Finite-buffered Networks Research Articles

Traffic dynamics based on dynamic local routing protocol in a finite buffer network

This paper proposed a novel routing strategy with two tunable parameters, [Formula: see text], [Formula: see text], based on the dynamic local information in a finite buffer network. The system behaves differently from that with a local routing strategy based on the degree with an adjustable parameter [Formula: see text]. Simulations show that, under dynamic local strategy, the maximal capacity of the network system increases with [Formula: see text] whereas it increases with the decrement of [Formula: see text] in the case of all the nodes having identical delivering ability. The dynamic local routing performs much better than the local routing, which is demonstrated by a larger value of the critical packet generation rate. We found that buffer coefficient has a limited impact on the performance of network system. We also demonstrate that a smaller [Formula: see text] would be better if we want to have an excellent traffic capacity considering the travel time, average path length and waiting time. Our study will be helpful to improve traffic performance in finite buffer networks.

The self-adaptive routing strategy to alleviate packet loss in finite buffer networks

In real communication or transportation systems, loss of agents is very common due to finite storage capacity. We study the traffic dynamics in finite buffer networks and propose a routing strategy motivated by a heuristic algorithm to alleviate packet loss. Under this routing strategy, the traffic capacity is further improved, comparing to the shortest path routing strategy and efficient routing strategy. Then we investigate the effect of this routing strategy on the betweenness of nodes. Through dynamic routing changes, the maximum node betweenness of the network is greatly reduced, and the final betweenness of each node is almost the same. Therefore, the routing strategy proposed in this paper can balance the node load, thereby effectively alleviating packet loss.

Traffic dynamics considering packet loss in finite buffer networks**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), and 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.

Diffusion Limits for Open Networks of Finite-Buffer Queues

This paper presents diffusion limits for congestion in networks of finite-buffer queues. We consider both loss networks, such as those in communication systems, and networks with manufacturing blocking. In both cases, the number in system process, under conditions of approximate balance under heavy traffic and appropriate scaling of buffers, is shown to behave like a multidimensional Brownian motion reflected to stay within a rectangle in the positive orthant. The two limits differ in directions of reflection off the faces representing full buffers. The limits suggest possible diffusion approximations for finitebuffer networks.