Load-sensitive routing of long-lived IP flows
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Stability issues in OSPF routing
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Developing scalable protocols for three-metric QoS routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
QoS-IP 2003 Proceedings of the Second International Workshop on Quality of Service in Multiservice IP Networks
Distance-Vector QoS-Based Routing with Three Metrics
NETWORKING '00 Proceedings of the IFIP-TC6 / European Commission International Conference on Broadband Communications, High Performance Networking, and Performance of Communication Networks
A new distributed QoS routing algorithm based on Fano's method
Computer Networks and ISDN Systems
Internet like control for MPLS based traffic engineering: performance evaluation
Performance Evaluation - Performance modelling and evaluation of heterogeneous networks
A new distributed QoS routing algorithm based on Fano's method
Computer Networks: The International Journal of Computer and Telecommunications Networking
Internet like control for MPLS based traffic engineering: performance evaluation
Performance Evaluation
A qos-satisfied interdomain overlay multicast algorithm for live media service grid
GCC'05 Proceedings of the 4th international conference on Grid and Cooperative Computing
QoS-IP'05 Proceedings of the Third international conference on Quality of Service in Multiservice IP Networks
BSMON: bandwidth-satisfied multicast in overlay network for large-scale live media applications
ICCNMC'05 Proceedings of the Third international conference on Networking and Mobile Computing
Non-greedy minimum interference routing algorithm for bandwidth-guaranteed flows
Computer Communications
| Hi-index | 0.00 |
Quality-of-service (QoS) routing satisfies application performance requirements and optimizes network resource usage but effective path-selection schemes require the distribution of link-state information, which can impose a significant burden on the bandwidth and processing resources in the network. We investigate the fundamental trade-off between network overheads and the quality of routing decisions in the context of the source-directed link-state routing protocols proposed for future IP and ATM networks. Through extensive simulation experiments with several representative network topologies and traffic patterns, we uncover the effects of stale link-state information, random fluctuations in traffic load, and variations of the link-cost metric on the routing and signalling overheads. The paper concludes by summarizing our key results as a list of guidelines for designing efficient quality-of-service routing policies in large backbone networks.