Quality of Service (QoS) Routing aims to find path
between source and destination satisfying the QoS requirements
which efficiently using the network resources and underlying routing
algorithm and to find low-cost paths that satisfy given QoS
constraints. One of the key issues in providing end-to-end QoS
guarantees in packet networks is determining feasible path that
satisfies a number of QoS constraints. We present a Optimized Multi-
Constrained Routing (OMCR) algorithm for the computation of
constrained paths for QoS routing in computer networks. OMCR
applies distance vector to construct a shortest path for each
destination with reference to a given optimization metric, from which
a set of feasible paths are derived at each node. OMCR is able to find
feasible paths as well as optimize the utilization of network
resources. OMCR operates with the hop-by-hop, connectionless
routing model in IP Internet and does not create any loops while
finding the feasible paths. Nodes running OMCR not necessarily
maintaining global view of network state such as topology, resource
information and routing updates are sent only to neighboring nodes
whereas its counterpart link-state routing method depend on
complete network state for constrained path computation and that
incurs excessive communication overhead.