Study on Link Based Routing Algorithm for the Desired Quality of Service of a Network
Study on Link Based Routing Algorithm for the Desired Quality of Service of a Network
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).
#constraint #based #routing #delay #localized #blocking #probability #widest #path