Multicast routing with end-to-end delay and delay variation constraints

Rouskas, George N.; Baldin, Ilya

doi:10.1109/49.564133

Cited by 226 publications

(91 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Most of previous research on finding a multicast tree considers only one or two QoS constraints, like delay and jitter [8,9,10,11]. As far we know, only two methods have been published [6,13] recently for the MCMT problem.…”

Section: Introductionmentioning

confidence: 99%

A Heuristic Algorithm for the Multi-constrained Multicast Tree

Yang

2003

Management of Multimedia Networks and Services

View full text Add to dashboard Cite

Abstract.Multicasting is an important communication mechanism for implementing real-time multimedia applications, which usually require the underlying network to provide a number of quality-of-service (QoS) guarantees to users. In this paper, we study the problem concerning how to find a feasible multicast tree in which all the multicast paths satisfy the given set of QoS constraints. This problem is referred as the multiconstrained multicast tree (MCMT) problem. Based on tabu-search technique, a heuristic algorithm named MCMTS for the MCMT problem is proposed in this study. According to the experimental results, the probability of finding a feasible multicast tree by our MCMTS method is more than 99% if one exists. Furthermore, the MCMTS is also shown to be a simple and highly efficient method. As a result, it would be a practical approach for developing multicast routing protocol.

show abstract

Section: Introductionmentioning

confidence: 99%

A Heuristic Algorithm for the Multi-constrained Multicast Tree

Yang

2003

Management of Multimedia Networks and Services

View full text Add to dashboard Cite

show abstract

“…Specifically, the loss constraint (11) is equivalent to the delay constraint of DVBMT, while the loss variation constraint (12) is equivalent to the delay variation constraint of DVBMT. We have proved [23] that the DVBMT problem is NP-complete whenever the size of the destination set | M |≥ 2. Consequently, if we ignore the power loss due to the splitting of the optical signal at the branch nodes of the light-tree, the PCLT problem is also NP-complete.…”

Section: A the Pclt Problem Under Power Attenuation Onlymentioning

confidence: 99%

“…The degreeconstrained Steiner tree problem [4], [5] , in which it is assumed that some nodes may not support multicast (i.e., they cannot be used as branching points) or have a limited fanout capability has also been studied and appropriate heuristics have been proposed. A constrained multicast tree problem in which the objective is to to bound both the end-to-end delay and the delay variation among all source-destination paths has also been studied [23]; the total cost of the tree was not considered in that work, but it was shown that constructing such a constrained tree is an NP-complete problem.…”

Section: ) the Steiner Tree Problemmentioning

confidence: 99%

“…Consequently, if we ignore the power loss due to the splitting of the optical signal at the branch nodes of the light-tree, the PCLT problem is also NP-complete. In this case, the heuristics developed for DVBMT [23], [26] can be applied directly to construct a lighttree that satisfies both constraints (11) and (12).…”

Section: A the Pclt Problem Under Power Attenuation Onlymentioning

confidence: 99%

“…The PCLT problem with constraints (11) and (12) is equivalent to the delay-and delay variation-bounded multicast tree (DVBMT) problem [23], [26] . Specifically, the loss constraint (11) is equivalent to the delay constraint of DVBMT, while the loss variation constraint (12) is equivalent to the delay variation constraint of DVBMT.…”

Section: A the Pclt Problem Under Power Attenuation Onlymentioning

confidence: 99%

See 2 more Smart Citations

Multicast routing under optical layer constraints

Xin¹,

Rouskas

Ieee Infocom 2004

Self Cite

View full text Add to dashboard Cite

Abstract-It has been widely recognized that physical layer impairments, including power losses, must be taken into account when routing optical connections in transparent networks. In this paper we study the problem of constructing light-trees under optical layer power budget constraints, with a focus on algorithms which can guarantee a certain level of quality for the signals received by the destination nodes. We define a new constrained light-tree routing problem by introducing a set of constraints on the source-destination paths to account for the power losses at the optical layer. We investigate a number of variants of this problem, we characterize their complexity, and we develop a suite of corresponding routing algorithms; one of the algorithms is appropriate for networks with sparse light splitting and/or limited splitting fanout. We find that, in order to guarantee an adequate signal quality and to scale to large destination sets, light-trees must be as balanced as possible. Numerical results demonstrate that existing algorithms tend to construct highly unbalanced trees, and are thus expected to perform poorly in an optical network setting. Our algorithms, on the other hand, are designed to construct balanced trees which, in addition to having good performance in terms of signal quality, they also ensure a certain degree of fairness among destination nodes. While we only consider power loss in this work, the algorithms we develop could be appropriately modified to account for other physical layer impairments, such as dispersion.

show abstract

ESC: Estimation of selecting core for reducing multicast delay variation under delay constraints

Kim

Mutka

Kim

2010

Int J Communication

View full text Add to dashboard Cite

SUMMARYWith the spread of multimedia group applications, the construction of multicast trees satisfying the Quality of Service (QoS) requirements becomes a problem of prime importance. A principal factor of these real-time applications is to optimize the delay-and delay variation-bounded multicast tree (DVBMT) problem. This problem is to satisfy the minimum delay variation and the end-to-end delay within an upper bound. The DVBMT problem is known as an NP-complete problem. The representative algorithms are the DVMA, the DDVCA, and the ECS algorithm. In this paper, we show that the proposed ESC algorithm outperforms the DDVCA and the ECS algorithm. The efficiency of our algorithm is verified through performance evaluation and the enhancement is up to about 19.6% in terms of normalized surcharge for multicast delay variation. The time complexity of our algorithm is O(mn 2 ), which is comparable to the well-known DDVCA.

show abstract

Multicast routing with end-to-end delay and delay variation constraints

Cited by 226 publications

References 12 publications

A Heuristic Algorithm for the Multi-constrained Multicast Tree

A Heuristic Algorithm for the Multi-constrained Multicast Tree

Multicast routing under optical layer constraints

ESC: Estimation of selecting core for reducing multicast delay variation under delay constraints

Contact Info

Product

Resources

About