JSChord: A Peer-to-Peer System to Achieve Max Throughput
暂无分享,去创建一个
[1] Mark Handley,et al. A scalable content-addressable network , 2001, SIGCOMM '01.
[2] Pingzhi Fan,et al. Proceedings of the 5th international conference on Parallel and Distributed Computing: applications and Technologies , 2004 .
[3] David R. Karger,et al. Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM '01.
[4] Mor Harchol-Balter,et al. On Choosing a Task Assignment Policy for a Distributed Server System , 1998, J. Parallel Distributed Comput..
[5] M. Crovella,et al. Heavy-tailed probability distributions in the World Wide Web , 1998 .
[6] Azer Bestavros,et al. Self-similarity in World Wide Web traffic: evidence and possible causes , 1996, SIGMETRICS '96.
[7] Sally Floyd,et al. Wide area traffic: the failure of Poisson modeling , 1995, TNET.
[8] David R. Karger,et al. Chord: a scalable peer-to-peer lookup protocol for internet applications , 2003, TNET.
[9] Ben Y. Zhao,et al. An Infrastructure for Fault-tolerant Wide-area Location and Routing , 2001 .
[10] Peter Druschel,et al. Pastry: Scalable, distributed object location and routing for large-scale peer-to- , 2001 .
[11] Teunis J. Ott,et al. Load-balancing heuristics and process behavior , 1986, SIGMETRICS '86/PERFORMANCE '86.
[12] David L. Peterson,et al. Fractal Patterns In DASD I/O Traffic , 1996, Int. CMG Conference.
[13] Antony I. T. Rowstron,et al. Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems , 2001, Middleware.