中国物理B ›› 2020, Vol. 29 ›› Issue (1): 18901-018901.doi: 10.1088/1674-1056/ab5935

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

Major impact of queue-rule choice on the performance of dynamic networks with limited buffer size

Xiang Ling(凌翔), Xiao-Kun Wang(王晓坤), Jun-Jie Chen(陈俊杰), Dong Liu(刘冬), Kong-Jin Zhu(朱孔金), Ning Guo(郭宁)   

  1. 1 School of Automotive and Transportation Engineering, Hefei University of Technology, Hefei 230009, China;
    2 School of Civil Engineering and Architecture, Southwest University of Science and Technology, Mianyang 621010, China
  • 收稿日期:2019-10-17 修回日期:2019-11-11 出版日期:2020-01-05 发布日期:2020-01-05
  • 通讯作者: Ning Guo E-mail:guoning_945@126.com
  • 基金资助:
    Project supported by the National Natural Science Foundation of China (Grant Nos. 71801066 and 71431003) and the Fundamental Research Funds for the Central Universities of China (Grant Nos. PA2019GDQT0020 and JZ2017HGTB0186).

Major impact of queue-rule choice on the performance of dynamic networks with limited buffer size

Xiang Ling(凌翔)1, Xiao-Kun Wang(王晓坤)1, Jun-Jie Chen(陈俊杰)1, Dong Liu(刘冬)2, Kong-Jin Zhu(朱孔金)1, Ning Guo(郭宁)1   

  1. 1 School of Automotive and Transportation Engineering, Hefei University of Technology, Hefei 230009, China;
    2 School of Civil Engineering and Architecture, Southwest University of Science and Technology, Mianyang 621010, China
  • Received:2019-10-17 Revised:2019-11-11 Online:2020-01-05 Published:2020-01-05
  • Contact: Ning Guo E-mail:guoning_945@126.com
  • Supported by:
    Project supported by the National Natural Science Foundation of China (Grant Nos. 71801066 and 71431003) and the Fundamental Research Funds for the Central Universities of China (Grant Nos. PA2019GDQT0020 and JZ2017HGTB0186).

摘要: We investigate the similarities and differences among three queue rules, the first-in-first-out (FIFO) rule, last-in-first-out (LIFO) rule and random-in-random-out (RIRO) rule, on dynamical networks with limited buffer size. In our network model, nodes move at each time step. Packets are transmitted by an adaptive routing strategy, combining Euclidean distance and node load by a tunable parameter. Because of this routing strategy, at the initial stage of increasing buffer size, the network density will increase, and the packet loss rate will decrease. Packet loss and traffic congestion occur by these three rules, but nodes keep unblocked and lose no packet in a larger buffer size range on the RIRO rule networks. If packets are lost and traffic congestion occurs, different dynamic characteristics are shown by these three queue rules. Moreover, a phenomenon similar to Braess' paradox is also found by the LIFO rule and the RIRO rule.

关键词: dynamical network, queue rule, buffer size, traffic congestion

Abstract: We investigate the similarities and differences among three queue rules, the first-in-first-out (FIFO) rule, last-in-first-out (LIFO) rule and random-in-random-out (RIRO) rule, on dynamical networks with limited buffer size. In our network model, nodes move at each time step. Packets are transmitted by an adaptive routing strategy, combining Euclidean distance and node load by a tunable parameter. Because of this routing strategy, at the initial stage of increasing buffer size, the network density will increase, and the packet loss rate will decrease. Packet loss and traffic congestion occur by these three rules, but nodes keep unblocked and lose no packet in a larger buffer size range on the RIRO rule networks. If packets are lost and traffic congestion occurs, different dynamic characteristics are shown by these three queue rules. Moreover, a phenomenon similar to Braess' paradox is also found by the LIFO rule and the RIRO rule.

Key words: dynamical network, queue rule, buffer size, traffic congestion

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

  • 89.75.Hc
45.70.Vn (Granular models of complex systems; traffic flow) 05.70.Fh (Phase transitions: general studies)