Skip to main content
SpringerLink
Log in

Dynamic distributed unicast routing: optimal incremental paths

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Developing new mathematical frameworks such as distributed dynamic routing algorithms for constructing optimal incremental paths from a node to another node is an important challenge in data communication networks. These new algorithms can model network resources optimally and increase network performances. A bundle of single routes in a current communication path, which starts from a source node and ends to a destination node, can consist of several successive nodes and links. The Incremental term emphasizes that the number of routes (links and nodes) in a current path can change so that achieving more data rate and optimal efficiency in the network. In this paper, our problem is to add/omit some routes consisting of some nodes and links to/from the current unicast path dynamically and optimally. We call this problem the Optimal Dynamic Distributed Unicast Routing (ODDUR) problem and it is a NP-complete problem. This problem can be formulated as a new type of Linear Programming Problem (LPP) for finding a minimum cost multichannel unicast path, which this path will minimize end-to-end delay and bandwidth consumption along the routes from the source node to the destination node. In this paper, at first a new mathematical framework will be constructed and then this framework will propose the new optimal dynamic distributed unicast routing algorithm for solving our LPP problem. This algorithm will compute an optimal solution for our LPP based on the simplex method and postoptimality computations and will reduce computations and consumed time. Simulation results will show that our new algorithm is more efficient than other available algorithms in terms of utilization of bandwidths and data rate.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13

Similar content being viewed by others

References

  1. Akar N, Toksoz M (2011) Mpls automatic bandwidth allocation via adaptive hysteresis. Comput Netw 55(5):1181–1196

    Article  MATH  Google Scholar 

  2. Andina D, Ropero-Pelez FJ (2013) On the biological plausibility of artificial metaplasticity learning algorithm. Neurocomputing 114:32–35

    Article  Google Scholar 

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

    Google Scholar 

  4. 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 Publishing, Saarbrücken

    Google Scholar 

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

    Google Scholar 

  6. Capone A, Carello G, Filippini I, Gualandi S, Malucelli F (2010) Routing, scheduling and channel assignment in wireless mesh networks: optimization models and algorithms. Ad Hoc Netw 8(6):545–563

    Article  Google Scholar 

  7. Chen J, Tarn W-H, Hsu W-H, Wang C-C (2012) Cross-layer end-to-end label switching protocol for WIMAX–MPLS heterogeneous networks. J Syst Softw 85(11):2459–2469

    Article  Google Scholar 

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

    Google Scholar 

  9. Farrel A (2004) The Internet and its protocols. Morgan Kaufmann, San Mateo

    Google Scholar 

  10. Ford LR, Fulkerson DR (1958) Constructing maximal dynamic flows from static flows. Oper Res 6:419–433

    Article  MathSciNet  Google Scholar 

  11. Ford LR, Fulkerson DR (1958) A suggested computation for maximal multi-commodity network flows. Manag Sci 5(1):97–101

    Article  MATH  MathSciNet  Google Scholar 

  12. Fortz MTB (2002) Optimizing OSPF/IS-IS weights in a changing world. IEEE J Sel Areas Commun 20(1):756–767

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  14. Heydarian M, Mogavi RH (2013) A new high performance approach: merging optimal multicast sessions for supporting multisource routing. J Supercomput 63(3):871–896

    Article  Google Scholar 

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

    Article  Google Scholar 

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

    Article  Google Scholar 

  17. Isazadeh A, Heydarian M (2012) Distributed multicast multichannel paths. Telecommun Syst 50(1):55–70

    Article  Google Scholar 

  18. Jiang J, Li W, Luo J, Tan J (2013) A network accountability based verification mechanism for detecting inter-domain routing path inconsistency. J Netw Comput Appl. Available online

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

    Google Scholar 

  20. Kalderstamemail J, Eden P, Bendahl P-O, Strand C, Ferno M, Ohlsson M (2013) Training artificial neural networks directly on the concordance index for censored data using genetic algorithms. Artif Intell Med 58(2):125–132

    Article  Google Scholar 

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

  22. Liu D, Barber B, DiGrande L (2009) Routing protocols: RIP, RIPv2, IGRP, EIGRP, OSPF. Cisco Press, Indianapolis. Cisco CCNA/CCENT exam 640-802, 640-822, 640-816 preparation kit

    Google Scholar 

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

    Google Scholar 

  24. Mineno H, Soga K, Takenaka T (2011) Integrated protocol for optimized link state routing and localization: Olsr-l. Simul Model Pract Theory 19(8):1711–1722

    Article  Google Scholar 

  25. Moltchanov D (2012) A study of TCP performance in wireless environment using fixed-point approximation. Comput Netw 54(6):1263–1285

    Article  Google Scholar 

  26. Moy J (1994) OSPF version 2. Internet RFC 1583. http://ds.internic.net/rfc/rfc1583.txt

  27. Oki E, Iwaki A (2010) Fine two-phase routing over shortest paths with traffic matrix. Comput Netw 54(18):3223–3231

    Article  MATH  Google Scholar 

  28. Okumus IT, Mantar HA, Hwang J (2005) Inter-domain QoS routing on diffserv networks: a region-based approach. Comput Commun 28(10):174–188

    Article  Google Scholar 

  29. Pei D, Zhang B, Massey D, Zhang L (2006) An analysis of convergence delay in path vector routing protocols. Comput Netw 50(3):398–421

    Article  MATH  Google Scholar 

  30. Riesco A, Verdejo A (2009) Implementing and analyzing in Maude the enhanced interior gateway routing protocol. Electronic notes in theoretical computer science, vol 238

    Google Scholar 

  31. Savic A, Kratica J, Milanovic M, Dugosija D (2010) A mixed integer linear programming formulation of the maximum betweenness problem. Eur J Oper Res 206(3):522–527

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  33. Sun Y, Cheng AC (2012) Machine learning on-a-chip: a high-performance low-power reusable neuron architecture for artificial neural networks in ECG classifications. Comput Biol Med 42(7):751–757

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

  35. Vielma GNJP, Ahmed S (2012) Mixed integer linear programming formulations for probabilistic constraints. Oper Res Lett 40(3):153–158

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

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

    Article  Google Scholar 

Download references

Acknowledgements

This research has been supported by a research fund number 217/sad/335 from Azarbaijan Shahid Madani University.

Author information

Authors and Affiliations

  1. Faculty of Information Technology and Computer Engineering, Azarbaijan Shahid Madani University, Tabriz, Iran

    Mohsen Heydarian

Authors
  1. Mohsen Heydarian
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mohsen Heydarian.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Heydarian, M. Dynamic distributed unicast routing: optimal incremental paths. J Supercomput 68, 214–244 (2014). https://doi.org/10.1007/s11227-013-1035-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-013-1035-3

Keywords

Search

Navigation