@article{(Open Science Index):https://publications.waset.org/pdf/15830,
	  title     = {Coerced Delay and Multi Additive Constraints QoS Routing Schemes},
	  author    = {P.S. Prakash and  S. Selvan},
	  country	= {},
	  institution	= {},
	  abstract     = {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.},
	    journal   = {International Journal of Computer and Information Engineering},
	  volume    = {3},
	  number    = {3},
	  year      = {2009},
	  pages     = {801 - 810},
	  ee        = {https://publications.waset.org/pdf/15830},
	  url   	= {https://publications.waset.org/vol/27},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 27, 2009},
	}