Dynamic Lookup Networks
暂无分享,去创建一个
Miguel Castro | Antony I. T. Rowstron | Peter Druschel | Y. Charlie Hu | A. Rowstron | P. Druschel | M. Castro | Y. C. Hu | Dalia Malki
[1] Scott Shenker,et al. Routing Algorithms for DHTs: Some Open Questions , 2002, IPTPS.
[2] 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).
[3] Miguel Castro,et al. SCRIBE: The Design of a Large-Scale Event Notification Infrastructure , 2001, Networked Group Communication.
[4] David Mazières,et al. Kademlia: A Peer-to-Peer Information System Based on the XOR Metric , 2002, IPTPS.
[5] R. K. Shyamasundar,et al. Introduction to algorithms , 1996 .
[6] Antony I. T. Rowstron,et al. Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.
[7] Ramesh Govindan,et al. Heuristics for Internet map discovery , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).
[8] Antony I. T. Rowstron,et al. Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility , 2001, SOSP.
[9] David R. Karger,et al. Wide-area cooperative storage with CFS , 2001, SOSP.
[10] Ellen W. Zegura,et al. How to model an internetwork , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.
[11] 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.
[12] Mark Handley,et al. A scalable content-addressable network , 2001, SIGCOMM '01.