Concepts of exact QoS routing algorithms

• Published in: IEEE/ACM transactions on networking Vol. 12; no. 5; pp. 851 - 864
• Main Authors: Van Mieghem, P., Kuipers, F.A.
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.10.2004; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Algorithms; Communication networks; Communications networks; Computation; Computational complexity; Computer networks; Computer science; Constraint optimization; Expenses; Graphs; Heuristic algorithms; Internet; Mathematics; Network topology; Nonlinear systems; Proposals; Routing (telecommunications); Routing protocols; Running; Shortest path algorithms; Studies
• ISSN: 1063-6692; 1558-2566
• DOI: 10.1109/TNET.2004.836112

The underlying concepts of an exact QoS routing algorithm are explained. We show that these four concepts, namely 1) nonlinear definition of the path length; 2) a /spl kappa/-shortest path approach; 3) nondominance; and 4) look-ahead, are fundamental building blocks of a multiconstrained routing algorithm. The main reasons to consider exact multiconstrained routing algorithms are as follows. First, the NP-complete behavior seems only to occur in specially constructed graphs, which are unlikely to occur in realistic communication networks. Second, there exist exact algorithms that are equally complex as heuristics in algorithmic structure and in running time on topologies that do not induce NP-complete behavior. Third, by simply restricting the number /spl kappa/ of paths explored during the path computation, the computational complexity can be decreased at the expense of possibly loosing exactness. The presented four concepts are incorporated in SAMCRA, a self-adaptive multiple constraints routing algorithm.