Study on Link Based Routing Algorithm for the Desired Quality of Service of a Network

Authors

  • R. Bhargava Rama Gowd Department of ECE, JNTU, Anantapur, India.
  • T. Someshwari TOCE, Bangalore, India.
  • S. Thenappan ECE Department, KNSIT, Bangalore, India.
  • M. N. Giri Prasad Department of ECE, JNTU, Anantapur, India.

DOI:

https://doi.org/10.9734/bpi/naer/v3/10377D

Keywords:

Constraint based routing, delay, localized routing, blocking probability, widest shortest path

Abstract

Routing algorithms play an important rolein the network performance calculation where Quality of service matters there are two types of routing algorithms:  Local and Global Routing. Local routing allows for more effective decision-making than global routing [1].  This methodology significantly reduces the overheads associated with maintaining global state data at each hub, thereby improving routing performance. We provide a Restricted QoS steering computation in this paper that takes the Probability of Blocking Link (LBP).We compare the performance of the algorithm w.r.t. 1) Delay between source and destination 2) Nodes 3)Consumed Energy 4)Alive Hubs 5) Dead Hubs 6) Dynamic Hubs 7) Rest Hubs 8) Routing Overhead 9) Packets Conveyed against the Constraint Based Routing(CBR) and Widest Shortest Path(WSP).

Published

2021-06-21

How to Cite

R. Bhargava Rama Gowd, T. Someshwari, S. Thenappan, & M. N. Giri Prasad. (2021). Study on Link Based Routing Algorithm for the Desired Quality of Service of a Network. New Approaches in Engineering Research Vol. 3, 90–102. https://doi.org/10.9734/bpi/naer/v3/10377D

Issue

New Approaches in Engineering Research Vol. 3

Section

Chapters