Abstract
We investigate the problem of path selection under multiple QoS constraints, when the information available for making routing decisions is non-deterministic. The goal of the path selection process is to identify a feasible path while minimizing the overall setup time required for establishing a successful connection. We assume that a list of candidate paths already exists and, under some practical assumptions, we show how to find an optimal order of the given paths in order to achieve the goal.
| Original language | English |
|---|---|
| Pages (from-to) | 2227-2231 |
| Number of pages | 5 |
| Journal | Conference Record - International Conference on Communications |
| Volume | 4 |
| State | Published - 1 Jan 2002 |
| Event | 2002 International Conference on Communications (ICC 2002) - New York, NY, United States Duration: 28 Apr 2002 → 2 May 2002 |
ASJC Scopus subject areas
- Computer Networks and Communications
- Electrical and Electronic Engineering