Article

Oblivious routing on geometric networks

Authors:

Malik Magdon-Ismail,

Jing XiAuthors Info & Claims

SPAA '05: Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures

Pages 316 - 324

https://doi.org/10.1145/1073970.1074022

Published: 18 July 2005 Publication History

Abstract

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.

References

[1]

J. Aspens, Y. Azar, A. Fiat, S. Plotkin, and O. Waarts. Online load balancing with applications to machine scheduling and virtual circuit routing. In Proceedings of the 25th ACM Symposium on Theory of Computing, pages 623--631, 1993.

Digital Library

[2]

B. Awerbuch and Y. Azar. Local optimization of global objectives: competitive distributed deadlock resolution and resource allocation. In Proceedings of 35th Annual Symposium on Foundations of Computer Science, pages 240--249, Santa Fe, New Mexico, 1994.

Digital Library

[3]

Y. Azar, E. Cohen, A. Fiat, H. Kaplan, and H. Racke. Optimal oblivious routing in polynomial time. In Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC), pages 383--388, San Diego, CA, June 2003. ACM Press.

Digital Library

[4]

Marcin Bienkowski, Miroslaw Korzeniowski, and Harald Räcke. A practical algrorithm for constructing oblivious routing schemes. In Proceedings of the 15th Annual ACM Symposium on Parallelism in Algorithms and Architectures, pages 24--33, Jun. 2003.

Digital Library

[5]

A. Borodin and J. E. Hopcroft. Routing, merging, and sorting on parallel models of computation. Journal of Computer and System Science, 30:130--145, 1985.

Digital Library

[6]

Costas Busch, Malik Magdon-Ismail, and Jing Xi. Optimal oblivious path selection on the mesh. In Proceedings of the 19th IEEE International Parallel & Distributed Processing Symposium (IPDPS 2005), Denver, Colorado, April 2005.

Digital Library

[7]

Jie Gao and Li Zhang. Tradeoffs between stretch factor and load balancing ratio in routing on growth restricted graphs. In PODC '04: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, pages 189--196, New York, NY, USA, 2004.

Digital Library

[8]

Chris Harrelson, Kristen Hildrum, and Satish Rao. A polynomial-time tree decomposition to minize congestion. In Proceedings of the 15th Annual ACM Symposium on Parallelism in Algorithms and Architectures, pages 34--43, Jun. 2003.

Digital Library

[9]

Christos Kaklamanis, Danny Krizanc, and Thanasis Tsantilas. Tight bounds for oblivious routing in the hypercube. In Proceedings of 2nd IEEE Symposium on Parallel and Distributed Processing (2nd SPAA 90), pages 31--36, Crete, Greece, July 1990.

Digital Library

[10]

F. T. Leighton, B. M. Maggs, and S. B. Rao. Packet routing and job-scheduling in O(congestion+dilation) steps. Combinatorica, 14:167--186, 1994.

[11]

Tom Leighton, Bruce Maggs, and Andrea W. Richa. Fast algorithms for finding O(congestion + dilation) packet routing schedules. Combinatorica, 19:375--401, 1999.

[12]

B. M. Maggs, F. Meyer auf der Heide, B. Vöcking, and M. Westerman. Exploiting locality in data management in systems of limited bandwidth. In Proceedings of the 38th Annual Symposium on the Foundations of Computer Science, pages 284--293, 1997.

Digital Library

[13]

Friedhelm Meyer auf der Heide and Berthold Vöcking. Shortest-path routing in arbitrary networks. Journal of Algorithms, 31(1):105--131, April 1999.

Digital Library

[14]

Rajeev Motwani and Prabhakar Raghavan. Randomized Algorithms. Cambridge University Press, Cambridge, UK, 2000.

Digital Library

[15]

Rafail Ostrovsky and Yuval Rabani. Universal O(congestion+dilation+log1+εN) local control packet switching algorithms. In Proceedings of the 29th Annual ACM Symposium on the Theory of Computing, pages 644--653, New York, May 1997.

Digital Library

[16]

Harald Räcke. Minimizing congestion in general networks. In Proceedings of the 43rd Annual Symposium on the Foundations of Computer Science, pages 43--52, Nov. 2002.

Digital Library

[17]

P. Raghavan and C. D. Thompson. Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica, 7:365--374, 1987.

Digital Library

[18]

A. Srinivasan and C-P. Teo. A constant factor approximation algorithm for packet routing, and balancing local vs. global criteria. In Proceedings of the ACM Symposium on the Theory of Computing (STOC), pages 636--643, 1997.

Digital Library

[19]

L. G. Valiant. A scheme for fast parallel communication. SIAM Journal on Computing, 11:350--361, 1982.

Digital Library

[20]

L. G. Valiant and G. J. Brebner. Universal schemes for parallel communication. In Proceedings of the 13th Annual ACM Symposium on Theory of Computing, pages 263--277, May 1981.

Digital Library

Cited By

Haeupler BPatel SRoeyskoe AStein CZuzic GMohar BShinkar IO'Donnell R(2024)Polylog-Competitive Deterministic Local Routing and SchedulingProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649678(812-822)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649678
Mehak Mahato D(2024)Hop-Constrained Oblivious Routing Using Prim’s-Sollin’s AlgorithmAdvanced Information Networking and Applications10.1007/978-3-031-57942-4_43(444-452)Online publication date: 10-Apr-2024
https://doi.org/10.1007/978-3-031-57942-4_43
Ghaffari MHaeupler BZuzic GKhuller SVassilevska Williams V(2021)Hop-constrained oblivious routingProceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing10.1145/3406325.3451098(1208-1220)Online publication date: 15-Jun-2021
https://dl.acm.org/doi/10.1145/3406325.3451098
Show More Cited By

Index Terms

Oblivious routing on geometric networks
1. Networks
  1. Network protocols
    1. Network layer protocols
      1. Routing protocols
2. Theory of computation
  1. Design and analysis of algorithms

Recommendations

Hop-constrained oblivious routing
STOC 2021: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing

We prove the existence of an oblivious routing scheme that is poly(logn)-competitive in terms of (congestion + dilation), thus resolving a well-known question in oblivious routing.

Concretely, consider an undirected network and a set of packets each ...
Oblivious routing for fat-tree based system area networks with uncertain traffic demands
SIGMETRICS '07: Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems

Fat-tree based system area networks have been widely adopted in high performance computing clusters. In such systems, the routing is often deterministic and the traffic demand is usually uncertain and changing. In this paper, we study routing ...
Oblivious low-congestion multicast routing in wireless networks
MobiHoc '12: Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing

We propose a routing scheme to implement multicast communication in wireless networks. The scheme is oblivious, compact, and completely decentralized. It is intended to support dynamic and diverse multicast requests typical of, for example, publish/...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SPAA '05: Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures

July 2005

346 pages

ISBN:1581139861

DOI:10.1145/1073970

General Chair:
Phil Gibbons
Intel Research
,
Program Chair:
Paul Spirakis
Research and Academic Computer Technology Institute, Greece

Copyright © 2005 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 18 July 2005

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SPAA05

Sponsor:

SPAA05: 17th ACM Symposium on Parallelism in Algorithms and Architectures 2005

July 18 - 20, 2005

Nevada, Las Vegas, USA

Acceptance Rates

Overall Acceptance Rate 447 of 1,461 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

15
Total Citations
View Citations
303
Total Downloads

Downloads (Last 12 months)8
Downloads (Last 6 weeks)1

Reflects downloads up to 09 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Haeupler BPatel SRoeyskoe AStein CZuzic GMohar BShinkar IO'Donnell R(2024)Polylog-Competitive Deterministic Local Routing and SchedulingProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649678(812-822)Online publication date: 10-Jun-2024
https://dl.acm.org/doi/10.1145/3618260.3649678
Mehak Mahato D(2024)Hop-Constrained Oblivious Routing Using Prim’s-Sollin’s AlgorithmAdvanced Information Networking and Applications10.1007/978-3-031-57942-4_43(444-452)Online publication date: 10-Apr-2024
https://doi.org/10.1007/978-3-031-57942-4_43
Ghaffari MHaeupler BZuzic GKhuller SVassilevska Williams V(2021)Hop-constrained oblivious routingProceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing10.1145/3406325.3451098(1208-1220)Online publication date: 15-Jun-2021
https://dl.acm.org/doi/10.1145/3406325.3451098
Carzaniga AKhazaei KKuhn FNasipuri AHu YShakkottai S(2012)Oblivious low-congestion multicast routing in wireless networksProceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing10.1145/2248371.2248395(155-164)Online publication date: 11-Jun-2012
https://dl.acm.org/doi/10.1145/2248371.2248395
Lee TLin M(2012)A load-balanced routing method for large-scale mesh multiprocessorsJournal of the Chinese Institute of Engineers10.1080/02533839.2012.67907235:5(567-577)Online publication date: Jul-2012
https://doi.org/10.1080/02533839.2012.679072
Busch CMagdon-Ismail M(2012)Optimal Oblivious Routing in Hole-Free NetworksQuality, Reliability, Security and Robustness in Heterogeneous Networks10.1007/978-3-642-29222-4_30(421-437)Online publication date: 2012
https://doi.org/10.1007/978-3-642-29222-4_30
Hesari MNarayanan LOpatrny J(2010)On average and maximum load of greedy routing in wireless ad hoc networksProceedings of the 7th international conference on Wireless on-demand network systems and services10.5555/1834182.1834204(113-120)Online publication date: 3-Feb-2010
https://dl.acm.org/doi/10.5555/1834182.1834204
Busch CMagdon-Ismail MXi J(2010)Oblivious Routing for Sensor Network TopologiesTheoretical Aspects of Distributed Computing in Sensor Networks10.1007/978-3-642-14849-1_13(381-406)Online publication date: 8-Nov-2010
https://doi.org/10.1007/978-3-642-14849-1_13
Räcke H(2009)Survey on Oblivious Routing StrategiesProceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice10.1007/978-3-642-03073-4_43(419-429)Online publication date: 15-Jul-2009
https://dl.acm.org/doi/10.1007/978-3-642-03073-4_43
Sau IŽerovnik J(2009)Permutation Routing and (ℓ, k)-Routing on Plane GridsGraphs and Algorithms in Communication Networks10.1007/978-3-642-02250-0_10(265-279)Online publication date: 9-Nov-2009
https://doi.org/10.1007/978-3-642-02250-0_10
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents