P.S.Prakash and S.Selvan
A Feasible Path Selection QoS Routing Algorithm with two Constraints in Packet Switched Networks
775 - 781
2008
2
3
International Journal of Computer and Information Engineering
https://publications.waset.org/pdf/12781
https://publications.waset.org/vol/15
World Academy of Science, Engineering and Technology
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 endtoend 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.
Open Science Index 15, 2008