Using the small-world model to improve Freenet performance
暂无分享,去创建一个
[1] Jie Wu,et al. Small Worlds: The Dynamics of Networks between Order and Randomness , 2003 .
[2] Rajeev Motwani,et al. Randomized algorithms , 1996, CSUR.
[3] Duncan J. Watts,et al. Collective dynamics of ‘small-world’ networks , 1998, Nature.
[4] D. Watts,et al. Small Worlds: The Dynamics of Networks between Order and Randomness , 2001 .
[5] Robert Morris,et al. Chord: A scalable peer-to-peer lookup service for internet applications , 2001, SIGCOMM 2001.
[6] Béla Bollobás,et al. Random Graphs , 1985 .
[7] Jon M. Kleinberg,et al. The small-world phenomenon: an algorithmic perspective , 2000, STOC '00.
[8] James F. Doyle,et al. Peer-to-Peer: harnessing the power of disruptive technologies , 2001, UBIQ.
[9] Rajmohan Rajaraman,et al. Accessing Nearby Copies of Replicated Objects in a Distributed Environment , 1999, Theory of Computing Systems.
[10] Srinivasan Seshan,et al. A case for end system multicast , 2002, IEEE J. Sel. Areas Commun..
[11] Mark Handley,et al. A scalable content-addressable network , 2001, SIGCOMM '01.
[12] Hui Zhang,et al. A case for end system multicast (keynote address) , 2000, SIGMETRICS '00.
[13] Mark Handley,et al. A scalable content-addressable network , 2001, SIGCOMM 2001.
[14] Rajmohan Rajaraman,et al. A data tracking scheme for general networks , 2001, SPAA '01.
[15] Ben Y. Zhao,et al. OceanStore: an architecture for global-scale persistent storage , 2000, SIGP.
[16] Michalis Faloutsos,et al. On power-law relationships of the Internet topology , 1999, SIGCOMM '99.
[17] Jon M. Kleinberg,et al. Navigation in a small world , 2000, Nature.
[18] Kamesh Munagala,et al. Extending Greedy Multicast Routing to Delay Sensitive Applications , 2002, Algorithmica.