Using global information for load balancing in DHTs

Proceedings - 2nd IEEE International Conference on Self-Adaptive and Self-Organizing Systems Workshops, SASOW 2008

Volumn , Issue , 2008, Pages 236-241

  Högqvist, Mikael ^a   Haridi, Seif ^b   Kruber, Nico ^a   Reinefeld, Alexander ^a   Schütt, Thorsten ^a  

^a ZUSE INSTITUTE BERLIN   (Germany)

^b ROYAL INSTITUTE OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

BALANCING ALGORITHMS; DISTRIBUTED HASH TABLES; GLOBAL INFORMATIONS; GOSSIP MECHANISMS; LOAD IMBALANCES; LOAD-BALANCING; LOW COSTS; NETWORK TRAFFICS; SIMULATION-BASED;

CYBERNETICS; HASH FUNCTIONS; INTERNET;

APPROXIMATION ALGORITHMS;

EID: 64849083355     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SASOW.2008.50     Document Type: Conference Paper

References (16)

1. D. P. Bertsekas. Network Optimization: Continuous and Discrete Models (Optimization, Computation, and Control). Athena Scientific, 1998.
2. C. Chen and K.-C. Tsai. The server reassignment problem for load balancing in structured p2p systems. IEEE Trans. Parallel Distrib. Syst., 19(2):234-246, 2008.
3. A. Datta, R. Schmidt, and K. Aberer. Query-load balancing in structured overlays. In Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGRID'07), 2007.
4. P. Ganesan, M. Bawa, and H. Garcia-Molina. Online balancing of range-partitioned data with applications to peer-to-peer systems. In VLDB, pages 444-455. Morgan Kaufmann, 2004.
5. A. Ghodsi, S. Haridi, and H. Weatherspoon. Exploiting the synergy between gossiping and structured overlays. Operating Systems Review, 41(5):61-66, 2007.
6. B. Godfrey, K. Lakshminarayanan, S. Surana, R. M. Karp, and I. Stoica. Load balancing in dynamic structured p2p systems. In INFOCOM, 2004.
7. B. Godfrey and I. Stoica. Heterogeneity and load balance in distributed hash tables. In INFOCOM, pages 596-606. IEEE, 2005.
8. D. R. Karger and M. Ruhl. Simple efficient load balancing algorithms for peer-to-peer systems. In IPTPS, volume 3279 of Lecture Notes in Computer Science, pages 131-140. Springer, 2004.
9. A. Rao, K. Lakshminarayanan, S. Surana, R. M. Karp, and I. Stoica. Load balancing in structured p2p systems. In IPTPS, volume 2735 of Lecture Notes in Computer Science, pages 68-79. Springer, 2003.
10. A. I. T. Rowstron and P. Druschel. Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In Middleware, volume 2218 of Lecture Notes in Computer Science, pages 329-350. Springer, 2001.
11. T. Schutt, F. Schintke, and A. Reinefeld. Structured overlay without consistent hashing: Empirical results. In CCGRID. IEEE Computer Society, 2006.
12. T. Schutt, F. Schintke, and A. Reinefeld. Scalaris: Reliable ransactional P2P key/value store. In ACM SIGPLAN Erlang Workshop, 2008.
13. I. Stoica, R. Morris, D. R. Karger, M. F. Kaashoek, and H. Balakrishnan. Chord: A scalable peer-to-peer lookup service for internet applications. In SIGCO , pages 149160, 2001.
14. S. Voulgaris, D. Gavidia, and M. van Steen. Cyclon: Inexpensive membership management for unstructured p2p overlays. J. Network Syst. Manage., 13(2), 2005.
15. S. Voulgaris, M. van Steen, and K. Iwanicki. Proactive gossip-based management of semantic overlay networks. Concurrency and Computation: Practice and Experience, 19(17):2299-2311, 2007.
16. Y. Zhu and Y. Hu. Efficient, proximity-aware load balancing for dht-based p2p systems. IEEE Trans. Parallel Distrib.Syst., 16(4):349-361, 2005.