Modeling and analysis of stochastic systems
Modeling and analysis of stochastic systems
A comparison of reliable multicast protocols
Multimedia Systems
Parity-based loss recovery for reliable multicast transmission
IEEE/ACM Transactions on Networking (TON)
A case for end system multicast (keynote address)
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Enabling conferencing applications on the internet using an overlay muilticast architecture
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Chord: A scalable peer-to-peer lookup service for internet applications
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
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
Resilient multicast using overlays
SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
End-Host Multicast Communication Using Switch-Trees Protocols
CCGRID '02 Proceedings of the 2nd IEEE/ACM International Symposium on Cluster Computing and the Grid
Resilient Peer-to-Peer Streaming
ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
Analyzing peer-to-peer traffic across large networks
IEEE/ACM Transactions on Networking (TON)
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
On lifetime-based node failure and stochastic resilience of decentralized peer-to-peer networks
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
A hierarchical characterization of a live streaming media workload
IEEE/ACM Transactions on Networking (TON)
Overcast: reliable multicasting with on overlay network
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
ALMI: an application level multicast infrastructure
USITS'01 Proceedings of the 3rd conference on USENIX Symposium on Internet Technologies and Systems - Volume 3
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Reliable multicast transport protocol (RMTP)
IEEE Journal on Selected Areas in Communications
A peer-to-peer architecture for media streaming
IEEE Journal on Selected Areas in Communications
Improving stability for peer-to-peer multicast overlays by active measurements
Journal of Systems Architecture: the EUROMICRO Journal
ICME'09 Proceedings of the 2009 IEEE international conference on Multimedia and Expo
Functional and performance verification of overlay multicast applications - a product level approach
CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference
Collaborative personalized top-k processing
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |
A key technical challenge for overlay multicast is that the highly dynamic multicast members can make data delivery unreliable. In this paper, we address this issue in the context of live media streaming by exploring 1) how to construct a stable multicast tree that minimizes the negative impact of frequent member departures on an existing overlay and 2) how to efficiently recover from packet errors caused by end-system or network failures. For the first problem, we identify two layout schemes for the tree nodes, namely, the bandwidth-ordered tree and the time-ordered tree, which represent two typical approaches to improving tree reliability, and conduct a stochastic analysis on their properties regarding reliability and tree depth. Based on the findings, we propose a distributed Reliability-Oriented Switching Tree (ROST) algorithm that minimizes the failure correlation among tree nodes. Compared with some commonly used distributed algorithms, the ROST algorithm significantly improves tree reliability and reduces average service delay, while incurring only a small protocol overhead; furthermore, it features a mechanism that prevents cheating or malicious behaviors in the exchange of bandwidth/time information. For the second problem, we develop a simple Cooperative Error Recovery (CER) protocol that helps recover from packet errors efficiently. Recognizing that a single recovery source is usually incapable of providing the timely delivery of the lost data, the protocol recovers from data outages using the residual bandwidths from multiple sources, which are identified using a minimum-loss-correlation algorithm. Extensive simulations demonstrate the effectiveness of the proposed schemes.