Hybrid Inter-Domain QoS Routing with Crankback Mechanisms
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.
KeywordsQoS routing inter-domain routing crankback mechanisms pre-computation on-demand computation
Unable to display preview. Download preview PDF.
- 1.Frikha, A., Lahoud, S.: Hybrid Inter-Domain QoS Routing based on Look-Ahead Information. IRISA, Tech. Rep. 1946 (2010)Google Scholar
- 4.Knoll, T.: BGP Extended Community Attribute for QoS Marking, draft-knoll-idr-qos-attribute-02. IETF (2009) (work in progress)Google Scholar
- 6.Farrel, A., Vasseur, J.P., Ash, J.A.: Path Computation Element (PCE)-Based Architecture. IETF RFC 4655 (August 2006)Google Scholar
- 9.Molnar, M.: Hierarchies for Constrained Partial Spanning Problems in Graphs. IRISA, Tech. Rep. 1900 (2008)Google Scholar