Oblivious routing on geometric networks

We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the nodes are embedded in the Euclidean plane. In our algorithm, a packet path is constructed by first choosing a random intermediate node in the space between the source and destination, and then the packet is sent to its destination through the intermediate node. We analyze the performance of the algorithm in terms of the stretch and congestion of the resulting paths. We show that the stretch is constant, and the congestion is near optimal when the network paths can be chosen to be close to the geodesic lines that connect the end points of the paths. We give applications of our general result to the mesh topology and uniformly distributed disc graphs. Previous oblivious routing algorithms with near optimal congestion use many intermediate nodes and do not control the stretch.

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

[2]  Marcin Bienkowski,et al.  A practical algorithm for constructing oblivious routing schemes , 2003, SPAA '03.

[3]  Christos Kaklamanis,et al.  Tight bounds for oblivious routing in the hypercube , 1990, SPAA '90.

[4]  Prabhakar Raghavan,et al.  Randomized rounding: A technique for provably good algorithms and algorithmic proofs , 1985, Comb..

[5]  Amos Fiat,et al.  On-line load balancing with applications to machine scheduling and virtual circuit routing , 1993, STOC.

[6]  Allan Borodin,et al.  Routing, merging and sorting on parallel models of computation , 1982, STOC '82.

[7]  Leslie G. Valiant,et al.  A Scheme for Fast Parallel Communication , 1982, SIAM J. Comput..

[8]  Bruce M. Maggs,et al.  Fast Algorithms for Finding O(Congestion + Dilation) Packet Routing Schedules , 1999, Comb..

[9]  Jie Gao,et al.  Tradeo between stretch factor and load balancing ratio in wireless network routing , 2004, PODC 2004.

[10]  Satish Rao,et al.  A polynomial-time tree decomposition to minimize congestion , 2003, SPAA '03.

[11]  Edith Cohen,et al.  Optimal oblivious routing in polynomial time , 2004, J. Comput. Syst. Sci..

[12]  Allan Borodin,et al.  Routing, Merging, and Sorting on Parallel Models of Computation , 1985, J. Comput. Syst. Sci..

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

[14]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[15]  Harald Räcke,et al.  Minimizing Congestion in General Networks , 2002, FOCS.

[16]  Yossi Azar,et al.  Local optimization of global objectives: competitive distributed deadlock resolution and resource allocation , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[17]  Friedhelm Meyer auf der Heide,et al.  Shortest-Path Routing in Arbitrary Networks , 1999, J. Algorithms.

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

[19]  Bruce M. Maggs,et al.  Exploiting locality for data management in systems of limited bandwidth , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[20]  Leslie G. Valiant,et al.  Universal schemes for parallel communication , 1981, STOC '81.