Fast routing table construction using small messages

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2013, Pages 381-390

  Lenzen, Christoph ^a   Patt Shamir, Boaz ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Approximate shortest paths; Routing; Small messages

Indexed keywords

DISTANCE ESTIMATION; DISTRIBUTED APPROXIMATION ALGORITHM; DISTRIBUTED COMPUTATIONS; GENERALIZED STEINER FORESTS; RANDOMIZED ALGORITHMS; ROUTING; SHORTEST PATH; SMALL MESSAGES;

APPROXIMATION ALGORITHMS; COMPLEX NETWORKS; GRAPH THEORY; OPTIMIZATION; TELECOMMUNICATION NETWORKS;

COMPUTATION THEORY;

EID: 84879820138     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2488608.2488656     Document Type: Conference Paper

References (31)

1. I. Abraham, C. Gavoille, and D. Malkhi. On Space-Stretch Trade-Offs: Lower Bounds. In Proc. 18th ACM Symp. on Parallelism in Algorithms and Architectures, pages 207-216, 2006.
2. I. Abraham, C. Gavoille, D. Malkhi, N. Nisan, and M. Thorup. Compact name-independent routing with minimum stretch. ACM Transactions on Algorithms, 4(3):37:1-37:12, 2008.
3. S. Baswana and S. Sen. A Simple and Linear Time Randomized Algorithm for Computing Sparse Spanners in Weighted Graphs. Random Structures and Algorithms, 30(4):532-563, 2007.
4. R. E. Bellman. On a routing problem. Quart. Appl. Math., 16:87-90, 1958.
5. P. Chalermsook and J. Fakcharoenphol. Simple distributed algorithms for approximating minimum steiner trees. In Proc. 11th Ann. Conf. on Computing and Combinatorics, volume 3595 of LNCS, pages 380-389, 2005.
6. J. Chawachat, J. Fakcharoenphol, and D. Nanongkai. Fast shortest-path algorithms on distributed networks. Unpublished manuscript, 2013.
7. A. Das Sarma, M. Dinitz, and G. Pandurangan. Efficient Computation of Distance Sketches in Distributed Networks. In Proc. 24th ACM Symp. on Parallelism in Algorithms and Architectures, 2012.
8. A. Das Sarma, S. Holzer, L. Kor, A. Korman, D. Nanongkai, G. Pandurangan, D. Peleg, and R. Wattenhofer. Distributed Verification and Hardness of Distributed Approximation. In Proc. 43th ACM Symp. on Theory of Computing, pages 363-372, 2011.
9. M. Elkin. An Unconditional Lower Bound on the Time-Approximation Tradeoff for the Minimum Spanning Tree Problem. SIAM Journal on Computing, 36(2):463-501, 2006.
10. M. Elkin and D. Peleg. (1 + ε, β)-Spanner Constructions for General Graphs. SIAM Journal on Computing, 33(3):608-631, 2004.
11. L. R. Ford. Network ow theory. Technical Report P-923, The Rand Corp., 1956.
12. S. Frischknecht, S. Holzer, and R. Wattenhofer. Networks Cannot Compute their Diameter in Sublinear Time. In Proc. 23rd ACM-SIAM Symp. on Discrete Algorithms, pages 1150-1162, 2012.
13. J. A. Garay, S. Kutten, and D. Peleg. A Sub-Linear Time Distributed Algorithm for Minimum-Weight Spanning Trees. In Proc. 34th IEEE Symp. on Foundations of Computer Science, pages 659-668, 1993.
14. S. Holzer and R. Wattenhofer. Optimal Distributed All Pairs Shortest Paths and Applications. In Proc. 31st ACM Symp. on Principles of Distributed Computing, 2012.
15. M. Khan, F. Kuhn, D. Malkhi, G. Pandurangan, and K. Talwar. Efficient Distributed Approximation Algorithms via Probabilistic Tree Embeddings. Distributed Computing, 25:189-205, 2012.
16. M. Khan and G. Pandurangan. A Fast Distributed Algorithm for Minimum Spanning Trees. Distributed Computing, 20:391-402, 2008.
17. S. Kutten and D. Peleg. Fast Distributed Construction of Small k-Dominating Sets and Applications. Journal of Algorithms, 28(1):40-66, 1998.
18. C. Lenzen and B. Patt-Shamir. Fast Routing Table Construction Using Small Messages. ArXiv e-prints, Oct. 2012.
19. Y. Mansour and B. Patt-Shamir. Greedy packet scheduling on shortest paths. Journal of Algorithms, 14:449-465, 1993.
20. J. McQuillan, I. Richer, and E. Rosen. The new routing algorithm for the arpanet. IEEE Trans. on Communications, COM-28(5):711-719, May 1980.
21. J. Moy. OSPF version 2. RFC 2328, Network Working Group, 1998.
22. D. Peleg. Distributed Computing: A Locality-Sensitive Approach. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, 2000.
23. D. Peleg, L. Roditty, and E. Tal. Distributed Algorithms for Network Diameter and Girth. In Proc. 39th Int. Colloquium on Automata, Languages, and Programming, 2012.
24. D. Peleg and V. Rubinovich. Near-tight Lower Bound on the Time Complexity of Distributed MST Construction. SIAM Journal on Computing, 30:1427-1442, 2000.
25. D. Peleg and A. A. Schäffer. Graph Spanners. Journal of Graph Theory, 13(1):99-116, 1989.
26. D. Peleg and E. Upfal. A trade-off between space and efficiency for routing tables. Journal of the ACM, 36(3):510-530, 1989.
27. L. L. Peterson and B. S. Davie. Computer Networks: A Systems Approach. Morgan Kaufmann, 5th edition, 2011.
28. N. Santoro and R. Khatib. Labelling and Implicit Routing in Networks. The Computer Journal, 28:5-8, 1985.
29. M. Thorup and U. Zwick. Compact routing schemes. In Proc. 13th Ann. ACM Symp. on Parallel Algorithms and Architectures, 2001.
30. M. Thorup and U. Zwick. Approximate Distance Oracles. Journal of the ACM, 52(1):1-24, 2005.
31. U. Zwick. Exact and Approximate Distances in Graphs - A Survey. In Proc. 9th Ann. European Symp. on Algorithms, pages 33-48, 2001.