Using the small-world model to improve freenet performance

Proceedings - IEEE INFOCOM

Volumn 3, Issue , 2002, Pages 1228-1237

  Zhang, Hui ^a   Goel, Ashish ^a   Govindan, Ramesh ^a  

^a University of Southern California ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CACHE MEMORY; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; GRAPH THEORY; INFORMATION RETRIEVAL; NETWORK PROTOCOLS; TABLE LOOKUP;

CACHE REPLACEMENT; FREENET; LEAST RECENTLY USED; PEER TO PEER NETWORKED SYSTEM; ROUTING TABLES; SMALL WORLD MODEL;

INTERNET;

EID: 0036343647     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. A scalable content- Addressable network
2. Chord: A peer-to-peer lookup service for internet applications
3. Oceanstore: An architecture for global-scale persistent storage
4. Freenet: A distributed anonymous information storage and retrieval system in designing privacy enhancing technologies
5. A case for end system multicast
6. Yallcast: Extending the internet multicast infrastructure
7. Extending greedy multicast routing to delay sensitive applications
8. Small-worlds: The dynamics of networks between order and randomness
9. Navigation in a small-world
10. The small-world phenomenon: An algorithmic perspective
11. Performance
12. Accessing nearby copies of replicated objects in a distributed environment
13. On power-law relationships of the internet topology
14. Collective dynamics of 'small-world' networks
15. A data tracking scheme for general networks