Adelson-Velsky Landis and Log Structured Merge Tree for Kubernetes ETCD

Renukadevi Chuppala; Dr. B. Purnachandra Rao

Adelson-Velsky Landis and Log Structured Merge Tree for Kubernetes ETCD

Author(s)	Renukadevi Chuppala, Dr. B. Purnachandra Rao
Country	USA
Abstract	ETCD is a distributed key-value store that provides a reliable way to store and manage data in a distributed system. Here's an overview of etcd and its role in Kubernetes. ETCD ensures data consistency and durability across multiple nodes, provides distributed locking mechanisms to prevent concurrent modifications, facilitates leader election for distributed systems. ETCD uses a distributed consensus algorithm (Raft) to manage data replication and ensure consistency across nodes. Etcd nodes form a cluster, ensuring data availability and reliability. stores data as key-value pairs., provides watchers for real-time updates on key changes, supports leases for distributed locking and resource management, Etcd serves as the primary data store for Kubernetes, responsible for storing and managing Cluster state i.e, Node information, pod status, and replication controller data, Configuration data like Persistent volume claims, secrets, and config maps, Network policies i.e, Network policies and rules, High availability that ensures data consistency and availability across nodes, Distributed locking i.e, Prevents concurrent modifications and ensures data integrity. Scalability Supports large-scale Kubernetes clusters. When ever we are sending apply command using kubectl or any other client API Server authenticates the request, authorizes the same, and updates to etcd on the new configuration. Etcd receives the updates (API Server sends the updated configuration to etcd), then etcd writes the updated configuration to its key-value store. Etcd replicates the updated data across its nodes and it ensures data consistency across all the nodes. We can say that ETCD is the main storage of the cluster. It carries the cluster state by storing the latest state at key value store. In this paper we will discuss about implementation of ETCD using Adelson-Velsky and Landis (AVL) and Log Structured Merge (LSM) Tree. Log Structured Merge tree outperforms Adelson-Velsky and Landis , AVL in some scenarios. We will work on to prove that Log Structured Merge Tree implementation provides better performance than Adelson-Velsky and Landis AVL Tree.
Keywords	Kubernetes (K8S), Cluster, Nodes, Deployments, Pods, ReplicaSets, Statefulsets, Service, IP-Tables, Load Balancer, Service Abstraction, , Adelson-Velsky and Landis (AVL), Log Structured Merge Tree (LSM) Tree, ETCD.
Discipline	Other
Published In	Volume 2, Issue 5, September-October 2024
Published On	2024-10-29
Cite This	Adelson-Velsky Landis and Log Structured Merge Tree for Kubernetes ETCD - Renukadevi Chuppala, Dr. B. Purnachandra Rao - AIJMR Volume 2, Issue 5, September-October 2024.

View / Download Full-text Research PDF File

About AIJMR 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-9328-605090	editor@aijmr.com

Advanced International Journal of Multidisciplinary Research

An Open Access Peer Reviewed Multidisciplinary Bi-monthly Scholarly International Journal

Adelson-Velsky Landis and Log Structured Merge Tree for Kubernetes ETCD

Share this