skip to main content
10.1145/1060590.1060619acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
Article

Oblivious routing in directed graphs with random demands

Published: 22 May 2005 Publication History

Abstract

Oblivious routing algorithms for general undirected networks were introduced by Räcke, and this work has led to many subsequent improvements and applications. More precisely, Räcke showed that there is an oblivious routing algorithm with polylogarithmic competitive ratio (w.r.t. edge congestion) for any undirected graph. Comparatively little positive results are known about oblivious routing in general directed networks. Using a novel approach, we present the first oblivious routing algorithm which is O(log2 n) competitive with high probability in directed graphs given that the demands are chosen randomly from a known demand-distribution. On the other hand, we show that no oblivious routing algorithm can be o(logn/log log n) competitive even with constant probability in general directed graphs.Our routing algorithms are not oblivious in the traditional definition, but we add the concept of demand-dependence, i.e., the path chosen for an s-t pair may depend on the demand between s and t. This concept that still preserves that routing decisions are only based on local information proves very powerful in our randomized demand model.Finally, we show that our approach for designing competitive oblivious routing algorithms is quite general and has applications in other contexts like stochastic scheduling.

References

[1]
N. Alon, B. Awerbuch, Y. Azar, N. Buchbinder, and J. S. Naor, A general approach to online network optimization problems, in Proceedings of the 15th ACM symposium on Discrete Algorithms, ACM Press, 2004, pp. 942--951.
[2]
B. Awerbuch, M. Hajiaghayi, R. Kleinberg, and T. Leighton, Online client-server load balancing without global information, in Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms, 2005, pp. 197--206.
[3]
Y. Azar, E. Cohen, A. Fiat, H. Kaplan, and H. Räcke, Optimal oblivious routing in polynomial time, in Proceedings of the 35th ACM Symposium on Theory of Computing, ACM Press, 2003, pp. 383--388.
[4]
M. Bienkowski, M. Korzeniowski, and H. Räcke, A practical algorithm for constructing oblivious routing schemes, in Proceedings of the 15th ACM Symposium on Parallel Algorithms and Architectures, ACM Press, 2003, pp. 24--33.
[5]
S. Boucheron, G. Lugosi, and P. Massart, A sharp concentration inequality with applications, Random Structures and Algorithms, 16 (2000), pp. 277--292.
[6]
C. Chekuri, S. Khanna, and B. Shepherd, The all-or-nothing multicommodity ow problem, in Proceedings of the 36th ACM symposium on Theory of Computing, ACM Press, 2004, pp. 156--165.
[7]
B. Dean, M. Goemans, and J. Vondrak, Approximating the stochastic knapsack problem: The benefit of adaptivity, in Proceedings of the 45th IEEE Symposium on Foundations of Computer Science (FOCS), IEEE Computer Society, 2004, pp. 208--217.
[8]
---------, Adaptivity and approximation for stochastic packing problems, in Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms (SODA), ACM Press, 2005, pp. 395--404.
[9]
M. Hajiaghayi, R. D. Kleinberg, T. Leighton, and H. Räcke, Oblivious routing on node-capacitated and directed graphs, in Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms (SODA), ACM Press, 2005, pp. 782--790.
[10]
C. Harrelson, K. Hildrum, and S. Rao, A polynomial-time tree decomposition to minimize congestion, in Proceedings of the 15th Annual ACM Symposium on Parallel Algorithms and Architectures, 2003, pp. 34--43.
[11]
B. M. Maggs, G. L. Miller, O. Parekh, R. Ravi, and S. L. M. Woo, Solving symmetric diagonally-dominant systems by preconditioning. manuscript, 2003.
[12]
R. Motwani and P. Rahgavan, Randomized Algorithms, Cambridge University Press, 1995.
[13]
H. Räcke, Minimizing congestion in general networks, in Proceedings of the 43rd Symposium on Foundations of Computer Science, IEEE Computer Society, 2002, pp. 43--52.
[14]
H. Räcke and A. Rosen, Distributed online call control in general networks, in Proceedings of the 16th ACM-SIAM Symposium on Discrete Algorithms, 2005, pp. 791--800.
[15]
L. G. Valiant and G. J. Brebner, Universal schemes for parallel communication, in Proceedings of the 13th ACM symposium on Theory of Computing, 1981, pp. 263--277.

Cited By

View all
  • (2024)Breaking the VLB Barrier for Oblivious Reconfigurable NetworksProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649608(1865-1876)Online publication date: 10-Jun-2024
  • (2023)Configuration Balancing for Stochastic RequestsInteger Programming and Combinatorial Optimization10.1007/978-3-031-32726-1_10(127-141)Online publication date: 22-May-2023
  • (2017)An improved upper bound for the universal TSP on the gridProceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3039686.3039750(1006-1021)Online publication date: 16-Jan-2017
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
STOC '05: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
May 2005
778 pages
ISBN:1581139608
DOI:10.1145/1060590
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: 22 May 2005

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. demand distributions
  2. directed graphs
  3. oblivious routing

Qualifiers

  • Article

Conference

STOC05
Sponsor:
STOC05: Symposium on Theory of Computing
May 22 - 24, 2005
MD, Baltimore, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Upcoming Conference

STOC '25
57th Annual ACM Symposium on Theory of Computing (STOC 2025)
June 23 - 27, 2025
Prague , Czech Republic

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)9
  • Downloads (Last 6 weeks)3
Reflects downloads up to 17 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Breaking the VLB Barrier for Oblivious Reconfigurable NetworksProceedings of the 56th Annual ACM Symposium on Theory of Computing10.1145/3618260.3649608(1865-1876)Online publication date: 10-Jun-2024
  • (2023)Configuration Balancing for Stochastic RequestsInteger Programming and Combinatorial Optimization10.1007/978-3-031-32726-1_10(127-141)Online publication date: 22-May-2023
  • (2017)An improved upper bound for the universal TSP on the gridProceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3039686.3039750(1006-1021)Online publication date: 16-Jan-2017
  • (2016)Routing under balanceProceedings of the forty-eighth annual ACM symposium on Theory of Computing10.1145/2897518.2897654(598-611)Online publication date: 19-Jun-2016
  • (2016)RoutingEncyclopedia of Algorithms10.1007/978-1-4939-2864-4_351(1868-1871)Online publication date: 22-Apr-2016
  • (2016)Oblivious RoutingEncyclopedia of Algorithms10.1007/978-1-4939-2864-4_261(1426-1430)Online publication date: 22-Apr-2016
  • (2015)Traffic Engineering Based on Model Predictive ControlIEICE Transactions on Communications10.1587/transcom.E98.B.996E98.B:6(996-1007)Online publication date: 2015
  • (2014)Online Stochastic Reordering Buffer SchedulingAutomata, Languages, and Programming10.1007/978-3-662-43948-7_39(465-476)Online publication date: 2014
  • (2012)Hybrid Demand Oblivious Routing: Hyper-cubic Partitions and Theoretical Upper BoundsBroadband Communications, Networks, and Systems10.1007/978-3-642-30376-0_7(84-100)Online publication date: 2012
  • (2011)Learning submodular functionsProceedings of the forty-third annual ACM symposium on Theory of computing10.1145/1993636.1993741(793-802)Online publication date: 6-Jun-2011
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media