A Distributed Dynamic Heuristic for Delay-Constrained Least-Cost Multicast Routing

Wang, Zhengying; Shi, Bingxin; Wei, Liu

doi:10.1142/s0219265900000202

Cited by 1 publication

(2 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…. , R n ]; see (2). For G with p nodes and a maximum number q of destination nodes in requests R i (e.g., q = 8 for the requests in Table 1), the time complexity to execute the KMB algorithm is O(q · p 2 ) [48].…”

Section: Run-time Analysismentioning

confidence: 99%

See 1 more Smart Citation

Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing

Zahrani

Loomes

Malcolm

et al. 2008

Computers & Operations Research

View full text Add to dashboard Cite

Over the past few years, several local search algorithms have been proposed for various problems related to multicast routing in the off-line mode. We describe a population-based search algorithm for cost minimisation of multicast routing. The algorithm utilises the partially mixed crossover operation (PMX) under the elitist model: for each element of the current population, the local search is based upon the results of a landscape analysis that is executed only once in a pre-processing step; the best solution found so far is always part of the population. The aim of the landscape analysis is to estimate the depth of the deepest local minima in the landscape generated by the routing tasks and the objective function. The analysis employs simulated annealing with a logarithmic cooling schedule (logarithmic simulated annealing-LSA). The local search then performs alternating sequences of descending and ascending steps for each individual of the population, where the length of a sequence with uniform direction is controlled by the estimated value of the maximum depth of local minima. We present results from computational experiments on three different routing tasks, and we provide experimental evidence that our genetic local search procedure that combines LSA and PMX performs better than algorithms using either LSA or PMX only. ᭧

show abstract

Section: Run-time Analysismentioning

confidence: 99%

“…A recent overview on multicast routing and associated optimisation algorithms has been presented by Oliveira and Pardalos [1]. The focus of this overview, as in most papers on multicast routing, are on-line algorithms [2,3]. An early summary of problems and technical solutions related to multicast communication was given by Diot et al [4].…”

Section: Introductionmentioning

confidence: 99%