Implementation of Link based Probability Routing Algorithm for Achieving Desired Quality of Service

Global routing algorithms maintain the state information at each node, but as the number of nodes increases it becomes difficult to provide the best routing path, thus localized Quality of Service routing (QoS) gave relax to global routing from the overhead by taking routing decisions only founded on locally numerical information relatively to global state information. This paper introduces “Link Blocking Probability” (LBP) which is an algorithm based on localized QoS. This mechanism lowers the overheads linked with global state information at every point which increases the performance of routing. The algorithm which is proposed is compared with “localized routing algorithm (CBR)”, and “contemporary global routing algorithm (WSP)”. This paper presents the proposed algorithm which works more efficiently than the “CBR” and “WSP” algorithm and improves the overall network performance.