Abstract
Localized Quality of Service (QoS) routing has recently been proposed as a promising alternative to the currently deployed global routing algorithms. In localized routing schemes, routing decisions are taken solely based on locally collected statistical information rather than global state information [1]. This approach significantly reduces the overheads associated with maintaining global state information at each node, which in turn improves the overall routing performance. In this paper we introduce a Localized QoS routing algorithm based on Link Blocking Probability (LBP). We compare the performance of the proposed algorithm against the most efficient localized routing algorithm, namely Credit Based Routing (CBR), and against the contemporary global routing algorithm, the Widest Shortest Path (WSP). With the aid of simulations, we show that the introduced algorithm outperforms the others in terms of the overall network blocking probability.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
