Link Based Routing Algorithm for the Desired Quality of Service of a Network
R.Bhargava Rama Gowd1, S.Thenappan2, Giri Prasad M.N3

1R. Bhargava Rama Gowd, Research Scholar, Department of ECE, JNTU, Anantapur, Anantapur (Andhra Pradesh), India.
2Dr.S.Thenappan, Professor Department of ECE, KNSIT, Bangalore (Karnataka), India.
3Dr.GiriPrasad M.N, Professor, Department of ECE, JNTU, Anantapur, Anantapur (Andhra Pradesh), India.

Manuscript received on 18 April 2019 | Revised Manuscript received on 25 April 2019 | Manuscript published on 30 April 2019 | PP: 199-203 | Volume-8 Issue-4, April 2019 | Retrieval Number: C5938028319/19©BEIESP
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (

Abstract: 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).
Keywords: CBR, Delay, Localized Routing; blocking probability, WSP

Scope of the Article: Routing, Switching and Addressing Techniques