Journal of Advances in Developmental Research

E-ISSN: 0976-4844   •   Impact Factor: 9.71

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

Call for Paper Volume 17 Issue 1 January-June 2026 Submit your research before last 3 days of June to publish your research paper in the issue of January-June.
Submit Research Paper Join as a Reviewer

Plagiarism is checked by the leading plagiarism checker TurnItIn

Call for Paper

Volume 17 Issue 1
2026

Submit your research paper

Indexing Partners
Academia Advanced Sciences Index Bielefeld Academic Search Engine CiteSeer DRJI Google Scholar Independent Search Engine & Directory Network ISI (International Scientific Indexing) Issuu Mendeley Research Networks
RefSeek ResearcherId - Thomson Reuters ResearchGate Scirus Scribd Semantic Scholar UTeM - Universiti Teknikal Malaysia Melaka Wiki for Call for Papers WorldCat Zenodo

Distance Aware Load Balancing for Scalable Distributed Storage

Author(s) Kanagalakshmi Murugan
Country United States
Abstract Distributed storage platforms rely heavily on load balancing mechanisms to distribute requests across multiple nodes and ensure scalability. Conventional load balancing strategies typically make routing decisions without considering network distance or physical proximity between clients and storage nodes. Requests are often assigned using static rules or uniform distribution policies that ignore communication cost. As cluster size increases, these approaches frequently direct requests to remote nodes, causing data access paths to traverse multiple intermediate devices. This behavior leads to increased hop count, higher routing overhead, and inefficient network utilization. Excessive hop traversal introduces additional delay at each intermediate node and amplifies network congestion. Even when sufficient storage and processing capacity are available, requests experience longer paths due to distance unaware routing. In large scale distributed storage systems, this inefficiency accumulates rapidly, resulting in degraded performance and poor scalability. Adding more nodes does not mitigate the problem, as the likelihood of accessing distant nodes increases with cluster expansion. Consequently, static load balancing fails to maintain efficient communication patterns in growing environments. Empirical observations show that existing load balancing mechanisms consistently exhibit rising hop counts as cluster size grows. This increase reflects longer communication paths rather than workload imbalance alone. High hop counts directly impact request latency, bandwidth consumption, and overall system responsiveness. Despite distributing load across nodes, the absence of distance awareness limits the effectiveness of conventional strategies. This paper addresses the problem of excessive hop count in distributed storage platforms by focusing on network distance as a critical factor in load balancing decisions. The work emphasizes reducing communication distance to maintain shorter routing paths as the system scales. By targeting hop count as a primary metric, the study aims to improve communication efficiency and support scalable operation in distributed storage environments.
Keywords Distributed, Storage, LoadBalancing, DistanceAware, HopCount, Locality, Routing, Scalability, Communication, Networking, Partitioning, Efficiency, Clustering, Performance, Topology.
Published In Volume 16, Issue 2, July-December 2025
Published On 2025-11-08
Cite This Distance Aware Load Balancing for Scalable Distributed Storage - Kanagalakshmi Murugan - IJAIDR Volume 16, Issue 2, July-December 2025.
View / Download PDF File

Share this



CrossRef

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

IJAIDR DOI prefix is
10.71097/IJAIDR

Downloads
Research Paper Format Copyright Permission Form and Undertaking Form Cover Page Vol 16 Isu 2Cover Page Vol 16 Isu 1Cover Page Vol 15 Isu 2

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 Open Access

About IJAIDR
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 Message on WhatsApp +91-9687-182-185 editor@ijaidr.com