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

Abstract

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.

Routing Strategies for Isochronal-Evolution Random Matching Network

“…In [24], the influences of the coupling mode and its corresponding routing strategy on the traffic capacity of the twolayer network were studied. In [25,26], the traffic dynamics in finite buffer networks were studied and a routing strategy motivated by a heuristic algorithm and a routing strategy based on dynamic local information were proposed. In [27], the mechanism by which the network structure impacts traffic dynamics was studied, and a high-contraction-centralityfirst strategy was proposed to optimize the network structure.…”