Link based routing algorithm for the desired quality of service of a network

ISSN: 22498958
Citations of this article
Mendeley users who have this article in their library.


The routing algorithms play a vital role in the network performance calculation where Quality of service matters there are two algorithms in routing i.e Local and Global Routing. Decisions can be taken effectively in local routing rather than Global routing [1]. This methodology altogether lessens the overheads connected with keeping up worldwide state data at every hub, which thus enhances the performance of the routing. In this paper we present a Restricted QoS steering calculation taking into account 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).




Gowd, R. B. R., Thenappan, S., & GiriPrasad, M. N. (2019). Link based routing algorithm for the desired quality of service of a network. International Journal of Engineering and Advanced Technology, 8(4), 199–203.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free