A case for lightweight superpeer topologies

Lecture Notes in Informatics (LNI), Proceedings - Series of the Gesellschaft fur Informatik (GI)

Volumn P-61, Issue , 2005, Pages 185-188

  Kleis, Michael ^a   Lua, Eng Keong ^b   Zhou, Xiaoming ^c  

^a FRAUNHOFER FOKUS   (Germany)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

^c DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

BROADCAST ALGORITHM; GEOMETRIC SPACE; NETWORK-AWARE; PLACEMENT MODEL; PLANETLAB; SUPER-PEER TOPOLOGY; SUPERPEERS; UNSTRUCTURED PEER-TO-PEER;

GEOMETRY; TOPOLOGY;

PEER TO PEER NETWORKS;

EID: 84880479154     PISSN: 16175468     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. M. Castro, P. Druschel, A. Kermarrec, and A. Rowstron. Scalable application-level anycast for highly dynamic groups. InProc.NGC, 2003.
2. A. Czumaj, F. Ergun, L. Fortnow, A. Magen, I. Newman, R. Rubinfeld, and C. Sohler. Sublinear-time approximation of Euclidean minimum spanning tree. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'03), 2003.
3. Evangelos Kranakis, Harvinder Singh, and Jorge Urrutia. Compass Routing on Geometric Networks. In In Proceedings of the 11th Canadian Conference on Computational Geometry, pages 51-54, Vancouver, August 1999.
4. Michael Kleis and Xiaoming Zhou. A Placement Scheme for Peer-to-Peer Networks Based on Principles from Geometry. In Proceedings of the IEEE Fourth International Conference on Peer-to-Peer Computing (P2P'04), pages 134-141, 2004.
5. Eng Keong Lua, Jon Crowcroft, and Marcelo Pias. Highways: Proximity Clustering for Scalable Peer-to-Peer Network. In Proceedings of the IEEE Fourth International Conference on Peer-to-Peer Computing (P2P'04), pages 266-267, 2004.
6. J. Liebeherr, M. Nahas, and W. Si. Application-Layer Multicasting with Delaunay Triangulation Overlays. Technical Report CS-2001-26, 5 2001.
7. PlanetLab home page. http://www.planet-lab.org.
8. M. I. Shamos and D. Hoey. Closest-point problems. In 16th IEEE Symposium on Foundations of Computer Science, 1975.
9. Andrew Chi-Chih Yao. On constructing minimum spanning trees in k-dimensional space and related problems. SIAM Journal on Computing, 11:721-736, 1982.