Dynamic Multicast Routing Algorithm Research Articles

Research on Several Multicast Routing Algorithms

This paper first describes the dynamic multicast routing and routing optimization standard, then puts forward the RPL protocol based energy efficient DODAG multicast routing algorithm. Through simulation experiments, we can compare and analyze the advantages and disadvantages of several kinds of dynamic multicast routing algorithm. And according to the simulation results obtained conclusion, EE - DODAG multicast in the process of each packet sent after more a small amount of forwarding nodes, and consume less energy in survival time.

Several Non-Rearranged Dynamic Multicast Routing Algorithms

In this paper, dynamic multicast routing and routing optimization criteria have been described.By comparing and analyzing the advantages and disadvantages of several non-rearranged dynamic multicast algorithms, the advantages of the non-rearranged dynamic multicast routing algorithm based on the delay constraint have been further confirmed and a conclusion has been drawn by performance testing.

A Multiple Constrained QoS Routing Algorithm for the Wireless Sensor Networks

Routing problem is one of the most important issues to a wireless sensor network (WSN). It is the key problem to find an efficient energy strategy for prolonging network's lifetime because power supply might be impossible. This paper discusses the multicast routing problem of WSN with multiple QoS constraints, which may deal with the delay, bandwidth, hop count and packet reception rat and surplus energy metrics, and finds a minimum resource consumption path while satisfying multiple constraints optimization conditions, and describes a network model for researching the multicast routing problem. It presents a dynamic multicast routing algorithm with multiple QoS constraints (MCQoSRA). The MCQoSRA successfully solves the QoS routing problems when multicast nodes change dynamically in the networks. The MCQoSRA only requires the local state information of the link (or node), but does not require any global network sate to be maintained. In MCQoSRA, a multicast group member can join or leave the multicast session dynamically. The MCQoSRA can effectively decrease the overhead for constructing a multicast tree and the delay of the nodes, and improve the success ratio of seeking links. Simulation results show that the MCQoSRA provides an available means to implement multicast routing, and adapt to all kinds of the topology networks, and have better expansibility.

Integrated multicast routing algorithms considering traffic engineering for broadband IPTV services

Abstract With the rapid growth of broadband network deployment and multimedia streaming development, Internet protocol (IP) multicast networks have become a delivery mechanism for Internet protocol television (IPTV). IPTV provides a two-way interactive service to the viewers, which generates the path request for IP multicast network. Thus, it is essential to evaluate the path rejection probability accurately and further to reduce it. In this paper, we propose a new dynamic multicast routing algorithm for broadband IPTV services and apply it to three legacy algorithms. These integrated multicast routing algorithms support the minimum cost and the traffic engineering features, in order to maximize the acceptance rate for bandwidth constraint path request under IPTV service environments. Furthermore, we compare their network performances in terms of the acceptance rate and delay by experimental simulations. The simulation result gives us that the nearest node first Dijkstra algorithm can be the optimal solution of multicast connection for IPTV service delivery.

On Dynamic Multicast Traffic Provisioning with Grooming Capabilities Support in Light-Trail Networks

In recent years, because of the popularity of Internet and the rapid growth of multimedia applications, the requirements of bandwidth from users increase violently in optical networks. Various multicast multimedia services also bring challenges to next generation optical networks. As the rapid advance of DWDM, the bandwidth of a single fiber link is significantly improved. However, the traditional circuit switching architecture, lightpath, has the disadvantage with lower bandwidth utilization of a single wavelength. Light-trail has been proposed as an efficient solution to support optical networks. Compared with lightpath approach, a light-trail can achieve fast provisioning for multiple connections without optical switching. The support of sub-wavelength granularity in light-trial network increases the utilization of wavelength bandwidth effectively. The most distinctive feature is that light-trail allows multiple node access, so it possesses natural multicasting capability inherently. In a light-trail, the single send by one node will be received by the downstream nodes. In other words, light-trail has the advantage of natural multicasting. Furthermore, incorporating traffic grooming into light-trail, it can obviously become a strong candidate to support multicasting and multi-granularity bandwidth demands in the future. In this article, we propose a dynamic multicast routing algorithm with traffic grooming consideration in light-trail networks, named Dynamic Light-Trail-based Multicast Routing algorithm (DLTMR). For static traffic, we use a set of ILP formulations to calculate the optimal solution for minimizing the number of established light-trails. In the simulation, we use various network topologies and variant limitation of network resource to verify that DLTMR can efficiently improve blocking performance in the light-trail networks.

Dynamic Routing Algorithm Based on HIP Multicast Model

A HIP multicast mode; based dynamic multicast routing algorithm (HIPDMR) was brought out and network model was established to describe and simplify problem to be researched. HIPDMR used Bellman-Ford as routing search algorithm, which can determine dynamic multicast routing with minimum hop number and overhead while meet constraints of bandwidth, delay, jitter and packet loss rate. Simulation experiments result show that HIPDMR can build dynamic multicast routing under constraints of multiple QoS comparing with algorithms that not considering QoS assuming network node output link capacity be equal

A distributed multicast routing algorithm for real-time applications in wide area networks

The problem of constructing a minimal cost multicast routing tree (MRT) with delay constraints in wide area networks (WAN) is considered. A new distributed token-passing based algorithm that constructs a sub-optimal MRT satisfying given delay constraints for all members in the multicast group is presented. In contrast with the previous works by Jia [A distributed algorithm of delay-bounded multicast routing for multimedia applications in wide area networks, IEEE/ACM Trans. Network. 6 (1998) 828–837] and several others [Y. Im, Y. Lee, S. Wi, Y. Choi, Delay constrained distributed multicast routing algorithm, Comput. Comm. 20 (1997) 60–66; X. Jia, Y. Zhang, N. Pissinou, K. Makki, A distributed multicast routing protocol for real-time multicast applications, Comput. Networks 31 (1999) 101–110; Q. Sun, H. Langendorfer, A distributed delay-constrained dynamic multicast routing algorithm, Telecommun. Systems 11 (1999) 47–58], in which cycles may occur, we show that the multicast routing network produced by our algorithm is indeed a tree, namely, cycle free. Also the success rate of our algorithm to find a feasible solution, if one exists, is guaranteed to be 100%, while Jia's algorithm is not. Furthermore, our algorithm is fault tolerant and can also adapt to cases where the multicast group members are allowed to join or leave the multicast session dynamically. Simulations have been conducted and the results show that the MRT generated by our algorithm has better performance compared to previous methods.

Dynamic multicast routing algorithm for delay and delay variation-bounded Steiner tree problem

The delay and delay variation-bounded Steiner tree problem is an important problem in real-time multimedia networks, and is known to be NP-complete. In this paper, we propose an efficient heuristic multicast routing algorithm based on simulated annealing named SADDVMA to construct the constrained Steiner tree. To avoid enlargement of search area and increase of computing time, the proposed heuristic algorithm uses a procedure called Paths-switching to construct neighbors in feasible region according to the relationship between delay and delay variation. We also give a method to dynamically reorganize the multicast tree in response to changes for the destinations. Simulations demonstrate that our algorithm is better in terms of tree cost as compared to the existing algorithms. Further, it performs excellent performance of delay and delay variation, rapid convergence and better real-time property.

On multicast routing for wavelength-routed WDM networks with dynamic membership

Future broadband networks must support integrated services and offer flexible bandwidth usage. In our previous work in [1], we explored the optical link control (OLC) layer on the top of optical layer that enables the possibility of bandwidth on-demand (BoD) service directly over wavelength division multiplexed (WDM) networks. Today, more and more applications and services such as video-conferencing software and Virtual LAN service require multicast support over the underlying networks. Currently, it is difficult to provide wavelength multicast over optical switches without optical/electronic conversions although the conversion takes extra cost. In this paper, based on the proposed wavelength router architecture (equipped with ATM switches to offer O/E and E/O conversions when necessary), a dynamic multicast routing algorithm is proposed to furnish multicast services over WDM networks. The goal is to join a new group member into the multicast tree so that the cost, including the link cost and the optical/electronic conversion cost, is kept as low as possible. The same algorithm can be applied to other wavelength routing architectures with redefinition of electronic copy cost. The effectiveness of the proposed wavelength router architecture as well as the dynamic multicast algorithm is evaluated by simulation.

A Delay-Constrained Least-Cost Multicast Routing Heuristic for Dynamic Multicast Groups

Many new multimedia applications involve dynamic multiple participants, have stringent end-to-end delay requirement and consume large amount of network resources. In this paper, we propose a new dynamic delay-constrained least-cost multicast routing algorithm (DDCLCMR) to support these applications. When group membership changes, the existing multicast tree is perturbed as little as possible. Simulation results show that DDCLCMR performs very well in terms of cost for both, static and dynamic multicast groups, when compared to the best multicast algorithms known. Our evaluation of the cost performance of the algorithms showed that DDCLCMR is always within 10% from BSMA which has the best cost performance among all the proposed delay-constrained static multicast heuristics, while NAIVE, the well-known dynamic multicast routing algorithm, is up to 70% worse than BSMA in some cases.

Modified Least Load Multicast Routings for Single Rate Fully-Connected Loss Networks

In this paper, we investigate the dynamic multicast routing problem and briefly discuss the common dynamic multicast routing algorithm called Least Load Multicast Routing (LLMR). We propose two new multicast routing algorithms called Least Load Multicast Routing with Maximum Occupied Circuits (LLMRMOC) and Least Load Multicast Routing with Minimum Measured Blocking Time (LLMRMMBT), both of which are based on LLMR. Simulation results show that these algorithms, compared with LLMR, not only produce a smaller network revenue loss, but also result in smaller call blocking probabilities for all classes of traffic. The moderate gain in the network performance comes only a slight additional cost. The implementation issues of the proposed algorithms are also discussed.

A DISTRIBUTED DYNAMIC HEURISTIC FOR DELAY-CONSTRAINED LEAST-COST MULTICAST ROUTING

Many new distributed multimedia applications involve dynamic multiple participants, have stringent end-to-end delay requirement and consume large amount of network resources. In this paper, we propose a new distributed dynamic delay-constrained least-cost multicast routing algorithm (DDDCLCMR) to support these applications. DDDCLCMR scales well because the source of the multicast tree needs only limited computation or may even not be involved in the route computation. When group membership changes, the existing multicast tree is perturbed as little as possible. Simulation results show that DDDCLCMR performs very good in terms of delay and cost for both, static and dynamic multicast groups, when compared to the best multicast algorithms known.

Dynamic multicast routing based on mean number of new calls accepted before blocking for single rate loss networks

In this paper, we investigate the dynamic multicast routing problem for single rate loss network and briefly discuss the dynamic multicast routing algorithm called least load multicast routing (LLMR). We propose a new multicast routing algorithm called maximum mean number of new calls accepted before blocking multicast routing (MCBMR), which can more accurately capture the current and future loading of a network. Simulation results show that this algorithm, compared with LLMR, not only has a smaller network revenue loss, but also results in smaller call blocking probabilities for all classes of traffic. We also discuss the implementation issues of our proposed algorithm and develop two approximation methods, state approximation and curve fitting, which can reduce the measurement complexity significantly with only a slight performance degradation.

Analysis of the performance of dynamic multicast routing algorithms

In this article, three new dynamic, low delay multicast routing algorithms based on the greedy tree technique are proposed; Source Optimised Tree (SOPT), Topology based Optimisation Tree (TOPT) and Minimum Diameter Tree (MDT). A simulation analysis is presented showing the various performance aspects of the algorithms, in which a comparison is made with the greedy and Core Based Tree (CBT) techniques. The effects of the tree source location on dynamic membership change are also examined. The simulations demonstrate that the SOPT algorithm achieves a significant improvement in terms of delay and link usage when compared to the CBT, and the greedy algorithm.

A distributed delay-constrained dynamic multicast routing algorithm

Many new distributed multimedia applications involve dynamic multiple participants, have stringent end-to-end delay requirement and consume large amount of network resources. In this paper, we propose a distributed delay-constrained dynamic multicast routing algorithm (DCDMR) to support these applications. DCDMR scales well because the source of the multicast tree needs only limited computation or may even not be involved in the route computation. When group membership changes, the existing multicast tree is perturbed as little as possible and the resulting tree cost performance is very satisfactory.