Pre-computation based heuristic for inter-domain QoS routing

In the present paper, we propose a novel fast heuristic for inter-domain QoS routing, named ID-PPPA. ID-PPPA is based on a pre-computation scheme. The pre-computation scheme attempts to solve the QoS routing problem while keeping a low response time by computing in advance a set of QoS paths. Our solution preserves domain confidentiality and solves the scaling problem related to inter-domain routing by distributing computations over the domains. Theoretical analysis proves that the ID-PPPA algorithm has a low computational complexity, which is very necessary for a pre-computation algorithm to deal with dynamic changes of the network link state information. Moreover, extensive simulations confirm the efficiency of our algorithm in terms of success rate and quality of the computed path.