QoS based routing in networks with inaccurate information: theory and algorithms
- 23 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
We investigate the problem of routing connections with QoS requirements across one or more networks, when the information available for making routing decisions is inaccurate and expressed in some probabilistic manner. This uncertainty about the actual state of a node or network arises naturally in a number of different environments, that are reviewed in the paper. The main focus is to determine the impact of such inaccuracies on the path selection process, whose goal is then to identify the path that is most likely to satisfy the QoS requirements.Keywords
This publication has 5 references indexed in Scilit:
- Efficient network QoS provisioning based on per node traffic shapingIEEE/ACM Transactions on Networking, 1996
- Topology aggregation for hierarchical routing in ATM networksACM SIGCOMM Computer Communication Review, 1995
- NBBS path selection frameworkIBM Systems Journal, 1995
- A generalized processor sharing approach to flow control in integrated services networks: the multiple node caseIEEE/ACM Transactions on Networking, 1994
- Algorithms for the quickest path problem and the enumeration of quickest pathsComputers & Operations Research, 1991