scholarly journals Longest Path Reroute to Optimize the Optical Multicast Routing in Sparse Splitting WDM Networks

2015 ◽  
Vol 2015 ◽  
pp. 1-6 ◽  
Author(s):  
Huanlin Liu ◽  
Hongyue Dai ◽  
Fei Zhai ◽  
Yong Chen ◽  
Chengying Wei
Keyword(s):  
Cost Control ◽  
Heuristic Algorithms ◽  
Multicast Routing ◽  
Low Cost ◽  
Routing Algorithm ◽  
Wdm Networks ◽  
Multicast Tree ◽  
Control Factor ◽  
Wavelength Channel ◽  
Longest Path

Limited by the sparse light-splitting capability in WDM networks, some nodes need to reroute the optical packet to different destination nodes with the high cost of routing for reducing packet loss possibility. In the paper, the longest path reroute optimization algorithm is put forward to jointly optimize the multicast routing cost and wavelength channel assignment cost for sparse splitting WDM networks. Based on heuristic algorithms, the longest path reroute routing algorithm calls multiple longest paths in existing multicast tree to reroute the path passing from the nodes which are violating the light-splitting constraint to the nodes which are not violating light-splitting constraint with few wavelength channels and low rerouting cost. And a wavelength cost control factor is designed to select the reroute path with the lowest cost by comparing the multicast rerouting path cost increment with the equivalent wavelength channel required cost increment. By adjusting wavelength cost control factor, we can usually get the optimized multicast routing according to the actual network available wavelength conversion cost. Simulation results show that the proposed algorithm can get the low-cost multicast tree and reduce the required number of wavelength channels.

A FAST HYBRID ALGORITHM FOR MULTICAST ROUTING IN WIRELESS NETWORKS

2007 ◽  
Vol 16 (01) ◽  
pp. 45-68 ◽  
Author(s):  
S. AL-SHARHAN ◽  
W. GUEAIEB
Keyword(s):  
Wireless Networks ◽  
Hybrid Algorithm ◽  
Heuristic Algorithms ◽  
Multicast Routing ◽  
Learning Algorithm ◽  
Population Based ◽  
Multicast Tree ◽  
Recent Developments ◽  
Real Challenge

This paper tackles the issue of constrained multicast routing in wireless networks using a hybrid soft computing-based algorithm. Recent developments in multimedia applications and the dynamic and rapidly changed environment of the wireless networks make the constrained multicast routing a real challenge. The problem can be formulated as minimizing a multicast tree cost under several constraints or Quality of Service (QoS) metrics. This problem has been proven to be NP-complete. The proposed hybrid algorithm is based on a population based incremental learning algorithm that combines in an efficient way the features of genetic algorithms and competitive learning. Experimental results show that, in most cases, the proposed algorithm yields better solutions than other heuristic algorithms proposed in the literature.

A Multicast Routing Algorithm with Cost, Delay and Bandwidth Constraints

2013 ◽  
Vol 756-759 ◽  
pp. 1850-1854
Author(s):  
Yuan Chen Li ◽  
Guo Fang Kuang
Keyword(s):  
Communication Networks ◽  
Multicast Routing ◽  
Routing Algorithm ◽  
Multicast Tree ◽  
Routing Problem ◽  
Qos Parameters ◽  
The Cost ◽  
Multicast Routing Algorithm ◽  
Multiple Qos

Quality of service (QoS) generally assumes more than one QoS measure which implies that routing can be categorized as an instance of routing subject to multiple constraints: such as cost, delay, bandwidth, etc. The problem of constructing multicast trees is studied to meet the QoS requirements where it is necessary to provide bounded constraints among the source and all destinations while keeping the cost of the multicast tree low. So, a kind of source-destination QoS multicast routing problem is addressed about communication networks. The algorithm we presented takes bandwidth, delay and loss rate as premise, constructs routing selected function based on shortest path, modifies selected path according to the function above so as to fit multi-QoS parameters. Simulation results show that the algorithm has both lower delay and better performance and can be extended to cases of multiple QoS parameters conveniently.

A Multiple Constrained QoS Routing Algorithm for the Wireless Sensor Networks

2013 ◽  
Vol 347-350 ◽  
pp. 553-558
Author(s):  
Ze Shun Zhou ◽  
Yi Xu ◽  
Jun Jie Yan ◽  
Zhong Wei Nie ◽  
La Yuan Li
Keyword(s):  
Multicast Routing ◽  
Routing Algorithm ◽  
Qos Routing ◽  
Multicast Tree ◽  
Global Network ◽  
Wireless Sensor ◽  
Hop Count ◽  
Routing Problem ◽  
Multiple Qos Constraints ◽  
Multiple Qos

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.

scholarly journals An Optical Multicast Routing with Minimal Network Coding Operations in WDM Networks

2014 ◽  
Vol 2014 ◽  
pp. 1-7 ◽  
Author(s):  
Huanlin Liu ◽  
Qinren Shen ◽  
Yong Chen
Keyword(s):  
Network Coding ◽  
Multicast Routing ◽  
Routing Algorithm ◽  
Wdm Networks ◽  
The Other ◽  
Optical Wdm Networks ◽  
Optical Wdm ◽  
Optical Multicast ◽  
Multicast Routing Algorithm ◽  
Maximal Capacity

Network coding can improve the optical multicast routing performance in terms of network throughput, bandwidth utilization, and traffic load balance. But network coding needs high encoding operations costs in all-optical WDM networks due to shortage of optical RAM. In the paper, the network coding operation is defined to evaluate the number of network coding operation cost in the paper. An optical multicast routing algorithm based on minimal number of network coding operations is proposed to improve the multicast capacity. Two heuristic criteria are designed to establish the multicast routing with low network coding cost and high multicast capacity. One is to select one path from the formerKshortest paths with the least probability of dropping the multicast maximal capacity. The other is to select the path with lowest potential coding operations with the highest link shared degree among the multiple wavelength disjoint paths cluster from source to each destination. Comparing with the other multicast routing based on network coding, simulation results show that the proposed multicast routing algorithm can effectively reduce the times of network coding operations, can improve the probability of reaching multicast maximal capacity, and can keep the less multicast routing link cost for optical WDM networks.

Tabu Search for Low-Cost Dynamic Multicast Tree Generation with Quality of Service Guarantees

2015 ◽  
Vol 24 (4) ◽  
pp. 479-489
Author(s):  
Muhammad Atif Tahir ◽  
Asif Jamshed ◽  
Habib-ur Rehman ◽  
Yassine Daadaa
Keyword(s):  
Quality Of Service ◽  
Tabu Search ◽  
Multicast Routing ◽  
Low Cost ◽  
Multicast Tree ◽  
Source Node ◽  
Delay Constraint ◽  
Routing Problem ◽  
Dynamic Multicast

AbstractIn a communication network with a source node, a multicast tree is defined as a tree rooted at the source node and all its leaves being recipients of the multicast originating at the source. The tree or bandwidth cost is normally measured by its utilization of tree links along with the quality of service (QoS) measures such as delay constraint and end-to-end delay. However, if nodes are allowed to join or leave the multicast group at any time during the lifetime of the multicast connection, then the problem is known as dynamic multicast routing problem. In this article, we combine a greedy approach with static multicast routing using Tabu Search to find a low-cost dynamic multicast tree with desirable QoS parameters. The proposed algorithm is then compared with several static multicast routing algorithms. The simulation results show that, on a large number of events, i.e., where nodes are leaving or joining, the proposed algorithm is able to find multicast trees of lower cost and more desirable QoS properties.

A Multicast Routing to Improve Multicast Capacity with Minimal Network Coding Cellsin WDM Networks

2014 ◽  
Vol 35 (4) ◽  
Author(s):  
Huanlin Liu ◽  
Bangtao Zhou ◽  
Yong Chen
Keyword(s):  
Network Coding ◽  
Multicast Routing ◽  
Routing Algorithm ◽  
Wdm Networks ◽  
Minimal Network ◽  
Optical Wdm ◽  
Optical Multicast ◽  
Operation Costs ◽  
All Optical ◽  
Multicast Routing Algorithm

AbstractMulticast routing based on network coding can save large wavelength channels with high network coding operation costs for the all-optical WDM network. An optical multicast routing algorithm based on minimum network coding cells to reach the multicast max-flow is proposed in the paper. The algorithm selects path in the

scholarly journals Multi Criterion Multicast Routing Algorithm Comparison for Large Networks

2017 ◽  
Vol 22 (1) ◽  
pp. 49-56
Author(s):  
Krzysztof Stachowiak
Keyword(s):  
Heuristic Algorithms ◽  
Multicast Routing ◽  
Routing Algorithm ◽  
Network Size ◽  
Steiner Tree Problem ◽  
Simulation Techniques ◽  
Wide Range ◽  
Algorithm Comparison ◽  
Minimum Steiner Tree Problem ◽  
Small Models

Abstract QoS enabled multicast routing is known to be of non-polynominal complexity, which leads to the necessity of using heuristic algorithms to find sub-optimal solutions to the problems of this class. The evaluation of such algorithms requires the use of the simulation techniques as the heuristics’ results are of stochastic nature. Because of the problem complexity the simulation times increase significantly in the function of the network size, therefore the results presented in the literature are often limited to only small models. In this article the results of the evaluation of different multicast QoS routing algorithms (further referred to as the Multi-Constrained Minimum Steiner Tree Problem - MCMST) have been presented for a wide range of network sizes reaching thousands of nodes.

Sign in / Sign up

Export Citation Format

Share Document