Transcript Outline of the Talk

Lecture 02: Faster Approximations for QoS Routing
Guoliang (Larry) Xue
Department of CSE
Arizona State University
http://optimization.asu.edu/~xue
13May2008
Guoliang.Xue@asu.edu
Outline of the Lecture
Multi-Constrained QoS Routing: OMCP and DCLC
 Algorithms for MCPP and MCPN
 Scaling, Rounding, and Approximate Testing
 The FPTAS of Lorenz and Raz
 The FPTAS of Xue et al.
 Conclusions

1
Guoliang.Xue@asu.edu
Multi-Constrained QoS Routing
2
Guoliang.Xue@asu.edu
Multi-Constrained QoS Routing
3
Guoliang.Xue@asu.edu
Multi-Constrained QoS Routing
4
Guoliang.Xue@asu.edu
Multi-Constrained QoS Routing
5
Guoliang.Xue@asu.edu
Multi-Constrained QoS Routing
6
Guoliang.Xue@asu.edu
Outline of the Lecture
Multi-Constrained QoS Routing: OMCP and DCLC
 Algorithms for MCPP and MCPN
 Scaling, Rounding, and Approximate Testing
 The FPTAS of Lorenz and Raz
 The FPTAS of Xue et al.
 Conclusions

7
Guoliang.Xue@asu.edu
MCPP and MCPN
8
Guoliang.Xue@asu.edu
Layered Graph
9
Guoliang.Xue@asu.edu
Pseudo-Polynomial Time Algorithm for MCPP
10
Guoliang.Xue@asu.edu
Pesudopolynomial Time Algorithm for MCPP
11
Guoliang.Xue@asu.edu
Pesudopolynomial Time Algorithm for MCPP
12
Guoliang.Xue@asu.edu
Pesudopolynomial Time Algorithm for MCPN
13
Guoliang.Xue@asu.edu
Pesudopolynomial Time Algorithm for MCPN
14
Guoliang.Xue@asu.edu
Pesudopolynomial Time Algorithm for MCPN
15
Guoliang.Xue@asu.edu
Outline of the Lecture
Multi-Constrained QoS Routing: OMCP and DCLC
 Algorithms for MCPP and MCPN
 Scaling, Rounding, and Approximate Testing
 The FPTAS of Lorenz and Raz
 The FPTAS of Xue et al.
 Conclusions

16
Guoliang.Xue@asu.edu
Scaling and Rounding, Approximate Testing (N)
17
Guoliang.Xue@asu.edu
Scaling and Rounding, Approximate Testing (N)
18
Guoliang.Xue@asu.edu
Scaling and Rounding, Approximate Testing (N)
19
Guoliang.Xue@asu.edu
Scaling and Rounding, Approximate Testing (P)
20
Guoliang.Xue@asu.edu
Scaling and Rounding, Approximate Testing (P)
21
Guoliang.Xue@asu.edu
Scaling and Rounding, Approximate Testing (P)
22
Guoliang.Xue@asu.edu
Outline of the Lecture
Multi-Constrained QoS Routing: OMCP and DCLC
 Algorithms for MCPP and MCPN
 Scaling, Rounding, and Approximate Testing
 The FPTAS of Lorenz and Raz
 The FPTAS of Xue et al.
 Conclusions

23
Guoliang.Xue@asu.edu
The FPTAS of Lorenz and Raz
24
Guoliang.Xue@asu.edu
Outline of the Lecture
Multi-Constrained QoS Routing: OMCP and DCLC
 Algorithms for MCPP and MCPN
 Scaling, Rounding, and Approximate Testing
 The FPTAS of Lorenz and Raz
 The FPTAS of Xue et al.
 Conclusions

25
Guoliang.Xue@asu.edu
The FPTAS of Xue et al.
26
Guoliang.Xue@asu.edu
The FPTAS of Xue et al
27
Guoliang.Xue@asu.edu
The FTPAS of Xue et al.
28
Guoliang.Xue@asu.edu
The FPTAS of Xue et al.
29
Guoliang.Xue@asu.edu
The FPTAS of Xue et al.
30
Guoliang.Xue@asu.edu
The FPTAS of Xue et al.
31
Guoliang.Xue@asu.edu
The FPTAS of Xue et al.
32
Guoliang.Xue@asu.edu
The FPTAS of Xue et al.
33
Guoliang.Xue@asu.edu
The FPTAS of Xue et al.
34
Guoliang.Xue@asu.edu
The FPTAS of Xue et al.
35
Guoliang.Xue@asu.edu
Outline of the Lecture
Multi-Constrained QoS Routing: OMCP and DCLC
 Algorithms for MCPP and MCPN
 Scaling, Rounding, and Approximate Testing
 The FPTAS of Lorenz and Raz
 The FPTAS of Xue et al.
 Conclusions

36
Guoliang.Xue@asu.edu
Conclusions

We have presented a systematic approach to multiconstrained QoS routing. This include
Pseudo-polynomial time algorithms for MCPP and MCPN
 Scaling, rounding, and approximate testing
 The FPTAS of Lorenz and Raz
 The FPTAS of Xue et al.

It is interesting to see that a faster approximation
algorithm is obtained by a novel combination of two
existing techniques.
 This approach has other applications.

37
Guoliang.Xue@asu.edu