Skip to main content

Path-Aware Multicast for Efficient File Distribution in Peer-to-Peer Overlay Networks

  • Conference paper
  • 796 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 3961))

Abstract

This paper discusses how to transmit the same file or the same part of a large file from a source peer to a group of destination peers efficiently. Considering the quality of overlay links and the restriction of Internet firewalls, we propose a hybrid approach of amplification and multicast, called amplicast, to improve the efficiency of file distribution. By intelligent peer selection and the support of replicate peers, the proposed amplicast approach constructs a series of multicast sub-trees to alleviate the load of the source peer and allow a requesting peer to decide when and where to join a tree, based on its own benefits. With link status cache and top-set sampling heuristic, the proposed PeerTop can significantly reduce the cost of exhausted network probing. Experiments with real-world Internet traffic data demonstrate that our approach can distribute contents very efficiently.

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   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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Andersen, H.B., Kaashoek, F., Morris, R.: Resilient Overlay Networks. In: ACM Symposium on Operating Systems Principles (2001)

    Google Scholar 

  2. Cheng, C.-M., Huang, Y.-S., Kung, H.T., Wu, C.-H.: Low-Cost Relay Routing for Achieving High End-to-End Performance. In: IEEE Globecom (2004)

    Google Scholar 

  3. Chu, Y.-h., Rao, S.G., Seshan, S., Zhang, H.: A Case for End System Multicast. In: ACM SIGMETRICS (2000)

    Google Scholar 

  4. Kung, H.T., Wu, C.-H.: Differentiated Admission for Peer-to-Peer Systems: Incentivize Peers to Contribute Their Resources. In: Workshop on Economics of Peer-to-Peer Systems, Berkeley, CA, USA (June 2003)

    Google Scholar 

  5. Nguyen, T., Zakhor, A.: Path Diversity with Forward Error Correction (PDF) System for Packet Switched Networks. In: IEEE INFOCOM (2003)

    Google Scholar 

  6. Padmanabhan, V.N., Wang, H.J., Chou, P.A., Sripanidkulchai, K.: Distributing Streaming Media Content Using Cooperative Networking. In: ACM/IEEE NOSSDAV (2002)

    Google Scholar 

  7. Tran, D.A., Hua, K.A., Do, T.: ZIGZAG: An Efficient Peer-to-Peer Scheme for Media Streaming. In: IEEE INFOCOM (2003)

    Google Scholar 

  8. Xu, D., Hefeeda, M., Hambrusch, S., Bhargava, B.: On Peer-to-Peer Media Streaming. In: IEEE ICDCS (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wu, CH., Li, JW., Chen, YJ., Lin, JP. (2006). Path-Aware Multicast for Efficient File Distribution in Peer-to-Peer Overlay Networks. In: Chong, I., Kawahara, K. (eds) Information Networking. Advances in Data Communications and Wireless Networks. ICOIN 2006. Lecture Notes in Computer Science, vol 3961. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11919568_93

Download citation

  • DOI: https://doi.org/10.1007/11919568_93

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-48563-6

  • Online ISBN: 978-3-540-48564-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics