Browsing by Author "Amit Biswas"

Now showing 1 - 5 of 5

A Blockchain Framework for Efficient Resource Allocation in Edge Computing
(Institute of Electrical and Electronics Engineers Inc., 2024) Gaurav Baranwal; Dinesh Kumar; Amit Biswas; Ravi Yadav
Edge computing provides low-latency computing services. Since Edge computing Service Providers (ESPs) are competitors, mutual distrust and distrust towards the platform may exist if a centralized resource allocation platform is used. To address trust issues, we propose a blockchain framework for resource allocation in edge computing that ensures decentralization and transparency in resource allocation. We also offer a novel consensus mechanism for the framework, Proof of Efficient Resource Allocation (PoERA), where ESPs compete to give the best solution to the resource allocation problem to become the leader and earn rewards. The framework addresses the trust issue, single-point failure, and the biased nature of the centralized platform. PoERA includes a novel self-stabilizing leader election algorithm, ensuring no forking, final consensus and consistency, which is lacking in most existing works. The work encourages the participation of both leader and non-leader ESPs by rewarding them based on the quality of their solutions. We perform CAP theorem analysis, demonstrating that Consistency (C) and Availability (A) are more important for the proposed framework than Partition tolerance (P). We conduct experiments to show that the work ensures decentralization, fair competition, and fair reward distribution to miners, eventually improving resource allocation in edge computing. © 2004-2012 IEEE.
A Blockchain-Based Framework to Resolve the Oligopoly Issue in Cloud Computing
(Institute of Electrical and Electronics Engineers Inc., 2024) Amit Biswas; Gaurav Baranwal; Abhinav Kumar
Cloud computing is one of the foundation technologies of Industry 4.0. Cloud 2.0 is the upcoming cloud technology that addresses several bottlenecks of Cloud 1.0. For instance, the presence of small service providers is threatened by the dominance of a few giant service providers in today's cloud market in Cloud 1.0. Under this circumstance, the small service providers must work together to compete with the giant competitors to survive in the market. For that, small service providers require a transparent, fair, cost-effective, fault-tolerant, and easily scalable platform that can provide reliable and quality services to customers. This work introduces a blockchain-based framework to provide such a platform for cloud service providers and their customers. Here, a new consensus mechanism is proposed to maintain the system's fairness, decentralization, and consistency. A consensus-based service monitoring concept is also introduced to assess the service quality. If a service provider does not deliver the committed quality of service (QoS), a penalty is imposed on the service provider. This framework is designed so that the service providers are always bound to provide committed QoS to the customers. Finally, we performed several experiments, and the experimental results corroborate our claims regarding the proposed framework. © 2013 IEEE.
ABAC: Alternative by alternative comparison based multi-criteria decision making method
(Elsevier Ltd, 2022) Amit Biswas; Gaurav Baranwal; Anil Kumar Tripathi
Decision-making appears as a complex and challenging task when it requires finding the most suitable alternative among the numerous alternatives in the presence of multiple, usually conflicting criteria. At the same time, stakeholders expect a simple, transparent, and traceable decision-making method. Multi-Criteria Decision-Making (MCDM) methods rank the alternatives considering multiple criteria. The rank reversal problem is an important issue in most existing conventional MCDM methods. This paper proposes a new alternative by alternative comparison-based MCDM Method (ABAC) that addresses the rank reversal problem. We prove that ABAC is free from the rank reversal problem. To illustrate and validate ABAC, we have taken the cloud service selection problem as an application. Further, to show the effectiveness of ABAC, we have provided several case studies covering various domains. We perform several experiments by simulating the ABAC method. We have compared ABAC and existing MCDM methods. The experimental results support that the ABAC method is a rank reversal free MCDM method. We also carry out sensitivity analysis for ABAC. Salient features of ABAC over existing MCDM methods are (i) it is simple; (ii) it is rank reversal free; (iii) it is more scalable. © 2022 Elsevier Ltd
Multi-attribute-based self-stabilizing algorithm for leader election in distributed systems
(Springer, 2025) Amit Biswas; Manisha Singh; Gaurav Baranwal; Anil Kumar Tripathi; Samir Aknine
Cloud computing, edge computing, replicated databases, and various modern technologies adopt distributed computing concepts for a reliable, high-performance, large-scale computational platform. In distributed computing, leader election is a fundamental problem because the elected leader helps coordinate and utilize the resources efficiently. Several state-of-the-art works mentioned that a good quality leader is essential as it improves system performance, simplifies management procedures, reduces coordinational complexity, and makes the system more fault-tolerant. However, designing a self-stabilizing leader election algorithm with weak assumptions in a failure-prone distributed environment is challenging. This paper proposes a multi-attribute-based, self-stabilizing, network partition-tolerant leader election method for failure-prone distributed systems. Here, based on the system requirements, the pertinent attributes of a good quality leader are identified and assigned weights according to their importance. Then, the identified attributes and their weight are used to elect a suitable node as the leader. We show that the algorithm is self-stabilizing and can tolerate multiple nodes and link failures. Further, we analyze the proposed algorithm’s time, communication, and bit complexities. We consider a distributed database system scenario to simulate the proposed method and compare it with existing approaches to evaluate and validate the proposed method’s performance and the elected leader’s quality. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.
Proof of Karma (PoK): A Novel Consensus Mechanism for Consortium Blockchain
(Institute of Electrical and Electronics Engineers Inc., 2023) Amit Biswas; Ravi Yadav; Gaurav Baranwal; Anil Kumar Tripathi
In blockchain-based systems, participants can be malicious. Therefore, this work first characterizes several properties expected in systems where the honest behaviour of involved parties plays significant role in the success. Considering these properties, a new consensus mechanism, Proof of Karma (PoK), is proposed based on karma (actions) of nodes. PoK incorporates a self-stabilizing leader election algorithm based on karma score to ensure consistency in the system. In PoK, both new and existing nodes get a fair chance to earn profit by becoming a leader and adding a valid block to the blockchain. PoK gives incentives and imposes penalties to encourage and discourage the nodes' honest and malicious actions, respectively. PoK is analyzed with respect to the CAP theorem. The work provides security analysis to demonstrate the resistance of PoK against various blockchain specific attacks and karma specific attacks. Several experiments are also performed to assess the performance of PoK and compare it with the baseline model. The results show the feasibility, effectiveness, usability and scalability of PoK. PoK is also compared based on the characterized properties with various existing consensus mechanisms that consider malicious actions of nodes. PoK achieves consensus finality, decentralization and fairness, outperforming existing works. © 2008-2012 IEEE.