Enhanced crankback signaling for multi-domain IP/MPLS networks

Esmaeili, M.; Xu, Feng; Peng, Min; Ghani, Nasir; Gumaste, Ashwin; Finochietto, Jorge M.

doi:10.1016/j.comcom.2010.08.003

Cited by 3 publications

(4 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The drawback of this algorithm is its high complexity. Work in [8] proposes also a promising distributed solution with crankback mechanisms for inter-domain routing. However this solution cannot take into account several QoS metrics.…”

Section: Definitionmentioning

confidence: 99%

Hybrid Inter-Domain QoS Routing with Crankback Mechanisms

Frikha

Lahoud

Cousin

2011

Smart Spaces and Next Generation Wired/Wireless Networking

View full text Add to dashboard Cite

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.

show abstract

Section: Definitionmentioning

confidence: 99%

Hybrid Inter-Domain QoS Routing with Crankback Mechanisms

Frikha

Lahoud

Cousin

2011

Smart Spaces and Next Generation Wired/Wireless Networking

View full text Add to dashboard Cite

show abstract

“…The pre-computation scheme ensures a very low computational time, but requires a periodical update of the network link state information to maintain a high success rate. Work in [19] proposes also a promising distributed solution with crankback mechanisms for inter-domain routing. However this solution cannot take into account several QoS metrics.…”

Section: Definitionmentioning

confidence: 99%

“…Algorithm 3 illustrates the operations performed by the on-demand path computation procedure. First of all, our proposed procedure computes a prediction for the lowest weight vector to reach domain D q+1 through each path in the received VSPH (lines [11][12][13][14][15][16][17][18][19]. We define for each aggregated path d, n, → W (p d→n ) in the VSPH and for each node n k in E q , a weight vector → W * (d → n j → n k ) that represents the sum of the weight vector of the computed segment p d →nj and the lowest weight vector to reach n k from n j (line 13).…”

Section: The On-demand Path Computation Proceduresmentioning

confidence: 99%

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

2013

View full text Add to dashboard Cite

International audienceThe Inter-domain Quality of Service (QoS) routing is a challenging problem for today's Internet. This problem requires the computation of paths that cross multiple domains and meet the different QoS constraints. In addition , the methods of computation that are used must meet the constraints of confidentiality and autonomy imposed by the domains of different operators. The path computation element (PCE)-based architecture offers a promising solution for the inter-domain QoS routing. It ensures the computation of end-to-end QoS paths while preserving the confidentiality and the autonomy of the domains. In this paper, we propose a novel hybrid end-to-end QoS path computation algorithm, named HID-MCP, for PCE-based networks. HID-MCP is a hybrid algorithm that combines the advantages of pre-computation and on-demand computation to obtain end-to-end QoS paths. Moreover, it integrates crankback mechanisms for improving the path computation results in a single domain or in multiple domains based on the PCE architecture. The simulation results show that our algorithm has an acceptance rate of the requests very close to the optimal solution. Moreover HID-MCP out-performs BGP in terms of success rate and the difference is up to 30% in a realistic network. Detailed analysis are provided to assess the performance of our algorithm in terms of success rate and computational complexity. Besides, our solution relies on the PCE architecture to overcome the limitations related to inter-domain routing such as domain autonomy and confidentiality

show abstract

“…The drawback of this algorithm is its high complexity. Also, work in [11] proposes a promising distributed solution with crankback mechanisms for inter-domain routing. However this solution cannot take into account more than one QoS metric.…”

Section: The Inter-domain Qos Routing Problemmentioning

confidence: 99%

Performance evaluation of pre-computation algorithms for inter-domain QoS routing

Frikha

Lahoud

2011

2011 18th International Conference on Telecommunications

View full text Add to dashboard Cite

Abstract-Inter-domain QoS routing is a very challenging problem area. This problem combines the complexity of QoS routing, with the limitations of inter-domain routing, such as domain heterogeneity and information confidentiality. The precomputation offers a very promising solution for addressing this problem. Although the pre-computation scheme has been investigated in several previous studies for a single routing domain, applying pre-computation on an inter-domain level is not straightforward and necessitates deeper investigation. In this work, we study different algorithms for QoS routing based on pre-computation. First, we investigate an exact algorithm. This algorithm provides an optimal solution for the QoS routing problem. However, its application in large scale networks is not always practical. Second, heuristic solutions are also investigated in this work. Particularly, a detailed study of the ID-MEFPA and the ID-PPPA heuristics is provided. Analytical studies and extensive simulations confirm that the exact algorithm achieves the best success rate, but has a very high computational complexity. The ID-MEFPA heuristic has a lower complexity and provides a success rate always close to the exact algorithm. When inter-domain connectivity is high, the ID-PPPA heuristic is the most appropriate with the lowest computation complexity and a success rate very close to the exact algorithm.

show abstract

Enhanced crankback signaling for multi-domain IP/MPLS networks

Cited by 3 publications

References 19 publications

Hybrid Inter-Domain QoS Routing with Crankback Mechanisms

Hybrid Inter-Domain QoS Routing with Crankback Mechanisms

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

Performance evaluation of pre-computation algorithms for inter-domain QoS routing

Contact Info

Product

Resources

About