Control DHT maintenance costs with session heterogeneity
暂无分享,去创建一个
[1] Robert Morris,et al. Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.
[2] Antony I. T. Rowstron,et al. Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.
[3] David R. Karger,et al. Looking up data in P2P systems , 2003, CACM.
[4] Evangelos P. Markatos,et al. Tracing a Large-Scale Peer to Peer System: An Hour in the Life of Gnutella , 2002, 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGRID'02).
[5] Mark Handley,et al. A scalable content-addressable network , 2001, SIGCOMM 2001.
[6] Ma Fan-yuan,et al. Super-proximity routing in structured peer-to-peer overlay networks , 2004 .
[7] Jia Wang,et al. Analyzing peer-to-peer traffic across large networks , 2004, IEEE/ACM Trans. Netw..
[8] Stefan Saroiu,et al. A Measurement Study of Peer-to-Peer File Sharing Systems , 2001 .
[9] Margo I. Seltzer,et al. Self-organization in peer-to-peer systems , 2002, EW 10.
[10] Scott Shenker,et al. Routing Algorithms for DHTs: Some Open Questions , 2002, IPTPS.
[11] Miguel Castro,et al. Controlling the Cost of Reliability in Peer-to-Peer Overlays , 2003, IPTPS.
[12] David R. Karger,et al. Analysis of the evolution of peer-to-peer systems , 2002, PODC '02.
[13] Ben Y. Zhao,et al. Tapestry: a resilient global-scale overlay for service deployment , 2004, IEEE Journal on Selected Areas in Communications.