Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet
IEEE/ACM Transactions on Networking (TON)
Mobile Network Domain Agency for Managing Network Resources
MATA '00 Proceedings of the Second International Workshop on Mobile Agents for Telecommunication Applications
PCP: An End-to-End Measurement-Based Call Admission Control for Real-Time Services over IP Networks
QoS-IP '01 Proceedings of the International Workshop on Quality of Service in Multiservice IP Networks
Connection set-up and QoS monitoring in ATM networks
International Journal of Network Management
ICCC '02 Proceedings of the 15th international conference on Computer communication
Precomputation schemes for QoS routing
IEEE/ACM Transactions on Networking (TON)
Reducing traffic fluctuations of link state QoS routing algorithms in virtual circuit networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
An efficient resource allocation scheme for multimedia applications in MANET
Journal of Network and Computer Applications
QoS provision in wireless access networks: a routing perspective considering mobility
International Journal of Network Management
Research challenges in QoS routing
Computer Communications
Effects of topology on the performance of localized QOS routing algorithms
SPECTS'09 Proceedings of the 12th international conference on Symposium on Performance Evaluation of Computer & Telecommunication Systems
Performance evaluation of QoS-routing methods for IP-based multiservice networks
Computer Communications
A QoS-guaranteed multicast routing protocol
Computer Communications
Non-greedy minimum interference routing algorithm for bandwidth-guaranteed flows
Computer Communications
Resource Monitoring in a Network Embedded Cloud: An Extension to OSPF-TE
UCC '13 Proceedings of the 2013 IEEE/ACM 6th International Conference on Utility and Cloud Computing
| Hi-index | 0.00 |
Constraint-based routing gradually becomes an essential enabling mechanism for a variety of emerging network services such as virtual private networking and QoS support. A number of previous works have recognized its significance and investigated many aspects of the operation of constraint-based routing and in particular its variant concerned with determining paths for requests with specific QoS requirements, known as QoS routing. In this work we build on previous results on the cost of QoS routing and investigate the performance/cost trade-offs involved in the operation of a representative QoS routing architecture, elaborate on the constituents of this cost, and identify the main methods for containing the cost that QoS routing incurs on routers. Our results show that the cost of QoS routing is not excessive and that there indeed exist operational configurations, which can achieve reasonable performance gains with only a minimal increase in processing cost when compared to conventional best-effort routing