Effective usage of global dynamic information for network traffic

Chen Hong

Physica A: Statistical Mechanics and its Applications, 2015, vol. 424, issue C, 242-247

Abstract: In this paper, we propose a routing strategy based on the global dynamic information of network traffic. In the strategy, packets will travel along the path with the minimal sum of links’ weight, which may vary with the traffic condition. During the whole evolution, if the queue length of a node exceeds a threshold, the link weight of its direct links will increase. Simulation results show that the maximal traffic capacity corresponds to an optimal value of the threshold. Furthermore, we compare the performance of the strategy with global dynamic (GD) routing strategy. It is found that the strategy can further improve the transport efficiency, especially in the congestion state. Our work may be helpful for the design of new routing strategies in networked traffic systems.

Keywords: Routing strategy; Transport efficiency; Dynamic information (search for similar items in EconPapers)
Date: 2015
References: View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378437115000291
Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:phsmap:v:424:y:2015:i:c:p:242-247

DOI: 10.1016/j.physa.2015.01.027

Access Statistics for this article

Physica A: Statistical Mechanics and its Applications is currently edited by K. A. Dawson, J. O. Indekeu, H.E. Stanley and C. Tsallis

More articles in Physica A: Statistical Mechanics and its Applications from Elsevier
Bibliographic data for series maintained by Catherine Liu ().