research-article

Dynamic routing schemes for graphs with low local density

Authors:

David PelegAuthors Info & Claims

ACM Transactions on Algorithms (TALG), Volume 4, Issue 4

Article No.: 41, Pages 1 - 18

https://doi.org/10.1145/1383369.1383372

Published: 22 August 2008 Publication History

Abstract

This article studies approximate distributed routing schemes on dynamic communication networks. The work focuses on dynamic weighted general graphs where the vertices of the graph are fixed, but the weights of the edges may change. Our main contribution concerns bounding the cost of adapting to dynamic changes. The update efficiency of a routing scheme is measured by the time needed in order to update the routing scheme following a weight change. A naive dynamic routing scheme, which updates all vertices following a weight change, requires Ω(Diam) time in order to perform the updates after every weight change, where Diam is the diameter of the underlying graph. In contrast, this article presents approximate dynamic routing schemes with average time complexity Θ˜(D) per topological change, where D is the local density parameter of the underlying graph. Following a weight change, our scheme never incurs more than Diam time; thus, our scheme is particularly efficient on graphs which have low local density and large diameter. The article also establishes upper and lower bounds on the size of the databases required by the scheme at each site.

References

[1]

Afek, Y., Awerbuch, B., Plotkin, S. A., and Saks, M. 1996. Local management of a global resource in a communication network. J. ACM 43, 1--19.

Digital Library

[2]

Afek, Y., Gafni, E., and Ricklin, M. 1989. Upper and lower bounds for routing schemes in dynamic networks. In Proceedings of the 30th Symposium on Foundations of Computer Science (FOCS), 370--375.

Digital Library

[3]

Awerbuch, B., Bar-Noy, A., Linial, N., and Peleg, D. 1990. Improved routing strategies with succinct tables. J. Algor. 11, 307--341.

Digital Library

[4]

Awerbuch, B., and Peleg, D. 1992. Routing with polynomial communication-space trade-off. SIAM J. Discr. Math. 5, 307--341.

Digital Library

[5]

Chinn, P., Chavatálová, J., Dewdney, A., and Gibbs, N. 1982. The bandwidth problem for graphs and matrices—Survey. J. Graph Theory 6, 223--254.

[6]

Cowen, L. 2001. Compact routing with minimum stretch. J. Algor. 38, 170--183.

Digital Library

[7]

Chung, R. F., and Seymour, P. D. 1989. Graphs with small bandwidth and cutwidth. Discr. Math. 75, 113--119.

Digital Library

[8]

Dolev, S., Kranakis, E., Krizanc, D., and Peleg, D. 1999. Bubbles: Adaptive routing scheme for high-speed dynamic networks. SIAM J. Comput. 29, 804--833.

Digital Library

[9]

Eppstein, D., Galil, Z., and Italiano, G. F. 1999. Dynamic graph algorithms. In Algorithms and Theoretical Computing Handbook, Atallah, M. J. CRC Press, Boca Raton, FL, Chapter 8.

[10]

Fraigniaud, P., and Gavoille, C. 1997. Universal routing schemes. Distrib. Comput. 10, 65--78.

[11]

Feige, U. 2000. Approximating the bandwidth via volume respecting embeddings. J. Comput. Syst. Sci. 60, 510--539.

Digital Library

[12]

Feige, U., and Talwar, K. 2005. Approximating the bandwidth of caterpillars. In Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX). Lecture Notes in Computer Science, vol. 3624. Springer, 62--73.

Digital Library

[13]

Feigenbaum, J., and Kannan, S. 2000. Dynamic graph algorithms. In Handbook of Discrete and Combinatorial Mathematics, CRC Press, Boca Raton, FL.

[14]

Iwama, K., and Kawachi, A. 2000. Compact routing with stretch factor less than three. In Proceedings of the 19th ACM Symposium on Principles of Distributed Computing (PODC), 337.

Digital Library

[15]

Iwama, K., and Okita, M. 2003. Compact routing for flat networks. In Proceedings of the 17th International Symposium on Distributed Computing.

Digital Library

[16]

Krauthgamer, R., Lee, J., Mendel, M., and Naor, A. 2004. Measured descent: A new embedding method for finite metrices. In Proceedings of the 45th IEEE Symposium on Foundations of Computer Science (FOCS).

Digital Library

[17]

Korman, A. 2005. General compact labeling schemes for dynamic trees. In Proceedings of the 19th International Symposium on Distributed Computing.

Digital Library

[18]

Korman, A., Peleg, D., and Rodeh, Y. 2004. Labeling schemes for dynamic tree networks. Theory Comput. Syst. 37, 49--75.

[19]

Korman, A., and Peleg, D. 2003. Labeling schemes for weighted dynamic trees. In Proceedings of the 30th International Colloquium on Automata, Languages and Programming (ICALP), 369--383.

Digital Library

[20]

Linial, N. 1992. Locality in distributed graph algorithms. SIAM J. Comput. 21, 193--201.

Digital Library

[21]

Peleg, D. 2000. Distributed Computing: A Locality-Sensitive Approach. SIAM, Philadelphia, PA.

[22]

Peleg, D., and Upfal, E. 1989. A tradeoff between size and efficiency for routing tables. J. ACM 36, 510--530.

Digital Library

[23]

Santoro, N., and Khatib, R. 1985. Labeling and implicit routing in networks. The Comput. J. 28, 5--8.

[24]

Thorup, M., and Zwick, U. 2001. Compact routing schemes. In Proceedings of the 13th ACM Symposium on Parallel Algorithms and Architectures (SPAA), 1--10.

Digital Library

Cited By

Korman AKutten S(2019)Controller and estimator for dynamic networksInformation and Computation10.1016/j.ic.2012.10.018223(43-66)Online publication date: 4-Jan-2019
https://dl.acm.org/doi/10.1016/j.ic.2012.10.018
Henzinger MKrinninger SNanongkai D(2017)Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic NetworksACM Transactions on Algorithms10.1145/314655013:4(1-24)Online publication date: 21-Dec-2017
https://dl.acm.org/doi/10.1145/3146550
Parter MPeleg DSolomon S(2016)Local-on-average distributed tasksProceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms10.5555/2884435.2884452(220-239)Online publication date: 10-Jan-2016
https://dl.acm.org/doi/10.5555/2884435.2884452
Show More Cited By

Recommendations

Compact separator decompositions in dynamic trees and applications to labeling schemes

This paper presents an efficient scheme maintaining a separator decomposition representation in dynamic trees using asymptotically optimal labels. In order to maintain the short labels, the scheme uses relatively low message complexity. In particular, ...
Compact separator decompositions in dynamic trees and applications to labeling schemes
DISC'07: Proceedings of the 21st international conference on Distributed Computing

This paper presents an efficient scheme maintaining a separator decomposition representation in dynamic trees using asymptotically optimal labels. In order to maintain the short labels, the scheme uses relatively low message complexity. In particular, ...
Improved compact routing schemes for dynamic trees
PODC '08: Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing

A classical routing problem consists of assigning a label and distinct port numbers to each node of a graph, such that for every node v, given its own label and the label of any destination vertex u, node v can find which of its incident port numbers ...

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Algorithms

ACM Transactions on Algorithms Volume 4, Issue 4

August 2008

264 pages

ISSN:1549-6325

EISSN:1549-6333

DOI:10.1145/1383369

Issue’s Table of Contents

Copyright © 2008 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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 22 August 2008

Accepted: 01 March 2007

Received: 01 September 2006

Published in TALG Volume 4, Issue 4

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article
Research
Refereed

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
417
Total Downloads

Downloads (Last 12 months)4
Downloads (Last 6 weeks)2

Reflects downloads up to 14 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Korman AKutten S(2019)Controller and estimator for dynamic networksInformation and Computation10.1016/j.ic.2012.10.018223(43-66)Online publication date: 4-Jan-2019
https://dl.acm.org/doi/10.1016/j.ic.2012.10.018
Henzinger MKrinninger SNanongkai D(2017)Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic NetworksACM Transactions on Algorithms10.1145/314655013:4(1-24)Online publication date: 21-Dec-2017
https://dl.acm.org/doi/10.1145/3146550
Parter MPeleg DSolomon S(2016)Local-on-average distributed tasksProceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms10.5555/2884435.2884452(220-239)Online publication date: 10-Jan-2016
https://dl.acm.org/doi/10.5555/2884435.2884452
Henzinger MKrinninger SNanongkai D(2013)Sublinear-Time maintenance of breadth-first spanning tree in partially dynamic networksProceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part II10.1007/978-3-642-39212-2_53(607-619)Online publication date: 8-Jul-2013
https://dl.acm.org/doi/10.1007/978-3-642-39212-2_53
Emek YKorman ARicha AGuerraoui R(2010)Efficient threshold detection in a distributed environmentProceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing10.1145/1835698.1835742(183-191)Online publication date: 25-Jul-2010
https://dl.acm.org/doi/10.1145/1835698.1835742
Westphal CKempf JEggert LDoyle L(2008)A compact routing architecture for mobilityProceedings of the 3rd international workshop on Mobility in the evolving internet architecture10.1145/1403007.1403009(1-6)Online publication date: 22-Aug-2008
https://dl.acm.org/doi/10.1145/1403007.1403009
Korman ABazzi RPatt-Shamir B(2008)Improved compact routing schemes for dynamic treesProceedings of the twenty-seventh ACM symposium on Principles of distributed computing10.1145/1400751.1400777(185-194)Online publication date: 18-Aug-2008
https://dl.acm.org/doi/10.1145/1400751.1400777

View Options

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 Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents