Connectivity Aware Routing - a Method for Finding Bandwidth Constrained Paths Over a Variety of Network Topologies

  • Authors:
  • Karol Kowalik;Martin Collier

  • Affiliations:
  • -;-

  • Venue:
  • ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Multimedia traffic and real-time e-commerce applicationscan experience quality degradation in traditional networkssuch as the Internet. These difficulties can be overcome innetworks which feature dynamically set up paths with bandwidthand delay guarantees. The problem of selecting suchconstrained paths is the task of Quality of Service (QoS)routing.Researchers have proposed several ways of implementingQoS routing, preferring either mechanisms which distributethe network load or algorithms which conserve resources.Our previous studies have shown that networkconnectivity is an important factor when deciding whichof these two approaches gives the best performance. Inthis paper we propose an algorithm, which features bothload distribution and resource conservation. It takes a hybridapproach which balances between these two extremeapproaches, according to the level of network connectivity.Our simulations indicate that this algorithm offers excellentperformance over a wider range of network topologies thanexisting algorithms.