Skip to main content

Towards Balanced Allocations for DHTs

  • Conference paper
  • 1224 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 6861))

Abstract

We consider the problem of load-balancing structured peer-to-peer networks. Load-balancing is of major significance for large-scale decentralized networks in terms of enhanced scalability and performance. Our methods focus mainly on task-skew. Specifically, we address the problem with general rigorous algorithms on the basis of migration. In particular, the cornerstones of our methods are the notions of virtual nodes, replication and multiple realities. Finally, our work is complemented with extensive experiments.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Avidor, A., Azar, Y., Sgall, J.: Ancient and new algorithms for load balancing in the p norm. Algorithmica 29(3), 422–441 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  2. Bharambe, A.R., Agrawal, M., Seshan, S.: Mercury: supporting scalable multi-attribute range queries. In: SIGCOMM, pp. 353–366 (2004)

    Google Scholar 

  3. Blanas, S., Samoladas, V.: Contention-based performance evaluation of multidimensional range search in p2p networks. In: InfoScale 2007, pp. 1–8 (2007)

    Google Scholar 

  4. Ganesan, P., Bawa, M., Garcia-molina, H.: Online balancing of range-partitioned data with applications to peer-to-peer systems. In: VLDB, pp. 444–455 (2004)

    Google Scholar 

  5. Jain, R., Chiu, D., Hawe, W.: A quantitative measure of fairness and discrimination for resource allocation in shared computer systems. DEC TR-301 (1984)

    Google Scholar 

  6. Karger, D.R.: Simple efficient load balancing algorithms for peer-to-peer systems. In: ACM SPAA, pp. 36–43 (2004)

    Google Scholar 

  7. Rao, A., Lakshminarayanan, K., Surana, S., Karp, R.M., Stoica, I.: Load balancing in structured p2p systems. In: IPTPS, pp. 68–79 (2003)

    Google Scholar 

  8. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Schenker, S.: A scalable contentaddressable network. In: SIGCOMM 2001, pp. 161–172 (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tsatsanifos, G., Samoladas, V. (2011). Towards Balanced Allocations for DHTs. In: Hameurlain, A., Liddle, S.W., Schewe, KD., Zhou, X. (eds) Database and Expert Systems Applications. DEXA 2011. Lecture Notes in Computer Science, vol 6861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23091-2_42

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-23091-2_42

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-23090-5

  • Online ISBN: 978-3-642-23091-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics