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.

A Delay-Constrained Multicast Routing Balanced-Optimization Algorithm of Link-Sharing

2012 ◽  
Vol 152-154 ◽  
pp. 1834-1839
Author(s):  
Wei Qun Liu ◽  
Xiang Kui Chen
Keyword(s):  
Computational Complexity ◽  
Multicast Routing ◽  
Routing Algorithm ◽  
Shortest Paths ◽  
Multicast Tree ◽  
Selection Function ◽  
Minimum Delay ◽  
The Cost ◽  
Balanced Optimization

In multimedia network, Quality of service (QoS) provisioning generally assumes more than one QoS measure which implies that QoS routing can be categorized as an instance of routing subject to multiple constraints: delay, cost, bandwidth, etc. We study the problem of constructing multicast trees to meet the QoS requirements of real-time applications where it is necessary to provide bounded delays among the source and all destinations while keeping overall cost of the multicast tree low. So the cost and computational complexity are analyzed as constructing delay-constrained multicast tree. So as to optimize shortest paths, a new algorithm of ORLSB(optimal routing algorithm for link-sharing balance) is proposed.The link selection function of the algorithm not only considers the priority of the destination nodes, but also takes into account the priority of the low delay path based on local information. Because the multicast tree has fewer possible path, the algorithm reduces the probability of creating multicast tree through the minimum delay path and improves the sharing paths. Simulation results show that this algorithm has balanced cost, delay and computational complexity, and has better overall performance.

An Energy Balanced Ad Hoc Multicast Routing Algorithm

2012 ◽  
Vol 466-467 ◽  
pp. 425-429
Author(s):  
Qi Zhang ◽  
Hai Jun Xiong
Keyword(s):  
Ad Hoc Network ◽  
Ad Hoc ◽  
Multicast Routing ◽  
Routing Algorithm ◽  
Energy Model ◽  
Specific Data ◽  
Routing Technology ◽  
Multicast Routing Algorithm ◽  
Energy Network

Multicast routing technology of Ad hoc network is a method of transferring specific data to a group of clients selectively; therefore, quality of the services is the key to evaluate the method. After the analysis of energy model and other routing algorithms ,an energy model and a balanced energy network multicast routing algorithm EBAMRA have been proposed in this article,. Experiments had been done, the simulation results show that this algorithm is feasible and effective, which provides a new and effective way of Ad hoc multicast routing technology.

Dynamic Routing Algorithm Based on HIP Multicast Model

2012 ◽  
Vol 424-425 ◽  
pp. 607-611
Author(s):  
Xue Zhen Shen ◽  
Xin Guo Tang
Keyword(s):  
Loss Rate ◽  
Multicast Routing ◽  
Search Algorithm ◽  
Routing Algorithm ◽  
Simulation Experiments ◽  
Delay Jitter ◽  
Result Show ◽  
Dynamic Multicast ◽  
Multicast Routing Algorithm ◽  
Multiple Qos

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

Multicast Routing Algorithm with QoS Constraints in Mobile Ad Hoc Networks

2014 ◽  
Vol 602-605 ◽  
pp. 3169-3172 ◽  
Author(s):  
Yue Li ◽  
Yin Hui Liu ◽  
Zhong Bao Luo
Keyword(s):  
Ad Hoc ◽  
Multicast Routing ◽  
Routing Algorithm ◽  
Estimation Algorithm ◽  
Bandwidth Estimation ◽  
Routing Problem ◽  
Network Bandwidth ◽  
Hoc Networks ◽  
Multicast Routing Algorithm ◽  
Select Function

Through the study of MANET's QoS multicast routing problem, we propose a heuristic-demand multicast routing algorithm. Algorithm combines the MANET network bandwidth estimation algorithm, redefined the select function, restrictions request packets of flooding algorithm, to ensure fair treatment delay and bandwidth. Simulation results show that the algorithm has the advantage of fewer routing overhead, high success rate.

A Multicast Routing Algorithm with Sparse Light Splitting Constrained

2010 ◽  
Vol 159 ◽  
pp. 412-419
Author(s):  
Li Du ◽  
Xiao Jing Wang ◽  
Li Lin ◽  
Han Yuan Zhang
Keyword(s):  
Multicast Routing ◽  
Blocking Probability ◽  
Routing Algorithm ◽  
Virtual Source ◽  
Minimum Path ◽  
Average Maximum ◽  
Path Cost ◽  
The Cost ◽  
Multicast Routing Algorithm ◽  
Path Calculation

This paper investigates the defects that exist in the blocking probability and the cost of establishing light-tree in the multicast routing algorithm with sparse splitting capability constraint based on the Virtual Source (VS). It proposes a new multicast routing algorithm N_VSBA (New Virtual Source Based Algorithm). By introducing the minimum interference routing algorithm in the path calculation among the VS nodes, this new algorithm solves the problem of blocking caused by establishing the light-tree through a pre-computed path when two VS nodes concentrate. This algorithm also solves the problem of VS-based algorithm’s not being able to utilize the TaC (Tap and Continue) capability of indecomposable optical nodes by introduction of MPH (Minimum Path-cost Heuristic) algorithm into the process of adding light-tree into indecomposable nodes. Simulation results show that the new algorithm has improvements of different degrees in aspects of blocking probability, average number of wavelength links and average maximum number of wavelength.

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 DISTRIBUTED DYNAMIC HEURISTIC FOR DELAY-CONSTRAINED LEAST-COST MULTICAST ROUTING

2000 ◽  
Vol 01 (04) ◽  
pp. 331-344 ◽  
Author(s):  
Zhengying Wang ◽  
Bingxin Shi ◽  
Wei Liu
Keyword(s):  
Group Membership ◽  
Multicast Routing ◽  
Routing Algorithm ◽  
Multicast Tree ◽  
Network Resources ◽  
End To End Delay ◽  
Dynamic Multicast ◽  
Simulation Results ◽  
Multicast Routing Algorithm ◽  
Multicast Algorithms

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.

An Improved Chaotic Binary Bat Algorithm for QoS Multicast Routing

2016 ◽  
Vol 25 (04) ◽  
pp. 1650025 ◽  
Author(s):  
Yassine Meraihi ◽  
Dalila Acheli ◽  
Amar Ramdane-Cherif
Keyword(s):  
Particle Swarm Optimization ◽  
Communication Networks ◽  
Heuristic Algorithms ◽  
Multicast Routing ◽  
Logistic Map ◽  
Particle Swarm ◽  
Bat Algorithm ◽  
Multicast Tree ◽  
Swarm Optimization ◽  
Routing Problem

The quality of service (QoS) multicast routing problem is one of the main issues for transmission in communication networks. It is known to be an NP-hard problem, so many heuristic algorithms have been employed to solve the multicast routing problem and find the optimal multicast tree which satisfies the requirements of multiple QoS constraints such as delay, delay jitter, bandwidth and packet loss rate. In this paper, we propose an improved chaotic binary bat algorithm to solve the QoS multicast routing problem. We introduce two modification methods into the binary bat algorithm. First, we use the two most representative chaotic maps, namely the logistic map and the tent map, to determine the parameter [Formula: see text] of the pulse frequency [Formula: see text]. Second, we use a dynamic formulation to update the parameter α of the loudness [Formula: see text]. The aim of these modifications is to enhance the performance and the robustness of the binary bat algorithm and ensure the diversity of the solutions. The simulation results reveal the superiority, effectiveness and efficiency of our proposed algorithms compared with some well-known algorithms such as Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Jumping Particle Swarm Optimization (JPSO), and Binary Bat Algorithm (BBA).

Sign in / Sign up

Export Citation Format

Share Document