Using NATO! for partially reliable large scale multicast streaming in broadcast wireless networks

Authors:
Reuven Cohen;Alexander Landau
Affiliations:
Dept. of Computer Science, Technion, Israel;Dept. of Computer Science, Technion, Israel
Venue:
INFOCOM'09 Proceedings of the 28th IEEE international conference on Computer Communications Workshops
Year:
2009

Citing 7
Cited 0

Effective erasure codes for reliable computer communication protocols

ACM SIGCOMM Computer Communication Review
Parity-based loss recovery for reliable multicast transmission

IEEE/ACM Transactions on Networking (TON)
A novel feedback scheme to increase throughput in multiple access radio systems

Wireless Networks
Estimating membership in a multicast session

SIGMETRICS '03 Proceedings of the 2003 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Evaluating the Utility of FEC with Reliable Multicast

ICNP '99 Proceedings of the Seventh Annual International Conference on Network Protocols
Large scale content distribution protocols

ACM SIGCOMM Computer Communication Review
A study of proactive hybrid FEC/ARQ and scalable feedback techniques for reliable, real-time multicast

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Streaming multicast is one of the most important Transport layer services in future broadcast wireless networks. This service enables the delivery of real-time voice and video applications to an almost unlimited number of mobile devices, by taking advantage of a base station's ability to transmit a single packet to all the nodes in its cell. While strict delivery assurance is not necessary and not possible for such applications, some level of assurance is provided using Transport layer FEC (Forward Error Correction) codes. In this paper we show how to improve the performance of large-scale partially reliable multicast streaming in broadcast wireless networks, using the NATO! scheme. NATO!, presented in another paper, is a generic real-time scheme that allows a node to estimate the size of any subset of nodes affected by the same event using a few messages received from this subset.