O(log n)-time overlay network construction from graphs with out-degree 1

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4878 LNCS, Issue , 2007, Pages 286-300

  Aspnes, James ^a   Wu, Yinghua ^a  

^a YALE UNIVERSITY   (United States)

Author keywords

Balanced search tree; Fault tolerance; Overlay network; Pipeline; Randomization; Selfstabilizing

Indexed keywords

ALGORITHMS; DATA STRUCTURES; DISTRIBUTED COMPUTER SYSTEMS; FAULT TOLERANCE; TREES (MATHEMATICS);

BALANCED SEARCH TREE; OVERLAY NETWORK;

COMPUTER NETWORKS;

EID: 38449091427     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77096-1_21     Document Type: Conference Paper

References (17)

1. Angluin, D., Aspnes, J., Chen, J., Wu, Y., Yin, Y.: Fast construction of overlay networks. In: SPAA 2005. Proceedings of the 17th ACM Symposium on Parallelism in Algorithms and Architectures, Las Vegas, NV, USA (July 2005)
2. Stoica, I., Morris, R., Liben-Nowell, D., Karger, D.R., Kaashoek, M.F., Dabek, F., Balakrishnan, H.: Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. IEEE/ACM Transactions on Networking 11(1), 17-32 (2003)
3. Aspnes, J., Shah, G.: Skip Graphs. In: SODA. Proceedings of the Fourteenth Annual ACMSIAM Symposium on Discrete Algorithms, Baltimore, MD, USA, pp. 384-393 (January 2003) (submitted to a special issue of Journal of Algorithms dedicated to select papers of SODA 2003)
4. Onus, M., Richa, A., Scheideler, C.: Linearization: Locally self-stabilizing sorting in graphs. In: Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX) to appear, 2007)
5. Jelasity, M., Babaoglu, O.: T-Man: Gossip-based overlay topology management. In: Brueckner, S.A., Serugendo, G.D.M., Hales, D., Zambonelli, F. (eds.) ESOA 2005. LNCS (LNAI), vol. 3910, pp. 1-15. Springer, Heidelberg (2006)
6. Jelasity, M., Montresor, A., Babaoglu, O.: The bootstrapping service. In: Proceedings of the 26th International Conference on Distributed Computing Systems Workshops (ICDCS WORKSHOPS): International Workshop on Dynamic Distributed Systems (IWDDS) (2006)
7. Montresor, A., Jelasity, M., Babaoglu, O.: Chord on demand. In: P2P 2005. Proceedings of the Fifth IEEE International Conference on Peer-to-Peer Computing, pp. 87-94. IEEE Computer Society Press, Los Alamitos (2005)
8. Harchol-Balter, M., Leighton, T., Lewin, D.: Resource discovery in distributed networks. In: Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing, pp. 229-237. ACM Press, New York (1999)
9. Kutten, S., Peleg, D., Vishkin, U.: Deterministic resource discovery in distributed networks. In: Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures, pp. 77-83. ACM Press, New York (2001)
10. Law, C., Siu, K.Y.: An O(logn) 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/, pp. 5-8. (October 2000)
11. Kutten, S., Peleg, D.: Asynchronous resource discovery in peer to peer networks. In: SRDS 2002. 21st IEEE Symposium on Reliable Distributed Systems October 13-16, 2002, pp. 224-231 (2002)
12. Abraham, I., Dolev, D.: Asynchronous resource discovery. In: Proceedings of the twenty-second annual symposium on Principles of distributed computing, pp. 143-150. ACM Press, New York (2003)
13. Cidon, I., Gopal, I., Kutten, S.: New models and algorithms for future networks. IEEE Trans-actions on Information Theory 41(3), 769-780 (1995)
14. Goodrich, M.T., Kosaraju, S.R.: Sorting on a parallel pointer machine with applications to set expression evaluation. J. ACM 43(2), 331-361 (1996)
15. Awerbuch, B.: Complexity of network synchronization. J. ACM 32(4), 804-823 (1985)
16. Awerbuch, B., Sipser, M.: Dynamic networks are as fast as static networks (preliminary version). In: 29th Annual Symposium on Foundations of Computer Science, 24-26 October 1988, White Plains, New York, USA, pp. 206-220. (1988)
17. Karp, R.M.: Probabilistic recurrence relations. In: STOC 1991. Proceedings of the twenty-third annual ACM symposium on Theory of computing, pp. 190-197. ACM Press, New York (1991)