Dana Angluin, James Aspnes, Jiang Chen, Yitong Yin  Home/Search
Context Related
| yale.edu/homes/asp...oda2005overlay.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: yale.edu/homes/aspnes...directory (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A mechanism is described for rapidly constructing overlay networks in a peer-to-peer system where all nodes can in principle communicate with each other directly through an underlying network, but each participating node initially has a pointer to only a handful of other participants. (Update)
Similar documents based on text: More All
0.1: Computation in Networks of Passively Mobile Finite-State.. - Angluin, Aspnes.. (2004) (Correct)
0.1: Urn Automata - Angluin, Aspnes, Diamadi, Fischer.. (2003) (Correct)
0.1: Learning Markov chains with variable memory length from noisy .. - Angluin, Csürös (1997) (Correct)
BibTeX entry: (Update)
D. Angluin, J. Aspnes, J. Chen, Y. Wu, and Y. Yin. Fast construction of overlay networks. In SPAA, 2005. http://citeseer.ist.psu.edu/angluin04fast.html More
@misc{ angluin05fast,
author = "D. Angluin and J. Aspnes and J. Chen and Y. Wu and Y. Yin",
title = "Fast construction of overlay networks",
text = "D. Angluin, J. Aspnes, J. Chen, Y. Wu, and Y. Yin. Fast construction of
overlay networks. In SPAA, 2005.",
year = "2005",
url = "citeseer.ist.psu.edu/angluin04fast.html" }
Citations (may not include all citations):1225 Chord: A Scalable Peer-to-peer Lookup Service for Internet A.. - Stoica, Morris et al. - 2003
134 A distributed algorithm for minimum-weight spanning trees (context) - Gallager, Humblet et al. - 1983
46 Skip Graphs (context) - Aspnes, Shah - 2003
44 Communications of the ACM (context) - Fredkin - 1960
43 Resource discovery in distributed networks (context) - Harchol-Balter, Leighton et al. - 1999
41 New models and algorithms for future networks - Cidon, Gopal et al. - 1995
16 The complexity of parallel search (context) - Karp, Upfal et al. - 1988
11 Sorting on a parallel pointer machine with applications to s.. - Goodrich, Kosaraju - 1996
10 randomized resource discovery algorithm (context) - Law, Siu et al. - 2000
9 Fast mergeable integer maps - Okasaki, Gill - 1998
9 File searching using variable length keys (context) - Briandais - 1959
7 Deterministic resource discovery in distributed networks - Kutten, Peleg et al. - 2001
6 practical algorithm to retrieve information coded in alphanu.. (context) - Morrison - 1968
6 Asynchronous resource discovery in peer to peer networks - Kutten, Peleg - 2002
4 Asynchronous resource discovery - Abraham, Dolev - 2003
[Article contains additional citations not shown here]
Documents on the same site (http://cs-www.cs.yale.edu/homes/aspnes/directory.html): More
Fault-tolerant Routing in Peer-to-peer Systems - Aspnes, Diamadi, Shah (2003) (Correct)
A Theory of Competitive Analysis for Distributed Algorithms - Ajtai, Aspnes, Dwork, Waarts (2003) (Correct)
Load Balancing and Locality in Range-Queriable Data - Aspnes, Kirsch, Krishnamurthy (2004) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC