Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
The revised ARPANET routing metric
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Virtual clock: a new traffic control algorithm for packet switching networks
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Comparison of rate-based service disciplines
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
An analysis of near optimal call admission and routing model for multi-service loss networks
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 1)
Asymptotically optimal loss network control
Mathematics of Operations Research
A protocol for route establishment and packet forwarding across multidomain internets
IEEE/ACM Transactions on Networking (TON)
Open issues and challenges in providing quality of service guarantees in high-speed networks
ACM SIGCOMM Computer Communication Review
Proceedings of the 1995 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
IEEE/ACM Transactions on Networking (TON)
A quantitative comparison of graph-based models for Internet topology
IEEE/ACM Transactions on Networking (TON)
Dynamic multi-path routing: asymptotic approximation and simulations
Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
On the impact of alternate path routing for load balancing in mobile ad hoc networks
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
Multi-Service Dynamic QoS Routing Schemes with Call Admission Control: A Comparative Study
Journal of Network and Systems Management
A new class of QoS routing strategies based on network graph reduction
Computer Networks: The International Journal of Computer and Telecommunications Networking
A scalable virtual circuit routing scheme for ATM networks
ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks
QofIS'02/ICQT'02 Proceedings of the 3rd international conference on quality of future internet services and internet charging and QoS technologies 2nd international conference on From QoS provisioning to QoS charging
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
A study of reservation dynamics in integrated services packet networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Dynamic grooming in IP over optical networks based on the overlay architecture
Optical Switching and Networking
| Hi-index | 0.01 |
High-speed packet networks will begin to support services that need Quality-of-Service (QoS) guarantees. Guaranteeing QoS typically translates to reserving resources for the duration of a call. We propose a state-dependent routing scheme that builds on any base state-independent routing scheme, by routing flows which are blocked on their primary paths (as selected by the state-independent scheme) onto alternate paths in a manner that is guaranteed—under certain Poisson assumptions— to improve on the performance of the base state-independent scheme. Our scheme only requires each node to have state information of those links that are incident on it. Such a scheme is of value when either the base state-independent scheme is already in place and a complete overhaul of the routing algorithm is undesirable, or when the state (reserved flows) of a link changes fast enough that the timely update of state information is infeasible to all possible call-originators. The performance improvements due to our controlled alternate routing scheme are borne out from simulations conducted on a fully-connected 4-node network, as well as on a sparsely-connected 12-node network modeled on the NSFNet T3 Backbone.