Browsing by Author "Sarvesh Pandey"

Now showing 1 - 12 of 12

A Journey from Commit Processing in Distributed Databases to Consensus in Blockchain
(IEEE Computer Society, 2022) Kamal Kant; Sarvesh Pandey; Udai Shanker
Blockchain Technology (BT) is a futuristic data management technology that eliminates the intermediary/ third-party/central authority as it is operated over a peer-to-peer network running cryptographic protocols. It is tamper-proof as it utilizes a cryptographic hash feature. Some other features, it offers, are transparency, security, inalterability, immutability, and decentralization; these features of the BTs have acquired the wide attention of the computing research community. While a transaction is occurring between two parties, it ensures that the trust is a consensus-driven built-in technology component instead of relying on a third party for the same. With the help of a consensus algorithm, the newly generated block is appended at the end of the already existing chain. In this paper, a thorough analysis of the various blockchain consensus algorithms is conducted including their benefits and drawbacks. Finally, it enlists the challenges and opportunities in designing blockchain consensus algorithms. Further, it proposes an idea for designing a blockchain consensus algorithm and concludes the discussion. © 2022 IEEE.
A Priority Inheritance Centered Locking Protocol for DRTDBS
(Springer, 2023) Sarvesh Pandey; Udai Shanker
In distributed real-time applications, the static 2 Phase Locking with High Priority (S2PL-HP) protocol may resolve data conflict(s) among transactions executing concurrently. S2PL-HP is virtuously free from the priority inversion that may arise due to executing–executing conflict—both the transactions in the execution phase. However, its performance may degrade because of other problems, i.e., cyclic restart and unnecessary abort, starvation of transactions of longer length, and system resource wastage. We propose a new Priority Inheritance (PRIN) centered locking protocol to resolve the above problems. PRIN checks the wastage of system resources by preventing cyclic restart and unnecessary abort using the priority inheritance approach. It is also free from deadlock and reduces the effects of lengthy transaction starvation. The system performance is measured using the transaction miss percentage metric. We developed the simulator to assess the performance of the proposed protocol; the results confirm that our system, PRIN, achieves 1.05 ×–1.23 × performance improvement over the state-of-the-art systems. © 2023, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.
Addressing Blockchain Efficiency: A Study on Super Node-Based Consensus Mechanisms
(Institute of Electrical and Electronics Engineers Inc., 2024) Kamal Kant; Sarvesh Pandey; Udai Shanker
The success of applying blockchain technology for transaction processing is based on a consensus mechanism to be utilized. The new solutions for the same are being reported and claiming to fix or overcome it. However, the reported consensus protocols are not capable enough to serve the purpose adequately because the majority of widely used blockchain platforms purposefully exclude metrics like delay and throughput, which are essential for the efficiency of consensus protocols. Therefore, this paper discusses blockchain fundamentals, consensus mechanisms, their variants, and our super node concept is discussed, and we perform extensive experiments and our analysis preliminary results indicate that as the number of nodes increases, the throughput increases rapidly. © 2024 IEEE.
Blockchain transaction processing: Challenges and resolutions
(CRC Press, 2025) Kamal Kant; Sarvesh Pandey; Udai Shanker
This paper delves into the transformative shift from traditional databases to blockchain technology motivated by challenges such as tampering and central control inherent in databases. Traditional databases (e.g., relational databases) are structured in rows and columns while blockchain is structured as a chain of blocks secured through cryptographic primitives. Blockchain technology has paved the way for developing more practical solutions with its features, which include decentralization, security, and immutability etc. We introduce traditional databases and blockchain technology focusing on the shift towards the later. A emphasis is also placed on the pivotal role of consensus, a notable divergence that renders blockchain unique. Furthermore, we discuss key consensus algorithms, their challenges, and the opportunities they present. © 2024 selection and editorial matter, Anurag Tiwari and Manuj Darbari.
On Designing a Compaction Strategy for Enhanced LevelDB Read Performance
(Association for Computing Machinery, Inc, 2025) Umesh Bhatt; Sarvesh Pandey
Key-value stores based on a Log-Structured Merge-Tree, especially LevelDB, are extensively used for managing unstructured data with no predefined schema. LevelDB’s popularity stems from an optimized write performance, achieved through in-memory buffers, sequential disk writes, and background compaction. Although the write performance is satisfactory, the read performance is, at best, marginally acceptable, particularly for random (non-contiguous) reads. Read performance can be enhanced by optimizing the compaction strategy (i.e., the trade-off between the number of levels and the number of tables per level). LevelDB utilizes geometric progression to determine compaction table size, which often leads to increased read latency due to the inefficient distribution of compaction tables across levels. We propose utilizing power law distribution to determine compaction table size for each level, which in turn improves read efficiency. Our empirical results show a reduction in average query runtime (up to 2%), an increase in read throughput (up to 2.5%), and a decrease in average latency (up to 2%) on YCSB’s read-only workload. © 2024 Copyright held by the owner/author(s).
On Designing an Intelligent Shipping Algorithm for Decentralized E-Commerce Systems
(Springer Science and Business Media Deutschland GmbH, 2024) Suneel Kumar; Sarvesh Pandey; Umesh Bhatt
The foundation of online shopping lies in the efficient and timely delivery of products from sellers to customers directly through a streamlined (and user-friendly) digital platform. However, transitioning to the online shopping platform leads to the following two problems: higher shipping charges and product handling fees levied by these platforms. The shipping charge is typically exempted if the order value is equal to or higher than the predetermined threshold value. The existing shipping charge exemption rule does not favor customers with low and mid-range budgets who often place orders valued lower than the threshold. To address the inherent biasness, we propose the History Informed Shipping (HIShip) method, establishing a fair business environment for all parties involved – the online shopping platform provider, sellers, and customers. HIShip intelligently utilizes the order history data, i.e., the cumulative sum of orders’ value placed in the recent past, to make the shipping charge exemption rule friendly to low and mid-budget customers. Furthermore, it reduces biasness against vendors selling products that cost less than the threshold amount. Such a win-win scenario for the seller and customer eventually generates more revenue for the online shopping platform. We simulate the blockchain environment and use the TPC-H dataset to assess the performance. Our algorithm outperforms the threshold-based traditional approach. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2024.
On Developing Framework for Schedulable Priority-Driven Systems: A Futuristic Review
(Springer, 2023) Sarvesh Pandey; Udai Shanker
Over time, systems’ real-time data access requirements evolved, e.g., Real-Time Systems and Real-Time Database Systems and their variants. Assigning priorities to tasks/transactions in such a system has always been a critical decision as it forms a basis for allocating the limited number of shared resources optimally. This survey article studies the resource scheduling mechanisms of such systems. For resource scheduling, a priority is assigned to the smallest execution unit of the application, depending on the underlying scenario. The already existing resource scheduling algorithms are compared to make future recommendations – further exploration of all such unresolved open priority assignment policy-related problems is critical. Finally, we identify some new target technologies where one could foresee the future possibility of integrating custom-designed priority assignment policies. © 2022, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.
On Enhancing E-Commerce Shipping Policies with Blockchain and Recommender Systems
(Springer, 2025) S. Dasaratha Kumar; Sarvesh Pandey; Umesh Bhatt
E-commerce systems aim to deliver products on time and at a competitive price to customers through the Internet. Though transformational, adapting to an internet-based online system led to higher shipping charges (being borne by customers) and overwhelming options (requiring endless time to make purchasing decisions). Most existing shipping policies exempt the shipping fee only when the customer’s order value exceeds a pre-set threshold; they do not consider the frequency of orders made by a customer when deciding on a shipping fee exemption. First, to address the shipping charge problem, we propose a History Informed Shipping (HIShip) method, which utilizes the customer’s transaction history in making the shipping charge exemption decisions. HIShip mainly benefits low (and mid) order-value customers who frequently order and sellers with a product cost lower than the pre-defined shipping exemption threshold amount. The greater customer and seller participation eventually contribute to higher revenue from the e-commerce platform. Furthermore, we store order history in the blockchain to ensure decentralization and immutability in a trustless environment. HIShip’s shipping policy is evaluated against a naive threshold-based shipping policy on the TPC-H dataset, and results confirm that 21.5% and 21.06% increase in the percentage of orders (placed by low and mid ’order-value’ customers, respectively) qualify for the shipping fee exemption. Second, we integrated an ML-based recommendation mechanism to suggest appropriate product(s) further in case the actual order does not qualify for shipping fee exemption. Evaluation results show that SVD is the best model with a minimum RMSE of 0.765364 and MAE of 0.508519 on the ‘All Beauty’ dataset. © The Author(s), under exclusive licence to Springer Nature Singapore Pte Ltd. 2025.
Preface
(Springer Science and Business Media Deutschland GmbH, 2023) Sarvesh Pandey; Udai Shanker; Vijayalakshmi Saravanan; Rajinikumar Ramalingam
[No abstract available]
STEP: A Concomitant Protocol for Real Time Applications
(Springer, 2022) Sarvesh Pandey; Udai Shanker
In distributed real-time database system, utilizing a priority inheritance mechanism may help in reducing the priority inversion duration of a conflicting (and waiting) high priority transaction. However, mere integration of the priority inheritance scheme with classic 2PC is not enough and may lead to performance degradation. The two main problems that arise because of such integration are considerably longer ‘Priority-Inherit’ message dissemination time and extra message overhead. In addition, the explosion of priority inheritance events in the system might lead to the increased miss percentage for high-priority transactions. To address the above-mentioned problems, a Sophisticated Time and message utilization centered Priority inheritance (STEP) concomitant protocol is designed which brings down the overhead (time & message) by simply requiring of single round intelligent message transfer and eliminates priority de-boosting part of the general priority inheritance mechanism. Moreover, it also keeps a check on the no. of priority inheritance events occurrences with the help of real-time monitoring of priority inversions’ percentage in the system and thereby makes sure that high priority transaction miss percentage does not increase in an uncontrolled manner. The extensive performance study suggests that STEP protocol performs considerably well compared to the existing state-of-the-art protocols. © 2021, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.
TOPSIS Enabled Trustworthiness in Crowdsourcing using the Fuzzy Logic-powered Blockchain
(Institute of Electrical and Electronics Engineers Inc., 2024) Suneel Kumar; Sarvesh Pandey
With the rapid increase in crowd service workers fueled by broader adaptation of crowd services, the trustworthiness of a crowd service offered by a worker is vital. Evaluating the solutions offered by different workers presents two challenges: (i) selecting the best crowd service alternate and (ii) criteria- level trustworthiness assessment of the selected crowd service. We propose a Crowd Service Trustworthiness (CrowdST) model, which selects the best crowd service alternative using TOPSIS (a multi-criteria decision-making method) and applies a fuzzy logic-based Max-Min Composition method to provide criteria- level trustworthiness assessment. In this way, the crowd service requester's criteria-level requirements can be better catered. Moreover, to further enable trust in the crowd (both requester and worker), we have studied the implications of using CrowdST in a decentralized environment, including gas costs. Our solution provides greater flexibility to all the stakeholders - requesters can get customized crowd service based on their trustworthiness requirements, and crowd service workers can work on the criteria that have a scope for improvements. © 2024 IEEE.
WSC: A Crowd-Powered Framework for Mapping Decomposable Complex-Task With Worker-Set
(John Wiley and Sons Ltd, 2024) Suneel Kumar; Sarvesh Pandey
The crowdsourcing platform serves as an intermediary managing the interaction between a requester who posts a decomposable task and a pool of workers who bid to solve it. Each worker intending to take up the task (partially or fully) decomposes it into multiple independent subtasks and submits it to the platform. Selection of a diverse set of workers (based on the bids received) to solve the decomposable task is challenging as it requires balancing factors like cost and quality while encouraging collaboration. We propose a Worker Set Computation (WSC) methodology to address these challenges by selecting a custom set of potential workers who can collaboratively complete the task with the optimal cost, in an efficient way. The aging technique is employed to dynamically update the weight of each worker, giving more weightage to the feedback received in the recent past. This, in turn, not only favors those workers who were rated well in the immediate past but also ensures that one odd feedback does not influence the overall rating heavily. We compare the performance of the proposed method against the state-of-the-art methods, considering the computational (and budget) requirements, as well as the aging-based worker rating. © 2024 John Wiley & Sons Ltd.