This Article Full Text (PDF) References Alert me when this article is cited Alert me if a correction is posted Services Email this article to a friend Similar articles in this journal Similar articles in Web of Science Alert me to new issues of the journal Add to Saved Citations Download to citation manager Request Permissions Request Reprints Add to My Marked Citations Citing Articles Citing Articles via Google Scholar Citing Articles via Scopus Google Scholar Articles by Alabbad, S. H. Articles by Woodward, M. E. Search for Related Content Social Bookmarking                         What's this?

Localized Route Selection for Traffic with Bandwidth Guarantees

Department of Computing, School of Informatics University of Bradford Bradford BD7 1DP, UK

Michael E. Woodward

Department of Computing, School of Informatics University of Bradford Bradford BD7 1DP, UK, M.E.Woodward{at}Bradford.ac.uk

Localized Quality of Service (QoS) routing has recently been proposed as a viable alternative approach to traditional QoS routing algorithms that use global state information. In this approach, problems associated with maintaining global state information are avoided by having the source nodes to infer the network QoS state based on flow blocking statistics collected locally, and perform flow routing using this localized view of the network QoS state. One of the most important QoS metrics is bandwidth and in this paper we introduce a localized routing scheme for providing bandwidth guarantees, based on a crediting scheme that uses an estimate of flow blocking probability to adjust credits and select routes. We compare its performance against the localized proportional sticky routing (PSR) algorithm using different types of network topologies, QoS requirements and traffic patterns and under a wide range of traffic loads. Extensive simulations show that our algorithm outperforms the PSR scheme while maintaining the same level of adaptivity and stability. We also compare performance against the well known widest-shortest path (WSP) algorithm that uses the global network QoS state and show that our algorithm gives a comparable performance with better time complexity and very much lower communication overhead. The simulations were implemented using OMNET ++, a discrete-event simulator that provides a rich set of functions and tools for simulating the elements of a communication network, such as nodes, links and packets.

Key Words: Communication networks • quality of service • localized routing

SIMULATION, Vol. 83, No. 3, 259-272 (2007)
DOI: 10.1177/0037549707081185


CiteULike    Complore    Connotea    Del.icio.us    Digg    Reddit    Technorati    Twitter    What's this?