Use this resource - and many more! - in your textbook!
AcademicPub holds over eight million pieces of educational content for you to mix-and-match your way.
Path selection in networks with non-deterministic information
By: Korach, E.; Ohayon, R.;
2002 / IEEE / 0-7803-7400-2
This item was taken from the IEEE Conference ' 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.
Quality Of Service
Multiple Qos Constraints
Setup Time Minimization
Computer Network Management
Telecommunication Network Routing