RELIABLE CONCURRENT MULTICAST FROM BURSTY SOURCES

This paper presents a protocol and design for concurrent and reliable group multicast (many-to-many) from bursty data sources in general net works, In a group multicast, any node can be a multicast source and mu ltiple nodes may start to multicast simultaneously, i.e., an asynchron ous access to the network, The reliable multicast protocol presented i n this work is window based with a combined sender and receiver initia tion of the recovery protocol, In reliable multicasting the necessary requirement is to ensure that data is received correctly by all the ac tive members of the multicast group, The approach taken in this work i s to combine the multicast operation with the internal flow control, A s a result, it is possible to provide: 1) congestion-free multicast ro uting with a single and immediate acknowledgment message to the sender , Furthermore, in every multicast, 2) a node can access all the rapaci ty allocated to its group with no delay, however, if several nodes are active in the same group, then the rapacity will be shared fairly, In addition, 3) each sender in the multicast group uses a single timer, and 4) a node can become active or inactive in a transparent fashion, i.e., there is no need to explicitly notify the members of the group, A multiple criteria optimization study of the bandwidth allocation to each multicast group is presented, The optimization problem has two Mi n-Max objective functions: 1) for delay, which is caused by the number of links needed to connect the group, and 2) for congestion, which is caused by sharing a link among multiple multicast groups, The bandwid th allocation among multicast groups sharing the same link are further optimized using the Max-Min fairness criterion.