Distributing streaming media content using cooperative networking
NOSSDAV '02 Proceedings of the 12th international workshop on Network and operating systems support for digital audio and video
Scalable application layer multicast
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
BRITE: An Approach to Universal Topology Generation
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Bullet: high bandwidth data dissemination using an overlay mesh
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
SplitStream: high-bandwidth multicast in cooperative environments
SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
An analysis of live streaming workloads on the internet
Proceedings of the 4th ACM SIGCOMM conference on Internet measurement
A decentralized scheduler for distributed video streaming in a server-less video streaming system
CCGRID '04 Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid
A hierarchical characterization of a live streaming media workload
IEEE/ACM Transactions on Networking (TON)
ALMI: an application level multicast infrastructure
USITS'01 Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3
Chainsaw: eliminating trees from overlay multicast
IPTPS'05 Proceedings of the 4th international conference on Peer-to-Peer Systems
A Measurement Study of a Large-Scale P2P IPTV System
IEEE Transactions on Multimedia
A case for end system multicast
IEEE Journal on Selected Areas in Communications
A peer-to-peer architecture for media streaming
IEEE Journal on Selected Areas in Communications
Outreach: peer-to-peer topology construction towards minimized server bandwidth costs
IEEE Journal on Selected Areas in Communications
Efficient search and scheduling in P2P-based media-on-demand streaming service
IEEE Journal on Selected Areas in Communications
MixNStream: multi-source video distribution with stream mixers
Proceedings of the 2010 ACM workshop on Advanced video streaming techniques for peer-to-peer networks and social networking
A new and effective hierarchical overlay structure for Peer-to-Peer networks
Computer Communications
Survey A survey of peer-to-peer live video streaming schemes - An algorithmic perspective
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
Peer-to-peer (P2P) technology has emerged as a promising scalable solution for live streaming to a large group. In this paper, we address the design of an overlay mesh which achieves low source-to-peer delay, accommodates asymmetric and diverse uplink bandwidth, and continuously improves delay based on an existing pool of peers. By considering a streaming mesh as an aggregation of data flows along multiple spanning trees, the peer delay in the mesh is then its longest delay (including both propagation and scheduling delay) among all the trees. Clearly, such delay can be very high if the mesh is not designed well. In this paper, we propose and study a mesh protocol called Fast-Mesh, which optimizes such delay while meeting a certain streaming bandwidth requirement. Fast-Mesh is particularly suitable for a mildly dynamic network consisting of proxies, supernodes, or content distribution servers. We first formulate the minimum delay multiple trees (MDMT) problem and show that it is NP-hard. Then we propose a centralized heuristic based on complete knowledge, which may be used when the network is small or managed, and serves as an optimal benchmark for all the other schemes under comparison. We then propose a simple distributed algorithm, Fast-Mesh, where peers select their parents based on the concept of power in networks given by the ratio of throughput and delay. By maximizing the network power, our algorithm achieves low delay. The algorithm makes continuous improvement on delay until some minimum delay is reached. Simulation and PlanetLab experiments show that our distributed algorithm performs very well in terms of delay and source workload, and substantially outperforms traditional and state-of-the-art approaches.