Print ISSN:1674-1056  |  Online ISSN:2058-3834  |  CN:11-5639/O4
  • Cite this article:

    Zhou Si-Yuan, Wang Kai, Zhang Yi-Feng, Pei Wen-Jiang, Pu Cun-Lai, Li Wei. Generalized minimum information path routing strategy on scale-free networksJ. Chin. Phys. B, 2011, 20(8): 080501.
    Zhou Si-Yuan, Wang Kai, Zhang Yi-Feng, Pei Wen-Jiang, Pu Cun-Lai, Li Wei. Generalized minimum information path routing strategy on scale-free networksJ. Chin. Phys. B, 2011, 20(8): 080501.
  • Generalized minimum information path routing strategy on scale-free networks

    • This paper presents a new routing strategy by introducing a tunable parameter into the minimum information path routing strategy we proposed previously. It is found that network transmission capacity can be considerably enhanced by adjusting the parameter with various allocations of node capability for packet delivery. Moreover, the proposed routing strategy provides a traffic load distribution which can better match the allocation of node capability than that of traditional efficient routing strategies, leading to a network with improved transmission performance. This routing strategy, without deviating from the shortest-path routing strategy in the length of paths too much, produces improved performance indexes such as critical generating rate, average length of paths and average search information.
    • Article Text

    • loading

    Catalog

      /

      DownLoad:  Full-Size Img  PowerPoint
      Return
      Return