Amit Biswas

dblp:10/11323 · DBLP profile ↗
← Back
8ranked-venue papers
6as first author
8since 2021 · last 2025
0000-0003-0567-7582ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 5 · 4 first-author · 5 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Computer networks · 1 · 1 since 2021Software engineering, systems software and programming languages · 1 · 1 first-author · 1 since 2021
YearPublicationVenuePosition
2025 Multi-attribute-based self-stabilizing algorithm for leader election in distributed systems
Amit Biswas, Manisha Singh, Gaurav Baranwal, Anil Kumar Tripathi, Samir Aknine
J. Supercomput.1
2024 A Blockchain-Based Framework to Resolve the Oligopoly Issue in Cloud Computing
abstract
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.
Amit Biswas, Gaurav Baranwal, Abhinav Kumar 0005
IEEE Trans. Cloud Comput.1
2024 A Blockchain Framework for Efficient Resource Allocation in Edge Computing
abstract
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.
Gaurav Baranwal, Dinesh Kumar 0006, Amit Biswas
IEEE Trans. Netw. Serv. Manag.3
2023 Proof of Karma (PoK): A Novel Consensus Mechanism for Consortium Blockchain
abstract
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.
Amit Biswas, Gaurav Baranwal, Anil Kumar Tripathi
IEEE Trans. Serv. Comput.1
2022 ABAC: Alternative by alternative comparison based multi-criteria decision making method
Amit Biswas, Gaurav Baranwal, Anil Kumar Tripathi
Expert Syst. Appl.1
2022 An integrated approach of designing functionality with security for distributed cyber-physical systems
Dipty Tripathi, Amit Biswas, Anil Kumar Tripathi, Lalit Kumar Singh, Amrita Chaturvedi
J. Supercomput.2
2021 FRLLE: a failure rate and load-based leader election algorithm for a bidirectional ring in distributed systems
Amit Biswas, Ashish Kumar Maurya, Anil Kumar Tripathi, Samir Aknine
J. Supercomput.1
2021 Lea-TN: leader election algorithm considering node and link failures in a torus network
Amit Biswas, Anil Kumar Tripathi, Samir Aknine
J. Supercomput.1