Solving k-shortest and constrained shortest path problems efficiently
Annals of Operations Research
Approximation schemes for the restricted shortest path problem
Mathematics of Operations Research
Editorial: Special Section on Dependable Real-Time Systems*
IEEE Transactions on Parallel and Distributed Systems
Real-Time Dependable Channels: Customizing QoS Attributes for Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Routing with end-to-end QoS guarantees in broadband networks
IEEE/ACM Transactions on Networking (TON)
Comparative analysis of path computation techniques for MPLS traffic engineering
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Towards a new internet architecture
IEEE/ACM Transactions on Networking (TON)
BRITE: An Approach to Universal Topology Generation
MASCOTS '01 Proceedings of the Ninth International Symposium in Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Precomputation schemes for QoS routing
IEEE/ACM Transactions on Networking (TON)
Computer Networks: The International Journal of Computer and Telecommunications Networking
IEEE Network: The Magazine of Global Internetworking
IEEE Network: The Magazine of Global Internetworking
Research note: A proactive backup scheme for reliable real-time transmission
Journal of Parallel and Distributed Computing
| Hi-index | 0.24 |
Quality of Service (QoS) path computation techniques have assumed a lot of importance in recent years. The goal of QoS based routing is to find a path that meets the requested QoS requirements optimizing network utilization. Real-time and multimedia applications require QoS guarantees on timeliness of message delivery and failure-recovery delay. With these goals in mind we present two new routing algorithms. The first one is an efficient routing algorithm that finds a single path given an end-to-end delay. The second algorithm uses the first one in order to obtain the primary and backup paths for dependable channels guaranteeing the required end-to-end delay. Both algorithms maximize the admission of channels in a network and have low polynomial computational cost. We evaluated these algorithms using Differentiated Services Expedited Forwarding (EF) class of service. The experiments show that these algorithms are very efficient: the admission rate (the number of channels that a network can accept) is practically the same as using the optimal routing algorithm and the computational cost is very low.