Approximate Breadth First Search (ABFS) Graph Algorithm for Efficient Etcd Notification Latency Reduction

Renukadevi Chuppala; Dr. B. Purnachandra Rao

Approximate Breadth First Search (ABFS) Graph Algorithm for Efficient Etcd Notification Latency Reduction

Author(s)	Renukadevi Chuppala, Dr. B. Purnachandra Rao
Country	United States
Abstract	Etcd is a distributed key-value store that provides a reliable way to store and manage data in a distributed system. Etcd is a highly available, distributed key-value store that enables reliable data management in distributed systems. It provides a fault-tolerant and scalable solution for storing and retrieving data, making it an ideal choice for modern distributed applications. Etcd's core features include Distributed architecture, Key-value data model, High availability and fault tolerance, Scalability and performance, Secure data storage and transmission, Simple and intuitive API. Etcd is a distributed, consensus-based key-value store built on top of the Raft consensus algorithm. It provides a hierarchical namespace for storing and retrieving data, with support for transactions, watches, and leases. Etcd's architecture includes A cluster of nodes that store and replicate data. A leader node that manages the cluster and handles client requests. A consensus algorithm that ensures data consistency and availability.A client API for interacting with the etcd cluster. Notification latency refers to the delay between the occurrence of an event and the notification of that event to the interested parties. In other words, it is the time taken for a notification to be delivered from the source of the event to the recipient. Notification throughput is The average number of notifications delivered per second. Memory usage is the average amount of memory used by the system. Notification latency metric measures the delay between the occurrence of an event and the notification of that event to the interested parties. The existing architecture is using Levelized Breadth First Search Algorithm for watch mechanism and it is having performance issues. This paper addresses these issues including latency issues by implementing the watch mechanism in the ETCD by Approximate Breadth First Search Algorithm.
Keywords	Keywords: ETCD, Breadth First Search Algorithm, Levelized Breadth Search algorithm, Approximate BFS (ABFS) algorithm, Controllers, Schedulers, Graphs.
Field	Computer Applications
Published In	Volume 4, Issue 4, July-August 2022
Published On	2022-08-26

View / Download PDF File

E-ISSN 2582-2160

doi

CrossRef DOI is assigned to each research paper published in our journal.

IJFMR DOI prefix is
10.36948/ijfmr

Downloads

Research Paper Format Copyright Permission Form and Undertaking Form Cover Page Vol 7 Isu 2 Cover Page Vol 7 Isu 1 Cover Page Vol 6 Isu 6

All research papers published on this website are licensed under Creative Commons Attribution-ShareAlike 4.0 International License, and all rights belong to their respective authors/researchers.

CC-BY-SA

About IJFMR Fees & Payment Current Issue Publication Archive	Submit Research Paper Track Submission Status Publication Guidelines Publication Ethics Peer Review & Plagiarism	Join as a Reviewer Editors & Reviewers Reviewer Referral Program Get Reviewer Membership Certi.	Website/Journal Policies Usage Policy Content Policies Privacy Policy

Contact Us		+91-9687-828-838	editor@ijfmr.com

International Journal For Multidisciplinary Research

A Widely Indexed Open Access Peer Reviewed Multidisciplinary Bi-monthly Scholarly International Journal

Approximate Breadth First Search (ABFS) Graph Algorithm for Efficient Etcd Notification Latency Reduction

Share this