Congestion control in complex network based on local routing strategy
Liu Wei-Yan,Liu Bin +1 more
7
About: This article is published in Acta Physica Sinica. The article was published on 01 Jan 2014. and is currently open access. The article focuses on the topics: Network congestion & Routing (electronic design automation).
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Analysis of robustness of urban bus network
TL;DR: In this paper, the invulnerability and cascade failures are discussed for the urban bus network, and a new load redistribution method is proposed to study the robustness of dynamic traffic.
41
Betweenness Centrality Based Software Defined Routing: Observation from Practical Internet Datasets
TL;DR: An in-depth observation of practical Internet datasets reveals an interesting phenomenon that DRBC is proportional to the routing efficiency when the maximum betweenness centrality varies in a small range and a DRBC-based routing scheme is proposed to improve routing efficiency.
11
An efficient probability routing algorithm for scale-free networks
TL;DR: Simulation results reveal that the proposed EP routing algorithm is able to improve the network capacity in comparison to the shortest path routing strategy and the centrality-degree-based probability path (PP) routing algorithm.
9
Optimized routing strategy for complex network with multiple priorities
TL;DR: The simulation results show that RS-MP can guarantee privileged-packets with the shortest path length and smallest delay, and maximized throughout capacity for common packets in the no-congestion state.
4
Routing in spatial networks based on the shortest path length
TL;DR: Simulations on homogeneous and heterogeneous spatial networks show that the routing algorithm based on the shortest path length proposed in this paper can effectively improve the throughput of the network, compared with the traditional least number of hops routing strategy.
References
Emergence of Scaling in Random Networks
TL;DR: A model based on these two ingredients reproduces the observed stationary scale-free distributions, which indicates that the development of large networks is governed by robust self-organizing phenomena that go beyond the particulars of the individual systems.
39.1K
Network Robustness and Fragility: Percolation on Random Graphs
Duncan S. Callaway,Mark Newman,Mark Newman,Steven H. Strogatz,Duncan J. Watts,Duncan J. Watts +5 more
TL;DR: This paper studies percolation on graphs with completely general degree distribution, giving exact solutions for a variety of cases, including site percolators, bond percolations, and models in which occupation probabilities depend on vertex degree.
Universal Behavior of Load Distribution in Scale-Free Networks
TL;DR: It is conjecture that the load exponent is a universal quantity to characterize scale-free networks and valid for both undirected and directed cases.
1.4K
Onset of traffic congestion in complex networks
TL;DR: It is found that there is a critical rate of information generation, below which the network traffic is free but above which traffic congestion occurs, and this model may be practically useful for designing communication protocols.
A complex network approach to supply chain network theory
TL;DR: This paper proposes that the structure of efficient supply chains follows a “scale‐free” network, and emerges from arguments that the key properties ofefficient supply chains are a short characteristic path length, a high clustering...
456