DocumentCode
1627150
Title
Multicasting to multiple groups over broadcast channels
Author
Gopal, Inder ; Rom, Raphi
Author_Institution
IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
fYear
1988
Firstpage
79
Lastpage
81
Abstract
The authors examine the multicast problem in a broadcast channel where any transmission can potentially be received by all intended destinations without having to send multiple copies. Specifically, they investigate the (more natural) case in which the source multicasts to a number of different (but not necessarily disjoint) destination groups. The basic problem is that a destination cannot distinguish between a lost message and a message not addressed to it. The approach to the problem that is adopted is to use a single sequence number per source and include additional information in the message stream to indicate to every destination the sequence numbers of the messages destined to it. The resulting protocols are analyzed under two retransmission procedures: the memoryless go-back-N protocol; and the ideal selective reject protocol.<>
Keywords
computer networks; data communication systems; protocols; broadcast channel; ideal selective reject protocol; memoryless go-back-N protocol; message stream; multiple copies; retransmission procedures; single sequence number per source; Broadcasting; Context; Degradation; Gold; History; Memory management; Multicast protocols; Read only memory; Waste management;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Networking Symposium, 1988., Proceedings of the
Conference_Location
Washington, DC, USA
Print_ISBN
0-8186-0835-8
Type
conf
DOI
10.1109/CNS.1988.4980
Filename
4980
Link To Document