Fast construction of overlay networks

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2005, Pages 145-154

  Angluin, Dana ^a   Aspnes, James ^a   Chen, Jiang ^a   Wu, Yinghua ^a   Yin, Yitong ^a  

^a YALE UNIVERSITY   (United States)

Author keywords

Asynchronous; Merging; Overlay networks; Patricia trees

Indexed keywords

OVERLAY NETWORKS; PATRICIA TREES; SKIN GRAPHS;

ALGORITHMS; GRAPH THEORY; TREES (MATHEMATICS);

TELECOMMUNICATION NETWORKS;

EID: 32144432299     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1073970.1073991     Document Type: Conference Paper

References (21)

1. K. Aberer. P-Grid: A self-organizing access structure for P2P information systems. Lecture Notes in Computer Science, 2172:179-194, 2001.
2. I. Abraham and D. Dolev. Asynchronous resource discovery. In Proceedings of the twenty-second annual symposium on Principles of distributed computing, pages 143-150. ACM Press, 2003.
3. J. Aspnes and G. Shah. Skip Graphs. In Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 384-393, Baltimore, MD, USA, Jan. 2003. Submitted to a special issue of Journal of Algorithms dedicated to select papers of SODA 2003.
4. I. Cidon, I. Gopal, and S. Kutten. New models and algorithms for future networks. IEEE Transactions on Information Theory, 41(3):769-780, May 1995.
5. R. de la Briandais. File searching using variable length keys. In Proceedings of the Western Joint Computer Conference, volume 15, pages 295-298, Montvale, NJ, USA, 1959.
6. E. Fredkin. Trie Memory. Communications of the ACM, 3(9):490-499, Sept. 1960.
7. M. J. Freedman and R. Vingralek. Efficient peer-to-peer lookup based on a distributed trie. In Proceedings of the 1st International Workshop on Peer-to-Peer Systems (IPTPS02), Cambridge, MA, March 2002.
8. R. G. Gallager, P. A. Humblet, and P. M. Spira. A distributed algorithm for minimum-weight spanning trees. ACM Trans. Program. Lang. Syst., 5(1):66-77, 1983.
9. M. T. Goodrich and S. R. Kosaraju. Sorting on a parallel pointer machine with applications to set expression evaluation. J. ACM, 43(2):1331-361, 1996.
10. M. Harchol-Balter, T. Leighton, and D. Lewin. Resource discovery in distributed networks. In Proceedings of the eighteenth annual A CM symposium on Principles of distributed computing, pages 229-237. ACM Press, 1999.
11. A. Israeli and A. Itai. A fast and simple randomized parallel algorithm for maximal matching. Information Processing Letters, 22(2):77-80, 1986.
12. T. Johnson and P. Krishna. Lazy updates for distributed search structure. In P. Buneman and S. Jajodia, editors, Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, Washington, D.C., May 26-28, 1993, pages 337-346. ACM Press, 1993.
13. S. Kutten and D. Peleg. Asynchronous resource discovery in peer to peer networks. In 21st IEEE Symposium on Reliable Distributed Systems (SRDS'02), pages 224-231, October 13-16, 2002.
14. S. Kutten, D. Peleg, and U. Vishkin. Deterministic resource discovery in distributed networks. In Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures, pages 77-83. ACM Press, 2001.
15. R. E. Ladner and M. J. Fischer. Parallel prefix computation. J. ACM, 27(4):831-838, 1980.
16. C. Law and K.-Y. Siu. An O(log n) randomized resource discovery algorithm. In Brief Announcements of the 14th International Symposium on Distributed Computing, Technical University of Madrid, Technical Report FIM/110.1/DLSIIS/2000, pages 5-8, Oct. 2000.
17. D. R. Morrison. Patricia - practical algorithm to retrieve information coded in alphanumeric, J. ACM, 15(4):514-534, 1968.
18. C. Okasaki and A. Gill. Fast mergeable integer maps. In Workshop on ML, pages 77-86, 1998.
19. I. Stoica, R. Morris, D. Liben-Nowell, D. R. Karger, M. F. Kaashoek, F. Dabek, and H. Balakrishnan. Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. IEEE/ACM Transactions on Networking, 11(1):17-32, Feb. 2003.
20. R. Uehara and Z.-Z. Chen. Parallel approximation algorithms for maximum weighted matching in general graphs. In Proceedings of IFIP TCS 2000, pages 84-98. Springer-Verlag, LNCS 1872, 2000.
21. H. Yokota, Y. Kanemasa, and J. Miyazaki. Fat-btree: An update-conscious parallel directory structure. In Proceedings of the 15th International Conference on Data Engineering, 23-26 March 1999, Sydney, Austrialia, pages 448-457. IEEE Computer Society, 1999.