Advertisement

Annals of Telecommunications

, Volume 74, Issue 11–12, pp 697–715 | Cite as

Dynamic Multicriteria Alternative Routing for single- and multi-service reservation-oriented networks and its performance

  • Catarina Francisco
  • Lúcia MartinsEmail author
  • Deep Medhi
Article
  • 48 Downloads

Abstract

We propose a new Dynamic Multicriteria Alternative Routing (DMAR) method that applies to reservation-oriented networks. DMAR combines a dynamic alternative routing scheme with a periodic update of alternative paths according to a multicriteria algorithm that aims to balance the traffic between traffic flows in single-service networks and also between services in multi-service environments. We conducted extensive simulations to compare the performance of DMAR with that of other reference alternative routing schemes in single- and multi-service networks with several topologies and load scenarios, namely with non-stationary traffic. We show that DMAR efficiently adjusts to traffic changes while often presenting better network performance than the reference alternative routing schemes, particularly in the multicriteria sense.

Keywords

Multicriteria optimization QoS routing Dynamic alternative routing Multi-service networks Blocking probability Implied costs 

Notes

Acknowledgments

Lúcia Martins has been supported by FCT (Fundação para a Ciência e a Tecnologia) under project grant UID/MULTI/-00308/2013 and by FEDER Funds and National Funds through FCT under the project CENTRO-01-0145-FEDER-029312.

References

  1. 1.
    Ash G (1995) Dynamic network evolution, with examples from AT&T’s evolving dynamic network. IEEE Communications Magazine 33:26–39CrossRefGoogle Scholar
  2. 2.
    Gibbens R (1988) Dynamic routing in circuit-switched networks: the dynamic alternative routing strategy. Ph.D. thesis, University of CambridgeGoogle Scholar
  3. 3.
    Girard A (1990) Routing and dimensioning in circuit-switched networks. Addison-Wesley Publishing Company, ReadingGoogle Scholar
  4. 4.
    Wang M, Li S, Wong E, Zukerman M (2013) Blocking probability analysis of circuit-switched networks with long-lived and short-lived connections. J Opt Commun Netw 5(6):621–640CrossRefGoogle Scholar
  5. 5.
    Wang M, Li S, Wong E, Zukerman M (2014) Performance analysis of circuit switched multi-service multi-rate networks with alternative routing. IEEE/OSA J Lightwave Technol 32(2):179–200CrossRefGoogle Scholar
  6. 6.
    Conte M (2003) Dynamic routing in broadband networks. Kluwer Academic Publishers, NorwellCrossRefGoogle Scholar
  7. 7.
    Katib I, Medhi D (2009) Adaptive alternate routing in WDM networks and its performance tradeoffs in the presence of wavelength converters. Opt Switch Netw 6(3):181–193CrossRefGoogle Scholar
  8. 8.
    Lin H, Wang S, Tsai C, Hung M (2008) Traffic intensity based alternate routing for all-optical WDM networks. J Lightwave Technol 26:3604–3616CrossRefGoogle Scholar
  9. 9.
    Lin H, Wang S, Hung M (2008) Finding routing paths for alternate routing in all-optical WDM networks. J Lightwave Technol 26:1432–1444CrossRefGoogle Scholar
  10. 10.
    Kist A, Harris R (2003) Scheme for alternative packet overflow routing (SAPOR). In: Workshop on High Performance Switching and Routing, HPSR. IEEE, pp 269–274Google Scholar
  11. 11.
    Srivastava S, Krithikaivasan B, Beard C, et al (2004) Benefits of traffic engineering using QoS routing schemes and network controls. Comput Commun 27:387–399CrossRefGoogle Scholar
  12. 12.
    Ash G, McDysan D (2012) Generic connection admission control (GCAC) algorithm specification for IP/MPLS networks. RFC 6601. http://www.ietf.org/rfc/rfc6601.txt
  13. 13.
    Martins L, Francisco C, Redol J, Craveirinha J, Clímaco J, Monteiro P (2009) Evaluation of a Multiobjective alternative routing method in carrier IP/MPLS networks. In: Proceedings of the 8th International IFIP-TC 6 Networking Conference, Networking 2009, pp 195–206Google Scholar
  14. 14.
    Clímaco J, Craveirinha J, Girão-Silva R (2016) Multicriteria analysis in telecommunication network planning and design: a survey. Int Ser Oper Res Manag Sci 233:1167–1233Google Scholar
  15. 15.
    Martins L, Craveirinha J, Clímaco J, Gomes T (2005) On a bi-dimensional dynamic alternative routing method. Eur J Oper Res Spec Issue Adv Complex Syst Model 166(3):828– 842MathSciNetzbMATHGoogle Scholar
  16. 16.
    Martins L, Craveirinha J, Clímaco J (2006) A new multiobjective dynamic routing method for multiservice networks: modelling and performance. CMS 3(3):225–244MathSciNetCrossRefGoogle Scholar
  17. 17.
    Kelly FP (1988) Routing in circuit-switched networks: optimization, shadow prices and decentralization. Adv Appl Probab 20:112–144MathSciNetCrossRefGoogle Scholar
  18. 18.
    Francisco C, Martins L, Medhi D (2018) Traffic model for dynamic multicriteria alternative routing for single- and multi-service reservation-oriented networks. Tech. Rep. 1, INESC-Coimbra, available online: https://www.uc.pt/en/org/inescc/res_reports_docs/research_reports
  19. 19.
    Kaufman JS (1981) Blocking in a shared resource environment. IEEE Trans Commun 29(10):1474–1481CrossRefGoogle Scholar
  20. 20.
    Mitra D, Morrison JA (1994) Erlang capacity and uniform approximations for shared unbuffered resources. IEEE/ACM Trans Netw 2(6):558–570CrossRefGoogle Scholar
  21. 21.
    Medhi D, Guptan S (1997) Network dimensioning and performance of multiservice, multirate loss networks with dynamic routing. IEEE/ACM Trans Netw 5:944–957CrossRefGoogle Scholar
  22. 22.
    Medhi D (2002) QoS Routing computation with path caching: a framework and network performance. IEEE Commun Mag 40(12):106–113CrossRefGoogle Scholar
  23. 23.
    Sivasankar R, Ramam S, Subramaniam S, Rao T, Medhi D (2000) Some studies on the impact of dynamic traffic in a QoS-based dynamic routing environment. In: Proceedings of 2000 IEEE International Conference on Communications (ICC), vol 2, pp 959–963Google Scholar
  24. 24.
    Mesquite Software: CSIM. http://www.mesquite.com/
  25. 25.
    Chemouil P, Filipiak J, Gauthier P (1990) Performance issues in the design of dynamically controlled circuit-switched networks. IEEE Commun Mag 28(10):90–95CrossRefGoogle Scholar

Copyright information

© Institut Mines-Télécom and Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Nokia Solutions and Networks Portugal S.A.AlfragidePortugal
  2. 2.Electrical and Computer Engineering DepartmentUniversity of CoimbraCoimbraPortugal
  3. 3.Computer Science & Electrical Engineering Department, School of Computing and EngineeringUniversity of Missouri–Kansas CityKansas CityUSA

Personalised recommendations