An overlay multicast protocol for live streaming and delay-guaranteed interactive media

Zhang, Weizhan; Zheng, Qinghua; Li, Haifei; Tian, Feng

doi:10.1016/j.jnca.2011.02.013

Cited by 20 publications

(14 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several approaches have been presented towards the management of the trees. Algorithms in [2], [5], [7] used centralized control. Pastry [17], a routing substrate, was used by the SplitStream algorithm in [3] for tree construction and maintenance.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Deterministic Near-Optimal P2P Streaming

Venkatakrishnan

Viswanath

2015

SIGMETRICS Perform. Eval. Rev.

View full text Add to dashboard Cite

We consider streaming over a peer-to-peer network with homogeneous nodes in which a single source broadcasts a data stream to all the users in the system. Peers are allowed to enter or leave the system (adversarially) arbitrarily. Previous approaches for streaming in this setting have either used randomized distribution graphs or structured trees with randomized maintenance algorithms. Randomized graphs handle peer churn well but have poor connectivity guarantees, while structured trees have good connectivity but have proven hard to maintain under peer churn. We improve upon both approaches by presenting a novel distribution structure with a deterministic and distributed algorithm for maintenance under peer churn; our result is inspired by a recent work [1] proposing deterministic algorithms for rumor spreading in graphs.A key innovation in our approach is in having redundant links in the distribution structure. While this leads to a reduction in the maximum streaming rate possible, we show that for the amount of redundancy used, the delay guarantee of the proposed algorithm is near optimal. We introduce a tolerance parameter that captures the worst-case transient streaming rate received by the peers during churn events and characterize the fundamental tradeoff between rate, delay and tolerance. A natural generalization of the deterministic algorithm achieves this tradeoff near optimally. Finally, the proposed deterministic algorithm is robust enough to handle various generalizations: ability to deal with heterogeneous node capacities of the peers and more complicated streaming patterns where multiple source transmissions are present.

show abstract

Section: Related Workmentioning

confidence: 99%

“…A popular method used by some early systems, was to divide the content into multiple substreams and distribute via multicast trees having disjoint interior nodes [2], [3], [5]- [7]. This way any peer could be an interior node in one multicast tree where it utilizes its upload bandwidth.…”

Section: Introductionmentioning

confidence: 99%

Deterministic Near-Optimal P2P Streaming

Venkatakrishnan

Viswanath

2015

SIGMETRICS Perform. Eval. Rev.

View full text Add to dashboard Cite

show abstract

“…However, as discussed earlier, a significant factor in the actual end-to-end delay is the delay incurred at overlay nodes that send out each message several times. There have been a number of previous works that did consider the node degree problem [14], [24], [26]- [28], but they only try to find a routing tree in which the degree of nodes is bounded to predefined thresholds. Ito et al [28] analyzed several forms of the multicast tree problem, and showed that it is NP-Complete to find various forms of degreebounded trees, such as one with minimum total distance or one with minimum distance to the farthest receiver.…”

Section: Related Workmentioning

confidence: 99%

“…However, it is not clear how these degree bounds are selected in practice; for instance, a fixed bound of 10 is used in [29]. In [26] it is proposed to set the degree bounds based on the level of the node in the tree. Nevertheless, these works only aim at bounding node degrees to given thresholds.…”

Section: Related Workmentioning

confidence: 99%

“…Yet, the problem with delays incurred by node degrees in an application-layer multicast tree is often ignored [16], [19]- [22] or only partially addressed by previous works, such as bounding node degrees in a tree to predefined thresholds [14], [23]- [26]. The problem with large node degrees, however, is of the same type as the shortest-path routing problem-minimizing the incurred delay.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Minimum-delay overlay multicast

Mokhtarian

Jacobsen

2013

2013 Proceedings IEEE INFOCOM

View full text Add to dashboard Cite

Delivering delay-sensitive data to a group of receivers with minimum latency is a fundamental problem for various applications. In this paper, we study multicast routing with minimum end-to-end delay to the receivers. The delay to each receiver in a multicast tree consist of the time that the data spends in overlay links as well as the latency incurred at each overlay node, which has to send out a piece of data several times over a finite-capacity network connection. The latter portion of the delay, which is proportional to the degree of nodes in the tree, can be a significant portion of the total delay as we show in the paper. Yet, it is often ignored or only partially addressed by previous multicast algorithms. We formulate the actual delay to the receivers in a multicast tree and consider minimizing the average and the maximum delay in the tree. We show the NP-hardness of these problems and prove that they cannot be approximated in polynomial time to within any reasonable approximation ratio.We then propose a number of efficient algorithms that heuristically build a multicast tree in which the average or the maximum delay is minimized. These algorithms together cover a wide range of overlay sizes and both versions of our problem. The effectiveness of our algorithms is demonstrated through comprehensive experiments on different real-world datasets and using various overlay network models.The results confirm that our algorithms can achieve much lower delays (up to 60% less) and up to orders of magnitude faster running times (hence supporting larger scales) than previous minimum-delay multicast approaches.

show abstract

RDDSACCGA: a reliable data distribution solution assisted by cloud computing based on genetic algorithm

Zhang

Shi

et al. 2017

Cluster Comput

View full text Add to dashboard Cite

An overlay multicast protocol for live streaming and delay-guaranteed interactive media

Cited by 20 publications

References 24 publications

Deterministic Near-Optimal P2P Streaming

Deterministic Near-Optimal P2P Streaming

Minimum-delay overlay multicast

RDDSACCGA: a reliable data distribution solution assisted by cloud computing based on genetic algorithm

Contact Info

Product

Resources

About