#### DMCA

## An approximation algorithm for minimum-delay peer-to-peer streaming (2009)

### Cached

### Download Links

Venue: | in Ninth International Conference on Peer-to-Peer Computing |

Citations: | 7 - 2 self |

### Citations

185 | A measurement study of a large-scale p2p iptv system,”
- Hei, Liang, et al.
- 2007
(Show Context)
Citation Context ...d capacity of Oi units/second and a download capacity of Ii units/second. For ease of presentation, we define unit as the minimum package size in P2P streaming, which varies in different applications =-=[4]-=-, [24]. We consider a peer-to-peer streaming session to originate from a single source node S to a set of receivers R, where V = {S} ∪ R. Peers may receive the streaming data from the source node dire... |

142 | Prime: Peer-to-peer receiver-driven mesh-based streaming,
- Magharei, Rejaie
- 2009
(Show Context)
Citation Context ...ltiple tree-based overlays, and (2) mesh-based overlays [6]–[11]. Recent studies have shown that the mesh-based approach consistently exhibits a superior performance over the tree-based approach [7], =-=[12]-=-. The tree-based P2P streaming approach organizes peers into multiple diverse trees. After obtaining the description of a Multiple Description Coded (MDC) content, it pushes each description through s... |

124 | A peer-to-peer architecture for media streaming,”
- Tran, Hua, et al.
- 2004
(Show Context)
Citation Context ...es; these are reported in Section 5. Section 6 concludes the paper. 2. Related Work Most of the previous protocols for the P2P streaming delay problem are based on tree-shaped overlays [5], [6], [8], =-=[17]-=-. Tran et al. propose Zigzag in [17], an approach to cluster peers into a hierarchy, called the administrative organization, for easy management, and build the multicast tree atop this hierarchy so as... |

105 | Mesh or multiple-tree: A comparative study of live p2p streaming approaches.
- Magharei, Rejaie, et al.
- 2007
(Show Context)
Citation Context ...1) multiple tree-based overlays, and (2) mesh-based overlays [6]–[11]. Recent studies have shown that the mesh-based approach consistently exhibits a superior performance over the tree-based approach =-=[7]-=-, [12]. The tree-based P2P streaming approach organizes peers into multiple diverse trees. After obtaining the description of a Multiple Description Coded (MDC) content, it pushes each description thr... |

97 | Anysee: Peer-topeer live streaming.
- Liao, Jin, et al.
- 2006
(Show Context)
Citation Context ...cient cooperation among end users [1]. Benefiting from its significant scalability, there is an increasing demand on applications of P2P live streaming, such as IPTV, VOIP, and video conferencing [2]–=-=[5]-=-. In these classes of applications, the delivery of real-time video content imposes rigorous constraints on the end-to-end delay. Obtaining assurances on meeting such delay constraints in highly dynam... |

87 | Epidemic live streaming: optimal performance trade-offs,”
- Bonald, Massoulie, et al.
- 2008
(Show Context)
Citation Context ...ristics on the problem of reducing P2P streaming delay either provides no theoretical bound on the worst-case performance or loosely estimate the bound without a robust theoretical analysis [8], [9], =-=[15]-=-. The estimated bound of previous algorithms [15], [16] is O(log n). In this paper, we not only present an approximation algorithm with a strong theoretical basis, but also reduce the approximation fa... |

71 | Chunkyspread: Multi-tree Unstructured Peer-to-Peer Multicast.
- Venkataraman, Francis, et al.
- 2006
(Show Context)
Citation Context ...can be easily deployed in a fully dynamic network environment. Previous work on P2P streaming can be broadly classified into two classes: (1) multiple tree-based overlays, and (2) mesh-based overlays =-=[6]-=-–[11]. Recent studies have shown that the mesh-based approach consistently exhibits a superior performance over the tree-based approach [7], [12]. The tree-based P2P streaming approach organizes peers... |

51 | Traffic modeling and proportional partial caching for peer-to-peer systems,”
- Hefeeda, Saleh
- 2008
(Show Context)
Citation Context ...acity of Oi units/second and a download capacity of Ii units/second. For ease of presentation, we define unit as the minimum package size in P2P streaming, which varies in different applications [4], =-=[24]-=-. We consider a peer-to-peer streaming session to originate from a single source node S to a set of receivers R, where V = {S} ∪ R. Peers may receive the streaming data from the source node directly o... |

45 | On the minimum delay peer-to-peer video streaming: how realtime can it be? In:
- Liu
- 2007
(Show Context)
Citation Context ...either provides no theoretical bound on the worst-case performance or loosely estimate the bound without a robust theoretical analysis [8], [9], [15]. The estimated bound of previous algorithms [15], =-=[16]-=- is O(log n). In this paper, we not only present an approximation algorithm with a strong theoretical basis, but also reduce the approximation factor to a ratio of O( √ logn). To the best of our knowl... |

42 | IPTV over P2P streaming networks: the mesh-pull approach, - Hei, Liu, et al. - 2008 |

38 | On Reducing Mesh Delay for Peer-to-Peer Live Streaming,"
- Ren, Li, et al.
- 2008
(Show Context)
Citation Context ...g heuristics on the problem of reducing P2P streaming delay either provides no theoretical bound on the worst-case performance or loosely estimate the bound without a robust theoretical analysis [8], =-=[9]-=-, [15]. The estimated bound of previous algorithms [15], [16] is O(log n). In this paper, we not only present an approximation algorithm with a strong theoretical basis, but also reduce the approximat... |

34 | Is there a future for meshbased live video streaming - Picconi, Massoulié - 2008 |

34 | rStream: Resilient and optimal peer-topeer streaming with rateless codes,
- Wu, Li
- 2008
(Show Context)
Citation Context ...ple, all leaf nodes do not contribute any bandwidth or CPU cycles to the multicast trees [18]. Recently, an increasing number of studies have focused on mesh-based P2P live streaming [9], [11], [16], =-=[19]-=-. In [9], Ren et al. propose a heuristic to reduce the delay on mesh topology, where peers select their parents based on the metric of link capacity divided by the communication delay. In this algorit... |

31 | Approximation and heuristic algorithms for minimum delay application-layer multicast trees,” - Brosh - 2003 |

31 | The freeze-tag problem: how to wake up a swarm of robots
- Arkin, Bender, et al.
(Show Context)
Citation Context ...em 1: The minimum-delay P2P streaming problem is NP-complete. Proof: We first show that the MDPS problem can be reduced from the Freeze-Tag Problem (FTP), which is well known to be an NP-hard problem =-=[25]-=-, [26]. Given a complete graph G = (V , E) in metric space, FTP can be described by a set of robots V , among which one robot S is initially awake and all the others R are asleep. The robot whic... |

18 |
Scalable Live Streaming Service Based on Interoverlay Optimization
- Liao, Jin, et al.
- 2007
(Show Context)
Citation Context ...[9]. Moreover, resource utilization of multiple-tree approaches is generally speaking, relatively low. For example, all leaf nodes do not contribute any bandwidth or CPU cycles to the multicast trees =-=[18]-=-. Recently, an increasing number of studies have focused on mesh-based P2P live streaming [9], [11], [16], [19]. In [9], Ren et al. propose a heuristic to reduce the delay on mesh topology, where peer... |

14 |
IPTV ride the peer-to-peer stream
- Sentinelli, Marfia, et al.
- 2007
(Show Context)
Citation Context ...nd shows a reasonable message overhead. 1. Introduction In the recent decade, P2P networks have greatly enhanced content distribution on the Internet by enabling efficient cooperation among end users =-=[1]-=-. Benefiting from its significant scalability, there is an increasing demand on applications of P2P live streaming, such as IPTV, VOIP, and video conferencing [2]–[5]. In these classes of applications... |

13 |
A bandwidth-aware scheduling strategy for p2p-tv systems. In:
- Silva, Leonardi, et al.
- 2008
(Show Context)
Citation Context ...mple modifications. To reduce the complexity of the problem, our paper focuses only on minimizing the communication delay. For packet scheduling, there exists a vast array of solutions, such as [11], =-=[13]-=-, [14]. The mesh built from our algorithm can adopt any of these scheduling algorithms to yield low-delay streaming. Existing heuristics on the problem of reducing P2P streaming delay either provides ... |

12 | Approximating the degree-bounded minimum diameter spanning tree problem, Algorithmica 41 (2
- Könemann, Levin, et al.
- 2004
(Show Context)
Citation Context ...n the network. Minimum-delay P2P streaming has some similarity with the minimum-delay multicast tree problem (MDMT problem) [20], [21] and degree-bounded minimum-diameter tree problem (DBMDT problem) =-=[22]-=-, [23]. Our algorithm is inspired by the clustering method first proposed by Könemann et al. [22]. However, previous approximation algorithms on MDMT and DBMDT generally assume a constant and equival... |

11 | Traveling salesman path problems
- Lam, Newman
- 2008
(Show Context)
Citation Context ...min(Oi) > 1 unit/second, ∀i ∈ V . For the case of Oi = 1 unit/second, this reduces the problem to the traditional traveling salesman path problem (TSP), which has been extensively studied in the past =-=[27]-=-, [28]. Therefore, we will not focus on this scenario in the paper. In the rest of this section, we discuss the details of our algorithm and derive its performance bound. 4.2. Centralized Approximatio... |

10 | FLoD: A framework for peer-to-peer 3D streaming
- Hu, Huang, et al.
- 2008
(Show Context)
Citation Context ...efficient cooperation among end users [1]. Benefiting from its significant scalability, there is an increasing demand on applications of P2P live streaming, such as IPTV, VOIP, and video conferencing =-=[2]-=-–[5]. In these classes of applications, the delivery of real-time video content imposes rigorous constraints on the end-to-end delay. Obtaining assurances on meeting such delay constraints in highly d... |

5 | Reducing end-to-end transmission delay in p2p streaming systems using multiple trees with moderate outdegree
- Noh, Mavlankar, et al.
- 2008
(Show Context)
Citation Context ...isting heuristics on the problem of reducing P2P streaming delay either provides no theoretical bound on the worst-case performance or loosely estimate the bound without a robust theoretical analysis =-=[8]-=-, [9], [15]. The estimated bound of previous algorithms [15], [16] is O(log n). In this paper, we not only present an approximation algorithm with a strong theoretical basis, but also reduce the appro... |

5 |
A study on reducing chunk scheduling delay for meshbased p2p live streaming
- Chen, Xue, et al.
- 2008
(Show Context)
Citation Context ...be easily deployed in a fully dynamic network environment. Previous work on P2P streaming can be broadly classified into two classes: (1) multiple tree-based overlays, and (2) mesh-based overlays [6]–=-=[11]-=-. Recent studies have shown that the mesh-based approach consistently exhibits a superior performance over the tree-based approach [7], [12]. The tree-based P2P streaming approach organizes peers into... |

4 |
Degree-constrained minimum latency trees are APX-Hard
- Brinkman, Helmick
- 2008
(Show Context)
Citation Context ...network. Minimum-delay P2P streaming has some similarity with the minimum-delay multicast tree problem (MDMT problem) [20], [21] and degree-bounded minimum-diameter tree problem (DBMDT problem) [22], =-=[23]-=-. Our algorithm is inspired by the clustering method first proposed by Könemann et al. [22]. However, previous approximation algorithms on MDMT and DBMDT generally assume a constant and equivalent de... |

3 |
Theoretical and experimental analysis of heuristics for the “freezetag” robot awakening problem,” Robotics
- Sztainberg, Arkin, et al.
- 2004
(Show Context)
Citation Context ...The minimum-delay P2P streaming problem is NP-complete. Proof: We first show that the MDPS problem can be reduced from the Freeze-Tag Problem (FTP), which is well known to be an NP-hard problem [25], =-=[26]-=-. Given a complete graph G = (V , E) in metric space, FTP can be described by a set of robots V , among which one robot S is initially awake and all the others R are asleep. The robot which is a... |

3 |
On the approximability of the traveling salesman problem,” Combinatorica
- Papadimitriou, Vempala
- 2006
(Show Context)
Citation Context ...) > 1 unit/second, ∀i ∈ V . For the case of Oi = 1 unit/second, this reduces the problem to the traditional traveling salesman path problem (TSP), which has been extensively studied in the past [27], =-=[28]-=-. Therefore, we will not focus on this scenario in the paper. In the rest of this section, we discuss the details of our algorithm and derive its performance bound. 4.2. Centralized Approximation Algo... |

1 |
Improving grid inter-domain scheduling with p2p techniques: A performance evaluation
- Caminero, Rana, et al.
- 2008
(Show Context)
Citation Context ...odifications. To reduce the complexity of the problem, our paper focuses only on minimizing the communication delay. For packet scheduling, there exists a vast array of solutions, such as [11], [13], =-=[14]-=-. The mesh built from our algorithm can adopt any of these scheduling algorithms to yield low-delay streaming. Existing heuristics on the problem of reducing P2P streaming delay either provides no the... |

1 | Cost-constrained minimum-delay multicasting
- Tayu, Al-Mutairi, et al.
- 2005
(Show Context)
Citation Context ...al data between peers, considerable message overhead may be incurred in the network. Minimum-delay P2P streaming has some similarity with the minimum-delay multicast tree problem (MDMT problem) [20], =-=[21]-=- and degree-bounded minimum-diameter tree problem (DBMDT problem) [22], [23]. Our algorithm is inspired by the clustering method first proposed by Könemann et al. [22]. However, previous approximatio... |