Routing algorithms play an important role in calculating network performance where quality of service is important. There are two types of routing algorithms: local and global routing. Local routing is more effective than global routing in terms of decision-making [1]. This methodology significantly reduces the overheads associated with maintaining global state data at each hub, resulting in better routing performance. In this paper, we present a Restricted QoS steering computation that takes the Probability of Blocking Link into account (LBP). We compare the algorithm’s performance vs. 1) Time difference between the source and the destination 2) The nodes 3)Energy Consumption 4)Hubs That Are Alive 5)Hubs That Are Dead 6) Dynamic Hubs are a type of hub that is constantly changing. 7) Rest Stops 8) Overhead Routing 9) Packets sent using Constraint Based Routing (CBR) and the Widest Shortest Path (WSP).
Author (s) Details
Dr. R. Bhargava Rama Gowd
Department of ECE, JNTU, Anantapur, India.
T. Someshwari
TOCE, Bangalore, India. Antonio Colchete Filho
Dr. S. Thenappan
ECE Department, KNSIT, Bangalore, India.
Dr. M. N. Giri Prasad
Department of ECE, JNTU, Anantapur, India.
View Book :- https://stm.bookpi.org/NAER-V3/article/view/1854
