Name
Abstract | ||
|---|---|---|
In this paper, we propose an effective routing strategy on the basis of the so-called nearest neighbor search strategy by introducing a preferential cut-off exponent K. We assume that the handling capacity of one vertex is proportional to its degree when the degree is smaller than K, and is a constantC(0) otherwise. It is found that by tuning the parameter alpha, the scale-free network capacity measured by the order parameter is considerably enhanced compared to the normal nearest-neighbor strategy. Traffic dynamics both near and far away from the critical generating rate R-c, are discussed. Simulation results demonstrate that the optimal performance of the system corresponds to alpha = -0.5. Due to the low cost of acquiring nearest-neighbor information and the strongly improved network capacity, our strategy may be useful and reasonable for the protocol designing of modem communication networks. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/978-3-642-02466-5_111 | Lecture Notes of the Institute for Computer Sciences Social Informatics and Telecommunications Engineering |
Keywords | DocType | Volume |
complex networks,scale-free,local routing strategy | Conference | 4 |
ISSN | Citations | PageRank |
1867-8211 | 0 | 0.34 |
References | Authors | |
4 | 6 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Li Yujian | 1 | 207 | 31.77 |
| Bing-Hong Wang | 2 | 67 | 15.60 |
| Zheng-dong Xi | 3 | 0 | 0.34 |
| Chuanyang Yin | 4 | 0 | 0.68 |
| Han-Xin Yang | 5 | 31 | 5.94 |
| Duo Sun | 6 | 7 | 1.95 |