A survey of application level multicast techniques

Yeo, Chai Kiat; Lee, Bu-Sung; Er, Meng Hwa

doi:10.1016/j.comcom.2004.04.003

Cited by 103 publications

(57 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The general problem of multicast routing has received significant research attention in the area of computer networks and algorithmic network theory [1,2,3]. It is defined as sending messages from a source to a set of destinations that belong to the same multicast group.…”

Section: Introductionmentioning

confidence: 99%

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

Kendall

2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. The rapid evolution of real-time multimedia applications requires Quality of Service (QoS) based multicast routing in underlying computer networks. The constrained Steiner Tree, as the underpinning mathematical structure, is a well-known NP-complete problem. 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 neighborhood structures designed in the VND approaches are based on the idea of path replacement in trees. They are simple, yet effective operators, enabling a flexible search over the solution space of this complex problem with multiple constraints. A large number of simulations demonstrate that our algorithm is highly efficient in solving the DCLC multicast routing problem in terms of the tree cost and execution time. To our knowledge, this is the first study of VND algorithm on the DCLC multicast routing problem. It outperforms other existing algorithms over a range of problem instances.

show abstract

Section: Introductionmentioning

confidence: 99%

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

Kendall

2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…This makes the complex QoS based MRPs one of the challenging optimisation problems. Over the past decade, the problem has attracted increasing attention from the meta-heuristic research community in both computer communications and operational research (Diot et al 1997;Yeo et al 2004;Oliveira et al 2005). A large amount of investigations on meta-heuristic algorithms exist in the literature (Haghighat et al 2004;Kun et al 2005;Skorin-Kapov and Kos 2006;Zahrani et al 2008;Qu et al 2009).…”

Section: The Multicast Routing Problem (Mrp)mentioning

confidence: 99%

A simulated annealing based genetic local search algorithm for multi-objective multicast routing problems

2013

Ann Oper Res

View full text Add to dashboard Cite

Abstract. This paper presents a new hybrid evolutionary algorithm to solve multi-objective multicast routing problems in telecommunication networks. The algorithm combines simulated annealing strategies and genetic local search, aiming at a more flexible and effective exploration and exploitation in the search space of the complex problem to find more non-dominated solutions in the Pareto Front. Due to the complex structure of the multicast tree, crossover and mutation operators have been specifically devised concerning the features and constraints in the problem. A new adaptive mutation probability based on simulated annealing is proposed in the hybrid algorithm to adaptively adjust the mutation rate according to the fitness of the new solution against the average quality of the current population during the evolution procedure. Two simulated annealing based search direction tuning strategies are applied to improve the efficiency and effectiveness of the hybrid evolutionary algorithm. Simulations have been carried out on some benchmark multi-objective multicast routing instances and a large amount of random networks with five real world objectives including cost, delay, link utilizations, average delay and delay variation in telecommunication networks. Experimental results demonstrate that both the simulated annealing strategies and the genetic local search within the proposed multi-objective algorithm, compared with other multi-objective evolutionary algorithms, can efficiently identify high quality non-dominated solution set for multi-objective multicast routing problems and outperform other conventional multi-objective evolutionary algorithms in the literature.

show abstract

“…The group-keyed service-oriented dissemination in ADCS is different from application level multicasting [23] where all dynamically changing contents are periodically multicast to satisfy demands of all group members. Whereas, ADCS involve dynamic grouping of nodes due to varying surrounding situations but service contents are static most of the time.…”

Section: Related Workmentioning

confidence: 99%

Autonomous Pull-Push Community Construction Technology for High-Assurance

Mahmood

Horikoshi

et al. 2009

IEICE Trans. Inf. & Syst.

View full text Add to dashboard Cite

SUMMARYLocation Based Services (LBS) are expected to become one of the major drivers of ubiquitous services due to recent inception of GPS-enabled mobile devices, the development of Web2.0 paradigm, and emergence of 3G broadband networks. Having this vision in mind, Community Context-attribute-oriented Collaborative Information Environment (CCCIE) based Autonomous Decentralized Community System (ADCS) is proposed to enable provision of services to specific users in specific place at specific time considering various context-attributes. This paper presents autonomous community construction technology that share service discovered by one member among others in flexible way to improve timeliness and reduce network cost. In order to meet crucial goal of real-time and context-aware community construction (provision of service/ service information to users with common interests), and defining flexible service area in highly dynamic operating environment of ADCS, proposed progressive ripple based service discovery technique introduces novel idea of snail's pace and steady advancing search followed by swift boundary confining mechanism; while service area construction shares the discovered service among members in defined area to further improve timeliness and reduce network cost. Analysis and empirical results verify the effectiveness of the proposed technique. key words: autonomous decentralized community system, community context-attribute-oriented collaborative information environment, community pervasive services, service discovery protocols, autonomous community construction, progressive ripple zone (PRZ)

show abstract

A survey of application level multicast techniques

Cited by 103 publications

References 25 publications

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

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

A simulated annealing based genetic local search algorithm for multi-objective multicast routing problems

Autonomous Pull-Push Community Construction Technology for High-Assurance

Contact Info

Product

Resources

About