Localized approach to distributed QoS routing with a bandwidth guarantee

Localized Quality of Service (QoS) routing has been recently proposed as a promising alternative to the currently deployed global routing schemes. In localized routing schemes, routing decisions are taken solely based on locally collected statistical information rather than global state information. 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 Distributed QoS Routing algorithm (LDR), which integrates the localized routing scheme into distributed routing. We compare the performance of our algorithm against other existing 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 proposed algorithm outperforms the others in terms of the overall network blocking probability.