Skip to main content

A Pull-Based Approach for a VoD Service in P2P Networks

  • Conference paper
High Speed Networks and Multimedia Communications (HSNMC 2004)

Abstract

We study a new approach to provide an efficient VoD service to a large client population in P2P networks. Previous work has suggested to construct a multicast tree to distribute the video to clients. However, a multicast tree usually requires the central server to perform complex algorithms to add new clients to the tree. In this paper, we show how to simplify the algorithm performed by the server and, at the same time, achieve an efficient use of the system resources. For this purpose, we present a new pull-based approach, called PBA. The basic idea of PBA is quite simple. When a new client wishes to receive a video, the new client contacts first the server. If there is enough left over bandwidth along the path to the new client, the server transmits the video to the new client. Otherwise, the server provides to the new client a list of candidate servants chosen at random. These servants are clients that have received or are currently receiving the video. The new client then searches for an available servant to download the video from.

We compare PBA to P 2 cast, a multicast-tree based approach proposed previously. We investigate via intensive simulations the efficiency of both approaches in terms of percentage of rejected clients and of bandwidth consumption. PBA does not only simplify the algorithm performed at the server, but also consumes less bandwidth and allows more clients to access the service.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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. Almeroth, K.C., Ammar, M.H.: On the use of multicast delivery to provide a scalable and interactive video-on-demand service. In: IEEE JSAC, vol. 14 (1996)

    Google Scholar 

  2. Viswanathan, S., Imielinski, T.: Pyramid broadcasting for video on demand service. In: Proc. of Multimedia Conference, San Jose, CA (1995)

    Google Scholar 

  3. Birk, Y., Mondri, R.: Tailored transmissions for efficient near-video-on-demand service. In: Proc. of ICMCS (1999)

    Google Scholar 

  4. You, P.F., Pâris, J.F.: A better dynamic broadcasting protocol for video on demand. In: Proc. of IPCCC, Phoenix, AZ (2001)

    Google Scholar 

  5. Gao, L., Towsley, D.: Supplying instantaneous video-on-demand services using controlled multicast. In: Proc. of IEEE Multimedia Computing Systems (1999)

    Google Scholar 

  6. Eager, D., Vernon, M., Zahorjan, J.: Optimal and efficient merging schedules for video-ondemand servers. In: Proc. of ACM Multimedia (1999)

    Google Scholar 

  7. Guo, Y., Sen, S., Towsley, D.: Prefix caching assisted periodic broadcast: Framework and techniques for streaming popular video. In: Proc. of IEEE ICC (2002)

    Google Scholar 

  8. Biersack, E.W., Hamra, A.A., Urvoy-Keller, G., Choi, D.: Cost-optimal dimensionig of a large scale video on demand server. In: Smirnov, M. (ed.) Quality of Future Internet Services. LNCS, vol. 2856, Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  9. Guo, Y., Suh, K., Kurose, J., Towsley, D.: P2cast: Peer-to-peer patching scheme for vod service. In: Proc. of the 12th World Wide Web Conference (WWW), Budapest, Hungary (2003)

    Google Scholar 

  10. Hu, A.: Video-on-Demand broadcasting protocols: A comprehensive study. In: Proc. of Infocom. Volume 1., Anchorage, Alaska, USA (2001)

    Google Scholar 

  11. Deshpande, H., Bawa, M., Garcia-Molina, H.: Streaming live media over a peer-to-peer network. CSD, Stanford University (2001)

    Google Scholar 

  12. Xu, D., Hefeeda, M., Hambrusch, S., Bhargava, B.: On peer-to-peer media streaming. In: Proc. of 22nd International Conference on Distributed Computing Systems, Washington - Brussels - Tokyo (2002)

    Google Scholar 

  13. Padmanabhan, V.N., Wang, H.J., Chou, P.A., Sripanidkulchai, K.: Distributing streaming media content using cooperative networking. In: Proc. of ACM/IEEE NOSSDAV (2002)

    Google Scholar 

  14. Tran, D.A., Hua, K.A., Do, T.T.: A peer-to-peer architecture for media streaming. To appear in IEEE JSAC Special Issue on Advances in Overlay Networks (2003)

    Google Scholar 

  15. Zegura, E.W., Calvert, K.: S.Bhattacharjee: How to model an internetwork. In: Proc. of Infocom (1996)

    Google Scholar 

  16. ylvia Ratnasamy: A Scalable Content-Addressable Network. PhD thesis, University of California (2002)

    Google Scholar 

  17. Krisnamurthy, B., Wang, J.: On network-aware clustering of web sites. In: Proc. of SIGCOMM (2000)

    Google Scholar 

  18. Cohen, B.: Incentives to build robustness in bittorrent. Technical report (2003), http://bitconjurer.org/BitTorrent/bittorrentecon.pdf

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hamra, A.A., Biersack, E.W., Urvoy-Keller, G. (2004). A Pull-Based Approach for a VoD Service in P2P Networks. In: Mammeri, Z., Lorenz, P. (eds) High Speed Networks and Multimedia Communications. HSNMC 2004. Lecture Notes in Computer Science, vol 3079. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-25969-5_93

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-25969-5_93

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-22262-0

  • Online ISBN: 978-3-540-25969-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics