This paper presents the performance analysis of topological multicast routing algorithms on mobile wireless ad-hoc networks. Flooding and OnDemand Multicast Routing Protocol (ODMRP) are simulated and compared with Topological Multicast Routing Protocol (ToMuRo) over a pedestrian scenario. The scenario evaluated considers one multicast transmitter and one, two, and three multicast receivers unde...

We introduce the Addressable Internet Multicast (AIM) architecture, which extends the IP-multicast architecture with group-relative addressing information along multicast routing trees. AIM permits more e cient and sophisticated multicast routing options and encourages communication and cooperation between IP and higher-layer protocols. AIM enables sources to restrict the delivery of packets to...

There are many benefits of multicasting using with network. The communication cost reduced by multicasting for applications that sends the same data to many recipients instead of sending via multiple unicast. This paper gives a general survey of multicast routing protocols in Mobile adhoc Networks (MANETs). The multicast routing protocols are divided into two categoriesmulticast routing based o...

A novel efficiency and effectiveness Internet multicast routing protocol is presented with short delay, high throughput, resource utilization and scalability for a single multicast group g. The protocol has two features: (1) Multiple Shared-Trees (MST) are configured to provide efficient, dynamic and quality multicast routing; (2) Anycasting approach is used to form the tree roots into an anyca...

Several unicast routing protocols have been presented for unicast traffic in MPSoCs. Exploiting the unicast routing algorithms for multicast traffic increases the likelihood of deadlock and congestion. In order to avoid deadlock for multicast traffic, the Hamiltonian path strategy was introduced. The traditional Hamiltonian path routing protocols supporting both unicast and multicast traffic ar...

In network multimedia applications, such as multiparty teleconferencing, users often need to send the same information to several (but not necessarily all) other users. To manage such one-to-many or many-to-many communication e ciently in wide-area internetworks, it is imperative to support and perform multicast routing. Multicast routing sends a single copy of a message from a source to multip...

We study the issues of adaptive multicast wormhole routing in 2D mesh multicomputers. Three adaptive multicast wormhole routing strategies are proposed and studied, which include minimal partial adap-tive, minimal fully adaptive and nonminimal multicast routing methods. All the algorithms are shown to be deadlock-free. These are the rst deadlock-free adaptive multicast wormhole routing algorith...

Multicast routing is an effective way to establish the group communication when the same message or the same stream of data needs to be sent to multiple receivers. Multicast routing has attracted a lot of attention in group oriented computing due to supporting data transmission from a single source node to multiple destinations concurrently. The advantage of multicast routing lies in its capabi...