skip to main content
10.1145/2484239.2484268acmconferencesArticle/Chapter ViewAbstractPublication PagespodcConference Proceedingsconference-collections
research-article

Compact routing schemes with improved stretch

Published: 22 July 2013 Publication History

Abstract

We consider the problem of compact routing in weighted general undirected graphs, in which the goal is to construct local routing tables that allow information to be sent on short paths in the network. In this paper the first improvement to the work of Thorup and Zwick [SPAA'01] is presented. Specifically, we construct an improved routing scheme obtaining for every k routing tables of size Õ(n1/k log D), and stretch (4 -- α)k -- β for some absolute constants α, β > 0, where D is the normalized diameter. This provides a positive answer to a main open question in this area as to the existence of a routing scheme with stretch ck for some constant c < 4.

References

[1]
I. Abraham, C. Gavoille, and D. Malkhi. Routing with improved communication-space trade-off. In Proc. 18th Annual Conference on Distributed Computing (DISC), 305--319, 2004.
[2]
I. Abraham, C. Gavoille, D. Malkhi, N. Nisan, and M. Thorup. Compact name-independent routing with minimum stretch. In Proc. 16th Annual ACM Symposium on Parallel Algorithms and Architecture (SPAA), 20--24, 2004.
[3]
M. Arias, L. Cowen, K. Laing, R. Rajaraman, and O. Taka, Compact routing with name independence. In Proc. 15th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), 184--192, 2003.
[4]
B. Awerbuch, A. Bar-Noy, N. Linial, and D. Peleg. Compact distributed data structures for adaptive routing. In Proc. 21st ACM Symp. on Theory of Computing (STOC), 479--489, 1989.
[5]
B. Awerbuch, A. Bar-Noy, N. Linial, and D. Peleg. Improved routing strategies with succinct tables. In J. Algorithms, 11(3):307--341, 1990.
[6]
B. Awerbuch and D. Peleg. Sparse partitions. In Proc. 31st IEEE Symp. on Foundations of Computer Science (FOCS), 503--513, 1990.
[7]
L. J. Cowen. Compact routing with minimum stretch. J. Alg., 38:170--183, 2001.
[8]
T. Eilam, C. Gavoille, and D. Peleg. Compact routing schemes with low stretch factor. In J. Algorithms, 46:97--114, 2003.
[9]
P. Erdős. Extremal problems in graph theory. In Theory of graphs and its applications, pages 29--36, 1964.
[10]
P. Fraigniaud and C. Gavoille. Memory requirement for universal routing schemes. In Proc. 14th ACM Symp. on Principles of Distributed Computing (PODC), 223--230, 1995.
[11]
P. Fraigniaud and C. Gavoille. Routing in Trees. In 28th Int'l Coll. on Automata, Languages and Programming (ICALP), 757--772, 2001.
[12]
C. Gavoille and M. Gengler. Space-efficiency for routing schemes of stretch factor three. In J. Parallel Distrib. Comput., 61:679--687, 2001.
[13]
C. Gavoille and D. Peleg. Compact and localized distributed data structures. In Distributed Computing, 16:111--120, 2003.
[14]
C. Gavoille and C. Sommer. Sparse spanners vs. compact routing. In Proc. 23th ACM Symp. on Parallel Algorithms and Architectures (SPAA), 225--234, 2011.
[15]
D. Peleg. Distributed computing: a locality-sensitive approach. In SIAM, 2000.
[16]
D. Peleg and E. Upfal. A trade-off between space and efficiency for routing tables. In J. ACM, 36(3):510--530, 1989.
[17]
M. Thorup and U. Zwick. Compact routing schemes. In Proc. 13th ACM Symp. on Parallel Algorithms and Architectures (SPAA), 1--10, 2001.
[18]
M. Thorup and U. Zwick. Approximate distance oracles. In J. ACM, 52, 1--24, 2005.

Cited By

View all

Index Terms

  1. Compact routing schemes with improved stretch

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    PODC '13: Proceedings of the 2013 ACM symposium on Principles of distributed computing
    July 2013
    422 pages
    ISBN:9781450320658
    DOI:10.1145/2484239
    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 July 2013

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. compact routing
    2. name independent routing
    3. stretch factor

    Qualifiers

    • Research-article

    Conference

    PODC '13
    Sponsor:
    PODC '13: ACM Symposium on Principles of Distributed Computing
    July 22 - 24, 2013
    Québec, Montréal, Canada

    Acceptance Rates

    PODC '13 Paper Acceptance Rate 37 of 145 submissions, 26%;
    Overall Acceptance Rate 740 of 2,477 submissions, 30%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

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

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)An artificial bee colony algorithm for the minimum edge-dilation K-center problemSoft Computing10.1007/s00500-023-09509-728:13-14(8497-8511)Online publication date: 11-Jul-2024
    • (2023)Approximate distance oracles with improved stretch for sparse graphsTheoretical Computer Science10.1016/j.tcs.2022.11.016943(89-101)Online publication date: Jan-2023
    • (2023)An Iterated Local Search for the Minimum Edge-Dilation K-Center ProblemSN Computer Science10.1007/s42979-023-02226-w4:6Online publication date: 12-Oct-2023
    • (2022)Hop-Constrained Metric Embeddings and their Applications2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS52979.2021.00056(492-503)Online publication date: Feb-2022
    • (2022)Constructing light spanners deterministically in near-linear timeTheoretical Computer Science10.1016/j.tcs.2022.01.021Online publication date: Jan-2022
    • (2021)Shorter labels for routing in treesProceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3458064.3458194(2174-2193)Online publication date: 10-Jan-2021
    • (2021)Constant-Round Spanners and Shortest Paths in Congested Clique and MPCProceedings of the 2021 ACM Symposium on Principles of Distributed Computing10.1145/3465084.3467928(223-233)Online publication date: 21-Jul-2021
    • (2021)Clan embeddings into trees, and low treewidth graphsProceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing10.1145/3406325.3451043(342-355)Online publication date: 15-Jun-2021
    • (2021)Routing Among Convex Polygonal Obstacles in the PlaneCombinatorial Optimization and Applications10.1007/978-3-030-92681-6_1(1-11)Online publication date: 11-Dec-2021
    • (2021)Approximate Distance Oracles with Improved Stretch for Sparse GraphsComputing and Combinatorics10.1007/978-3-030-89543-3_8(89-100)Online publication date: 20-Oct-2021
    • 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