Date Added: Jan 2011
IP networks are evolving from data communication infrastructure into many real-time applications such as video conferencing, IP telephony and require stringent Quality of Service (QoS) requirements. A rudimentary issue in QoS routing is to find a path between a source-destination pair that satisfies two or more end-to-end constraints and termed to be NP hard or complete. In this context, the authors present an algorithm Multi Constraint Path Problem Version 3 (MCPv3), where all constraints are approximated and return a feasible path in much quicker time. They present another algorithm namely Delay Coerced Multi Constrained Routing (DCMCR) where one constraint is coerced and the remaining constraints are approximated.