2015
DOI: 10.1002/dac.3084
|View full text |Cite
|
Sign up to set email alerts
|

Multicast routing based on data envelopment analysis with multiple Quality of Service parameters

Abstract: The requirement for real-time multimedia communications raises challenges for constructing multicast trees with multiple Quality of Service (QoS) parameters, for example, bandwidth, delay, delay jitter, error rates, and so on. In this paper, we present a new method for establishing multicast trees with multiple QoS parameters based on data envelopment analysis techniques. We first apply data envelopment analysis techniques for evaluating the relative efficiency of arcs in the presence of QoS parameters. Then, … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
12
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(14 citation statements)
references
References 31 publications
0
12
0
Order By: Relevance
“…Raayatpanah (2017) [25] has established a new method for developing multicast trees with multiple QoS parameters, which is based primarily on the DEA methodology. In his study, he focuses on multicasting as the "process of concurrently sending the same data from a source to a group of destinations in a computer network" and as a vital requirement in the transmission of multimedia information.…”
Section: Research Resultsmentioning
confidence: 99%
“…Raayatpanah (2017) [25] has established a new method for developing multicast trees with multiple QoS parameters, which is based primarily on the DEA methodology. In his study, he focuses on multicasting as the "process of concurrently sending the same data from a source to a group of destinations in a computer network" and as a vital requirement in the transmission of multimedia information.…”
Section: Research Resultsmentioning
confidence: 99%
“…In the classical formulation of the MCMCM problem [8] the goal is to find a subgraph G of G having a feasible path from the source s to each destination d j ∈ D, and the cost of the sub-graph is minimal. This definition can be used to formulate the MCMCM problem by an integer program which introduces some flow variables and special constraints to ensure the feasibility of each path [11]. Using the same definition, the classical cut formulation of spanning trees can also be used.…”
Section: Limitation Of Standard Ilp Formulationsmentioning
confidence: 99%
“…Therefore, several multicast routing algorithms are proposed not only for finding the multicast route which minimizes the cost, but also for satisfying the QoS constraints [5][6][8] [11][10] [17]. The problem of constructing a multiconstrained multicast route with minimal cost, the so-called Multi-Constrained Minimum Cost Multicast (MCMCM) problem is NP-hard.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations