IEEE GLOBECOM 1998 (Cat. NO. 98CH36250)
DOI: 10.1109/glocom.1998.775684
|View full text |Cite
|
Sign up to set email alerts
|

Generalised analysis of a QoS-aware routing algorithm

Abstract: Modem communicatians services have strict quality of service (QoS) quiremenis, with separate eonstrsinb on bandwidth, delay and error tolerance. The task of finding a mute through a network satisfying multiple QoS constmiits is intractable, but increasingly important for modern atmmuniestions apptications. This paper investigates an appmximate algorithm, which has p-ously been analysed for the w e of two constraints, and presents a generalisation of this analysis to the m e of an srbihary number of constraints… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
13
0

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(13 citation statements)
references
References 7 publications
0
13
0
Order By: Relevance
“…2(c) illustrates the approximated supported QoS defined by RP 2 . We can see that W 1 A,G (•) and W 2 A,G (•) define different supported QoSes.…”
Section: B the Existing Approximation Algorithmsmentioning
confidence: 98%
“…2(c) illustrates the approximated supported QoS defined by RP 2 . We can see that W 1 A,G (•) and W 2 A,G (•) define different supported QoSes.…”
Section: B the Existing Approximation Algorithmsmentioning
confidence: 98%
“…Korkmaz et al [19] proposed an algorithm that can dynamically adjust the values of a and b within a logarithmic number of function calls to DijkstraÕs shortestpath algorithm. Andrew and Kusuma [25] extended JaffeÕs algorithm to the case with more than two constraints. Iwata et al [24] proposed a polynomial-time algorithm to solve the MCP problem.…”
Section: Related Workmentioning
confidence: 99%
“…Second, the composition rule of this function is hard to define since the composition rules of its parameters are different. Nevertheless, the single mixed metric is used in many proposals [16,19]. This approach does not guarantee each QoS requirement individually, but adjusting the metric weights in the overall cost may increase the importance of a particular requirement.…”
Section: Single Mixed Metricmentioning
confidence: 99%
“…First, they may suppose centralized routing, i.e., the router knows the entire topology [19,20]. This is true for LS routing but not for DV routing.…”
Section: Heuristicsmentioning
confidence: 99%
See 1 more Smart Citation