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
Plagiarism is checked by the leading plagiarism checker
Call for Paper
Volume 17 Issue 1
2026
Indexing Partners
Distance Aware Routing for Hop Efficient Systems
| Author(s) | Vijaya Krishna Namala |
|---|---|
| Country | United States |
| Abstract | Modern distributed systems increasingly operate across large scale clusters where data and services are accessed through multiple intermediate network components. In such environments, the number of communication hops between clients and target resources has a direct impact on performance, scalability, and network efficiency. Existing distributed architectures commonly rely on static routing, uniform placement, or centralized load balancing strategies that do not explicitly consider hop count during request routing. As cluster size grows, hop count increases steadily, leading to higher transmission overhead, increased processing at intermediate nodes, and inefficient utilization of network paths. The accumulation of additional hops introduces avoidable delays, increases contention on shared network components, and amplifies congestion within the system. Although individual hop delays may appear small, their cumulative effect significantly impacts system efficiency as scale increases. Existing solutions primarily focus on load balancing or throughput improvement while hop count remains an indirect or overlooked factor. This paper addresses the problem of excessive hop count in distributed systems by examining how routing and placement decisions influence communication distance. The study focuses on identifying inefficiencies introduced by static and locality unaware routing strategies and evaluates their impact on hop count as cluster size increases. By analyzing hop count behavior across varying node configurations, the paper highlights how existing designs fail to scale efficiently from a network perspective. The objective is to bring hop count to the forefront as a critical performance metric and to motivate routing and placement strategies that minimize unnecessary communication paths, thereby improving scalability and network efficiency in distributed platforms. |
| Keywords | Hops, Routing, Locality, Proximity, Distribution, Scalability, Networks, Placement, Distance, Communication, Efficiency, Clusters, Topology, Systems, Performance. |
| Field | Engineering |
| Published In | Volume 16, Issue 1, January-June 2025 |
| Published On | 2025-05-09 |
| Cite This | Distance Aware Routing for Hop Efficient Systems - Vijaya Krishna Namala - IJAIDR Volume 16, Issue 1, January-June 2025. DOI 10.71097/IJAIDR.v16.i1.1728 |
| DOI | https://doi.org/10.71097/IJAIDR.v16.i1.1728 |
| Short DOI | https://doi.org/hbqqrd |
Share this

CrossRef DOI is assigned to each research paper published in our journal.
IJAIDR DOI prefix is
10.71097/IJAIDR
Downloads
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.