Abstract:Abstract-Peer-to-peer (P2P) technology has emerged as a promising scalable solution for live streaming to large group. In this paper, we address the design of overlay which achieves low source-to-peer delay, is robust to user churn, accommodates of asymmetric and diverse uplink bandwidth, and continuously improves based on existing user pool. A natural choice is the use of mesh, where each peer is served by multiple parents. Since the peer delay in a mesh depends on its longest path through its parents, we stu… Show more
“…To address the weaknesses of single-tree structure, using forest of multiple trees (or a push-based mesh) was proposed [14][15][16]. Multiple interior node-disjoint trees are constructed to mitigate single parent failure.…”
Section: Related Workmentioning
confidence: 99%
“…Therefore, TSP is polynomial reducible to MDRT. The complexity of a similar problem is proved to be NPHard in [15]. h…”
Section: Problem Formulation and Complexity Analysismentioning
confidence: 99%
“…Obviously those high-bandwidth nodes close to the server should be connected to the server with higher priority. To balance between the bandwidth and distance, the score of node i is calculated as u i =d si (this has been shown to be effective from [15]). Nodes with the highest scores become the children of s and hence are added to all the trees to get the streams.…”
Section: Padtrees-centralized: a Centralized Heuristic And Its Run-timentioning
“…To address the weaknesses of single-tree structure, using forest of multiple trees (or a push-based mesh) was proposed [14][15][16]. Multiple interior node-disjoint trees are constructed to mitigate single parent failure.…”
Section: Related Workmentioning
confidence: 99%
“…Therefore, TSP is polynomial reducible to MDRT. The complexity of a similar problem is proved to be NPHard in [15]. h…”
Section: Problem Formulation and Complexity Analysismentioning
confidence: 99%
“…Obviously those high-bandwidth nodes close to the server should be connected to the server with higher priority. To balance between the bandwidth and distance, the score of node i is calculated as u i =d si (this has been shown to be effective from [15]). Nodes with the highest scores become the children of s and hence are added to all the trees to get the streams.…”
Section: Padtrees-centralized: a Centralized Heuristic And Its Run-timentioning
“…These approaches have been reviewed in [1]. A viable scheduler can reduce the completion time and provide efficient utilization of peers' resources such as local storage and network bandwidth [8,9,10,11]. However, in a large heterogeneous overlay network it is very difficult to find an optimal chunk propagation scheme that minimizes the client download time.…”
Section: B Chunk Content Distribution Modelmentioning
Overlay networking has emerged as an alternative solution to solve many problems related to massive information distribution and processing tasks by providing enhanced services in application layer. For instance, overlay networks can improve data dissemination in P2P file sharing overlays and Content Distribution Networks (CDNs) in which delay is considered as a critical performance metric. A viable content distribution model could considerably minimize the completion time. The main objective of this paper is to design a new content distribution model for fast data dissemination in overlay networks with heterogeneous overlay nodes. The proposed content distribution model is a hybrid model that enables fast data dissemination in overlay networks by combining Chunk and Fluid content distribution models.
“…• Reducing the minimum longest path: Ren et al study how to optimize the source-to-end delay while meeting a certain streaming rate requirement from the fact that the peer delay in a mesh depends on its longest path through its parents to the source [22]. They formulate the minimum delay mesh problem which is NP-hard and propose a distributed algorithm which makes continuous improvement on delay until some minimum delay is reached.…”
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.