Cost Of Multicast Tree Research Articles

A Game-Theoretic Approach for Cost-Effective Multicast Routing in the Internet of Things

Internet of Things (IoT) devices have enabled communications in resource-limited computing environments. Sensor nodes from the multiple IoT devices collectively work for many applications, such as disaster management, border security management, smart farming, smart cities, etc. In such applications, the data from a single source node is often destined for multiple nodes. Multicast communication is preferred over unicast or broadcast communication for such applications, as multicast uses fewer resources. Efficient construction of the multicast tree leads to cost-effective multicast transmission. This article introduces a path selection game (PSGame), a game-theoretic approach that formulates the construction problem of the least-cost multicast tree as a potential game. Our proposed path selection algorithm (PSA) quickly converges to the pure Nash equilibrium (PNE), bringing the least cost multicast tree. Our findings show that the overhead incurred in terms of energy consumption and delay is minimal in the proposed algorithm compared to other mechanisms. The theoretical analysis proves that the proposed algorithm quickly converges to PNE in <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$O(n.r_{\max })$ </tex-math></inline-formula> steps. It also proves that the cost ratio between the proposed solution and the centralized optimum will be bounded by <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\log (n)$ </tex-math></inline-formula> . The numerical analysis substantiates the theoretical analysis.

A secure multicast routing algorithm Based on distributed PCE in multi-domain optical networks

Aiming at the calculation of secure multicast routing in multi-domain optical network, a new secure multicast routing algorithm based on distributed path calculation element was proposed. Firstly, the distributed PCE multicast routing model was constructed, and the intra-domain cost, inter-domain cost, maximum available wavelength and related constraints were defined. Secondly, the pheromone update strategy of ant colony algorithm with ant queen was locally simplified and modified to make it suitable for the distributed PCE architecture of multi-domain optical network. At the same time, by optimizing the trust value calculation method in the lightweight cross domain trust model, the algorithm can be applied to the calculation of trust value of multicast routing in multi domain optical networks. Finally, the specific implementation steps of the algorithm were given. The analysis and experimental results show that the algorithm can not only ensure the security of cross domain multicast routing, but also prevent the malicious nodes from destroying. Compared with the typical multicast routing algorithm, it has better performance in multicast tree cost and blocking rate in malicious node environment.

Delay-Optimized Multicast Tree Packing in Software-Defined Networks

In traditional networks, the multicast tree packing solutions usually aim to minimize the overall multicast tree cost, which can effectively improve network accommodation capacity but is disadvantageous to fully use network resources. In this paper, we propose a delay-optimized multicast tree packing problem called delivery delay minimized multicast tree packing (DDMMTP), which aims to minimize the average source-destination delay, under constraints on the bandwidth and maximum source-destination delay, according to available network resources. A low source-destination delay is desirable because it improves the service quality, especially for time-sensitive applications. In practice, the DDMMTP is highly valuable for the software-defined network (SDN) mainly because this new network paradigm has the ability to rapidly rearrange multicast routes on demand. The DDMMTP problem is NP-hard. We solve it approximately by a batched multicast tree packing algorithm and a network accommodation capacity improvement algorithm that adjusts existing multicast paths on demand. We also propose a source-destination delay improvement algorithm to further reduce source-destination delays based on new available network resources.

Multicast Routing Algorithms Based on Levy Flying Particle Swarm Optimization

Aiming at the problems of bandwidth, network delay and cost in IPv6 multicast routing transmission, a particle swarm optimization multicast routing algorithm (LPSO) based on Levy flight mechanism is proposed to find the optimal path in the multicast tree. In the iteration process, the cost, bandwidth, delay and delay jitter of multicast tree are taken as indexes, and penalty function is combined to constrain the algorithm. Compared with existing multicast routing algorithms, this algorithm improves the global search and meets the requirements of QoS in multicast routing.

Q-CAR: an intelligent solution for joint QoS multicast routing and channel assignment in multichannel multiradio wireless mesh networks

Multicast routing improves the efficiency of a network by effectively utilizing the available network bandwidth. In multichannel multiradio wireless mesh networks the channel allocation strategy plays a vital role along with multicast tree construction. However, the multicast routing problem in multichannel multiradio wireless mesh networks is proven to be NP-hard. With this paper, we propose a Quality of Service Channel Assignment and multicast Routing (Q-CAR) algorithm. The proposed algorithm jointly solves the channel assignment and multicast tree construction problem by intelligent computational methods. We use a slightly modified differential evolution approach for assigning channels to links. We design a genetic algorithm based multicast tree construction strategy which determines a delay, jitter bounded low cost multicast tree. Moreover, we define a multi objective fitness function for the tree construction algorithm which optimizes interference as well as tree cost. Finally, we compare the performance of Q-CAR with QoS Multicast Routing and Channel Assignment(QoS-MRCA) and intelligent Quality of service multicast routing and Channel Assignment(i-QCA) algorithm in multichannel multiradio wireless mesh network (simulated) environments. Our experimental results distinctly show the outstanding performance of the proposed algorithm.

Cost-effective multicast routings in wireless mesh networks with multiple gateways

In order that multicast routing characteristics is reflected in wireless mesh networks, multicast routing metric is required for quantifying the multicast tree cost under wireless environments. This paper proposes a new multicast routing metric considering receiver's different characteristics of link quality on a wireless multicast channel as well as wireless multicast advantage. The proposed multicast-tree transmission ratio quantifying the multicast tree cost represents the product of the multicast transmission ratios of all nodes in the constructed multicast tree. In this paper, we also propose a wireless multicast routing which constructs the multicast tree by maximizing the multicast-tree transmission ratio in wireless mesh networks with multiple gateways and design the multicast routing protocol based on AODV protocol. Since the multicast tree by our wireless proposed routing algorithm contains the nodes having maximum multicast-node transmission ratio, our proposed multicast routing shows a higher delivery ratio and a lower average delay than original multicast AODV and the multicast routing with minimizing the forwarding nodes in its multicast tree. In comparison with other multicast routings, simulation results show that the proposed multicast heuristics maximizing the multicast-tree transmission ratio construct a cost-effective multicast tree in terms of its delivery ratio, average delay, and required network resources.

Multicast Routing Algorithm of Network Lifetime

MaxNLMRGA (Max Network-Lifetime Multicast Routing Algorithm based on Genetic algorithm) for the NLMR (Network-Lifetime Multicast Routing) problem was presented. The genetic operators of this algorithm reduce the transmission cost and energy consumption of multicast trees, and mutation operator prolongs the network lifetime, thus accelerating the convergence speed of the algorithm. Experiment results show that the multicast tree found by this algorithm not only has the minimum transmission cost, but also has the longest network lifetime. Furthermore, this algorithm converges quickly.

DCEEMR: A Delay-Constrained Energy Efficient Multicast Routing Algorithm in Cognitive Radio Ad Hoc Networks

We discuss the delay-constrained energy efficient multicast routing problem in cognitive radio ad hoc networks. A cognitive radio ad hoc network is a wireless multihop network established by secondary users on varying available spectrum bands. The research on routing is a hot topic in the field of cognitive radio ad hoc networks. However, multicast routing algorithm study of cognitive radio ad hoc networks is still at its start stage. In this paper, we proposed a novel delay-constrained energy efficient multicast routing algorithm (DCEEMR) in cognitive radio ad hoc networks. The DCEEMR guarantees that the multicast tree can be found if it exists, and the multicast tree satisfies the delay bound and has low energy consumption. The algorithm uses delay-energy function to construct the multicast tree based on the spectrum selection. Through an example with random network topology, we demonstrate that our algorithm is better in terms of energy cost of multicast tree as compared to the existing algorithm QoS dependent multicast routing (QDMR). Moreover, the algorithm does not suffer from high complexity common to the algorithm QDMR. Experiment results by NS-2 show that the delay and cost of tree are lower than well-known multicast ad hoc on-demand distance vector (MAODV) protocol.

A New Delay-Constrained Multicast Routing Algorithm Based on Shared Edges

In this paper, we made a detail analysis for the ESAMPH algorithm, and proposed ESAMPH_D algorithm according to the insufficient of ESAMPH algorithm. The ESAMPH_D algorithm does not consider those paths that do not satisfy the delay constraint, so we can ensure that all paths be taken into account will meet the limit of delay constraint, then we find the least costly path in order to build a minimum cost multicast tree. Simulation results show that the algorithm is better than ESAMPH algorithm in performance.

A Multi-Objective Optimization Approach for Joint Channel Assignment and Multicast Routing in Multi-Radio Multi-Channel Wireless Mesh Networks

Multicast routing is an effective mechanism for delivering data to a group of receivers. Due to intrinsic property of air medium in wireless mesh networks (WMN), interference is an important issue in determining the data rate for multicast services. Interference reduction is handled by assigning multiple orthogonal channels to multiple radios in multi-radio multi-channel WMNs. Channel assignment is known to be a NP-complete problem. Most prior methods have solved multicast routing and channel assignment problems sequentially and have not considered the interplay between these two problems. Focusing on this issue, we address joint channel assignment and routing problem for multicast applications. In this paper, a novel technique based on a multi-objective genetic algorithm is proposed to build a delay constrained minimum cost multicast tree with minimum interference. We have examined the proposed algorithm on different network configurations. Experimental results demonstrate that our method finds better trees in terms of cost, delay, and interference compared to prior methods.

Performance evaluation of multisource Application Layer Multicast (ALM): Theoretical and simulative aspects

Multisource ALM routing protocol is an indispensable mechanism for efficient distribution of data from many sources to many receivers. The growing of Internet multimedia applications (e.g. videoconference and multiparty online game) which demand large network resources and call for multisource multicasting, has explicitly developed the necessity of an effective method to evaluate and compare the efficiency of various multisource multicast routings. We define a routing cost to be the total number of underlying hops traversed by multicast data over a multicast delivery tree. This study explores a multiplicative property to obtain the minimum cost of various multisource ALM routing protocols by simply multiplying the number of sources to the minimum cost in the single-source multicast. From theoretical and simulative studies, the multiplicative property has been proven through examining the minimum cost of multisource multicast delivery trees constructed by different multisource ALM routing protocols with source-specific tree (SST), core-based group-shared tree (GST-C) and bidirectional group-shared tree (GST-B), which are employed in the design of multisource ALM routing protocols.

Shortest Path First to Optimize the Optical Multicast Routing Cost and Wavelength Consumption for WDM Network

Due to optical node light splitting constraint, the minimal cost optical multicast routing tree is an important issue solved normally by bypassing the nodes which violate splitting capability with a good few route cost or consuming more wavelength channel. The method of shortest path first to re-route the contending optical packet to destination nodes is presented for optimization the re-route cost and wavelength consumption in the paper. The minimal cost multicast tree is used first to search the tree overlaying the source node and all destination. Then, the shortest path first is designed to bypass the nodes on the tree which violate the light-splitting constraint with the minimal re-route cost increment for the optical multicast. According to the wavelength consumption cost factor, the wavelength consumption cost increment is calculated if the new wavelength channel is assigned for the tree nodes violating the light-splitting. Lastly, by comparing re-routing path multicast cost increment with the new assignment wavelength consumption cost increment, a minimal cost multicast routing is determined for the optical network with some nodes light splitting constraint. Furthermore, according to the actual network available wavelength scarcity, the wavelength consumption cost factor can be increased. Simulation results show that the proposed algorithm can achieve the optimal low-cost multicast tree and few wavelengths consumption also.

Multicast Routing in Multi-Radio Multi-Channel Wireless Mesh Networks

In this paper, we tackle the multicast problem with the consideration of the interference between multicast trees in multi-radio multi-channel wireless mesh networks (MR-MC WMNs). We consider a dynamic traffic model, i.e., multicast session requests arrive dynamically without any prior knowledge of future requests. Each node in the network acts as a Transit Access Point (TAP), and has one or multiple radios tuned to non-overlapping channels. We prove that in MRMC WMNs, the minimum cost multicast tree (MCMT) problem, i.e., finding the multicast tree with minimum transmission cost, is NP-hard. We then formulate the problem by an Integer Linear Programming (ILP) model to solve it optimally, and propose a polynomial-time near-optimal algorithm, called Wireless Closest Terminal Branching (WCTB), for the MCMT problem. To alleviate the interference between multicast trees (sessions), we present a polynomial-time algorithm that computes the minimum interference minimum cost path in MR-MC WMNs, and integrate it into WCTB without altering the performance bound of WCTB on the tree cost. The experimental study shows that the tree cost produced by WCTB is very close to the optimal and that the proposed algorithm for interference alleviation is effective. To the best of our knowledge, this is the first paper that studies the MCMT problem in MR-MC WMNs.

Placement of wavelength converters and light splitters in a WDM network using the generic graph model

Previous studies on the placement issue mainly focus on the availability of wavelength converters or light splitters on each node and normally the placement of wavelength converters and light splitters are considered in isolation. In this paper, by extending our previous work on the generic graph model, we study the placement of wavelength converters and light splitters as well as how their capabilities will affect the cost efficiency and performance in a holistic manner. In our study, both the sparse and limited capability strategies are considered, so is the coexistence of both wavelength converters and light splitters in the same network. The dynamic multicast traffic model is used for the simulation study. Four proposed algorithms, namely, WCF-I, WCF-D, LSF-I and LSF-D, for finding the optimal configuration of wavelength converters and light splitters are studied. The configuration includes information on the availability as well as the capability (and limitation) of the devices on each node in the network. Three metrics: cost efficiency (CE), request blocking probability (RBP) and average multicast tree cost (AMTC) are used to compare the different algorithms. All of the proposed algorithms manage to find a placement configuration with higher CE and comparable RBP, compared to the case of wavelength converters and light splitters having full capability of wavelength conversion and light splitting on all the nodes. From the results, we conclude that the presence of wavelength converters contributes more to improving the cost efficiency than the presence of light splitters when traffic load is not high. We also conclude that the sparse strategy has more impact on the performance than the limited strategy. In addition, our results led us to believe that the configuration that is obtained for a specific traffic load is not necessary the optimal configuration for other traffic loads.

Delay-constrained multicast routing algorithm based on shared edges

In order to optimize cost and decrease time complexity,the delay-constrained Steiner tree problem was discussed. The implementation of Minimum Path Heuristic (MPH) algorithm was analyzed firstly,then a delay-constrained multicast routing algorithm based on shared edges named ESAMPH was presented. ESAMPH preferentially selected the nodes through which more shortest path was contained when constructing a multicast routing tree,therefore,the next node to the multicast tree may be also the shortest path through these nodes to reduce the cost of multicast tree. Simulation results show that ESAMPH balances cost,delay and computing time and has better overall performance.

Multicast QoS Core-Based Tree Routing Protocol and Genetic Algorithm Over an HAP-Satellite Architecture

In this paper, a quality-of-service (QoS) multicast routing protocol, i.e., the core-based tree based on heuristic genetic algorithms (GAs), has been implemented and applied over a high-altitude platform (HAP)-satellite platform. The proposed multicast routing algorithm is called the constrained cost-bandwidth-delay GA (CCBD-GA). To achieve a better optimization of the multicast tree cost, a new algorithm called HULK-GA, which is based on the GA and on a proposed broadcast metric, has been developed. Finally, an algorithm called hybrid cost-bandwidth-delay GA has been proposed, taking into account both CCDB-GA and HULK-GA characteristics to obtain an overall algorithm that can consider QoS routing constraints and minimize the overall cost per link of the considered multicast tree. The joint bandwidth-delay metrics can be very useful in hybrid platforms such as the platform considered, because it is possible to take advantage of the single characteristics of the satellite and HAP segments. The HAP segment offers low propagation delay, permitting QoS constraints based on maximum end-to-end delay to be met. The satellite segment, instead, offers a larger footprint but higher propagation delay. The joint bandwidth-delay metric permits the traffic load to be balanced, respecting both QoS constraints.

Optimizing Patching‐based multicast for video‐on‐demand in wireless mesh networks

AbstractIn this work, we study the application of video‐on‐demand (VoD) in wireless mesh networks (WMN), a next generation edge technology to provide broadband data access in residential, business and even city‐wise networks. We adopt a Patching‐based multicast technique to better utilize the bandwidth resources in the mesh network. We optimize the Patching‐based multicast by addressing two critical problems, namely, the Minimum Cost Multicast Tree (MCMT) problem and the Maximum Benefit Multicast Group (MBMG) problem. The MCMT problem is to find a MCMT in the network. We show that finding such a tree in the WMN can be formulated as a graph theory problem, which is to find the tree with minimum number of non‐leaf nodes, and which spans all the nodes in the multicast group. We further prove the problem is NP‐hard and propose a fast greedy algorithm to accommodate the real‐time feature of the VoD application. We solve the MBMG problem by minimizing the communication of a Patching group in the entire network. A Markov model is proposed to capture the growth of the multicast group in the WMN. Simulation study results validate the proposed solutions of the two problems. Copyright © 2009 John Wiley &amp; Sons, Ltd.

Delay-constrained minimum cost multicast tree algorithm

Based on the Random Selective Tree Node First (RSTF) algorithm that constructs minimum cost multicast tree and considering the delay of the network, this paper presented a new algorithm constructing delay-constrained minimum cost multicast tree. The simulation about random network model shows that compared with KPP the new algorithm has better performance in terms of cost and time delay.

A multipopulation parallel genetic simulated annealing-based QoS routing and wavelength assignment integration algorithm for multicast in optical networks

In this paper, we propose an integrated Quality of Service (QoS) routing algorithm for optical networks. Given a QoS multicast request and the delay interval specified by users, the proposed algorithm can find a flexible-QoS-based cost suboptimal routing tree. The algorithm first constructs the multicast tree based on the multipopulation parallel genetic simulated annealing algorithm, and then assigns wavelengths to the tree based on the wavelength graph. In the algorithm, routing and wavelength assignment are integrated into a single process. For routing, the objective is to find a cost suboptimal multicast tree. For wavelength assignment, the objective is to minimize the delay of the multicast tree, which is achieved by minimizing the number of wavelength conversion. Thus both the cost of multicast tree and the user QoS satisfaction degree can approach the optimal. Our algorithm also considers load balance. Simulation results show that the proposed algorithm is feasible and effective. We also discuss the practical realization mechanisms of the algorithm.

Distributed reformation of core-based group-shared multicast trees in mobile ad hoc networks

This paper proposes a method to reduce the cost of a core-based group-shared multicast tree, where the cost is evaluated by the total bandwidth consumption of multicasting packets among all group members. Due to the broadcast nature of radio transmissions, we find that the challenge of determining minimum cost multicast tree can be approximated by finding the multicast tree with a minimum number of non-leaves (the minimum non-leaf multicast tree problem). However, we also find that the minimum non-leaf multicast tree problem is NP-complete. Thus, a method is proposed to dynamically reduce the number of non-leaves in an existing multicast tree. Experimental results show that our method reduces the cost of the multicast tree in both geometrically and randomly distributed network models and the random waypoint mobility model.