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.
QoS routing localized routing distributed routing Jains fairness index
Fahd M. Aldosari Michael E. Woodward
Department of Computing, School of Computing, Informatics and Media University of Bradford Bradford, UK
国际会议
2011 International Conference on Information and Computer Networks(ICICN 2011)(2011年信息与计算机网络国际会议)
贵阳
英文
271-276
2011-01-26(万方平台首次上网日期,不代表论文的发表时间)