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

Frikha, Ahmed; Lahoud, Samer

doi:10.1109/cts.2011.5898944

Cited by 6 publications

(4 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The hybrid onlineoffline approach that enables the reconfiguration of existing e2e embeddings, was shown to increase acceptance ratios in the domain of virtual network embeddings by Fan and Ammar [36]. Frikha and Lahoud have recently proposed to precompute QoS paths to improve performance [40]. In contrast, the paths that have already been computed in our work are reused at a later stage (possibly in different contexts), thereby not introducing any additional computational overhead.…”

Section: Related Workmentioning

confidence: 99%

Stitching Inter-Domain Paths over IXPs

Kotronis

Klöti

Rost

et al. 2016

Proceedings of the Symposium on SDN Research

View full text Add to dashboard Cite

Modern Internet applications, from HD video-conferencing to health monitoring and remote control of power-plants, pose stringent demands on network latency, bandwidth and availability. Centralized inter-domain routing brokers is an approach to support such applications and provide inter-domain guarantees, enabling new avenues for innovation. These entities centralize routing control for missioncritical traffic across domains, working in parallel to BGP. In this work, we propose using IXPs as natural points for stitching interdomain paths under the control of inter-domain routing brokers.To evaluate the potential of this approach, we first map the global substrate of inter-IXP pathlets that IXP members could offer, based on measurements for 229 IXPs worldwide. We show that using IXPs as stitching points has two useful properties. Up to 91% of the total IPv4 address space can be served by such inter-domain routing brokers when working in concert with just a handful of large IXPs and their associated ISP members. Second, path diversity on the inter-IXP graph increases by up to 29 times, as compared to current BGP valley-free routing. To exploit the rich path diversity, we introduce algorithms that inter-domain routing brokers can use to embed paths, subject to bandwidth and latency constraints. We show that our algorithms scale to the sizes of the measured graphs and can serve diverse simulated path request mixes. Our work highlights a novel direction for SDN innovation across domains, based on logically centralized control and programmable IXP fabrics.

show abstract

Section: Related Workmentioning

confidence: 99%

Stitching Inter-Domain Paths over IXPs

Kotronis

Klöti

Rost

et al. 2016

Proceedings of the Symposium on SDN Research

View full text Add to dashboard Cite

show abstract

“…The drawback of this algorithm is its high complexity. The ID-PPPA algorithm [17] and the ID-MEFPA algorithm [18] rely on the PCE architecture and attempt to solve the ID-MCP algorithm using a pre-computation scheme. These solutions are efficient in terms of rapidity and have a good success rate.…”

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

Self Cite

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

“…Thus, pre-computed routing approaches are desirable to instantly set up the connection. In practice, they are tackled by many researchers [2] [3].…”

Section: Introductionmentioning

confidence: 99%

Multi-tiers route design coordinating QoS-specific K shortest paths over optical network

Tode

Takada

Tanigawa

2015

2015 IEEE International Conference on Communication Workshop (ICCW)

View full text Add to dashboard Cite

In the Wavelength Division Multiplexing (WDM) based optical circuit switching network, it takes longer time to set up the intermediate optical cross-connecting devices on the route. Thus, pre-computed routing approaches are desirable to instantly set up the connection. Most of their research works are based on the K Shortest Path (KSP) algorithm or it's variants considering route disjointness, because of load balancing effect in network, its simplicity, and quick response caused by heuristic approach. However, it essentially remains some issues to be solved, especially on the capability for various QoS support and fairer load balancing. In particular, the set of K shortest paths independently selected between any two nodes is insufficient for entire network load balancing. Specifically, sequential selection of the K routes for each source-destination (S-D) pair causes the unfairness and unbalance in network load among all S-D pairs. In the paper, to tackle the above problems, we propose multi-tiers route design method, which provides more enhanced load balancing by selecting QoS specific multiple routes for each node pair, coordinating with the routes for other node pairs. The proposed method is not the improvement of the KSP algorithm and it's variants themselves, but the framework to find a limited number (K') of adequate paths from the K (K' ≤ K) routes precomputed by KSP based algorithms for each S-D pair and each QoS level, taking spatial relationship between routes into account. Thus, the proposed method has complementary relationship with the KSP based algorithms themselves.

show abstract

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

Cited by 6 publications

References 10 publications

Stitching Inter-Domain Paths over IXPs

Stitching Inter-Domain Paths over IXPs

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

Multi-tiers route design coordinating QoS-specific K shortest paths over optical network

Contact Info

Product

Resources

About