The Library
Performance analysis and improvement of overlay construction for peer-to-peer live media streaming
Tools
Tan, G., Jarvis, Stephen A., Chen, X., Spooner, Daniel P. and Nudd, G. R. (2005) Performance analysis and improvement of overlay construction for peer-to-peer live media streaming. In: 13th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, Atlanta, GA, 27-29 Sep 2005. Published in: Proceedings of the 13th IEEE Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS) pp. 169-176. ISBN 0769524583. doi:10.1109/MASCOTS.2005.49 ISSN 1526-7539.
PDF
performance_analysis_and_improvement_of_overlay_construction_for_peer-to-peer_live_media_streaming.pdf - Published Version Embargoed item. Restricted access to Repository staff only - Requires a PDF viewer. Download (246Kb) |
Official URL: http://dx.doi.org/10.1109/MASCOTS.2005.49
Abstract
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.
Item Type: | Conference Item (Paper) | ||||
---|---|---|---|---|---|
Subjects: | T Technology > TK Electrical engineering. Electronics Nuclear engineering | ||||
Divisions: | Faculty of Science, Engineering and Medicine > Science > Computer Science | ||||
Journal or Publication Title: | Proceedings of the 13th IEEE Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS) | ||||
Publisher: | IEEE | ||||
ISBN: | 0769524583 | ||||
ISSN: | 1526-7539 | ||||
Official Date: | 2005 | ||||
Dates: |
|
||||
Number of Pages: | 8 | ||||
Page Range: | pp. 169-176 | ||||
DOI: | 10.1109/MASCOTS.2005.49 | ||||
Status: | Peer Reviewed | ||||
Publication Status: | Published | ||||
Access rights to Published version: | Restricted or Subscription Access | ||||
Date of first compliant deposit: | 15 December 2015 | ||||
Conference Paper Type: | Paper | ||||
Title of Event: | 13th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems | ||||
Type of Event: | Workshop | ||||
Location of Event: | Atlanta, GA | ||||
Date(s) of Event: | 27-29 Sep 2005 | ||||
Related URLs: |
Data sourced from Thomson Reuters' Web of Knowledge
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |