MPEG enabled Multicast Routing

Multicast routing is a collection leaning massage whose objective is to hold the spread of data from a dispatcher to all the recipient of a multicast group while annoying to use the obtainable bandwidth professionally, it also decrease the massage price and accumulate the network resources. In this paper, multicast routing protocols in wired networks that was projected in recent years has been covered and made a complete study on obtainable multicast routing protocols. A. Wired Network: It is a ordinary type of wired pattern which uses substantial cables to transport data among dissimilar devices and computer systems. Wired networks, too terms as Ethernet networks, are the most ordinary type of local area network (LAN) knowledge. It is just a group of two or more computers, printers, and other devices linked by Ethernet cables. In a little wired network, a sole router may be used to connect all the computers but larger networks frequently engage multiple routers or switches that attach to each other. Wired networks have quite a lot of salient distinctiveness:

Mesh networks are multi-hop wireless networks that can be used as a low cost infrastructure for community and city-wide access networks. In this context, support for killer applications such as cooperative services and mobile multimedia applications are in great demand. This mini-course presents the main challenges and solutions for providing mobility, quality of service (QoS) and multicasting in wireless mesh

Although multicast communication, in interconnection networks has been a major avenue for a lot of research works found in literature, there are several key issues that should still be improved in order to meet the increasing demand for service quality in such systems. Apparently, most of the related works handle multicast communication within limited operating conditions such as low traffic load, specific network sizes and limited destination nodes. However, this paper investigates the multicast communication under different scenarios. It presents a comparison study of some well known multicast algorithms proposed for wormhole switched interconnection networks. Unlike the previous studies, this paper considers the multicast latency at both network and node levels. Performance evaluation results show that our proposed algorithm can greatly improve the performance of multicast operation.

The Internet research community has proposed many routing protocols to support efficient multicast application. However, these protocols were developed for multicast parties whose members are topologically stationary, and they thus do not support both mobile receivers and mobile sources. Unfortunately, the mobility of the multicast source is a challenging problem to solve. When a multicast source moves from one IP network to another, it obtains a new IP address. However, since IP multicast is receiver-initiated, and the multicast delivery tree is constructed based on the multicast source’s address, the multicast traffic cannot be delivered to multicast receiver unless a new delivery tree is built. As a consequence, the multicast routing entities require new multicast routing states and multicast receivers need to be notified whenever the handover occurs. This induces a non-transparent mobility, and leads to session disruption. To overcome these drawbacks, this paper presents a new solution to make multicast source mobility transparent to both multicast receivers and on-tree multicast routers. This solution, called Mobility-aware Rendezvous Point, extends the PIM-SM Rendezvous Point with mobility awareness, and introduces new techniques for the source registration with the Rendezvous Point. Simulation results have proved that the solution avoids the reconstruction of a multicast tree after the handover of the multicast sources.

Present IPTV system fails to establish QoS due to packet loss, server congestion and  limited bandwidth. To overcome  these drawbacks an implementation of IPTV is presented here using MPLS in 3GPP LTE release 8 networks. This implementation will  provide  multicast  capability  and  FEC  along  with retransmission  to minimize  packet  loss.  Deploying  IPTV  in LTE  makes  LTE  capable  of  transmitting  voice,  data  and audio/video which will ensure convergence.

Group communication has become increasingly important in mobile ad hoc networks (MANET). Current multicast routing protocols in MANET have a large overhead due to the dynamic network topology. To overcome this problem, there is a recent shift towards stateless multicast in small groups. We introduce a small group multicast scheme, based on packet encapsulation, which uses a novel packet distribution tree construction algorithms for efficient data delivery. The tree is constructed with the goal of minimizing the overall bandwidth cost of the tree. Two construction algorithms, for a location-guided k-ary (LGK) tree and a location-guided Steiner (LGS) tree, utilize the geometric locations of the destination nodes as heuristics to compute the trees. They are accompanied by a hybrid location update mechanism to disseminate location information among a group of nodes. Our simulation results show that LGS tree has lower bandwidth cost than LGK tree when the location information of the nodes is up-to-date, and its cost is similar to that of an optimal Steiner multicast tree. When location information of the nodes is out-dated, LGK tree outperforms LGS tree due to its lower computational complexity.

A wireless MANET is a collection of wireless mobile hosts that dynamically create a temporary network without a fixed infrastructure. The topology of the network may change unpredictably and frequently. Therefore, multicast routing in ad hoc networks is a very challenging problem. This paper proposes a multi-constrained QoS multicast routing method using the genetic algorithm. The proposal will be flooding-limited using the available resources and minimum computation time in a dynamic environment. By selecting the appropriate values for parameters such as crossover, mutation, and population size, the genetic algorithm improves and tries to optimize the routes. Simulation results indicate its better performances compared to other methods.

A Mobile Ad hoc NETwork (MANET) is a collection of wireless mobile hosts that form a temporary network
without a centralized administration or wired infrastructure. Due to the high mobility of nodes, the network
topology of MANETs changes very fast, making it more difficult to find the routes that message packets use.
Network control with Quality of Service (QoS) support is a key issue for multimedia applications in MANET.
Most of the real time applications have stringent requirements on bandwidth, delay, delay-jitter, packet loss
ratio, cost and other QoS metrics. This paper proposes a Multi-constrained QoS routing with mobility
prediction protocol. If the node has enough resources to transmit data packets, it uses the Global
Positioning System (GPS) to get the location information of the mobile nodes and selects the routing path
with the maximum Route Expiration Time (RET). A set of static and mobile agents are used to find the
multicast routes and transmit the packets. Extensive simulations have been conducted to evaluate the
performance of MC_MAODV using Network Simulator (NS-2). The simulation results show that the
proposed protocol achieves good performance in terms of improving packet delivery ratio and minimizing
end-to-end delay.

Multicast streams are the most popular traffic pattern in many applications of mobile ad-hoc networks (MANET). However, the mobility of nodes causes frequent changes to the network topology and thus efficient routing of multicast traffic becomes very challenging. The establishment of a core-mesh has been deemed as a very effective solution for these dynamic setups. The core-mesh acts as a backbone in order to avoid frequent route discovery. However maintaining the core-mesh imposes significant overhead that dominates the performance for large networks. This paper advocates a novel methodology that combines network clustering and mesh-based multicast routing. The Cluster-Mesh based Multicast Routing (CMMR) methodology forms a backbone using cluster-heads. This makes the backbone more stable against frequent node mobility and enables scalability by limiting the scope of the core maintenance. The paper mainly captures the performance advantage of CMMR over contemporary node-based core-mesh strategies. A mathematical model is developed to analyze the average performance of one of the contemporary core-mesh routing schemes and an implementation of the CMMR methodology using the same mesh formation algorithm. The numerical results demonstrate the advantage of CMMR.

We present geographic multicast routing (GMR), a new multicast routing protocol for wireless sensor networks. GMR manages to preserve the good properties of previous geographic unicast routing schemes while being able to efficiently deliver multicast data messages to multiple destinations. It is a fully-localized algorithm (only needs information provided by neighbors) and it does not require any type of flooding

This paper considers the problem of grooming multicast traffic in WDM networks, with arbitrary mesh topologies. The problem is different from grooming of unicast traffic, since traffic can be delivered to destinations through other destinations in the same set, or through branching points. The paper presents an optimal Integer Linear Programming (ILP) formulation in order to minimize the cost of the network in terms of the number of SONET Add/Drop Multiplexers (ADM). The formulation also minimizes the number of wavelength channels used in the network, and does not allow bifurcation of traffic. Since the ILP formulation is able to solve limited size problems, the paper also introduces a heuristic approach to solve the problem.

In this paper the bases for the creation of the multicast routing protocol with traffic engineering characteristics (Pim-Dm/Sm-Te) is proposed. This protocol would consist of a series of modifications made to Pim-Dm/Sm multicast protocol to allow that this protocol makes load balancing and that this protocol serves like a source of information to resource reservation protocols. Initially, necessary definitions and