2011
DOI: 10.1016/j.amc.2011.09.017
|View full text |Cite
|
Sign up to set email alerts
|

A multicast routing algorithm based on searching in directed graph

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2014
2014
2017
2017

Publication Types

Select...
3

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 9 publications
0
4
0
Order By: Relevance
“…The authors also considered the algorithm's performance in terms of search efficiency and path computation time. The authors of [31][32][33][34][35][36][37][38][39] instead paid their attention to QoS routing algorithms under one-to-many multicast scenario. In [31], a novel Bi-Velocity Discrete Particle Swarm Optimization (BVDPSO) algorithm was proposed to optimize one-to-many multicast routing problem in communication networks.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…The authors also considered the algorithm's performance in terms of search efficiency and path computation time. The authors of [31][32][33][34][35][36][37][38][39] instead paid their attention to QoS routing algorithms under one-to-many multicast scenario. In [31], a novel Bi-Velocity Discrete Particle Swarm Optimization (BVDPSO) algorithm was proposed to optimize one-to-many multicast routing problem in communication networks.…”
Section: Related Workmentioning
confidence: 99%
“…It can search a routing path which satisfies the user QoS requirements and achieve the Pareto optimal utilities of the user and the network service provider under the Nash equilibrium. In [34], a Multicast Routing Algorithm based on Searching a Directed grapH (MRASDH) was proposed, and an ant algorithm is applied to construct a directed sub-graph for each destination node based on the thought of deleting the non-relative nodes to shrink the searching space, and finally used a simulated annealing algorithm to obtain the qualified multicast tree in the new space. In [35], a Tree-Growth Based Ant Colony Algorithm (TGBACA) for the multi-constrained QoS multicast routing problem was proposed.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…The Central Force Optimization (CFO) [1] is a new heuristic algorithm. In contrast with the stochastic algorithms such as Particle Swarm Optimization (PSO) [2], Ant Colony Optimization [3] and other such algorithms [4][5][6], CFO is an entirely deterministic algorithm.…”
Section: Dear Editormentioning
confidence: 99%