Please use this identifier to cite or link to this item: http://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/8548
Title: A Framework for Pre-Computated Multi-Constrained Quickest QoS Path Algorithm
Authors: Sharma, Ashutosh
kumar, Rajiv
Keywords: Terms—QoS
Multi-Constraints
NP-Complete
Performance envelope
Reliability
Issue Date: 2017
Publisher: Jaypee University of Information Technology, Solan, H.P.
Abstract: The era of advance computer networks and advance communication leads the technology to new heights and the algorithms used for the routing needs to be updated side by side parallel with the advancement. This paper presents the new multi-constrained routing algorithm which gives quality of service full-fill the service level agreements with the user. Finding a multi-constrained path is a NP-complete problem, but still the presented algorithm gives the feasible path for the routing in a given polynomial time. Furthermore the performance comparison shows the best results with presented approach and existed approach.
URI: http://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/8548
Appears in Collections:Journal Articles

Files in This Item:
File Description SizeFormat 
A Framework for Pre-Computated Multi-Constrained Quickest QOS Path Algorithm.pdf795.29 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.