Tunable reliable multicast for periodic information dissemination
Mobile Networks and Applications
Temporally enhanced erasure codes for reliable communication protocols
Computer Networks: The International Journal of Computer and Telecommunications Networking
Adaptive Hybrid Error Control for IP-Based Continuous Media Multicast Services
QofIS '00 Proceedings of the First COST 263 International Workshop on Quality of Future Internet Services
Robust Video Transmission Using RSE-Code-Based FEC
PCM '02 Proceedings of the Third IEEE Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing
Efficient placement of proxies for hierarchical reliable multicast
Computer Communications
A packet-loss recovery scheme based on the gap statistics
ICOIN'05 Proceedings of the 2005 international conference on Information Networking: convergence in broadband and mobile networking
| Hi-index | 0.01 |
Real-Time reliable multicast over a best-effort service network remains a challenging research problem. Most protocols for reliable multicast use repair techniques that result in significant and variable delay, which can lead to missed deadlines in real-time scenarios. This paper presents a repair technique that combines forward error correction (FEC) with automatic repeat request (ARQ). The novel aspect of the technique is its ability to reduce delay in reliable multicast delivery by sending repairs proactively (i.e., before they are required). The technique requires minimal state at senders and receivers, and no additional active router functionality beyond what is required by the current multicast service model. Furthermore, the technique uses only end-to-end mechanisms, where all data and repairs are transmitted by the data-originating source, leaving receivers free from any burden of sending repairs. We simulate a simple round-based version of a protocol embodying this technique to show its effectiveness in preventing repair request implosion, reducing the expected time of reliable delivery of data, and keeping bandwidth usage for repairs low. We show how a protocol using the technique can be adapted to provide delivery that is reliable before a real-time deadline with probabilities extremely close to one. Finally, we develop several variations of the protocol that use the technique in various fashions for high rate data streaming applications, and present results from additional simulations that examine performance in a variety of Internet-like heterogeneous networks.