@article{MAKHILLAJIT201615196418,
    title = {Optimized Multi Constrained Path Computation for QoS Routing},
    journal = {Asian Journal of Information Technology},
    volume = {15},
    number = {19},
    pages = {3810-3819},
    year = {2016},
    issn = {1682-3915},
    doi = {ajit.2016.3810.3819},
    url = {https://makhillpublications.co/view-article.php?issn=1682-3915&doi=ajit.2016.3810.3819},
    author = {P.S.},
    keywords = {QoS routing,optimization,multiple constraints,feasible path,OMCR},
    abstract = {The goal of Quality of Service (QoS) routing algorithms is to find a feasible path satisfying a given set of constraints on parameters like delay, jitter and reliability and so on and 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 our algorithm Optimized Multi-Constrained Routing (OMCR) for the computation of constrained paths for QoS routing in packet switched 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 Internet Protocol and does not create any loops while finding the feasible paths.}
    }