High-bandwidth mesh-based overlay multicast in heterogeneous environments

Biskupski, Bartosz; Cunningham, Robert E.; Dowling, Jim; Meier, René

doi:10.1145/1190183.1190187

Cited by 14 publications

(14 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Protocol parameters of the physical network and the TCP/IP stack (we use TCP New Reno), however, at the cost of reduced scalability, which limits the number of nodes that have been simulated to 500. Our previous experience in evaluating larger overlays in less accurate flow-level simulators lead us to believe that the findings presented here are also valid for larger overlays [4]. The physical network topology created for simulations is a full mesh with bandwidth being limited on the access links (uplinks and downlinks).…”

Section: Discussionmentioning

confidence: 84%

“…In previous research we proposed a MeshCast protocol [4], which extends Chainsaw with a gossip-based mesh overlay adaptation algorithm to exploit heterogeneity in the environment. However, MeshCast requires that nodes discover their own upload bandwidth, assumes that congestion may occur only at the ISPs and does not exploit node proximity.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Improving Throughput and Node Proximity of P2P Live Video Streaming through Overlay Adaptation

Biskupski

Cunningham

Meier

2007

Ninth IEEE International Symposium on Multimedia (ISM 2007)

Self Cite

View full text Add to dashboard Cite

Due to the heterogeneity of the environment, in which hosts may have different bandwidth capacities and network distances between hosts vary, current mesh-based multicast protocols for video streaming over the Internet tend to inefficiently utilise the available bandwidth and often transfer large amounts of data between distant hosts. This limits system throughput, which results in reduced video quality, and imposes significant costs on Internet Service Providers (ISPs) caused by network traffic outside a provider's own network. This paper presents MeshTV, a mesh-based peerto-peer (p2p) multicast protocol for streaming live video from a transmitter to numerous viewers. MeshTV proposes an algorithm for adapting the mesh overlay in which nodes explore their possible neighbour nodes and select neighbours so that data throughput is optimised and data is transmitted between nearby (low-latency) nodes, typically within the same ISP thus reducing the costs to ISPs. Our evaluation demonstrates that the adaptation algorithm used in MeshTV can improve video streaming throughput by over 100% and typically reduces the distances (network latencies) between interacting nodes by 50% compared to unoptimised mesh overlays.

show abstract

Section: Discussionmentioning

confidence: 84%

Section: Related Workmentioning

confidence: 99%

Improving Throughput and Node Proximity of P2P Live Video Streaming through Overlay Adaptation

Biskupski

Cunningham

Meier

2007

Ninth IEEE International Symposium on Multimedia (ISM 2007)

Self Cite

View full text Add to dashboard Cite

show abstract

“…We consider a unidirectional mesh since it is more general than a bidirectional mesh. Also, unidirectional meshes have been shown to perform better than bidirectional meshes [24].…”

Section: Mesh-based Peer-to-peer Streamingmentioning

confidence: 99%

Towards securing data delivery in peer-to-peer streaming

Seibert

Nita-Rotaru

Rao

2010

2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)

View full text Add to dashboard Cite

Abstract-The goal of enabling ubiquitous video broadcasting on the Internet has been a long cherished vision in the networking community. Prior efforts aimed at achieving this goal based on the IP Multicast architecture have been unsuccessful. In recent years, peer-to-peer (P2P) streaming has emerged as a promising alternative technology, which has matured to the point that there are several commercial offerings available to users. While these developments are encouraging, P2P streaming systems are susceptible to attacks by malicious participants, and their viability depends on how effectively they can perform under such attacks. In this paper, we explore this issue in the context of meshbased designs, which have emerged as the dominant architecture for P2P streaming.We provide a taxonomy of the implicit commitments made by nodes when peering with others. We show that when these commitments are not enforced explicitly, they can be exploited by malicious nodes to conduct attacks that degrade the data delivery service. We consider an important class of attacks where malicious nodes deliberately become neighbors of a large number of nodes and do not upload data to them. We focus on these attacks given the limited attention paid to them, and the significant impact they can have on overall data delivery. We present mechanisms that can enhance the resilience of meshbased streaming against such attacks. A key part of the solution is a novel reputation scheme that combines feedback from both the control and data planes of the overlay. We evaluate our design with real-world experiments on the PlanetLab testbed and show that our design is effective. Even when there are 30% attackers, nodes can receive 92% of the data with our schemes compared to 10% of the data without our schemes. Overall these results indicate the feasibility of enabling effective P2P streaming even under the presence of malicious participants.

show abstract

“…In our previous research on mesh overlay adaptation [10,11], we identified that completely random mesh overlays limit the network throughput by underutilising the available upload bandwidth at peers. Limited network throughput in turn reduces possible video streaming rates and the corresponding video quality.…”

Section: Mesh Overlay Propertiesmentioning

confidence: 99%

“…-Each peer has a constant (configurable) number of parents -Each peer has a number of children proportional to its upload bandwidth We showed in [10] that a mesh overlay satisfying these two conditions optimises the upload bandwidth utilisation and enables all peers to download at the maximum possible global video streaming rate. We also proposed algorithms for adapting the mesh overlay to satisfy these conditions.…”

Section: Mesh Overlay Propertiesmentioning

confidence: 99%

Tree-Based Analysis of Mesh Overlays for Peer-to-Peer Streaming

Biskupski

Schiely

Felber

et al. 2008

Distributed Applications and Interoperable Systems

Self Cite

View full text Add to dashboard Cite

Abstract. Mesh-based P2P streaming approaches have been recently proposed as an interesting alternative to tree-based approaches. However, many properties of mesh overlays remain little understood as they are difficult to study due to the lack of a predefined structure. In this paper we show that when data is streamed through mesh overlays, it follows tree-based diffusion patterns and thereby mesh-based streaming can be studied in a similar manner to tree-based approaches. We identify properties of the diffusion trees that emerge in mesh overlays and compare them to optimal diffusion trees. We show that the emerging diffusion trees exhibit suboptimal height and are unbalanced, which results in increased buffering delay of mesh-based P2P systems, particularly in heterogeneous environments. We present an algorithm that adapts the mesh overlay to shorten diffusion trees and to reduce the buffering delay.

show abstract

High-bandwidth mesh-based overlay multicast in heterogeneous environments

Cited by 14 publications

References 12 publications

Improving Throughput and Node Proximity of P2P Live Video Streaming through Overlay Adaptation

Improving Throughput and Node Proximity of P2P Live Video Streaming through Overlay Adaptation

Towards securing data delivery in peer-to-peer streaming

Tree-Based Analysis of Mesh Overlays for Peer-to-Peer Streaming

Contact Info

Product

Resources

About