中国物理B ›› 2013, Vol. 22 ›› Issue (5): 58902-058902.doi: 10.1088/1674-1056/22/5/058902

• INTERDISCIPLINARY PHYSICS AND RELATED AREAS OF SCIENCE AND TECHNOLOGY • 上一篇    下一篇

An adaptive strategy based on linear prediction of queue length to minimize congestion in Barabási-Albert scale-free networks

沈毅   

  1. College of Information Science and Technology, Nanjing Agricultural University, Nanjing 210095, China
  • 收稿日期:2012-08-27 修回日期:2012-10-16 出版日期:2013-04-01 发布日期:2013-04-01
  • 基金资助:
    Project supported by the National Natural Science Foundation of China (Grant No. 60672095) and the Youth Science and Technology Innovation Fund of Nanjing Agricultural University, China (Grant No. KJ2010024).

An adaptive strategy based on linear prediction of queue length to minimize congestion in Barabási-Albert scale-free networks

Shen Yi (沈毅)   

  1. College of Information Science and Technology, Nanjing Agricultural University, Nanjing 210095, China
  • Received:2012-08-27 Revised:2012-10-16 Online:2013-04-01 Published:2013-04-01
  • Contact: Shen Yi E-mail:shen_yi1979@njau.edu.cn
  • Supported by:
    Project supported by the National Natural Science Foundation of China (Grant No. 60672095) and the Youth Science and Technology Innovation Fund of Nanjing Agricultural University, China (Grant No. KJ2010024).

摘要: In this paper, we propose an adaptive strategy based on linear-prediction of queue length to minimize congestion in Barabási-Albert (BA) scale-free networks. This strategy uses local knowledge of traffic conditions and allows nodes to be able to self-coordinate their accepting probability to the incoming packets. We show that the strategy can delay remarkably the onset of congestion and systems avoiding the congestion can benefit from hierarchical organization of accepting rates of nodes. Furthermore, with the increase of prediction orders, we achieve larger values for the critical load together with a smooth transition from free-flow to congestion.

关键词: linear prediction, congestion, networks

Abstract: In this paper, we propose an adaptive strategy based on linear-prediction of queue length to minimize congestion in Barabási-Albert (BA) scale-free networks. This strategy uses local knowledge of traffic conditions and allows nodes to be able to self-coordinate their accepting probability to the incoming packets. We show that the strategy can delay remarkably the onset of congestion and systems avoiding the congestion can benefit from hierarchical organization of accepting rates of nodes. Furthermore, with the increase of prediction orders, we achieve larger values for the critical load together with a smooth transition from free-flow to congestion.

Key words: linear prediction, congestion, networks

中图分类号:  (Networks and genealogical trees)

  • 89.75.Hc
02.50.-r (Probability theory, stochastic processes, and statistics)