Priority Scheme for Window-Based Video-on-Demand Transmission on BitTorrent-Like Peer-to-Peer Networks

被引:0
|
作者
Baez Esquivel, Edgar [1 ]
Rivero-Angeles, Mario E. [2 ]
Rubino, Gerardo [3 ]
机构
[1] SEPI ESCOM IPN, Mexico City, DF, Mexico
[2] CINVESTAV IPN, Dept Elect Engn, Mexico City, DF, Mexico
[3] INRIA Rennes Bretagne Atlant, Rennes, France
关键词
Streaming Stored Playback Video-on-Demand; Peer-to-peer Network; BitTorrent; Markov Chain; IPTV;
D O I
暂无
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
Peer-to-Peer (P2P) networks are distributed systems where no central authority rules the behavior of the individual peers. These systems rely on the voluntary participation of the peers to help each other and reduce congestion at the data servers. BitTorrent is a popular file-sharing P2P application originally designed for non real-time data. With minor modifications concerning the peer selection among others, it can also be used for real-time applications. One major issue that impacts the performance of these networks is related to the fact that it is not uncommon to find users that have initiated a file transfer and decide to leave the system before the end of the download or when seeds leave the system shortly after downloading the complete file. In this work, a priority-based scheme for streaming stored playback video-on-demand services in window-based peers selection strategy in P2P networks is proposed. The priority scheme benefits the peers that are more likely to remain longer in the system by serving them first over peers that are statistically more likely to abort the download. The window-based peer selection strategy allows an efficient mechanism to select the downloader peers according to their progress in the file download process relative to the progress of the downloading peers. The aforementioned strategy is analyzed using both a fluid model and a Continuous Time Markov Chain. Also, abundance conditions in the system are identified.
引用
收藏
页码:3000 / 3005
页数:6
相关论文
共 50 条
  • [22] Stable and Efficient Piece-Selection in Multiple Swarm BitTorrent-like Peer-to-Peer Networks
    Khan, Nouman
    Moharrami, Mehrdad
    Subramanian, Vijay
    [J]. IEEE INFOCOM 2020 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS, 2020, : 1153 - 1162
  • [23] Adaptive Prefetching Scheme for Peer-to-Peer Video-on-Demand Systems with a Media Server
    Uedera, Ryusuke
    Fujita, Satoshi
    [J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2011, E94D (12) : 2362 - 2369
  • [24] Robust video-on-demand streaming in peer-to-peer environments
    Do, Tai T.
    Hua, Kien A.
    Tantaoui, Mounir A.
    [J]. COMPUTER COMMUNICATIONS, 2008, 31 (03) : 506 - 519
  • [25] Peer-to-Peer Batching Policy for Video-on-Demand System
    Ho, K. M.
    Poon, W. F.
    Lo, K. T.
    [J]. 2006 FIRST INTERNATIONAL CONFERENCE ON COMMUNICATIONS AND NETWORKING IN CHINA, 2006,
  • [26] Peer-to-Peer Video-on-Demand Service in Nu Web
    Huang, Hui-Ching
    Teng, Hung-Yi
    Hwang, Ren-Hung
    [J]. 2009 10TH INTERNATIONAL SYMPOSIUM ON PERVASIVE SYSTEMS, ALGORITHMS, AND NETWORKS (ISPAN 2009), 2009, : 527 - 532
  • [27] Evaluation and optimization of a peer-to-peer video-on-demand system
    Cheng, Bin
    Liu, Xiuzheng
    Zhang, Zheng
    Jin, Hai
    Stein, Lex
    Liao, Xiaofei
    [J]. JOURNAL OF SYSTEMS ARCHITECTURE, 2008, 54 (07) : 651 - 663
  • [28] A Peer-to-Peer Video-on-Demand System based on Asynchronous Data Transfer
    Peng Zhao
    Ymg Zongkai
    Cheng Wenqing
    Lv Guanzhong
    [J]. 2008 THIRD INTERNATIONAL CONFERENCE ON COMMUNICATIONS AND NETWORKING IN CHINA, VOLS 1-3, 2008, : 531 - +
  • [29] Improving Mobile Peer-to-Peer Streaming Service with BitTorrent-like Redundant Tracker
    Liu, Pin-Chuan
    Chiang, Tsun-Chieh
    Chien, Yi-Fan
    Shih, Wei-Kuan
    Hu, Chih-Lin
    [J]. MDM: 2009 10TH INTERNATIONAL CONFERENCE ON MOBILE DATA MANAGEMENT, 2009, : 643 - +
  • [30] Uplink Allocation based on User Actions for Peer-To-Peer Video-on-Demand
    Koravos, Filippos
    Tassiulas, Leandros
    [J]. 2014 INTERNATIONAL CONFERENCE ON COMPUTING, NETWORKING AND COMMUNICATIONS (ICNC), 2014, : 348 - 352