Publication:
A robust GA-based QoS routing algorithm for solving multi-constrained path problem

Simple item page
dc.citedby23
dc.contributor.authorYussof S.en_US
dc.contributor.authorSee O.H.en_US
dc.contributor.authorid16023225600en_US
dc.contributor.authorid16023044400en_US
dc.date.accessioned2023-12-29T07:51:27Z
dc.date.available2023-12-29T07:51:27Z
dc.date.issued2010
dc.description.abstractTo support networked multimedia applications, it is important for a network to provide guaranteed qualityof- service (QoS). One way to provide such services is for the network to perform QoS routing, where the path taken must fulfill certain constraints. Multi-constrained path (MCP) problem refers to the problem of finding a path through a network subject to multiple additive constraints. It has been proven that this problem is NP-complete and finding an exact solution can be difficult. As such, various heuristics and approximation algorithms have been proposed to solve the MCP problem. However, the actual link metrics in a QoS-aware network is dynamic and may continuously change over time and since the path given by the routing algorithm is computed using the state information available to the router, which may or may not be up-to-date, it is possible that a feasible path returned by the algorithm may turn out to be no longer valid. This paper presents a GAbased QoS routing algorithm for solving the general kconstrained problem which has the capability to return multiple feasible paths in a single run. This makes the algorithm more robust in the case that the rate of change of state information in the network is higher than the rate of state information received by the router. Simulation results show that this algorithm consistently achieve higher feasibility ratio relative to existing well-known MCP routing algorithms when state information in the router lags behind the network. � 2010 Academy Publisher.en_US
dc.description.natureFinalen_US
dc.identifier.doi10.4304/jcp.5.9.1322-1334
dc.identifier.epage1334
dc.identifier.issue9
dc.identifier.scopus2-s2.0-78651523849
dc.identifier.spage1322
dc.identifier.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-78651523849&doi=10.4304%2fjcp.5.9.1322-1334&partnerID=40&md5=d679a4b302066d817874c535312a41ea
dc.identifier.urihttps://irepository.uniten.edu.my/handle/123456789/30694
dc.identifier.volume5
dc.pagecount12
dc.sourceScopus
dc.sourcetitleJournal of Computers
dc.subjectGenetic algorithm
dc.subjectMulti-constrained path
dc.subjectQoS routing
dc.subjectRobust routing
dc.subjectComputer simulation
dc.subjectGenetic algorithms
dc.subjectRouting algorithms
dc.subjectExact solution
dc.subjectHeuristics and approximations
dc.subjectMulti constrained path
dc.subjectMulti-constrained path problems
dc.subjectNetworked multimedia
dc.subjectNP Complete
dc.subjectQoS routing
dc.subjectQoS routing algorithms
dc.subjectRate of change
dc.subjectRobust routing
dc.subjectSimulation result
dc.subjectState information
dc.subjectApproximation algorithms
dc.titleA robust GA-based QoS routing algorithm for solving multi-constrained path problemen_US
dc.typeArticleen_US
dspace.entity.typePublication
Files
Collections
SCOPUS