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)
Multiservice Loss Models for Broadband Telecommunication Networks
Multiservice Loss Models for Broadband Telecommunication Networks
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
On path selection for traffic with bandwidth guarantees
ICNP '97 Proceedings of the 1997 International Conference on Network Protocols (ICNP '97)
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
Localized Credit Based QoS Routing: Performance Evaluation Using
ANSS '06 Proceedings of the 39th annual Symposium on Simulation
On the building blocks of quality of service in heterogeneous IP networks
IEEE Communications Surveys & Tutorials
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
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 and admission control: performance evaluation
IIT'09 Proceedings of the 6th international conference on Innovations in information technology
| 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 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. One of the most important QoS metrics is bandwidth and in this paper we introduce a localized routing scheme for providing bandwidth guarantees, based on a crediting scheme that uses an estimate of flow blocking probability to adjust credits and select routes. We compare its performance against the localized proportional sticky routing (PSR) algorithm 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 scheme while maintaining the same level of adaptivity and stability. We also compare performance against the well known widest-shortest path (WSP) algorithm that uses the global network QoS state and show that our algorithm gives a comparable performance with better time complexity and very much lower communication overhead. The simulations were implemented using OMNET ++, a discrete-event simulator that provides a rich set of functions and tools for simulating the elements of a communication network, such as nodes, links and packets.