<?xml version="1.0" encoding="UTF-8"?> <article key="pdf/9058" mdate="2008-03-28 00:00:00"> <author>P.S.Prakash and S.Selvan</author> <title>A Characterized and Optimized Approach for EndtoEnd Delay Constrained QoS Routing</title> <pages>767 - 774</pages> <year>2008</year> <volume>2</volume> <number>3</number> <journal>International Journal of Computer and Information Engineering</journal> <ee>https://publications.waset.org/pdf/9058</ee> <url>https://publications.waset.org/vol/15</url> <publisher>World Academy of Science, Engineering and Technology</publisher> <abstract>QoS Routing aims to find paths between senders and receivers satisfying the QoS requirements of the application which efficiently using the network resources and underlying routing algorithm to be able to find lowcost paths that satisfy given QoS constraints. The problem of finding leastcost routing is known to be NP hard or complete and some algorithms have been proposed to find a near optimal solution. But these heuristics or algorithms either impose relationships among the link metrics to reduce the complexity of the problem which may limit the general applicability of the heuristic, or are too costly in terms of execution time to be applicable to large networks. In this paper, we analyzed two algorithms namely Characterized Delay Constrained Routing (CDCR) and Optimized Delay Constrained Routing (ODCR). The CDCR algorithm dealt an approach for delay constrained routing that captures the tradeoff between cost minimization and risk level regarding the delay constraint. The ODCR which uses an adaptive path weight function together with an additional constraint imposed on the path cost, to restrict search space and hence ODCR finds near optimal solution in much quicker time.</abstract> <index>Open Science Index 15, 2008</index> </article>