ETCD Notification Latency Reduction Using Approximate Breadth First Search ABFS Graph Algorithm

Authors: Satya Ram Tsaliki, Dr.B.PurnachandraRao

Country: USA

Full-text Research PDF File:   View   |   Download

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 is having high notification latency issues. This paper addresses this issue by implementing the watch mechanism in the ETCD by Approximate Breadth First Search Algorithm.

Keywords: ETCD, Breadth First Search Algorithm, Levelized Breadth Search algorithm, Approximate BFS (ABFS) algorithm, Controllers, Schedulers, Graphs.

Paper Id: 231785

Published On: 2023-09-06

Published In: Volume 11, Issue 5, September-October 2023

Cite This: ETCD Notification Latency Reduction Using Approximate Breadth First Search ABFS Graph Algorithm - Satya Ram Tsaliki, Dr.B.PurnachandraRao - IJIRMPS Volume 11, Issue 5, September-October 2023.

Share this