Skip to main content

Load Shared Sequential Routing in MPLS Networks: System and User Optimal Solutions

  • Conference paper
Network Control and Optimization (NET-COOP 2007)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 4465))

Included in the following conference series:

Abstract

Recently Gerald Ash has shown through case studies that event dependent routing is attractive in large scale multi-service MPLS networks. In this paper, we consider the application of Load Shared Sequential Routing (LSSR) in MPLS networks where the load sharing factors are updated using reinforcement learning techniques. We present algorithms based on learning automata techniques for optimizing the load sharing factors both from the user equilibrium and system optimum perspectives. To overcome the computationally expensive gradient evaluation associated with the Kuhn-Tucker conditions of the system optimum problem, we derive a computationally efficient method employing shadow prices. The proposed method for calculating the user equilibrium solution represents a computationally efficient alternative to discrete event simulation. Numerical results are presented for the performance comparison of the LSSR model with the user equilibrium and the system optimum load sharing factors in some example network topologies and traffic demands.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Mason, L.G.: Equilibrium flows, routing patterns and algorithms for store-and-forward networks. Journal of Large Scale systems 8, 187–209 (1985)

    MATH  Google Scholar 

  2. LeFaucheur, F., Lai, W.: Requirements for Support of Differentiated Services-aware MPLS Traffic Engineering. RFC 3564 (2003)

    Google Scholar 

  3. Marzo, J.L., Calle, E., Scoglio, C., Anjah, T.: QoS online routing and MPLS multilevel protection: a survey. IEEE Communications Magazine (10), 126–132 (2003)

    Google Scholar 

  4. Borkar, V., Kumar, P.: Dynamic Cesaro-Wardrop equilibration in networks. IEEE Trans. on Automatic Control (3), 382–396 (2003)

    Google Scholar 

  5. Ash, G.R.: Performance evaluation of QoS-routing methods for IP-based multiservice networks. Computer Communications 26(8), 817–833 (2003)

    Article  Google Scholar 

  6. Ash, G.R.: Traffic Engineering and QoS Optimization of Integrated Voice & Data Networks. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (2006)

    Google Scholar 

  7. Heidari, F., Mannor, S., Mason, L.G.: Reinforcement learning-based load shared sequential routing. IFIP-Networking (to appear, 2007)

    Google Scholar 

  8. Brunet, G.: Optimisation de l’acheminement séquentiel non hiérarchique par automates intelligents. Master’s thesis, INRS-Telecommunication (1991)

    Google Scholar 

  9. Mason, L.G.: An optimal learning algorithm for S-model environments. IEEE Trans. on Automatic Control 18(5), 493–496 (1973)

    Article  MATH  Google Scholar 

  10. Mason, L.G.: An optimal learning algorithm employing cross-correlation. In: Conference Record, Joint Automatic Control Conference, pp. 572–578 (1973)

    Google Scholar 

  11. Gallager, R.: A minimum delay routing algorithm using distributed computation. Communications, IEEE Trans. on 25(1), 73–85 (1977)

    Article  MATH  MathSciNet  Google Scholar 

  12. Cotton, M., Mason, L.G.: Adaptive isarithmic flow control in fast packet switching networks. IEEE Trans. on Communications 43(2-3-4), 1580–1590 (1995)

    Article  Google Scholar 

  13. Pelletier, A., Cotton, M., Mason, L.G.: Combined adaptive routing and flow control in fast packet switching networks. In: Proceedings of COMCON 4, Rhodes, Greece, pp. 557–569 (1993)

    Google Scholar 

  14. Vazquez-Abad, F.J., Mason, L.G.: Decentralized adaptive flow control of high-speed connectionless data networks. Journal of Operations Research 47(6), 928–942 (1999)

    Article  MATH  Google Scholar 

  15. Alanyali, M.: Learning automata in games with memory with application to circuit-switched routing. In: Decision and Control, 2004. CDC. 43rd IEEE Conference on, vol. 5, p. 4850. IEEE Computer Society Press, Los Alamitos (2004)

    Google Scholar 

  16. Greenberg, A.G., Srikant, R.: Computational techniques for accurate performance evaluation of multirate, multihop communication networks. IEEE/ACM Trans. on Networking 5(2), 266–277 (1997)

    Article  Google Scholar 

  17. Kelly, F.P.: Effective bandwidths at multi-class queues. Queueing Systems: Theory and Applications 9(1-2), 5–15 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  18. Wardrop, J.G.: Some theoretical aspects of road traffic research. In: Proceedings of the Institution of Civil Engineers, Part II, pp. 325–378 (1952)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Tijani Chahed Bruno Tuffin

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Brunet, G., Heidari, F., Mason, L.G. (2007). Load Shared Sequential Routing in MPLS Networks: System and User Optimal Solutions. In: Chahed, T., Tuffin, B. (eds) Network Control and Optimization. NET-COOP 2007. Lecture Notes in Computer Science, vol 4465. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72709-5_24

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-72709-5_24

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-72708-8

  • Online ISBN: 978-3-540-72709-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics