For single-source, single-tree-based peer-to-peer live media streaming, it is generally believed that a short (and wide) data delivery tree provides the best comprehensive performance in terms of reliability and service delay. While a short tree directly benefits delay optimization, it is unclear whether such a structure maximizes reliability, which is sometimes more critical for a streaming Internet service. This paper compares several prevalent overlay construction algorithms in terms of (1) service reliability; (2) service delay and (3) protocol overhead. A new Heap Algorithm is proposed to enhance reliability by leveraging the peers’ time properties while maintaining a short tree, which in turn helps to reduce service delay. This new algorithm dynamically moves peers between different layers of the tree according to a simple metric called Service Capacity Contribution (SCC), and gradually adjusts the overlay toward a short tree with peers ordered in time. Extensive simulations show that this new algorithm achieves better comprehensive performance than existing algorithms.
|Number of pages||9|
|Journal||International Journal of Simulation: Systems, Science and Technology|
|Publication status||Published - 1 Mar 2006|
Bibliographical notePublisher Copyright:
© 2006, UK Simulation Society. All rights reserved.
ASJC Scopus subject areas
- Modelling and Simulation