Lecture 02 faster approximations for qos routing
Sponsored Links
This presentation is the property of its rightful owner.
1 / 38

Lecture 02: Faster Approximations for QoS Routing PowerPoint PPT Presentation


  • 97 Views
  • Uploaded on
  • Presentation posted in: General

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

Download Presentation

Lecture 02: Faster Approximations for QoS Routing

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

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


Multi-Constrained QoS Routing


Multi-Constrained QoS Routing


Multi-Constrained QoS Routing


Multi-Constrained QoS Routing


Multi-Constrained QoS Routing


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


MCPP and MCPN


Layered Graph


Pseudo-Polynomial Time Algorithm for MCPP


Pesudopolynomial Time Algorithm for MCPP


Pesudopolynomial Time Algorithm for MCPP


Pesudopolynomial Time Algorithm for MCPN


Pesudopolynomial Time Algorithm for MCPN


Pesudopolynomial Time Algorithm for MCPN


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


Scaling and Rounding, Approximate Testing (N)


Scaling and Rounding, Approximate Testing (N)


Scaling and Rounding, Approximate Testing (N)


Scaling and Rounding, Approximate Testing (P)


Scaling and Rounding, Approximate Testing (P)


Scaling and Rounding, Approximate Testing (P)


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


The FPTAS of Lorenz and Raz


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


The FPTAS of Xue et al.


The FPTAS of Xue et al


The FTPAS of Xue et al.


The FPTAS of Xue et al.


The FPTAS of Xue et al.


The FPTAS of Xue et al.


The FPTAS of Xue et al.


The FPTAS of Xue et al.


The FPTAS of Xue et al.


The FPTAS of Xue et al.


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.


  • Login