|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
| ASCII Text | x | ||
| Guang Tan, Stephen A. Jarvis, Xinuo Chen, Daniel P. Spooner, Graham R. Nudd, "Performance Analysis and Improvement of Overlay Construction for Peer-to-Peer Live Media Streaming," 2012 IEEE 20th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, pp. 169-178, 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, 2005. | |||
| BibTex | x | ||
| @article{ 10.1109/MASCOT.2005.50, author = {Guang Tan and Stephen A. Jarvis and Xinuo Chen and Daniel P. Spooner and Graham R. Nudd}, title = {Performance Analysis and Improvement of Overlay Construction for Peer-to-Peer Live Media Streaming}, journal ={2012 IEEE 20th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems}, volume = {0}, year = {2005}, issn = {1526-7539}, pages = {169-178}, doi = {http://doi.ieeecomputersociety.org/10.1109/MASCOT.2005.50}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - 2012 IEEE 20th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems TI - Performance Analysis and Improvement of Overlay Construction for Peer-to-Peer Live Media Streaming SN - 1526-7539 SP169 EP178 A1 - Guang Tan, A1 - Stephen A. Jarvis, A1 - Xinuo Chen, A1 - Daniel P. Spooner, A1 - Graham R. Nudd, PY - 2005 KW - null VL - 0 JA - 2012 IEEE 20th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems ER - | |||
For single-source, single-tree based peer-to-peer live media streaming, it is generally believed that a short (and wide) tree has a good comprehensive performance in terms of tree reliability and service delay. While the short tree directly benefits delay optimization, it is unclear whether such a structure maximizes tree reliability, which is sometimes more critical for a streaming Internet service.
This paper studies several prevalent overlay construction algorithms in terms of (1) service reliability; (2) service delay and (3) protocol overhead. Two types of peer layout, bandwidth-ordered layout and time-ordered layout, are identified and their performance is evaluated. The analytical results show that, by appropriately placing peers according to their time properties, the tree can be much more reliable than a depth-optimized tree.
We therefore propose a heap algorithm, which aims for combining the strengths of both bandwidth ordering and time ordering. It dynamically moves peers between difference layers of the tree according to a simple metric, and gradually adjusts the tree toward a layout partially ordered in time and partially ordered in bandwidth. In so doing the tree has advantages in both service reliability and delay, and maintains small protocol overheads. Extensive simulations demonstrate the effectiveness of this new algorithm.