Path selection in networks with non-deterministic information

We investigate the problem of path selection under multiple QoS constraints, when the information available for making routing decisions is nondeterministic. 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.