Hybrid Inter-Domain QoS Routing with Crankback Mechanisms

Abstract

Abstract. In this paper we tackle the challenging problem of Quality of Service (QoS) routing in multiple domains. We propose a novel inter-domain QoS routing algorithm named HID-MCP. HID-MCP benefits from two major concepts that ensure high performance in terms of success rate and computational complexity. First, HID-MCP is a hybrid algorithm that combines the advantages of pre-computation and on-demand computation to obtain end-to-end QoS paths. Second, HID-MCP integrates crankback mechanisms for improving the path computation results in a single domain or in multiple domains. Extensive simulations confirm the efficiency of our algorithm on randomly generated topologies.

A Hybrid End-to-End QoS Path Computation Algorithm for PCE-Based Multi-Domain Networks

“…The intra-domain crankback is solicited to locally improve the computation results by executing an on-demand computation in the failing domain, while the inter-domain crankback performs a global improvement by executing an on-demand computation starting from one of the downstream domains in the crossed domain set. Note that this solution extends our recently published work in [8] by enhancing the algorithm side and simulation side. We enhance the algorithm by adding a new parameter, named hops.…”

“…The weight vectors of these aggregated paths are respectively (3, 7) and (5,4). We combine the aggregated paths with the pre-computed ones and we obtain two paths corresponding to the weight vectors (8,9) and (7,7). These two paths are aggregated in a new VSPH H q+1 and then sent to domain D q+1 .…”

“…One time starting form n 1 and the another time starting from n 2 . We obtain three feasible paths from d to n 5 with the weight vectors: (8,8), (7,8) and (10,8). (8,8) and (10,8) are dominated by (7,8), so we discard them from the VSPH H q+1 .…”

“…We obtain three feasible paths from d to n 5 with the weight vectors: (8,8), (7,8) and (10,8). (8,8) and (10,8) are dominated by (7,8), so we discard them from the VSPH H q+1 . We also obtain three feasible paths from d to n 6 with the weight vectors: (7,10), (7,8) and (10,7).…”

“…This parameter represents the number of backward hops in term of domain to be done before executing the on-demand computation. Precisely, in [8], the inter-domain crankback signaling is sent to the destination domain. While in this paper, the inter-domain crankback signaling can be sent to one of the downstream domains in order to execute the on-demand computation starting from this domain, and not only starting from the destination domain.…”