380 likes | 539 Views
Lecture 02: Faster Approximations for QoS Routing. Guoliang (Larry) Xue Department of CSE Arizona State University http://optimization.asu.edu/~xue 13May2008. Outline of the Lecture. Multi-Constrained QoS Routing: OMCP and DCLC Algorithms for MCPP and MCPN
E N D
Lecture 02: Faster Approximations for QoS Routing Guoliang (Larry) Xue Department of CSE Arizona State University http://optimization.asu.edu/~xue 13May2008
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
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
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
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
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
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
Conclusions • We have presented a systematic approach to multi-constrained 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.