@article{(Open Science Index):https://publications.waset.org/pdf/12781,
	  title     = {A Feasible Path Selection QoS Routing Algorithm with two Constraints in Packet Switched Networks},
	  author    = {P.S.Prakash and  S.Selvan},
	  country	= {},
	  institution	= {},
	  abstract     = {Over the past several years, there has been a
considerable amount of research within the field of Quality of
Service (QoS) support for distributed multimedia systems. One of the
key issues in providing end-to-end QoS guarantees in packet
networks is determining a feasible path that satisfies a number of
QoS constraints. The problem of finding a feasible path is NPComplete
if number of constraints is more than two and cannot be
exactly solved in polynomial time. We proposed Feasible Path
Selection Algorithm (FPSA) that addresses issues with pertain to
finding a feasible path subject to delay and cost constraints and it
offers higher success rate in finding feasible paths.},
	    journal   = {International Journal of Computer and Information Engineering},
	  volume    = {2},
	  number    = {3},
	  year      = {2008},
	  pages     = {775 - 781},
	  ee        = {https://publications.waset.org/pdf/12781},
	  url   	= {https://publications.waset.org/vol/15},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 15, 2008},
	}