Repository logo
  • Research Outputs
  • Researchers
  • Schools
    Felizberta Lo Padilla Tong School of Social SciencesIp Ying To Lee Yu Yee School of Humanities and LanguagesRita Tong Liu School of Business and Hospitality ManagementS.K. Yee School of Health SciencesYam Pak Charitable Foundation School of Computing and Information Sciences
  • Help
Repository logo
  1. Home
  2. Social Sciences
  3. SS Publication
  4. Performance modeling and evaluation of peer-to-peer live streaming systems under flash crowds
 
  • Details

Performance modeling and evaluation of peer-to-peer live streaming systems under flash crowds

Author(s)
Chiu, Dah Ming  
Author(s)
Chen, Y.
Zhang, B.
Chen, C.
Date Issued
2014
Publisher
IEEE
Journal
IEEE/ACM Transactions on Networking
Volume
22
Issue
4
Start page
1106
End page
1120
Abstract
A peer-to-peer (P2P) live streaming system faces a big challenge under flash crowds. When a flash crowd occurs, the sudden arrival of numerous peers may starve the upload capacity of the system, hurt its quality of service, and even cause system collapse. This paper provides a comprehensive study on the performance of P2P live streaming systems under flash crowds. By modeling the systems using a fluid model, we study the system capacity, peer startup latency, and system recovery time of systems with and without admission control for flash crowds, respectively. Our study demonstrates that, without admission control, a P2P live streaming system has limited capacity to handle flash crowds. We quantify this capacity by the largest flash crowd (measured in shock level) that the system can handle, and further find this capacity is independent of system initial state while decreasing as departure rate of stable peer increases, in a power-law relationship. We also establish the mathematical relationship of flash crowd size to the worst-case peer startup latency and system recovery time. For a system with admission control, we prove that it can recover stability under flash crowds of any sizes. Moreover, its worst-case peer startup latency and system recovery time increase logarithmically with the flash crowd size. Based on the analytical results, we present detailed flash crowd handling strategies, which can be used to achieve satisfying peer startup performance while keeping system stability in the presence of flash crowds under different circumstances.
URI
https://repository.sfu.edu.hk/handle/sfu/1863
DOI
10.1109/TNET.2013.2272056
SFU Affiliated Publication
No
Availability at SFU Library

No database links found.

Responsible Use of E‑Resources | Privacy Policy | Disclaimer
© SFU Library. All Rights Reserved.
SFU Library