Routing in communications networks
QoS routing in networks with inaccurate information: theory and algorithms
IEEE/ACM Transactions on Networking (TON)
Distributed Route Selection for Establishing Real-Time Channels
IEEE Transactions on Parallel and Distributed Systems
Evaluating the impact of stale link state on quality-of-service routing
IEEE/ACM Transactions on Networking (TON)
Difficulties in simulating the internet
IEEE/ACM Transactions on Networking (TON)
Adaptive proportional routing: a localized QoS routing approach
IEEE/ACM Transactions on Networking (TON)
Distributed Quality-of-Service Routing in High-Speed Networks Based on Selective Probing
LCN '98 Proceedings of the 23rd Annual IEEE Conference on Local Computer Networks
ICCC '02 Proceedings of the 15th international conference on Computer communication
Distributed QoS Routing with Imprecise State Information
IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
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
On selection of candidate paths for proportional routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
TAMCRA: a tunable accuracy multiple constraints routing algorithm
Computer Communications
Quality-of-service routing for supporting multimedia applications
IEEE Journal on Selected Areas in Communications
IEEE Network: The Magazine of Global Internetworking
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
Localized QoS routing algorithm based on residual bandwidth
NTMS'09 Proceedings of the 3rd international conference on New technologies, mobility and security
| Hi-index | 0.00 |
Localized Quality of Service (QoS) routing has recently been proposed as a viable alternative approach to traditional QoS routing algorithms that use global state information. In this approach, problems associated with maintaining global state information and the staleness of such information are avoided by having the source nodes to infer the network QoS state based on flow blocking statistics collected locally, and perform flow routing using this localized view of the network QoS state . In this paper we introduce a credit based routing algorithm (cbr) which is a simple yet effective localized QoS routing algorithm. We compare its performance against the localized proportional sticky routing (psr) algorithm same time complexity. using different types of network topologies, QoS requirements and traffic patterns and under a wide range of traffic loads. Extensive simulations show that our algorithm outperforms the psr algorithm with the