Abstract
In this paper we study the performance of communication networks from a network science perspective. We study the traffic performance of scale-free network under shortest path and minimum degree routing. We introduce the node usage probability, which depends on both the network topology and routing algorithm, to characterize the traffic load distribution and show that resource allocation based on the node usage probability outperforms the uniform and degree-based allocation scheme.
Original language | English |
---|---|
Title of host publication | Proceedings of the 5th International Workshop on Chaos-Fractals Theories and Applications, IWCFTA 2012 |
Pages | 159-163 |
Number of pages | 5 |
DOIs | |
Publication status | Published - 1 Dec 2012 |
Event | 5th International Workshop on Chaos-Fractals Theories and Applications, IWCFTA 2012 - Dalian, Liaoning, China Duration: 18 Oct 2012 → 21 Oct 2012 |
Conference
Conference | 5th International Workshop on Chaos-Fractals Theories and Applications, IWCFTA 2012 |
---|---|
Country/Territory | China |
City | Dalian, Liaoning |
Period | 18/10/12 → 21/10/12 |
Keywords
- communications
- complex network
- node usage probability
- scale-free
ASJC Scopus subject areas
- Computational Theory and Mathematics
- Applied Mathematics