On small world graphs in non-uniformly distributed key spaces

Proceedings - International Workshop on Biomedical Data Engineering, BMDE2005

Volumn 2005, Issue , 2005, Pages 1181-1187

  Girdzijauskas, Sarunas ^a   Datta, Anwitaman ^a   Aberer, Karl ^a  

^a EPFL   (Switzerland)

Author keywords

Distributed hash tables; Routing; Small world graphs; Storage load balancing

Indexed keywords

DATA STORAGE EQUIPMENT; GRAPH THEORY; GRID COMPUTING; MATHEMATICAL MODELS; TABLE LOOKUP;

KLEINBERG'S SMALL WORLD MODELS; STORAGE LOAD BALANCING; STRUCTURED P2P SYSTEMS;

DISTRIBUTED DATABASE SYSTEMS;

EID: 33947106990     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2005.254     Document Type: Conference Paper

References (19)

1. K. Aberer. P-Grid: A self-organizing access structure for P2P information systems. In Proceedings of the Sixth International. Conference on Cooperative Information Systems (CoopIS), 2001.
2. K. Aberer, A. Datta, and M. Hauswirth. Multifaceted Simultaneous Load Balancing in DHT-based P2P systems: A new game with old balls and bins. In Self-* Properties in Complex Information Systems, "Hot Topics" serices, Lecture Notes in Computer Science. Springer Verlag(to be published), 2005.
3. F. Banaei-Kashani and C. Shahabi. Swam: A family of access methods for similarity-search in peer-to-peer data networks. In Information and Knowledge Management (CIKM'04), Washington D.C., 2004.
4. A. Bharambe, M. Agrawal, and S. Seshan. Mercury: Supporting scalable multi-attribute range queries. In ACM SIGCOMM, Portland, USA, 2004.
5. M. Franceschetti and R. Meester. Navigation in small world networks, a scale-free continuum model. Under revision.
6. K. Gummadi, R. Gummadi. S. Ratnasamy, S. Shenker, and I. Stoica. The Impact of DHT Routing Geometry on Re silience and Proximity. In Proceedings of the ACM SIGCOMM, 2003.
7. J. Kleinberg. The Small-World Phenomenon: An Algorithmic Perspective. In Proceedings of the 32nd ACM Symposium on Theory of Computing, 2000.
8. G. S. Manku. Routing networks for distributed hash tables. In Proceedings of the twenty-second annual symposium on Principles of distributed computing (PODC), pages 133-142. ACM Press, 2003.
9. G. S. Manku, M. Bawa, and P. Raghavan. Symphony: Distributed hashing in a small world. In 4th USENIX Symposium on Internet Technologies and Systems, USITS, 2003.
10. G. S. Manku, M. Naor, and U. Wieder. Know thy neighbor's neighbor: the power of lookahead in randomized p2p networks. In 36th ACM Symposium on Theory of Computing, STOC 2004, p 54-63, 2004.
11. S. Milgram. The small world problem. In Psychology Today 1, 61, 1967.
12. Mayank Bawa Prasanna Ganesan and Hector Garcia-Molina. Online balancing of range-partitioned data with applications to peer-to-peer systems. In Proceedings VLDB, 2004.
13. S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Shenker. A Scalable Content-Addressable Network. In Proceedings of the ACM SIGCOMM, 2001.
14. A. Rowstron and P. Druschel. Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems. In IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), Heidelberg, Germany, 2001.
15. I. Stoica, R. Morris, D. Karger, F. Kaashoek, and H. Balakrishnan. Chord: A Scalable Peer-To-Peer Lookup Service for Internet Applications. In Proceedings of the ACM SIGCOMM, 2001.
16. X. Wang, Y. Zhang, X. Li, and D. Loguinov. On zone-balancing of peer-to-peer networks: Analysis of random node join. In ACM SIGMETRICS, 2004.
17. D. J. Watts and S. H. Strogatz. Collective dynamics of 'small-world' networks. In Nature, vol. 393, pp. 440-442, 1998.
18. H. Zhang, A. Goel, and R. Govindan. Using the small-world model to improve freenet performance. In Proc. of IEEE Infocom, 2002.
19. H. Zhang, A. Goel, and R. Govindan. Incrementally improving lookup latency in distributed hash table systems. In In ACM SIGMETRICS 2003, pages 114125, 2003.