2011
DOI: 10.1049/iet-com.2010.0144
|View full text |Cite
|
Sign up to set email alerts
|

Quality of service-based multi-domain routing under multiple quality of service metrics

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2012
2012
2022
2022

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 9 publications
(5 citation statements)
references
References 11 publications
0
5
0
Order By: Relevance
“…In the literature of the traditional networks, there are numerous studies and methods concerning multi-metric structures for improving the quality of service during the routing processes, as can be seen in [Yiltas and Perros 2011], [Yiltas-Kaplan 2015]. There are also many studies about general decision-making processes with multi-metric evaluations.…”
Section: Normalization Processmentioning
confidence: 99%
“…In the literature of the traditional networks, there are numerous studies and methods concerning multi-metric structures for improving the quality of service during the routing processes, as can be seen in [Yiltas and Perros 2011], [Yiltas-Kaplan 2015]. There are also many studies about general decision-making processes with multi-metric evaluations.…”
Section: Normalization Processmentioning
confidence: 99%
“…It is known that the problem of finding an optimal path with multiple additive constraints is NP-Hard [3,27,28]. In order to reduce the time complexity, some approaches have defined a single aggregated metric calculated from multiple metrics [29,30]. Although they reduce the search space the same as well-known shortest routing algorithms, this might not satisfy the requirement of applications because the single aggregated value may not guarantee the constraint of some specific metrics.…”
Section: Related Workmentioning
confidence: 99%
“…After the user specifies the required density as well as the entering and exiting lane of each traffic flow, the implemented Dijkstra’s algorithm [81] manages the idealized routing of every single traffic flow.…”
Section: Proposed Model Descriptionmentioning
confidence: 99%