Hierarchical QoS routing by using Multi-constrained Macro-routing

Abstract

QoS routing is used for finding feasible paths that satisfy simultaneously multiple constraints and it is a NP-complete problem. The difficulty of solving such problems increases in the hierarchical context, where aggregation techniques influence the path computation process. This paper offers a solution for hierarchical QoS routing by introducing the protocol called Multi-constrained Macro-routing. This protocol uses Macro-routing protocol with the Extended Full-Mesh aggregation technique to determine multiple hierarchical QoS routes. Tests presented here prove that Multi-constrained Macro-routing out-performs any other hierarchical routing protocol that uses the Full-Mesh aggregation by finding better and more QoS paths.