In this paper we propose an analytical model of a resilient end-node multicast streaming architecture based on multiple minimum-depth-trees that employs path diversity and forward error correction for improved resilience to node churns and packet losses. We study the performance of the architecture in the presence of packet losses and dynamic node behavior. We show that for a given redundancy the probability that an arbitrary node possesses a packet is high as long as the loss probability in the network is below a certain threshold. After reaching the threshold the packet possession probability suddenly drops; the rate decrease gets faster as the number of nodes in the overlay grows. The value of the threshold depends on the ratio of redundancy and on the number of the distribution trees. We study the overlay structure in the presence of node dynamics and conclude that stability can be achieved only if the root node serves a large number of nodes simultaneously.

Abstract. In this paper we evaluate the data transmission performance of a generalized multiple-tree-based overlay architecture for peer-to-peer live streaming that employs multipath transmission and forward error correction. We give mathematical models to describe the error recovery in the presence of packet losses. We evaluate the data distribution performance of the overlay, its asymptotic behavior, the stability regions for the data transmission, and analyze the system behavior around the stability threshold. We argue that the composed measure of the mean and the variance of the packet possession probability can support adaptive forward error correction. 1

In this paper we propose an analytical model to evaluate the end-to-end loss and delay characteris-tics for live multicast streaming. We consider multiple-tree architectures and push based transmission. We give an asymptotic bound on the performance of large overlays, and present a necessary condition for the overlay to be stable. Based on the model we show how the overlay’s loss characteristics is influenced by the number of distribution trees, the error control solutions used, the allocation of the bandwidth resources of the peers between the trees and the number of nodes in the overlay. Based on our results, we propose a tree structure that improves the stability of the overlay. We use the model to show how the structure of the overlay and the available bandwidth influence the delay characteristics of the data distribution and the playout buffer requirements.

The two main sources of impairment in overlay multicast systems are packet losses and node churn. Yet, little is known about their effects on the data distribution performance. In this paper we develop an analytical model of a large class of peer-to-peer streaming architectures based on decomposition and non-linear recurrence relations. We analyze the stability properties of these systems using fixed-point analysis. We derive bounds on the probability that nodes in the overlay receive an arbitrary packet of the stream. Based on the model, we explain the effects of the overlay’s size, node heterogeneity, loss correlations and node churn on the overlay’s performance. Our findings lead us to the definition of an overlay structure with improved stability properties. We show how and under what conditions overlays can benefit from the use of error control solutions, prioritization and taxation schemes. Based on our results, we identify the components that are needed to achieve good data distribution performance in multi-tree-based overlay multicast.

Abstract. A large number of peer-to-peer streaming systems has been proposed and deployed in recent years. Yet, there is no clear understanding of how these systems scale and how multi-path and multihop transmission, properties of all recent systems, affect the quality experienced by the peers. In this paper we present an analytical study that considers the relationship between delay and loss for general overlays: we study the trade-off between the playback delay and the probability of missing a packet and we derive bounds on the scalability of the systems. We use an exact model of push-based overlays to show that the bounds hold under diverse conditions: in the presence of errors, under node churn, and when using forward error correction and various retransmission schemes. Keywords: Overlay multicast, Scalability, Delay, Large-deviation theory. 1

Abstract — A large number of peer-to-peer streaming systems has been proposed and deployed in recent years. Yet, there is no clear understanding of how these systems scale and how multi-path and multihop transmission, properties of all recent systems, affect the quality experienced by the peers. In this paper we present an analytical study that considers the relationship between delay and loss for general overlays: we study the tradeoff between the playback delay and the probability of missing a packet and we derive bounds on the scalability of the systems. We present an exact model of push-based overlays and show that the bounds hold under diverse conditions: in the presence of errors, under node churn, and when using forward error correction and various retransmission schemes.