Hop-by-hop quality of service routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Concepts of exact QoS routing algorithms
IEEE/ACM Transactions on Networking (TON)
A Distributed Exact Solution to Compute Inter-domain Multi-constrained Paths
EUNICE '09 Proceedings of the 15th Open European Summer School and IFIP TC6.6 Workshop on The Internet of the Future
Enhanced crankback signaling for multi-domain IP/MPLS networks
Computer Communications
IEEE Communications Magazine
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
Hi-index | 0.00 |
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, HIDMCP 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.