Communication Bottlenecks in Scale-Free Networks
Sameet Sreenivasan, Reuven Cohen, Eduardo López, Zoltán Toroczkai, H. Eugene Stanley
Abstract
We consider the effects of network topology on the optimality of packet routing quantified by γc, the rate of packet insertion beyond which congestion and queue growth occurs. The key result of this paper is to show that for any network, there exists an absolute upper bound, expressed in terms of vertex separators, for the scaling of γc with network size N, irrespective of the routing algorithm used. We then derive an estimate to this upper bound for scale-free networks, and introduce a novel static routing protocol which is superior to shortest path routing under intense packet insertion rates.
Create a lesson
Related papers
Exploring the Power Consumption of ERC-4337 Bundling on Server Infrastructure
Claudiu-Nicu Bărbieru, Oana-Otilia Captarencu, Pascal Felber et al.
MusiSPARQ: Subscription-Aware Adaptive Resource Control for Musical Metaverse Services
Ali Al Housseini, Jaime Llorca, Omran Ayoub
Survival-Time Risk Beyond Low-Order Channel Models: Identifiability and Scheduling
Ruifeng Zheng, Zhihan Xu, Pit Hofmann et al.
From Reactive to Agentic Resilience: Multi-Timescale AI-RAN Orchestration Under Signaling Storms
Sotiris Chatzimiltis, Mahdi Boloursaz Mashhadi, Mohammad Shojafar et al.
Pod-wise Multimodal Federated Learning for Heterogeneous IoT
Joy Okolo, Zihao Ding, Jun Huang
DisC: Incentive Design for Green, Robust, and Fair Client Self-Participation in OTA Federated Learning
Driss Choukri, Essaid Sabir, Abdelkrim Haqiq