A measurement-based admission control algorithm for integrated services packet networks
SIGCOMM '95 Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Insensitivity in processor-sharing networks
Performance Evaluation
Insensitive Bandwidth Sharing in Data Networks
Queueing Systems: Theory and Applications
On Peer-to-Peer Media Streaming
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
QoS's downfall: at the bottom, or not at all!
RIPQoS '03 Proceedings of the ACM SIGCOMM workshop on Revisiting IP QoS: What have we learned, why do we care?
Proceedings of the joint international conference on Measurement and modeling of computer systems
Can self-organizing P2P file distribution provide QoS guarantees?
ACM SIGOPS Operating Systems Review
Call admission control in wireless networks: a comprehensive survey
IEEE Communications Surveys & Tutorials
A Measurement Study of a Large-Scale P2P IPTV System
IEEE Transactions on Multimedia
Call admission control schemes: a review
IEEE Communications Magazine
Characterizing Peer-to-Peer Streaming Flows
IEEE Journal on Selected Areas in Communications
Understanding the Power of Pull-Based Streaming Protocol: Can We Do Better?
IEEE Journal on Selected Areas in Communications
Linear programming models for multi-channel P2P streaming systems
INFOCOM'10 Proceedings of the 29th conference on Information communications
Multimedia Tools and Applications
Hi-index | 0.00 |
Most of the literature on peer-to-peer (P2P) live streaming focuses on how to provide best-effort streaming quality by efficiently using the system bandwidth; however, there is no guarantee about the provided streaming quality. This paper considers how to provide statistically guaranteed streaming quality to a P2P live streaming system. We study a class of admission control algorithms which statistically guarantee that a P2P live streaming system has sufficient overall bandwidth. Our results show that there is a tradeoff between the user blocking rate and user-behavior insensitivity (i.e., whether the system performance is insensitive to the fine statistics of user behaviors). We also find that the system performance is more sensitive to the distribution change of user inter-arrival times than to that of user lifetimes.