In this paper we focus on reliable multicast services. We present our work concerning the integration of RMTP in the network simulator NS. The resulting model allows us to simulate the performance of RMTP-based reliable multicast services. The simulation results of eight different scenarios presented in this paper show the poor performance of RMTP when used to multicast data to receivers in "heterogeneous" environments. Another question that we address in this paper is the scalability limitation of RMTP in spite of its hierarchical design. This limitation is due to several reasons like the use of the hierarchical acknowledgments (HACKS), the unlimited number of receivers that can be associated to a designated receiver, and the buffering space required in the sender and in the DRs when some or many receivers experience high loss rates. We discuss as well the challenges that face the integration of RMTP in current networks and its future coexistence with other multicast as well as unicast protocols.
MotivationIn nowadays networked, computerized world the word "reliability" is associated to almost every product and service. In protocol engineering terms the word "reliability" has more than one interpretation according to the requested service. We define the service in our context as a function of three main factors: time, data, and number of customers that request it. Reliability in time sensitive service is mainly a function of some or many temporal factors like delay and synchronization signals, while it is mainly a function of data factors like data size and loss rate in data sensitive services.Services with two involved end points are called unicast services. In multicast more than two end points are involved in the communication. File transfer between a sender and a receiver is an example of a data sensitive unicast service. Videoconferencing and multi-party games are examples of time sensitive multicast services. In our paper we focus on reliable multicast services only.Multicast services can be built directly using at the network level. The main point of the architecture of this protocol is that senders and receivers don't need to know each other explicitly. It is sufficient to know one group address, which makes the distribution of data simple and scalable. In contrast, this "anonymity" S.