Lecture 02 faster approximations for qos routing
Download
1 / 38

Lecture 02: Faster Approximations for QoS Routing - PowerPoint PPT Presentation


  • 129 Views
  • Uploaded on

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

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about ' Lecture 02: Faster Approximations for QoS Routing' - ghazi


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
Lecture 02 faster approximations for qos routing

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
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 lecture1
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 lecture2
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 lecture3
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 lecture4
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 lecture5
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
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.


ad