2006
DOI: 10.1093/ietcom/e89-b.9.2385
|View full text |Cite
|
Sign up to set email alerts
|

On Efficient Core Selection for Reducing Multicast Delay Variation under Delay Constraints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
26
0

Year Published

2007
2007
2013
2013

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 15 publications
(26 citation statements)
references
References 18 publications
0
26
0
Order By: Relevance
“…Recently, Kim, et al proposed the ECS algorithm [13]. The ECS improved DDVCA algorithm to reduce multicast delay variation when the path from the source node to the core node traverses the destination nodes.…”
Section: Previous Algorithmsmentioning
confidence: 99%
See 1 more Smart Citation
“…Recently, Kim, et al proposed the ECS algorithm [13]. The ECS improved DDVCA algorithm to reduce multicast delay variation when the path from the source node to the core node traverses the destination nodes.…”
Section: Previous Algorithmsmentioning
confidence: 99%
“…See Figure 1(b). In [13], the authors pointed out the drawback of the DDVCA, however, other drawbacks still exist. In this paper, therefore, we classify the cases of core selection in detail, we could avoid the drawbacks.…”
Section: Previous Algorithmsmentioning
confidence: 99%
“…However, the core selection is an NP-complete problem [1,[3][4] , which needs to be solved using heuristic algorithm. Researchers have already proposed several solutions to this problem [5][6][7][8][9][10][11][12][13][14][15] . However, the problem of finding a better or the best core node has not yet been completely solved.…”
Section: Introductionmentioning
confidence: 99%
“…Another efficient core selection algorithm has been proposed by KIM et al [6] to produce a core-based multicast tree under delay and delay-variation constraints. First, this algorithm finds a set of candidate core nodes that have the same associated multicast delay-variation for each destination node.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation