Skip to main content
SpringerLink
Log in

To investigate an efficient resilience oriented routing mechanism for high speed networks

  • Original Research
  • Published:
International Journal of Information Technology Aims and scope Submit manuscript

Abstract

This study aims at highlighting unicast routing techniques and their performance under different traffic arrival distributions. It is imperative to implement routing technique supporting resilience as single failure in high-speed networks even for fraction of second can disrupt millions of users. In this paper, Routing techniques such as session, distance vector, LS (link state) have been compared on basis of average E2E (end to end) delay, throughput, and jitter. In this investigation, four diverse traffic models CBR (constant bit rate), exponential, Poisson and Pareto have been considered with respect to user datagram protocol. It is observed that LS routing with Poisson traffic has least average E2E delay of 5.13 ms under single link failure and no failure in network. Network achieves best throughput of 1789.40 Kbps for session routing with CBR traffic. Network offers least jitter of 0.0002 ms for session routing with Poisson traffic. On occurrence of single link failure, maximum throughput and least jitter are achieved by session routing with Pareto traffic and CBR traffic respectively. The investigations in this paper provide insight into the selection of appropriate routing technique and traffic distribution for a particular application meeting its quality of service requirements.

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

Similar content being viewed by others

References

  1. Durresi A, Paruchuri V, Innamuri J, Anderson BL, Jain R (2003) Quality based optical routing protocol. Proc SPIE 5247:410–420

    Article  Google Scholar 

  2. Chatterjee BC, Sarma N, Sahu PP (2012) Priority based routing and wavelength assignment with traffic grooming for optical networks. J Opt Commun Netw 4(6):480–489

    Article  Google Scholar 

  3. Hasan MM, Jue Jason P (2009) Online partitioning for scalable and survivable optical networks. J Opt Commun Netw 1(2):A133–A142

    Article  Google Scholar 

  4. Shen G, Wei Y, Bose SK (2014) Optimal design for shared backup path protected elastic optical networks under single-link failure. J Opt Commun Netw 6(7):649–659

    Article  Google Scholar 

  5. Maier G, Pattavina A, De Patre S, Martinelli M (2002) Optical network survivability: protection techniques in the WDM layer. Photon Netw Commun 4(3/4):251–269. https://doi.org/10.1023/A:1016047527226

    Article  Google Scholar 

  6. Nejabati R, Peng S, Gou B, Channegowda M, Simeonidou D (2015) Toward a completely softwareized optical network [Invited]. J Opt Commun Netw 7(12):B222–B231

    Article  Google Scholar 

  7. Datta P (2005) Survivability approaches for multiple failures in WDM optical networks. Dissertation, Iowa State University Ames, Iowa

  8. Jue JP (2001) Lightpath establishment in wavelength-routed WDM optical networks. In: Ruan Lu, Ding-Zhu Du (eds) Optical networks-recent advances. Kluwer Academic Publishers, Cambridge, pp 99–122

    Chapter  Google Scholar 

  9. Fall K, Varadhan K (2011) The ns Manual (formerly ns Notes and Documentation), the VINT project

  10. Bornhager M (2002) Link-state routing protocols. Halmstad University, Session Number Version 2002–1. https://www.hh.se/download/18.70cf2e49129168da015800072015/Link-State+routing+protocols.pdf

  11. Zang H et al (1999) Connection management for wavelength routed WDM networks. In: Global Telecommunications conference. Proceedings of Globecom’99, pp 1428–1432

  12. Savage S. Lecture 8: routing| distance-vector algorithms, CSE 123: Computer Networks, UCSDCSE. https://cseweb.ucsd.edu/classes/fa11/cse123-a/123f11_Lec9.pdf

  13. Aloul FA, Rawi BA, Aboelaze M (2007) Routing in optical and non-optical networks using boolean satisfiability. J Commun 2:49–56

    Article  Google Scholar 

  14. Snoeren AC. Lecture 12: link-state routing, CSE 123: Computer Networks, UCSDCSE. https://cseweb.ucsd.edu/classes/fa10/cse123/lectures/123-fa10-l12.pdf

  15. Patra SK, Mishra SN (2015) Behavior analysis of self-similarity characteristics of network traffic with UDP and TCP. Int J Latest Trends Eng Technol 2:176–180

    Google Scholar 

  16. Singh B, Hans R (2015) TCP and UDP based performance analysis of AODV, DSR and DSDV routing protocols under different traffic conditions in mobile adhoc networks. Int J Future Gener Commun Netw 8:73–92

    Article  Google Scholar 

  17. Nayak AK, Rai SC, Mall R (2016) Computer Network simulation using NS2. CRC Press, Taylor & Francis Group, Boca Raton

  18. Sarkar NI (2012) Impact of traffic arrival distributions on an 802.11 ad hoc network: modeling and performance study. J Select Areas Telecommun (JSAT) 2:9–16

    Google Scholar 

  19. Adas A (1997) Traffic models in broadband networks. IEEE Commun Mag 35:82–89

    Article  Google Scholar 

  20. Hosamo M (2017) Source traffic modeling using Pareto traffic generator. J Comput Netw 4:11–19

    Article  Google Scholar 

  21. Alakiri OH, Oladeji Florence A, Benjamin CB, Okolie CC, Okikiola MF (2014) The desirability of Pareto distribution for modeling modern internet traffic characteristics. Int J Novel Res Eng Appl Sci (IJNREAS) 1(1):2–9

    Google Scholar 

  22. Issariyakul T, Hossain E (2009) Introduction to network simulator NS2. Springer Science + Business Media, New York

    Book  Google Scholar 

  23. Kurundkar S, Joshi S, Waghmare LM (2017) Modeling and statistical analysis of scenario metric parameters of ad hoc on demand distance vector routing protocol. Wirel Pers Commun 96(1):183–197

    Article  Google Scholar 

  24. Chen Y (2013) Mathematical modelling of end-to-end packet delay in multi-hop wireless networks and their applications to QoS provisioning, thesis submitted for the degree of doctor of philosophy, Communication and Information systems research group. Dept. of Electronics and Electrical Engineering, University College, London

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. ECE Department, Deenbandhu Chhotu Ram University of Science and Technology, Murthal, Sonepat, Haryana, 131027, India

    Himanshi Saini & Amit Kumar Garg

Authors
  1. Himanshi Saini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Amit Kumar Garg
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Himanshi Saini.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Saini, H., Garg, A.K. To investigate an efficient resilience oriented routing mechanism for high speed networks. Int. j. inf. tecnol. 14, 569–578 (2022). https://doi.org/10.1007/s41870-018-0089-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s41870-018-0089-0

Keywords

Search

Navigation