DORA: Efficient Routing for MPLS Traffic Engineering
Journal of Network and Systems Management
Profile-Based Routing: A New Framework for MPLS Traffic Engineering
COST 263 Proceedings of the Second International Workshop on Quality of Future Internet Services
A New Class of Online Minimum-Interference Routing Algorithms
NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
An Off-Line Traffic Engineering Model for MPLS Networks
LCN '02 Proceedings of the 27th Annual IEEE Conference on Local Computer Networks
QoS aware path protection schemes for MPLS networks
ICCC '02 Proceedings of the 15th international conference on Computer communication
Concepts of exact QoS routing algorithms
IEEE/ACM Transactions on Networking (TON)
Approximation Algorithms for Multiconstrained Quality-of-Service Routing
IEEE Transactions on Computers
TAMCRA: a tunable accuracy multiple constraints routing algorithm
Computer Communications
| Hi-index | 0.00 |
Quality of Service in computer networks depends on several variables like bandwidth, delay, jitter, cost, and packet loss which affect the overall user experience. In Multiprotocol Label Switching Networks, paths can be established end-to-end and resources can be guaranteed on each hop. However, due to several reasons, among them the computational cost involved, these paths are normally computed with constraints for only one variable. In this paper we propose a design and implementation of a scalable module for multi-constraint path computation in the context of the Path Computation Element architecture. We present all the design issues involved in an integral solution that accounts for all problems involved, some examples of the problem, and a scalable architecture to solve it. Finally, we present our performance results on simulated scenarios and real world networks.