Traffic dynamics considering packet loss in finite buffer networks  

作　　者：Jie Chen Jin-Yong Chen Ming Li Mao-Bin Hu 陈杰;陈金邕;李明;胡茂彬(School of Engineering Science University of Science and Technology of China;Civil Architectural and Environmental Engineering University of Texas at Austin)

机构地区：[1]School of Engineering Science University of Science and Technology of China [2]Civil Architectural and Environmental Engineering University of Texas at Austin

出　　处：《Chinese Physics B》2019年第4期433-438,共6页中国物理B（英文版）

基　　金：Project supported by the National Key Research and Development Program of China(Grant No.2016YFC0802508);the National Natural Science Foundation of China(Grant Nos.11672289 and 61503355);the support from the Chinese Scholarship Council

摘　　要：In real complex systems, the limited storage capacity of physical devices often results in the loss of data. We study the effect of buffer size on packet loss threshold in scale-free networks. A new order parameter is proposed to characterize the packet loss threshold. Our results show that the packet loss threshold can be optimized with a relative small buffer size. Meanwhile, a large buffer size will increase the travel time. Furthermore, we propose a Buffered-Shortest-Path-First(BSPF) queuing strategy. Compared to the traditional First-In-First-Out(FIFO) strategy, BSPF can not only increase the packet loss threshold but can also significantly decrease the travel length and travel time in both identical and heterogeneous node capacity cases. Our study will help to improve the traffic performance in finite buffer networks.In real complex systems, the limited storage capacity of physical devices often results in the loss of data. We study the effect of buffer size on packet loss threshold in scale-free networks. A new order parameter is proposed to characterize the packet loss threshold. Our results show that the packet loss threshold can be optimized with a relative small buffer size. Meanwhile, a large buffer size will increase the travel time. Furthermore, we propose a Buffered-Shortest-Path-First(BSPF) queuing strategy. Compared to the traditional First-In-First-Out(FIFO) strategy, BSPF can not only increase the packet loss threshold but can also significantly decrease the travel length and travel time in both identical and heterogeneous node capacity cases. Our study will help to improve the traffic performance in finite buffer networks.

关 键 词：FINITE BUFFER NETWORKS LOSS THRESHOLD QUEUING strategy 

分 类 号：O4[理学—物理]