Springer Nature is making Coronavirus research free. View research | View latest news | Sign up for updates

A high performance optimal dynamic routing algorithm with unicast multichannel QoS guarantee in communication systems

  • 225 Accesses

  • 5 Citations


Dynamic routing protocols play an important role in today’s networks. In communication networks, in a current data transmission session, failing nodes and links is a destructor event which loses packets immediately and it can also waste network resources and services seriously. Sometimes failing nodes can disconnect data transmission and, therefore, lost packets must be retransmitted by new session. In this situation, the routing algorithm must discard failed nodes and must repair paths of session by rerouting them. In this case, static routing algorithms and some existing dynamic routing algorithms cannot manage faulty paths fairly and network efficiency is seriously declined. The capability to compensate for topology changes is the most important advantage dynamic routing offers over static routing. An efficient dynamic routing algorithm tries to reroute and change faulty paths without disconnecting sessions and keeps packet transmission in a desirable rate. It is important to tell that a dynamic routing algorithm should provide multi essential parameters, such as acceptable delay, jitter, bandwidth, multichannel paths, virtual channel connections, label switching technology, optimal resource allocation, optimal efficiency in the case of multimedia, and real time applications. This paper proposes a new dynamic framework which transforms static routing algorithms to dynamic routing algorithms. Using the new dynamic framework, this paper constructs an Optimal Dynamic Unicast Multichannel QoS Routing (ODUMR) algorithm based on the Constrained Based Routing (CBR) and Label Switching Technology which is called as ODUMR Algorithm. The performance of ODUMR is analyzed by network simulator tools such as OpNet, MATLAB, and WinQSB. ODUMR produces results better than the existing static and dynamic routing algorithms in terms of necessary parameters.

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


  1. 1.

    Al-Kasassbeh M, Adda M (2009) Network fault detection with wiener filter-based agent. Optik 32(4):824–833

  2. 2.

    Ash GR (1997) Dynamic routing in telecommunications networks, 1st edn. McGraw-Hill, New York

  3. 3.

    Aslam MN, Aziz Y (2010) Traffic engineering with multiprotocol label switching: traffic engineering with multiprotocol label switching, performance comparison with IP networks. LAP LAMBERT Academic

  4. 4.

    Baroncelli F, Martini B, Martini V, Castoldi P (2011) Extending next generation network (NGN) architecture for connection-oriented transport. Comput Commun 34(9):1100–1111

  5. 5.

    Bertsekas D, Gallager R (1992) Data networks, 2nd edn. Prentice-Hall, New Jersey

  6. 6.

    Bistarelli S, Montanari U, Rossi F, Santini F (2007) Modelling multicast QoS routing by using best-tree search in and-or graphs and soft constraint logic programming. Electron Notes Theor Comput Sci 190(3):111–127

  7. 7.

    Black UN (2002) MPLS and label switching networks, 2nd edn. Prentice Hall, New York

  8. 8.

    Cao F, Yuan Y (2011) Learning errors of linear programming support vector regression. Appl Math Model 35(7):1820–1828

  9. 9.

    Castelucio A, Tadeu A (2010) Intra-domain IP traceback using OSPF. Comput Commun. doi:10.1016/j.comcom.2010.08.010

  10. 10.

    Cheng PC, Zhang B, Massey D, Zhang L (2011) Identifying BGP routing table transfers. Comput Netw 55(3):636–649

  11. 11.

    Conte M (2002) Dynamic routing in broadband networks (broadband networks and services), 1st edn. Springer, Berlin

  12. 12.

    Deep K, Singh KP, Kansal M, Mohan C (2011) An interactive method using genetic algorithm for multi-objective optimization problems modeled in fuzzy environment. Expert Syst Appl 38(4):1659–1667

  13. 13.

    Dolev D, Jamin S, Mokryn O, Shavitt Y (2008) Internet resiliency to attacks and failures under BGP policy routing. Comput Netw 50(16):3183–3196

  14. 14.

    Ebrahim RM, Razmi J (2009) A hybrid meta heuristic algorithm for bi-objective minimum cost flow (BMCF) problem. Adv Eng Softw 40(4):1056–1062

  15. 15.

    Eiji Oki AI (2010) Fine two-phase routing over shortest paths with traffic matrix. Comput Netw 54(18):3223–3231

  16. 16.

    Eusébio A, Figueira JR (2009) On the computation of all supported efficient solutions in multi-objective integer network flow problems. Eur J Oper Res 199(4):68–76

  17. 17.

    Garcia-Luna-Aceves J, Behrens J (1995) Distributed, scalable routing based on vectors of link states. IEEE J Sel Areas Commun 13(8):1383–1395

  18. 18.

    Lai G-C, Chang RS (1999) Support QoS in IP over ATM. Comput Commun 5(22):411–418

  19. 19.

    Guo R, Delgado-Frias JG (2009) IP routing table compaction and sampling schemes to enhance TCAM cache performance. J Syst Archit 55(1):61–69

  20. 20.

    Idzikowski F, Orlowski S (2011) Dynamic routing at different layers in IP-over-WDM networks maximizing energy savings. Opt Switch Netw 8(3):181–200

  21. 21.

    Isazadeh A, Heydarian M (2008) Optimal multicast multichannel routing in computer networks. Comput Commun 31(17):4149–4161

  22. 22.

    Isazadeh A, Heydarian M (2010) Traffic distribution for end-to-end QoS routing with multicast multichannel services. J Supercomput 52(1):47–81

  23. 23.

    Johnson A (2007) Routing protocols and concepts, CCNA exploration labs and study guide. Cisco Press

  24. 24.

    Kenyon T (2002) Data networks: routing, security, and performance optimization, 1st edn. Digital Press

  25. 25.

    Khadivi P, Samavi S, Todd T (2008) Multi-constraint QoS routing using a new single mixed metrics. J Netw Comput Appl 31(4):656–676

  26. 26.

    Kim C, Ko Y-B, Vaidya NH (2010) Link-state routing without broadcast storming for multichannel mesh networks. Comput Netw 54(2):330–340

  27. 27.

    Kocak C, Erturk I, Ekiz H (2009) MPLS over ATM and IP over ATM methods for multimedia applications. Comput Stand Interfaces 31(1):153–160

  28. 28.

    Lai WK, Tsai C-D, Shieh C-S (2008) Dynamic appointment of ABR for the OSPF routing protocol. Comput Commun 31(1):3098–3102

  29. 29.

    Lee SS, Tseng P-K, Chen A (2012) Link weight assignment and loop-free routing table update for link state routing protocols in energy-aware internet. Futur Gener Comput Syst 28(2):437–445

  30. 30.

    Li Q, Xu M, Wu J, Lee PP, Chiu DM (2011) Toward a practical approach for BGP stability with root cause check. J Parallel Distrib Comput 71(8):1098–1110

  31. 31.

    Liu D, Barber B, DiGrande L (2009) Routing protocols: RIP, RIPv2, IGRP, EIGRP, OSPF. Cisco Press

  32. 32.

    Luenberger DG, Ye Y (2000) Linear and nonlinear programming, 3rd edn. Springer, Berlin

  33. 33.

    Masip-Bruin X, Yannuzzi M (2006) Research challenges in QoS routing. Comput Commun 29(5):563–581

  34. 34.

    Matrawy A (2003) A rate adaption algorithm for multicast sources in priority-based IP networks. IEEE Commun Lett 7(2):94–96

  35. 35.

    Moy J (1994) OSPF Version 2. Internet RFC 1583,

  36. 36.

    Mérindol P, Francois P, Bonaventure O, Cateloin S, Pansiot J-J (2011) An efficient algorithm to enable path diversity in link state routing networks. Comput Netw 55(5):1132–1149

  37. 37.

    Pranggono B, Elmirghani JMH (2011) Design and performance evaluation of a metro WDM storage area network with IP datagram support. Optik 122(18):1598–1602

  38. 38.

    Randhawa R, Sohal J (2010) Comparison and performance of routing protocols in SONET based networks. Optik 121(11):2329–2351

  39. 39.

    Rangan PV (1993) The authenticated datagram protocol: a high performance, subtransport level, secure communication protocol. Comput Secur 12(3):305–314

  40. 40.

    Rango FD, Veltri F, Fazio P (2011) Interference aware-based ad-hoc on demand distance vector (ia-aodv) ultra wideband system routing protocol. Comput Commun 34(12):1475–1483

  41. 41.

    Rao Y, Wang R (2011) Performance of QoS routing using genetic algorithm for polar-orbit LEO satellite networks. AEÜ, Int J Electron Commun 65(6):530–538

  42. 42.

    Riesco A, Verdejo A (2009) Implementing and analyzing in Maude the enhanced interior gateway routing protocol. Electron Notes Theor Comput Sci 238(3):249–266

  43. 43.

    Sadok DH, Souto E, Feitosa E, Kelner J, Westberg L (2009) RIP a robust IP access architecture. Comput Secur 28(6):359–380

  44. 44.

    Stallings W (1997) Data and computer communications. Prentice Hall, New Jersey

  45. 45.

    Su CF (2000) High speed packet classification. In: Proceedings of IEEE GLOBCOM, vol 1, pp 582–586

  46. 46.

    Sun B, Pi S, Gui C, Zeng Y, Yan B, Wang W, Qin Q (2008) Multiple constraints QoS multicast routing optimization algorithm in MANET based on GA. Prog Nat Sci 18(3):331–336

  47. 47.

    Thomas SA (2001) IP switching and routing essentials: understanding RIP, OSPF, BGP, MPLS, CR-LDP, and RSVP-TE, 1st edn. Wiley, New York

  48. 48.

    Wang Z (2001) Internet QoS: architectures and mechanisms for quality of service. Networking. Morgan Kaufmann, San Mateo. Bell Labs, Lucent Technology

  49. 49.

    Xue GL (2003) Optimal multichannel data transmission in computer networks. Comput Commun 26:759–765

  50. 50.

    Yi J, Adnane A, David S, Parrein B (2011) Multipath optimized link state routing for mobile ad hoc networks. Ad Hoc Netw 9(1):28–47

  51. 51.

    Yuksel M, Ramakrishnan K (2011) Cross-layer failure restoration of IP multicast with applications to IPTV. Comput Netw 55(9):2329–2351

  52. 52.

    Zhang M, Liu B (2011) Traffic engineering for proactive failure recovery of IP networks. Tsinghua Sci Technol 16(1):55–61

Download references

Author information

Correspondence to Mohsen Heydarian.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Heydarian, M. A high performance optimal dynamic routing algorithm with unicast multichannel QoS guarantee in communication systems. J Supercomput 62, 315–344 (2012).

Download citation


  • High performance dynamic routing
  • Unicasting
  • Multichannel path
  • Quality of services
  • Optimized resource allocation