The Library
Performance analysis and improvement of overlay construction for peer-to-peer live streaming
Tools
UNSPECIFIED (2006) Performance analysis and improvement of overlay construction for peer-to-peer live streaming. In: 13th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems, Atlanta, GA, SEP 27-29, 2005. Published in: SIMULATION-TRANSACTIONS OF THE SOCIETY FOR MODELING AND SIMULATION INTERNATIONAL, 82 (2). pp. 93-106. doi:10.1177/0037549706065877 ISSN 0037-5497.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Official URL: http://dx.doi.org/10.1177/0037549706065877
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 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 fora streaming Internet service. This article studies several prevalent overlay construction algorithms from the aspects 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 achieves a much higher degree of reliability than the depth-optimized tree. This finding motivates the design of 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. Extensive simulations show that this new algorithm achieves better comprehensive performance than existing algorithms.
Item Type: | Conference Item (UNSPECIFIED) | ||||
---|---|---|---|---|---|
Subjects: | Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software | ||||
Journal or Publication Title: | SIMULATION-TRANSACTIONS OF THE SOCIETY FOR MODELING AND SIMULATION INTERNATIONAL | ||||
Publisher: | SAGE PUBLICATIONS LTD | ||||
ISSN: | 0037-5497 | ||||
Official Date: | February 2006 | ||||
Dates: |
|
||||
Volume: | 82 | ||||
Number: | 2 | ||||
Number of Pages: | 14 | ||||
Page Range: | pp. 93-106 | ||||
DOI: | 10.1177/0037549706065877 | ||||
Publication Status: | Published | ||||
Title of Event: | 13th IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems | ||||
Location of Event: | Atlanta, GA | ||||
Date(s) of Event: | SEP 27-29, 2005 |
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 |