http://iet.metastore.ingenta.com
1887

Optimal data scheduling for P2P video-on-demand streaming systems

Optimal data scheduling for P2P video-on-demand streaming systems

For access to this article, please select a purchase option:

Buy article PDF
$19.95
(plus tax if applicable)
Buy Knowledge Pack
10 articles for $120.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
IET Communications — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Peer-to-peer (P2P) overlay-based streaming services have became more and more attractive. However, it is still challenging to provide scalable streaming services over large-scale Internet environment beacause of the stringent quality of service requirements as well as the dynamic nature of P2P overlay network. In this study, the authors focus on the optimisation of streaming data scheduling in P2P video-on-demand (VoD) system, with the objective of minimising the server stress and maximising the playback continuity. The authors first model the data scheduling problem to the maximum network flow problem where the schedule scheme is transformed to find an optimal supplier-consumer relationship assigment among peers with minimal server strees, and then present two max-flow-based streaming data scheduling algorithms by combining the upload capacity of peers as well as the path capacity between peers. The authors prove that the computing complexing of the proposed scheduling algorithms is polynomial. The practicability of the proposal is evaluated via simulations. Simulation results indicate that the proposed scheduling scheme could distribute bandwidth load among peers well while keeping the node degree low. Simulation results also show that the novel proposal has better performance than previous work in term of the server stress and the playback continuity.

References

    1. 1)
      • Youtube, http://www.youtube.com, accessed August 2010.
    2. 2)
      • Castro, M., Druschel, P., Kermarrec, A., Nandi, A., Rowstron, A., Singh, A.: `SplitStream: high-bandwidth multicast in cooperative environments', Proc. ACM SOSP, 2003.
    3. 3)
      • Magharei, N., Rejaie, R.: `Prime: peer-to-peer receiverdriven mesh-based streaming', Proc. IEEE INFOCOM, 2007.
    4. 4)
      • D. Wang , J. Liu . A dynamic skip list-based overlay for on-demand media streaming with vcr interactions. TPDS , 503 - 514
    5. 5)
      • Liao, X., Jin, H., Liu, Y., Ni, L.M., Deng, D.: `AnySee: peer-to-peer live streaming', Proc. IEEE INFOCOM’06, April 2006.
    6. 6)
      • Zhang, X., Liu, J., Li, B., Yum, T.-S.P.: `DONet/coolstreaming: a data-driven overlay network for live media streaming', Proc. IEEE INFOCOM, 2005.
    7. 7)
      • PPlive, http://www.pplive.com, accessed August 2010.
    8. 8)
      • Huang, C., Li, J., Ross, K.: `Can internet video-on-demand be profitable?', Proc. ACM SIGCOMM, 2007, p. 313–324.
    9. 9)
      • Wu, C., Li, B., Zhao, S.: `Multi-channel live P2P streaming: Refocusing on servers', Proc. IEEE INFOCOM, 2008.
    10. 10)
      • Liu, S., Chen, M., Sengupta, S., Chiang, M., Li, J., Chou, P.: `P2P streaming capacity under node degree bound', Proc. IEEE ICDCS'10, June 2010, Genoa, Italy.
    11. 11)
      • Guo, Y., Liang, C., Liu, Y.: `AQCS: adaptive queue-based chunk scheduling for P2P live streaming', Proc. IFIP Networking, 2008.
    12. 12)
    13. 13)
      • Do, T.T., Hua, K.A., Tantaoui, M.A.: `P2VoD: providing fault tolerant video-on-demand streaming in peer-to-peer environment', Proc. IEEE ICC 2004, June 2004, Paris, France.
    14. 14)
      • Guo, Y., Suh, K., Kurose, J., Towsley, D.: `P2Cast: peer-topeer patching scheme for vod service', Proc. WWW'03, May 2003, Budapest, Hungary.
    15. 15)
      • Chu, Y.-H., Rao, S.G., Zhang, H.: `A case for end system multicast', Proc. ACM SIGMETRICS, 2000.
    16. 16)
      • C. Liang , Y. Guo , Y. Liu . Investigating the scheduling sensitivity of P2P video streaming: an experimental study. IEEE Trans. Multimed. – Special section on Communities and Media Computing Archive , 3 , 348 - 360
    17. 17)
      • Aggarwal, V., Caldebank, R., Gopalakrishnan, V., Janaand, R., Ramakrishnan, K.K., Yu, F.: `The effectiveness of intelligent scheduling for multicast video-on-demand', Proc. 17th ACM Int. Conf. on Multimedia, 2009.
    18. 18)
      • Cheng, X., Wang, F., Liu, J., Xu, K.: `Collaborative delay-aware scheduling in peer-to-peer UGC video sharing', Proc. NOSSDAV, 2010.
    19. 19)
      • Flow Network, http://en.wikipedia.org/wiki, accessed August 2010.
    20. 20)
      • Yu, Q., Xu, D.: `Optimal data scheduling for P2P VoD streaming systems', Proc. ICPADS Workshop, 2010.
    21. 21)
      • Li, Z., Cao, J., Chen, G.: `ContinuStreaming: achieving high playback continuity of gossip-based peer-to-peer streaming', Proc. IPDPS, 2008.
http://iet.metastore.ingenta.com/content/journals/10.1049/iet-com.2011.0190
Loading

Related content

content/journals/10.1049/iet-com.2011.0190
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address