Results 1  10
of
36
Multicast Routing and Its QoS Extension: Problems, Algorithms, and Protocols
 IEEE Network
, 2000
"... Multicast services have been increasingly used in large scale continuous media applications. The qualityofservice (QoS) requirements of these continuous media applications prompt the necessity for QoSdriven, constraintbased multicast routing. This article provides a comprehensive overview of exi ..."
Abstract

Cited by 79 (0 self)
 Add to MetaCart
(Show Context)
Multicast services have been increasingly used in large scale continuous media applications. The qualityofservice (QoS) requirements of these continuous media applications prompt the necessity for QoSdriven, constraintbased multicast routing. This article provides a comprehensive overview of existing multicast routing algorithms, protocols, and their QoS extension. In particular, we classify multicast routing problems according to their optimization functions and performance constraints, present basic routing algorithms in each problem class, and discuss their strengths and weakness. We also categorize existing multicast routing protocols, outline the issues and challenges in providing QoS in multicast routing, and point out possible future research directions.
A Survey of Combinatorial Optimization Problems in Multicast Routing
, 2003
"... In multicasting routing, the main objective is to send data from one or more source to multiple destinations, while at the same time minimizing the usage of resources. Examples of resources which can be minimized include bandwidth, time and connection costs. In this paper we survey applications of c ..."
Abstract

Cited by 40 (1 self)
 Add to MetaCart
In multicasting routing, the main objective is to send data from one or more source to multiple destinations, while at the same time minimizing the usage of resources. Examples of resources which can be minimized include bandwidth, time and connection costs. In this paper we survey applications of combinatorial optimization to multicast routing. We discuss the most important problems considered in this area, as well as their models. Algorithms for each of the main problems are also presented.
Optimization of wavelength assignment for QoS multicast in WDM networks
 IEEE Trans. Commun
, 2001
"... Abstract—This paper discusses qualityofservice (QoS) multicast in wavelengthdivision multiplexing (WDM) networks. Given a set of QoS multicast requests, we are to find a set of cost suboptimal QoS routing trees and assign wavelengths to them. The objective is to minimize the number of wavelengths ..."
Abstract

Cited by 30 (1 self)
 Add to MetaCart
(Show Context)
Abstract—This paper discusses qualityofservice (QoS) multicast in wavelengthdivision multiplexing (WDM) networks. Given a set of QoS multicast requests, we are to find a set of cost suboptimal QoS routing trees and assign wavelengths to them. The objective is to minimize the number of wavelengths in the system. This is a challenging issue. It involves not only optimal QoS multicast routing, but also the optimal wavelength assignment. Existing methods consider channel setup in WDM networks in two separate steps: routing and wavelength assignment, which has limited power in minimizing the number of wavelengths. In this paper, we propose a new optimization method, which integrates routing and wavelength assignment in optimization of wavelengths. Two optimization algorithms are also proposed in minimizing the number of wavelengths. One algorithm minimizes the number of wavelengths through reducing the maximal link load in the system; while the other does it by trying to free out the least used wavelengths. Simulation results demonstrate that the proposed algorithms can produce suboptimal QoS routing trees and substantially save the number of wavelengths. Index Terms—Lighttree, QoS multicast, routing, wavelength assignment, WDM network.
ReceiverInitiated Multicast with Multiple QoS Constraints
 Proceedings of IEEE INFOCOM
, 1999
"... In this report we present our work on a receiverinitiated approach called RIMQoS to support multicast with multiple QoS constraints and dynamic memberships. Assuming linkstate information is available, a receiver computes a path to join the multicast tree rooted at the source. It then sends join r ..."
Abstract

Cited by 14 (3 self)
 Add to MetaCart
(Show Context)
In this report we present our work on a receiverinitiated approach called RIMQoS to support multicast with multiple QoS constraints and dynamic memberships. Assuming linkstate information is available, a receiver computes a path to join the multicast tree rooted at the source. It then sends join request along the path to join the group. We first present the operation of our approach in an intradomain setting with delay constraint. Then we introduce an algebraic formulation for multiple QoS constraints to show how to determine if QoS requirements for a new receiver can be satisfied at an intermediate node along the join path and how to adjust the tree without breaking QoS requirements for existing members if they are not. It attempts to minimize the cost of the tree by letting a node to join the tree via a lowcost path and may later switch to a highercost but more QoS stringent path when necessary. Our scheme builds multicast tree incrementally and thus supports fully dynamic memberships. It also supports of heterogeneous receivers seamlessly. Moreover, it can support any number of arbitrary QoS metrics without assuming any dependencies among them, if they satisfy some normal mathematical property. If implemented as a distributed routing protocol, our approach doesn't require any node to have explicit knowledge of the multicast tree topology, thus it scales well for multicast of large group. Simulation studies have been carried out to study its behavior and compare its performance with other schemes.
A hybrid scatter search metaheuristic for delayconstrained multicast routing problems. Applied intelligence, doi
, 2010
"... Abstract. This paper investigates the first hybrid scatter search and path relinking metaheuristic for the DelayConstrained LeastCost (DCLC) multicast routing problem. The underpinning mathematic model of the DCLC problem is the constrained Steiner tree problem in graphs, a well known NPcomplete ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
(Show Context)
Abstract. This paper investigates the first hybrid scatter search and path relinking metaheuristic for the DelayConstrained LeastCost (DCLC) multicast routing problem. The underpinning mathematic model of the DCLC problem is the constrained Steiner tree problem in graphs, a well known NPcomplete problem. After combining a path relinking method as the solution combination method in scatter search, we further explore two improvement strategies: tabu search and variable neighborhood search, to intensify the search in the hybrid scatter search algorithm. A large number of simulations on some benchmark instances from the ORlibrary, and a group of random graphs of different characteristics demonstrate that the improvement strategy greatly affects the performance of the proposed scatter search algorithm. The hybrid scatter search algorithm intensified by a variable neighborhood descent search is highly efficient in solving the DCLC multicast routing problem in comparison with other algorithms and heuristics in the literature.
Genetic Algorithms with Immigrants Schemes for Dynamic Multicast Problems in Mobile Ad Hoc Networks
"... In this paper, the problem of dynamic qualityofservice (QoS) multicast routing in mobile ad hoc networks is investigated. Lots of interesting works have been done on multicast since it is proved to be a NPhard problem. However, most of them consider the static network scenarios only and the multi ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
(Show Context)
In this paper, the problem of dynamic qualityofservice (QoS) multicast routing in mobile ad hoc networks is investigated. Lots of interesting works have been done on multicast since it is proved to be a NPhard problem. However, most of them consider the static network scenarios only and the multicast tree cannot adapt to the topological changes. With the advancement in communication technologies, more and more wireless mobile networks appear, e.g., mobile ad hoc networks (MANETs). In a MANET, the network topology keeps changing due to its inherent characteristics such as the node mobility and energy conservation. Therefore, an effective multicast algorithm should track the topological changes and adapt the best multicast tree to the changes accordingly. In this paper, we propose to use genetic algorithms with immigrants schemes to solve the dynamic QoS multicast problem in MANETs. MANETs are considered as target systems because they represent a new generation of wireless networks. In the construction of the dynamic network environments, two models are proposed and investigated. One is named as the general dynamics model in which the topologies are changed due to that the nodes are scheduled to sleep or wake up. The other is named as the worst dynamics model, in which the topologies are altered because some links on the current best multicast tree are removed. Extensive experiments are conducted based on both of the dynamic network models. The experimental results show that these immigrants based genetic Corresponding author.
MobilityAware Mesh Construction Algorithm for Low DataOverhead Multicast Ad hoc Routing
 Journal of Communications and Networks
, 2004
"... Abstract: We study the problem of controlling data overhead of meshbased multicast ad hoc routing protocols by adaptively adding redundancy to the minimal data overhead multicast mesh as required by the network conditions. We show that the computation of the minimal data overhead multicast mesh is ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
(Show Context)
Abstract: We study the problem of controlling data overhead of meshbased multicast ad hoc routing protocols by adaptively adding redundancy to the minimal data overhead multicast mesh as required by the network conditions. We show that the computation of the minimal data overhead multicast mesh is NPcomplete, and we propose an heuristic approximation algorithm inspired on epidemic algorithms. In addition, we propose a mobilityaware and adaptive mesh construction algorithm based on a probabilistic path selection being able to adapt the reliability of the multicast mesh to the mobility of the network. Our simulation results show that the proposed approach, when implemented into ODMRP, is able to offer similar performance results and a lower average latency while reducing data overhead between 25 to 50 % compared to the original ODMRP. Index Terms: Ad hoc multicast routing, meshbased multicast, minimal data overhead, mobilityaware mesh construction I.
Joint QoS Multicast Routing and Channel Assignment in Multiradio Multichannel Wireless Mesh Networks using Intelligent Computational Methods
"... In this paper, the quality of service multicast routing and channel assignment (QoSMRCA) problem is investigated. It is proved to be a NPhard problem. Previous work separates the multicast tree construction from the channel assignment. Therefore they bear severe drawback, that is, channel assignme ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
(Show Context)
In this paper, the quality of service multicast routing and channel assignment (QoSMRCA) problem is investigated. It is proved to be a NPhard problem. Previous work separates the multicast tree construction from the channel assignment. Therefore they bear severe drawback, that is, channel assignment cannot work well with the determined multicast tree. In this paper, we integrate them together and solve it by intelligent computational methods. First, wedevelopaunifiedframeworkwhichconsistsoftheproblem formulation, the solution representation, the fitness function, and the channel assignment algorithm. Then, we propose three separate algorithms based on three representative intelligent computational methods (i.e., genetic algorithm, simulated annealing, and tabu search). These three algorithms aim to search minimuminterference multicast trees which also satisfy the endtoend delay constraint and optimize the usage of the scarce radio network resource in wireless mesh networks. To achieve this goal, the optimization techniques based on state of the art genetic algorithm and the techniques to control the annealing process and the tabu search procedure are well developed separately. Simulation results show that the proposed three intelligent computational methods based multicast algorithms all achieve better performance in terms of boththe total channel conflict and the tree cost than those comparative references. Corresponding author.
OPTIMIZATION PROBLEMS IN MULTICAST TREE CONSTRUCTION
"... ABSTRACT. Multicasting is a technique for data routing in networks that allows multiple destinations to be addressed simultaneously. The implementation of multicasting requires, however, the solution of difficult combinatorial optimization problems. In this chapter, we discuss combinatorial issues o ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
(Show Context)
ABSTRACT. Multicasting is a technique for data routing in networks that allows multiple destinations to be addressed simultaneously. The implementation of multicasting requires, however, the solution of difficult combinatorial optimization problems. In this chapter, we discuss combinatorial issues occurring in the implementation of multicast routing, including multicast tree construction, minimization of the total message delay, centerbased routing, and multicast message packing. Optimization methods for these problems are discussed and the corresponding literature reviewed. Mathematical programming as well as graph models for these problems are discussed. 1.
Streaming Cache Placement Problems: Complexity and Algorithms
, 2003
"... Virtual private networks (VPN) are often used to distribute live content, such as video or audio streams, from a single source to a large number of destinations. Streaming caches or splitters are deployed in these multicast networks to allow content distribution without overloading the network. In t ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
(Show Context)
Virtual private networks (VPN) are often used to distribute live content, such as video or audio streams, from a single source to a large number of destinations. Streaming caches or splitters are deployed in these multicast networks to allow content distribution without overloading the network. In this paper, we consider two combinatorial optimization problems that arise in multicast networks. In the Tree Cache Placement Problem (TCPP), the objective is to find a routing tree on which the number of cache nodes needed for multicasting is minimized. We also discuss a modification of this problem, called the Flow Cache Placement Problem (FCPP), where we seek any feasible flow from the source to the destinations which minimizes the number of cache nodes. We prove that these problems are NPhard using a transformation from Satisfiability. This transformation allows us to give a proof of nonapproximability by showing that it is gappreserving. We also consider approximation algorithms for the TCPP and FCPP and special cases where these problems can be solved in polynomial time.