Compact routing on euclidian metrics

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 23, Issue , 2004, Pages 141-149

  Abraham, Ittai ^a   Malkhi, Dahlia ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

Compact routing; Network design

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; DISTRIBUTED COMPUTER SYSTEMS; GRAPH THEORY; POLYNOMIALS; ROUTERS; TELECOMMUNICATION NETWORKS;

COMPACT ROUTING; EUCLIDIAN METRICS; GRAPH LABELING; NETWORK DESIGN;

METRIC SYSTEM;

EID: 10444289683     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1011767.1011789     Document Type: Conference Paper

References (25)

1. S. Arya, D. M. Mount, and M. Smid. Dynamic algorithms for geometric spanners of small diameter: randomized solutions. Comput. Geom. Theory Appl., 13(2):91-107, 1999.
2. J. Aspnes, Z. Diamadi, and G. Shah. Fault-tolerant routing in peer-to-peer systems. In Proceedings of the Twenty-First ACM Symposium on Principles of Distributed Computing (PODC 02), pages 223-232, July 2002.
3. B. Awerbuch and D. Peleg. Routing with polynomial communication-space trade-off. SIAM J. Discret. Math., 5(2):151-162, 1992.
4. P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia. Routing with guaranteed delivery in ad hoc wireless networks. Wireless Networks, 7(6):609-616, 2001.
5. L. J. Cowen. Compact routing with minimum stretch. In Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, pages 255-260. Society for Industrial and Applied Mathematics, 1999.
6. R. Cox, F. Dabek, F. Kaashoek, J. Li, and R. Morris. Practical, distributed network coordinates. SIGCOMM Comput. Commun. Rev., 34(1):113-118, 2004.
7. C. Gavoille. Routing in distributed networks: overview and open problems. ACM SIGACT News, 32(1):36-52, 2001.
8. C. Gavoille and D. Peleg. Comapact and localized distributed data structures. Distributed Computing, 16(2-3):111-120, 2003.
9. K. P. Gummadi, S. Saroiu, and S. D. Gribble. King: Estimating latency between arbitrary internet end hosts. In Proceedings of the SIGCOMM Internet Measurement Workshop (IMW 2002), 2002.
10. Y. Hassin and D. Peleg. Sparse communication networks and efficient routing in the plane. Distributed Computing, 14(4):205-215, 2001.
11. B. Karp and H. T. Kung, GPSR: greedy perimeter stateless routing for wireless networks. In Proceedings of the 6th annual international conference on Mobile computing and networking, pages 243-254. ACM Press, 2000.
12. J.M. Keil and C.A. Gutwin. Classes of graphs which approximate the complete euclidean graph. Discrete Computational Geometry, 7:13-28, 1992.
13. J. Kleinberg. The Small-World Phenomenon: An Algorithmic Perspective. In Proceedings of the 32nd ACM Symposium on Theory of Computing, 2000.
14. E. Kranakis, H. Singh, and J. Urrutia. Compass routing on geometric networks. In Proc. 11 th Canadian Conference on Computational Geometry, pages 51-54, Vancouver, August 1999.
15. F. Kuhn, R. Wattenhofer, and A. Zollinger. Asymptotically optimal geometric mobile ad-hoc routing. In Proc. of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications (Dial-M), pages 24-33. ACM Press, 2002.
16. th ACM Int. Symposium on Mobile Ad-Hoc Networking and Computing (MobiHoc), 2003.
17. D. Malkhi, M. Naor, and D. Ratajczak. Viceroy: A scalable and dynamic emulation of the butterfly. In Proceedings of the 21st ACM Symposium on Principles of Distributed Computing (PODC '02), pages 183-192, 2002.
18. G.S Manku, M. Bawa, and P. Raghavan. Symphony: Distributed hashing in small world. In Proceedings of the 4th USENIX Symposium on Internet Technologies and Systems, 2003.
19. E. Ng and H. Zhang. Predicting internet network distance with coordiantes-based approaches. In Proceedings of IEEE Conference on Computer Communications (INFOCOM '02), 2002.
20. Y. Shavitt and T. Tankel. Big-bang simulation for embedding network distances in euclidean space. In Proceedings of IEEE Conference on Computer Communications (INFOCOM '03), San Francisco, CA, 2003.
21. I. Stoica, R. Morris, D. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In Proceedings of the SIGCOMM 2001, 2001.
22. K. Talwar. Bypassing the embedding: Approximation schemes and compact representations for growth restricted metrics. In Preliminary version, to appear in STOC 2004.
23. M. Thorup and U. Zwick. Approximate distance oracles. In Proceedings of the thirty-third annual ACM symposium on Theory of computing, pages 183-192. ACM Press, 2001.
24. M. Thorup and U. Zwick. Compact routing schemes. In Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures, pages 1-10. ACM Press, 2001.
25. S. Wilbur, T. H. Saleem, B. M. Pias, and J. Crowcroft. Lighthouses for scalable distributed location. In The 2nd International Workshop on Peer-to-Peer Systems (IPTPS '03), 2003.