Scalability in adaptive multi-metric overlays

Rodriguez, Adolfo; Kostić, Dejan; Vahdat, Amin

doi:10.1109/icdcs.2004.1281574

Cited by 19 publications

(13 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A problem with the decentralized solution is that a node may overwhelm other neighboring nodes (e.g. AMMO [66]). Exarchakos and Antonopoulos propose an unstructured P2P overlay to share the network resources in [67].…”

Section: P2p Streamingmentioning

confidence: 99%

An architecture for federated video processing and online streaming

Iqbal¹

2010

SIGMultimedia Rec.

View full text Add to dashboard Cite

Today access to video is available via numerous multimedia enabled devices through a wide variety of network types. What is required is a mechanism to ensure that users can receive different qualities of video proportional to their device capabilities and network conditions. In this thesis, we propose an online adaptive video streaming approach which uses the Peer-to-Peer (P2P) paradigm to not only distribute the content using peers' bandwidth, but also adapt the video using peers' processing power, while taking into account receiver heterogeneity, watermarking, and perceptual encryption.

show abstract

Section: P2p Streamingmentioning

confidence: 99%

An architecture for federated video processing and online streaming

Iqbal¹

2010

SIGMultimedia Rec.

View full text Add to dashboard Cite

show abstract

“…RanSub assumes the presence of some scalable mechanism for efficiently building and maintaining the underlying tree. A number of such techniques are described in Banerjee et al [2002], hua Chu et al [2000], Jannotti et al [2000], Kostić et al [2003a], Rodriguez et al [2004b], and Rowstron et al [2001].…”

Section: :14mentioning

confidence: 99%

High-bandwidth data dissemination for large-scale distributed systems

Kostić

Snoeren

Vahdat

et al. 2008

ACM Trans. Comput. Syst.

View full text Add to dashboard Cite

IBMThis article focuses on the multireceiver data dissemination problem. Initially, IP multicast formed the basis for efficiently supporting such distribution. More recently, overlay networks have emerged to support point-to-multipoint communication. Both techniques focus on constructing trees rooted at the source to distribute content among all interested receivers. We argue, however, that trees have two fundamental limitations for data dissemination. First, since all data comes from a single parent, participants must often continuously probe in search of a parent with an acceptable level of bandwidth. Second, due to packet losses and failures, available bandwidth is monotonically decreasing down the tree.To address these limitations, we present Bullet, a data dissemination mesh that takes advantage of the computational and storage capabilities of end hosts to create a distribution structure where a node receives data in parallel from multiple peers. For the mesh to deliver improved bandwidth and reliability, we need to solve several key problems: (i) disseminating disjoint data over the mesh, (ii) locating missing content, (iii) finding who to peer with (peering strategy), (iv) Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or direct commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 ( right rate from all peers (flow control), and (v) recovering from failures and adapting to dynamically changing network conditions. Additionally, the system should be self-adjusting and should have few user-adjustable parameter settings. We describe our approach to addressing all of these problems in a working, deployed system across the Internet. Bullet outperforms state-of-the-art systems, including BitTorrent, by 25-70% and exhibits strong performance and reliability in a range of deployment settings. In addition, we find that, relative to tree-based solutions, Bullet reduces the need to perform expensive bandwidth probing.

show abstract

“…Parents are swapped using an algorithm called Swaplinks [8] that uses weighted random walks to build random graphs, so that the parent-child relationship are optimized with respect to load and relative latency. Rodriguez et al [9] seek to build and maintain topologies that optimize one or several metrics at the same time, such as delay and cost. Since this is an NP-hard problem, the constraints are typically ordered according to their importance to the user.…”

Section: Related Workmentioning

confidence: 99%

“…In particular, the theory holds true for the Zipf distribution, which has been shown to represent the online lifetimes of human users [13]. Although we have a closed form expression in (9), it is difficult to use this equation because of the need to take factorial for values of k up to Ns. Instead, we bound the probability of a new peer being served as follows.…”

Section: Expected Service Probabilitymentioning

confidence: 99%

Scaling laws and tradeoffs in peer-to-peer live multimedia streaming

Small

Liang

2006

Proceedings of the 14th ACM International Conference on Multimedia

View full text Add to dashboard Cite

It is well-known that live multimedia streaming applications operate more efficiently when organized in peer-to-peer (P2P) topologies, since peer upload capacities are utilized to support other peers, and to alleviate the load and operating costs on the streaming servers. To date, there have been a number of existing experimental proposals with respect to how such peer-to-peer topologies are organized to support live streaming sessions. However, most of the existing proposals resort to intuition and heuristics when it comes to the design of such topology construction (i.e., neighbor selection) protocols. In this paper, we investigate the scaling laws of live P2P multimedia streaming, by quantitatively studying the asymptotic effects and tradeoffs among three key parameters in P2P streaming: server bandwidth cost, the maximum number of peers that can be supported, and the maximum number of streaming hops experienced by a peer. To further generalize our studies, we do not make restrictive assumptions in our theoretical analysis of such scaling laws: both peer upload capacities and peer lifetimes in a session may come from arbitrary distributions. With the theoretical insights we have developed, we propose Affinity, a simple and realistic heuristic to demonstrate the key benefits of our theoretical analysis in dynamic P2P networks, as compared to the topology construction algorithms in existing work.

show abstract

Scalability in adaptive multi-metric overlays

Abstract: Overcast and a two-metric (delay-constrained, cost-optimized) overlay.

Cited by 19 publications

References 21 publications

An architecture for federated video processing and online streaming

An architecture for federated video processing and online streaming

High-bandwidth data dissemination for large-scale distributed systems

Scaling laws and tradeoffs in peer-to-peer live multimedia streaming

Contact Info

Product

Resources

About