Skip to main content
SpringerLink
Log in

Parallel Load Balancing Strategies for Tree-Structured Peer-to-Peer Networks

  • Conference paper
Advances in Data and Web Management (APWeb 2009, WAIM 2009)

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

  • 1173 Accesses

Abstract

A logical balanced tree structure can be overlaid on a peer-to-peer (P2P) network to support both exact match and range queries. Load balancing mechanisms are needed for handling skew problems in a tree-structured network. Traditional load balancing operations, such as sequentially probing for helper nodes and readjusting the tree structure after moving a node, may incur high costs. This research develops two new parallel load balancing strategies: vicinity load balancing and virtual group load balancing. The former adopts parallel transmission techniques to distribute the load of an overloaded node over a set of neighboring nodes, and the latter redirects the load of an overloaded node to a lightly loaded region. Simulation results indicate that these strategies are efficient not only in time and message, but also in the work load of participant nodes.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aspnes, J., Shah, G.: Skip Graphs. In: Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (2003)

    Google Scholar 

  2. Chou, J.C.-Y., Huang, T.-Y., Huang, K.-L., Chen, T.-Y.: SCALLOP: A Scalable and Load-Balanced Peer-to-Peer Lookup Protocol. IEEE Transactions on Parallel and Distributed Systems 17(5), 19–26 (2006)

    Article  Google Scholar 

  3. Crainiceanu, A., Linga, P., Gehrke, J., Shanmugasundaram, J.: Querying Peer-to-Peer Networks Using P-Trees. In: Proceedings of the 7th International Workshop on the Web and Databases (2004)

    Google Scholar 

  4. Crainiceanu, A., Linga, P., Machanavajjhala, A., Gehrke, J., Shanmugasundaram, J.: P-Ring: An Efficient and Robust P2P Range Index Structure. In: Proceedings of the ACM SIGMOD International Conference on Management of Data (2007)

    Google Scholar 

  5. Clarke, I., Sandberg, O., Wiley, B., Hong, T.W.: Freenet: A distributed anonymous information storage and retrieval system. In: Federrath, H. (ed.) Designing Privacy Enhancing Technologies. LNCS, vol. 2009, p. 46. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  6. Ganesan, P., Bawa, M., Garcia-Molina, H.: Online Balancing of Range-Partitioned Data with Applications to Peer-to-Peer Systems. In: Proceedings of the 30th International Conference on Very Large Data Bases (2004)

    Google Scholar 

  7. Gnutella, The Gnutella Protocol Specification v0.4

    Google Scholar 

  8. Jagadish, H.V., Ooi, B.C., Vu, Q.H.: BATON: A Balanced Tree Structure for Peer-to-Peer Networks. In: Proceedings of the 31st International Conference on Very Large Data Bases (2005)

    Google Scholar 

  9. Jagadish, H.V., Ooi, B.C., Tan, K.-L., Vu, Q.H., Zhang, R.: Speeding up Search in Peer-to-Peer Networks with a Multi-way Tree Structure. In: Proceedings of the ACM SIGMOD International Conference on Management of Data (2006)

    Google Scholar 

  10. Jagadish, H.V., Ooi, B.C., Vu, Q.H., Zhang, R., Zhou, A.: VBI-Tree: A Peer-to-Peer Framework for Supporting Multi-Dimensional Indexing Schemes. In: Proceedings of the 22nd International Conference on Data Engineering (2006)

    Google Scholar 

  11. Lua, E.K., Crowcroft, J., Pias, M., Sharma, R., Lim, S.: A Survey and Comparison of Peer-to-Peer Overlay Network Schemes. IEEE Communications Surveys & Tutorials 7(2), 72–93 (2005)

    Article  Google Scholar 

  12. Maymounkov, P., Mazières, D.: Kademlia: A Peer-to-Peer Information System Based on the XOR Metric. In: Proceedings of the 1st International Workshop on Peer-to-Peer Systems (2002)

    Google Scholar 

  13. Ratnasamy, S., Francis, P., Handley, M., Karp, R., Shenker, S.: A Scalable Content-Addressable Network. In: Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (2001)

    Google Scholar 

  14. Rowstron, A., Druschel, P.: Pastry: Scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) Middleware 2001. LNCS, vol. 2218, pp. 329–350. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  15. Stoica, I., Morris, R., Karger, D., Kaashoek, M.F., Balakrishnan, H.: Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications. In: Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (2001)

    Google Scholar 

  16. Zhao, B.Y., Huang, L., Stribling, J., Rhea, S.C., Joseph, A.D., Kubiatowicz, J.D.: Tapestry: A Resilient Global-Scale Overlay for Service Deployment. IEEE Journal on Selected Areas in Communications 22(1), 41–53 (2004)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Information Engineering, National Chiayi University, Chiayi, Taiwan, ROC

    Yaw-Huei Chen & Yu-Ren Ju

Authors
  1. Yaw-Huei Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yu-Ren Ju
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon, Hong Kong, China

    Qing Li

  2. Department of Computer Science & Technology, Tsinghua University, Beijing, China

    Ling Feng

  3. School of Computing Science, Simon Fraser University, 8888 University Drive, V5A 1S6, Burnaby BC, Canada

    Jian Pei

  4. Department of Computer Science, University of Vermont, VT 05405, Burlington, USA

    Sean X. Wang

  5. School of Information Technology and Electrical Engineering, The University of Queensland, QLD 4072, Brisbane, Australia

    Xiaofang Zhou

  6. Jiangsu Provincial Key Lab of Computer Information Processing Technology School of Computer Science & Technology, Soochow University China, 1 shizi Street Suzhou, 215006, Jiangsu, China

    Qiao-Ming Zhu

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Chen, YH., Ju, YR. (2009). Parallel Load Balancing Strategies for Tree-Structured Peer-to-Peer Networks. In: Li, Q., Feng, L., Pei, J., Wang, S.X., Zhou, X., Zhu, QM. (eds) Advances in Data and Web Management. APWeb WAIM 2009 2009. Lecture Notes in Computer Science, vol 5446. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00672-2_41

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-00672-2_41

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation