(Enter summary)
Abstract: DHTs can locate objects in a peer-to-peer network
within an efficient amount of overlay hops. Since an
overlay hop is likely to consist of multiple physical hops,
the ratio between the number of physical hops induced by
the overlay routing process and the number of physical
hops on a direct physical path is often significantly
lopsided. Recently, some approaches have been suggested
to optimize that ratio by building topology-aware peer-topeer
overlays. However, none of them were explicitly... (Update)
Cited by: More
Simple, Efficient Peer-to-Peer Overlay Clustering in.. - Zahn, Winter, Schiller (2004)
(Correct)
Active bibliography (related documents): More All
0.1: SAT-Match: A Self-Adaptive Topology Matching Method to Achieve .. - Lookup Latency In
(Correct)
0.1: T-DHT: Topology-Based Distributed Hash Tables - Landsiedel, Lehmann, Wehrle (2005)
(Correct)
0.0: PIC: Practical Internet Coordinates for Distance Estimation - Costa, Castro, Rowstron, Key (2003)
(Correct)
Similar documents based on text: More All
0.3: Experiences Using a Dual Wireless Technology Infrastructure .. - Ritter, Voigt, al. (2003)
(Correct)
0.3: Co-Scheduling Of Traffic Shaping And DMA Transfer.. - Bryhni..
(Correct)
0.2: ScatterWeb - Low Power Sensor Nodes and Energy Aware.. - Schiller, Liers.. (2005)
(Correct)
BibTeX entry: (Update)
R. Winter, T. Zahn, and J. Schiller. "Random Landmarking in Mobile, Topology-Aware Peer-to-Peer Networks". 10th International Workshop on Future Trends in Distributed Computing Systems (FTDCS 2004. http://citeseer.ist.psu.edu/winter04random.html More
@misc{ winter04random,
author = "R. Winter and T. Zahn and J. Schiller",
title = "Random Landmarking in Mobile, Topology-Aware Peer-to-Peer Networks",
text = "R. Winter, T. Zahn, and J. Schiller. Random Landmarking in Mobile, Topology-Aware
Peer-to-Peer Networks. 10th International Workshop on Future Trends in Distributed
Computing Systems (FTDCS 2004.",
year = "2004",
url = "citeseer.ist.psu.edu/winter04random.html" }
Citations (may not include all citations):
1225
Chord: A scalable peer-to-peer lookup service for internet a..
- Stoica, Morris et al. - 2001 DBLP
1023
A Scalable Content-Addressable Network
- Ratnasamy, Francis et al. - 2001 ACM DBLP
723
Dynamic source routing in ad hoc wireless networks
- Johnson, Maltz - 1996
117
Topologically-Aware Overlay Construction and Server Selectio..
- Ratnasamy, Handley et al. - 2002 DBLP
115
Tapestry: An infrastructure for fault-resilient wide-area lo.. (context) - Zhao, Kubiatowicz et al. - 2001
85
decentralized object location and routing for large-scale pe.. (context) - Rowstron, Druschel et al. - 2001
79
Exploiting Network Proximity in Peer-to-Peer Overlay Network.. (context) - Castro, Druschel et al. - 2002
28
Efficient Topology-Aware Overlay Network
- Waldvogel, Rinaldi - 2002 ACM DBLP
16
Building Topology-Aware Overlays using Global Soft-State
- Xu, Tang et al. - 2003 ACM
http://www.darkridge.com/~jpr5/doc/gnutella.html
http://www.ietf.org
http://www.omnetpp.org
Documents on the same site (http://page.mi.fu-berlin.de/~winter/publications.htm):
Simple, Efficient Peer-to-Peer Overlay Clustering in.. - Zahn, Winter, Schiller (2004)
(Correct)
ScatterWeb - Low Power Sensor Nodes and Energy Aware.. - Schiller, Liers.. (2005)
(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