Adaptive packet routing for bursty adversarial traffic

One of the central tasks of networking is packet routing when edge bandwidth is limited. Tremendous progress has been achieved by separating the issue of routing into two conceptual subproblems: path selection and congestion resolution along the selected paths. However, this conceptual separation has a serious drawback: each packet's path is fixed at the source and cannot be modified adaptively en-route. The problem is especially severe when packet injections are modeled by an adversary, whose goal is to cause traffic-jams. In this paper, we consider this adversarial setting, motivated by the adversarial queuing theory model of Borodin et al. (1996, in “Proc. of 28th STOC,” pp. 376?385). More precisely, we consider an adversary who injects packets, with only their destinations specified, into network nodes in a continuous manner subject to certain limitations on the injection rate. The question whether it is possible to deal with such an adversary and to design protocols that would discover routes which avoid traffic jams so that nodes only store a bounded number of packets was left as an open problem by Andrews et al. (1997, in “Proc. of 38th FOCS,” pp. 294?302) (who deal with the nonadaptive case where the adversary provides routes for the packets). In the present paper, we resolve this open problem. In particular, we present a simple, deterministic, local-control protocol that applies to any network topology. Our protocol guarantees that, for any injection sequence generated by the adversary, the buffers at the nodes are polynomially bounded and that each packet has a polynomially bounded delivery time.

[1]  Aravind Srinivasan,et al.  A Constant-Factor Approximation Algorithm for Packet Routing and Balancing Local vs. Global Criteria , 2000, SIAM J. Comput..

[2]  Alan M. Frieze,et al.  Dynamic Packet Routing on Arrays with Bounded Buffers , 1998, LATIN.

[3]  Lisa Zhang,et al.  General dynamic routing with per-packet delay guarantees of O(distance+1/session rate) , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[4]  Rafail Ostrovsky,et al.  Universal O(congestion + dilation + log1+εN) local control packet switching algorithms , 1997, STOC '97.

[5]  Aravind Srinivasan,et al.  A constant-factor approximation algorithm for packet routing, and balancing local vs. global criteria , 1997, STOC '97.

[6]  Nir Shavit,et al.  Slide-The Key to Polynomial End-to-End Communication , 1997, J. Algorithms.

[7]  S. Muthukrishnan,et al.  Dynamic Load Balancing by Random Matchings , 1996, J. Comput. Syst. Sci..

[8]  Alan M. Frieze,et al.  A general approach to dynamic packet routing with bounded buffers , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[9]  Baruch Awerbuch,et al.  Universal stability results for greedy contention-resolution protocols , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[10]  Allan Borodin,et al.  Adversarial queueing theory , 1996, STOC '96.

[11]  Eli Upfal,et al.  Dynamic deflection routing on arrays (preliminary version) , 1996, STOC '96.

[12]  Yuval Rabani,et al.  Distributed packet switching in arbitrary networks , 1996, STOC '96.

[13]  Friedhelm Meyer auf der Heide,et al.  Universal algorithms for store-and-forward and wormhole routing , 1996, STOC '96.

[14]  Christian Scheideler,et al.  Universal Continuous Routing Strategies , 1998, Theory of Computing Systems.

[15]  Serge A. Plotkin,et al.  Routing and admission control in general topology networks with Poisson arrivals , 1995, SODA '96.

[16]  F T Leighton,et al.  Routing and Job-shop Scheduling in O(congestion , 1996 .

[17]  Éva Tardos,et al.  Disjoint paths in densely embedded graphs , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[18]  C. G. Plaxton,et al.  Tight analyses of two local load balancing algorithms , 1995, STOC '95.

[19]  Mor Harchol-Balter,et al.  Bounding delays in packet-routing networks , 1995, STOC '95.

[20]  Friedhelm Meyer auf der Heide,et al.  A Packet Routing Protocol for Arbitrary Networks , 1995, STACS.

[21]  Bruce M. Maggs,et al.  Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules , 1995, Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Sciences.

[22]  S. Muthukrishnan,et al.  Dynamic load balancing in parallel and distributed networks by random matchings (extended abstract) , 1994, SPAA '94.

[23]  Michael Mitzenmacher,et al.  Bounds on the greedy routing algorithm for array networks , 1994, SPAA '94.

[24]  Bruce M. Maggs,et al.  Packet routing and job-shop scheduling inO(congestion+dilation) steps , 1994, Comb..

[25]  Baruch Awerbuch,et al.  Improved approximation algorithms for the multi-commodity flow problem and local competitive routing in dynamic networks , 1994, STOC '94.

[26]  Mor Harchol-Balter,et al.  Queueing analysis of oblivious packet-routing networks , 1994, SODA '94.

[27]  Yossi Azar,et al.  Competitive routing of virtual circuits with unknown duration , 1994, SODA '94.

[28]  Bhaskar Ghosh,et al.  Dynamic load balancing on parallel and distributed networks by random matchings , 1994 .

[29]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the multiple node case , 1994, TNET.

[30]  Baruch Awerbuch,et al.  A simple local-control approximation algorithm for multicommodity flow , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[31]  Yossi Azar,et al.  Throughput-competitive on-line routing , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[32]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[33]  Bruce M. Maggs,et al.  Approximate load balancing on dynamic and asynchronous networks , 1993, STOC.

[34]  Boaz Patt-Shamir,et al.  Greedy Packet Scheduling on Shortest Paths , 1993, J. Algorithms.

[35]  Yehuda Afek,et al.  The slide mechanism with applications in dynamic networks , 1992, PODC '92.

[36]  Frank Thomson Leighton,et al.  Methods for message routing in parallel machines , 1992, STOC '92.

[37]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks-the single node case , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[38]  John N. Tsitsiklis,et al.  The efficiency of greedy routing in hypercubes and butterflies , 1991, SPAA '91.

[39]  Rene L. Cruz,et al.  A calculus for network delay, Part II: Network analysis , 1991, IEEE Trans. Inf. Theory.

[40]  Rene L. Cruz,et al.  A calculus for network delay, Part I: Network elements in isolation , 1991, IEEE Trans. Inf. Theory.

[41]  Nir Shavit,et al.  Polynomial end-to-end communication , 1989, 30th Annual Symposium on Foundations of Computer Science.

[42]  Milena Mihail,et al.  Conductance and convergence of Markov chains-a combinatorial treatment of expanders , 1989, 30th Annual Symposium on Foundations of Computer Science.