107 Hits in 4.3 sec

A GRASP heuristic for the delay-constrained multicast routing problem

Nina Skorin-Kapov, Mladen Kos
2006 Telecommunications Systems  
This paper is concerned with delay-constrained multicast routing (the DCMR 2 problem).  ...  This paper deals with Delay-Constrained Multicast Routing (DCMR) where the maximum endto-end delay in a multicast session is bounded.  ...  These results indicate that the suggested GRASP heuristic is efficient for the general problem of multicast routing.  ... 
doi:10.1007/s11235-006-8202-2 fatcat:vfm2nbto2randlxm2ged6sswwy

A New Hybrid GRASP with the Pilot Method Forthe Delay-Constrained Multicast Routing Problem

Ying Xu, Xiong Fei Zheng, Ren Fa Li
2013 Advanced Materials Research  
The proposed GRASP approach is a competitive approach in solving the DCLC multicast routing problem.  ...  In this paper we investigate a new hybrid GRASP (Greedy Randomized Adaptive Search Procedure) approach where a pilot method is applied to further enhance the search for the Delay-Constrained Least-Cost  ...  The Delay-Constrained Least-Cost (DCLC) multicast routing problem can be seen as a delay-constrained Steiner tree, which is also NPcomplete [6] [7] [8] .  ... 
doi:10.4028/ fatcat:fq6edd7sjvhnrnsyg53ltj5gfy

A hybrid scatter search meta-heuristic for delay-constrained multicast routing problems

Ying Xu, Rong Qu
2010 Applied intelligence (Boston)  
This paper investigates the first hybrid scatter search and path relinking meta-heuristic for the Delay-Constrained Least-Cost (DCLC) multicast routing problem.  ...  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  ...  Acknowledgement This research was supported by Hunan University, China, and the School of Computer Science at The University of Nottingham, UK.  ... 
doi:10.1007/s10489-010-0256-x fatcat:2ibmj2vkufdinlaezo4e4cnvq4

Particle swarm optimization for the Steiner tree in graph and delay-constrained multicast routing problems

Rong Qu, Ying Xu, Juan P. Castro, Dario Landa-Silva
2012 Journal of Heuristics  
This paper presents the first investigation on applying a particle swarm optimization (PSO) algorithm to both the Steiner tree problem and the delay constrained multicast routing problem.  ...  The literature on the application of meta-heuristics to multicast routing problems is less extensive but includes several promising approaches.  ...  Acknowledgements This research is supported by Hunan University, China, and the School of Computer Science at The University of Nottingham, UK.  ... 
doi:10.1007/s10732-012-9198-2 fatcat:4jewzljqqfawxerxzkn264hgqy

Solving the Delay-Constrained Least-Cost routing problem using Tabu Search with Edge Betweenness

Amina Boudjelida, Ali Lemouari, S. Krit
2021 E3S Web of Conferences  
In this paper, we investigate metaheuristics approaches for the Delay-Constrained Least-Cost (DCLC) problem, we propose a novel algorithm based on Tabu Search procedure with the Edge Betweenness (EB).  ...  To solve the problem, a current approach for efficiently supporting a multicast session in a network consists of establishing a multicast tree that covers the source and all terminal nodes.  ...  In addition, several heuristics have been developed with the GRASP heuristic by N. Skorin-Kapov et al [25] to solve the Delay-Constrained Multicast Routing (DCMR).  ... 
doi:10.1051/e3sconf/202122901009 fatcat:lpzs3duf7nakrczlwnv5hchbke

An iterative local search approach based on fitness landscapes analysis for the delay-constrained multicast routing problem

Ying Xu, Rong Qu
2012 Computer Communications  
This paper presents the first fitness landscape analysis on the delay-constrained least-cost multicast routing problem (DCLC-MRP), a well-known NP-hard problem.  ...  The delay bound constraint in the DCLC-MRP has shown a great influence on the underlying landscape characteristic of the problem.  ...  Acknowledgement This research has been supported by Hunan University, China, and the School of Computer Science at The University of Nottingham, UK.  ... 
doi:10.1016/j.comcom.2011.10.011 fatcat:limizai77neenfeylfktsnalym

A Variable Neighborhood Descent Search Algorithm for Delay-Constrained Least-Cost Multicast Routing [chapter]

Rong Qu, Ying Xu, Graham Kendall
2009 Lecture Notes in Computer Science  
In this paper we investigate a variable neighborhood descent (VND) search, a variant of variable neighborhood search, for the delay-constrained leastcost (DCLC) multicast routing problem.  ...  The constrained Steiner Tree, as the underpinning mathematical structure, is a well-known NP-complete problem.  ...  This research is supported by Hunan University, China, and the School of Computer Science at The University of Nottingham, UK.  ... 
doi:10.1007/978-3-642-11169-3_2 fatcat:scdyi4g66zd23h75nvv2b3q53y

Core-Based GRASP for Delay-Constrained Group Communications

Zrinka Lukač, Manuel Laguna
2013 International Journal of Applied Metaheuristic Computing  
This has made multicasting under QoS constraints one of the most prominent routing problems.  ...  We adopt the multi-core approach and utilize SPAN [10] -a core-based framework for multi-source group applications-as the basis to develop greedy randomized adaptive search procedures (GRASP) for the associated  ...  SPAN is a generic corebased framework for asymmetric, decentralized delay-constrained multicast routing in multi-source groups that consists of core selection and tree construction modules.  ... 
doi:10.4018/ijamc.2013100101 fatcat:kgazy7qfzbakfo5grmyav5xsle

Introduction to the special issue on intelligent metaheuristics for logistic planning

Belén Melián-Batista, José A. Moreno-Pérez
2013 Journal of Heuristics  
Castro, Dario Landa-Silva apply a Particle Swarm Optimization (PSO) algorithm to both the Steiner tree problem and the delay constrained multicast routing problem.  ...  The literature on the application of meta-heuristics to multicast routing problems is less extensive but includes several promising approaches.  ... 
doi:10.1007/s10732-013-9217-y fatcat:eljwubkgujh63nib4h3ymcuawm

Delay and Delay Variation Constrained Algorithm based on VNS Algorithm for RP Management in Mobile IPv6 [article]

Youssef Baddi, Mohamed Dafir Ech-Cherif El Kettani
2013 arXiv   pre-print
D2V-RPM (delay and delay variation RP Manager) problem consist in choosing an optimal multicast router in the network as the root of the shared multicast tree (ST) within a specified delay and delay variation  ...  This NP hard problem needs to be solved through a heuristic algorithm.  ...  Multicast communication is based on a multicast tree for data routing; multicast routing protocols are built using two kinds of multicast trees: source based trees and shared trees.  ... 
arXiv:1303.4771v1 fatcat:6iral4z4czhtjhbx22sceycaqa

An Agent-based Distributed QoS Multicast Routing Algorithm

Gu Shen-jun, Chen Jie, Tian Hao-cheng, Xu Ping, Yang Yun
2012 Physics Procedia  
In accordance with multiple constrained QoS multicast routing problem, a new algorithm AQRAA (Agent-based Distributed QoS Multicast Routing Algorithm in Ad Hoc networks) is proposed based on Agent.  ...  The flexible routing switching and locking guarantees a successful routing connection. The experimental results indicate the feasibility and efficiency of AQRAA.  ...  Acknowledgment This paper is supported by the national natural science foundation of China (NO60803122), the natural science foundation of Jiangsu province (BK2007074) and the innovation fund project for  ... 
doi:10.1016/j.phpro.2012.02.287 fatcat:3qcuydifkffwfeteubkxlkfgkq

Degree-constrained minimum spanning tree problem using genetic algorithm

Keke Liu, Zhenxiang Chen, Ajith Abraham, Wenjie Cao, Shan Jing
2012 2012 Fourth World Congress on Nature and Biologically Inspired Computing (NaBIC)  
The main goal of multicast routing algorithm is seeking a minimum cost multicast tree in a given network, also known as the Steiner tree problem, which is a classical NP-Complete problem.  ...  In this paper, we solve constrained multicast routing algorithm based on genetic algorithm. The idea is to simulate the Darwinian theory of biological evolution.  ...  Several heuristic algorithms were proposed for this problem: the degree-constrained shortest path heuristic SPH [2] and the degree-constrained kruskal shortest path heuristic algorithm K.SPH [3] .  ... 
doi:10.1109/nabic.2012.6402214 dblp:conf/nabic/LiuCACJ12 fatcat:gwnvg552s5gifma4hucol5pn5a

Bi-Velocity Discrete Particle Swarm Optimization and Its Application to Multicast Routing Problem in Communication Networks

Meie Shen, Zhi-Hui Zhan, Wei-Neng Chen, Yue-Jiao Gong, Jun Zhang, Yun Li
2014 IEEE transactions on industrial electronics (1982. Print)  
This paper proposes a novel bi-velocity discrete particle swarm optimization (BVDPSO) approach and extends its application to the nondeterministic polynomial (NP) complete multicast routing problem (MRP  ...  Index Terms-Communication networks, multicast routing problem (MRP), particle swarm optimization (PSO), Steiner tree problem (STP).  ...  Instead, we compare BVDPSO with the recent heuristics DCH [6] , GRASP [7] , and JPSO for multicast routing (JPSOMR) [20] .  ... 
doi:10.1109/tie.2014.2314075 fatcat:shxucca7sjadlhkovztr32bswe

Parallel Minimum Spanning Tree Heuristic for the steiner problem in graphs

H. Akbari, Z. Iranmanesh, M. Ghodsi
2007 2007 International Conference on Parallel and Distributed Systems  
Minimum Spanning Tree Heuristic (MSTH) is a heuristic for solving the Steiner problem in graphs. In this paper we first review existing algorithms for solving the Steiner problem in graphs.  ...  Given an undirected graph with weights associated with its edges, the Steiner tree problem consists of finding a minimum weight subtree spanning a given subset of (terminal) nodes of the original graph  ...  The issue of multipoint routing for multimedia traffic has led to emergence of Constrained Steiner Tree Problem, in which the problem is to find a minimum cost tree such that the delay -delay variation  ... 
doi:10.1109/icpads.2007.4447726 dblp:conf/icpads/AkbariIG07 fatcat:rhlkovpeubh57d5x2hoafijk2e

Fault-tolerant topology and routing synthesis for IEEE time-sensitive networking

Voica Gavrilut, Bahram Zarrin, Paul Pop, Soheil Samii
2017 Proceedings of the 25th International Conference on Real-Time Networks and Systems - RTNS '17  
We propose three approaches to solve this optimization problem: (1) a heuristic solution, (2) a Greedy Randomized Adaptive Search Procedure (GRASP) metaheuristic, and (3) a Constraint Programmingbased  ...  We are interested in determining a fault-tolerant network topology, consisting of redundant physical links and bridges, the routing of each stream in the applications, such that the architecture cost is  ...  ACKNOWLEDGMENTS This work has been conducted within the ENABLE-S3 project that has received funding from the ECSEL Joint Undertaking under grant agreement No 692455.  ... 
doi:10.1145/3139258.3139284 dblp:conf/rtns/GavrilutZPS17 fatcat:zqa2brjylzbedmydxlsl32tsgu
« Previous Showing results 1 — 15 out of 107 results