A Local Routing Strategy Based-On Estimated Waiting Time on BA Networks

In this paper, we present a traffic flow model, a local routing strategy based on an estimated waiting time to improve transportation efficiency on Barabasi and Albert (BA) network model. Instead of global shortest path routing strategies, our method is cooperated between static and dynamic local information: degree of node and number of packets in node's queue, as an estimated waiting time, respectively. Due to, nodes with higher degree are more susceptible to traffic congestion than lower degree, the proposed strategy focuses on a neighbor node selection according to estimated waiting time of packets in each node's queue. As a consequence of simulation results, they indicate that the network capability is enhanced; the developed strategy can be applied usefully for realistic communication networks.