Dynamic routing on networks with fixed-size buffers
William A. Aiello, Rafail Ostrovsky, Eyal Kushilevitz, Adi Rosén · 2003
William Aiello Rafail Ostrovsky Eyal Kushilevitz Adi Ros'en Abstract The combination of the buffer size of routers deployed in the Internet and the Internet traffic itself leads routinely to routers dropping packets. Motivated by this, we initiate the rigorous study of dynamic storeand -forward routing on arbitrary networks in a model in which dropped packets must explicitly be taken into account. To avoid the uncertainties of traffic modeling, we consider arbitrary traffic on the network. We analyze and compare the effectiveness of several greedy, on-line, local-control protocols using a competitive analysis of the throughput. One goal of our approach is for the competitive results to continue to hold as a network grows without requiring the memory in the nodes to increase with the size of the network. Thus, in our model, we have link buffers of fixed size, B, which is independent of the size of the network, and B becomes a parameter of the model.