TAMCRA: a tunable accuracy multiple constraints routing algorithm

  • Authors:
  • H. De Neve;P. Van Mieghem

  • Affiliations:
  • Alcatel Corporate Research, Francis Wellesplein 1, B-2018 Antwerp, Belgium;Delft University of Technology, Information Technology and Systems, P.O. Box 5031, 2600 GA Delft, Netherlands

  • Venue:
  • Computer Communications
  • Year:
  • 2000

Quantified Score

Hi-index 0.25

Visualization

Abstract

Routing with more than one additive constraint is known to be an NP-complete problem, and hence considered as intractable. We present a new QoS routing algorithm, called the Tunable Accuracy Multiple Constraints Routing Algorithm (TAMCRA), which can solve multiple constraints problems with a finite but small probability of missing a path that satisfies all constraints while the probability of missing such a path is tunable with a single parameter k. We demonstrate that this algorithm scales very well as the size of the graph increases or as the number of constraints increases.