A reliable multicast framework for light-weight sessions and application level framing
IEEE/ACM Transactions on Networking (TON)
An error control scheme for large-scale multicast applications
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Computer Networking: A Top-Down Approach Featuring the Internet Package
Computer Networking: A Top-Down Approach Featuring the Internet Package
A Delay Analysis of Sender-Initiated and Receiver-Initiated Reliable Multicast Protocols
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
A cooperative packet recovery protocol for multicast video
ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
Dynamic Activation and Deactivation of Repair Servers in a Multicast Tree
Dynamic Activation and Deactivation of Repair Servers in a Multicast Tree
Scalable reliable multicast in wide area networks
Scalable reliable multicast in wide area networks
Reliable multicast transport protocol (RMTP)
IEEE Journal on Selected Areas in Communications
Scalable fair reliable multicast using active services
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
For time-constrained applications, repair-server-based active local recovery approaches can be valuable in providing low-latency reliable multicast service. However, an active multicast repair service consumes resources at the repair servers in the multicast tree. Ascheme was thus presented in [10] to dynamically activate/deactivate repair servers with the goal of using as few system resources (repair servers) as possible, while at the same time improving application-level performance. In this paper, we develop stochastic models to study the distribution of repair delay both with and without a repair server in a simple multicast tree. From these models, we observe that the application deadline, downstream link loss rates, the number of receivers, and the upstream round trip time of a repair server all influence the overall value of activating an active repair server. Based on these observations, we propose a modified dynamic repair server activation algorithm that considers the packet loss rate, the number of downstream receivers, and the round trip time to the nearest upstream active repair server when activating/ deactivating a repair server. From simulation, we observe that our modified dynamic repair server activation algorithm provides a significant reduction in the latency of successful packet delivery (over the original algorithm) while using the same amount of system resources. We also find that much of the performance gains achievable by having active repair servers can be obtained by having only a relatively small fraction of repair servers actually being active.