Proximity Neighbor Selection in Tree-Based Structured Peer-to-Peer Overlays
暂无分享,去创建一个
Peter Druschel | Y. Charlie Hu | Miguel Castro | Antony Rowstron | A. Rowstron | P. Druschel | M. Castro | Y. C. Hu
[1] Ellen W. Zegura,et al. How to model an internetwork , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.
[2] Rajmohan Rajaraman,et al. Accessing Nearby Copies of Replicated Objects in a Distributed Environment , 1999, Theory of Computing Systems.
[3] Ben Y. Zhao,et al. Bayeux: an architecture for scalable and fault-tolerant wide-area data dissemination , 2001, NOSSDAV '01.
[4] Ben Y. Zhao,et al. An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .
[5] Deborah Estrin,et al. The impact of routing policy on Internet paths , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).
[6] Mark Handley,et al. A scalable content-addressable network , 2001, SIGCOMM '01.
[7] Miguel Castro,et al. SCRIBE: The Design of a Large-Scale Event Notification Infrastructure , 2001, Networked Group Communication.
[8] David R. Karger,et al. Wide-area cooperative storage with CFS , 2001, SOSP.
[9] Antony I. T. Rowstron,et al. Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.
[10] David R. Karger,et al. Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.
[11] Moni Naor,et al. Viceroy: a scalable and dynamic emulation of the butterfly , 2002, PODC '02.
[12] Mark Handley,et al. Topologically-aware overlay construction and server selection , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.
[13] David R. Karger,et al. Finding nearest neighbors in growth-restricted metrics , 2002, STOC '02.
[14] Ben Y. Zhao,et al. Distributed Data Location in a Dynamic Network , 2002 .
[15] Peter Druschel,et al. Exploiting network proximity in peer-to-peer overlay networks , 2002 .
[16] Peter Druschel,et al. Exploiting Network Proximity in Distributed Hash Tables , 2002 .
[17] David Mazières,et al. Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.
[18] Krishna P. Gummadi,et al. The impact of DHT routing geometry on resilience and proximity , 2003, SIGCOMM '03.
[19] Helen J. Wang,et al. An evaluation of scalable application-level multicast built using peer-to-peer overlays , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).
[20] Miguel Castro,et al. Controlling the Cost of Reliability in Peer-to-Peer Overlays , 2003, IPTPS.
[21] Miguel Castro,et al. Scalable Application-Level Anycast for Highly Dynamic Groups , 2003, Networked Group Communication.