Advertisement

Dynamic Routing in QoS-Aware Traffic Engineered Networks

  • Stefano Avallone
  • Fernando Kuipers
  • Giorgio Ventre
  • Piet Van Mieghem
Conference paper
Part of the IFIP International Federation for Information Processing book series (IFIPAICT, volume 196)

Abstract

We propose a proper length function for an existing QoS routing algorithm (SAMCRA) that attempts to optimize network utilization while still offering QoS guarantees. This paper presents a comparison between several proposed algorithms via simulation studies. The simulations show that SAMCRA with a proper length performs similarly or even better than the best among the other algorithms and it has a fast running time.

Keywords

QoS routing Traffic Engineering network dynamics 

References

  1. Ahuja, R.K., Magnanti, T.L., and Orlin, J.B. (1993). Network Flows: Theory, Algorithms and Applications. Englewood Cliffs, NJ: Prentice-Hall.Google Scholar
  2. Banerjee, G. and Sidhu, D. (2002). Comparative analysis of path computation techniques for MPLS traffic engineering. Computer Networks, 40:149–165.CrossRefGoogle Scholar
  3. De Neve, H. and Van Mieghem, P. (2000). TAMCRA: A Tunable Accuracy Multiple Constraints Routing Algorithm. Computer Communications, 23:667–679.CrossRefGoogle Scholar
  4. Guerin, R., Williams, D., and Orda, A. (1997). QoS routing mechanisms and OSPF extensions. In Proc. Globecom.Google Scholar
  5. Iliadis, I. and Bauer, D. (2002). A New Class of Online Minimum-Interference Routing Algorithms. Networking 2002, LNCS 2345, pages 959–971.Google Scholar
  6. Kar, K., Kodialam, M., and Lakshman, T.V. (2000). Minimum Interference Routing of Bandwidth Guaranteed Tunnels with MPLS Traffic Engineering Applications. IEEE Journal on Selected Areas in Communications, 18(12):2566–2579.CrossRefGoogle Scholar
  7. Kuipers, F., Van Mieghem, P., Korkmaz, T., and Krunz, M. (2002). An overview of constraint-based path selection algorithms for QoS routing. IEEE Communications Magazine, 40(12):50–55.CrossRefGoogle Scholar
  8. Medina, A., Matta, I., and Byers, J. (2000). On the Origin of Power Laws in Internet Topology. ACM Computer Communications Review, 30(2).Google Scholar
  9. Van Mieghem, P. and Kuipers, F.A. (2004). Concepts of Exact QoS Routing Algorithms. IEEE ACM Transactions on Networking, 12(5):851–864.CrossRefGoogle Scholar
  10. Wang, Bin, Su, Xu, and Chen, C.L.P. (2002). A New Bandwidth Guaranteed Routing Algorithm for MPLS Traffic Engineering. In Proc. of IEEE International Conference on Communications, ICC 2002.Google Scholar

Copyright information

© International Federation for Information Processing 2006

Authors and Affiliations

  • Stefano Avallone
    • 1
  • Fernando Kuipers
    • 2
  • Giorgio Ventre
    • 1
  • Piet Van Mieghem
    • 2
  1. 1.COMICS Lab, Dipartimento di Informatica e SistemisticaUniversita di Napoli Federico IINapoliItaly
  2. 2.Network Architectures and Services, Faculty of Electrical Engineering, Mathematics and Computer ScienceDelft University of TechnologyDelftThe Netherlands

Personalised recommendations