%0 Journal Article
	%A P.S. Prakash and  S. Selvan
	%D 2009
	%J International Journal of Computer and Information Engineering
	%B World Academy of Science, Engineering and Technology
	%I Open Science Index 27, 2009
	%T Coerced Delay and Multi Additive Constraints QoS Routing Schemes
	%U https://publications.waset.org/pdf/15830
	%V 27
	%X 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 endto-
end constraints and termed to be NP hard or complete. In this
context, we present an algorithm Multi Constraint Path Problem
Version 3 (MCPv3), where all constraints are approximated and
return a feasible path in much quicker time. We present another
algorithm namely Delay Coerced Multi Constrained Routing
(DCMCR) where coerce one constraint and approximate the
remaining constraints. Our algorithm returns a feasible path, if exists,
in polynomial time between a source-destination pair whose first
weight satisfied by the first constraint and every other weight is
bounded by remaining constraints by a predefined approximation
factor (a). We present our experimental results with different
topologies and network conditions.
	%P 801 - 810