Finding a Path Subject to Many Additive QoS Constraints

A fundamental problem of routing in a network that provides Quality-of-Service (QoS) guarantees is to find a path between a specified source-destination node pair that simultaneously satisfies multiple QoS constraints, such as cost, delay, and reliability. Such an environment is commonly modeled by a graph with n vertices and m edges where the n vertices represent computers or routers and the m edges represent links. Each edge has K weights associated with it, representing cost, delay, and reliability, etc.