Publication:
Performance analysis of genetic algorithm (GA)-based multi-constrained path routing algorithm

Simple item page
dc.citedby2
dc.contributor.authorYussof S.en_US
dc.contributor.authorid16023225600en_US
dc.date.accessioned2023-12-29T07:47:28Z
dc.date.available2023-12-29T07:47:28Z
dc.date.issued2011
dc.description.abstractTo support networked multimedia applications, it is important for the network to provide guaranteed quality-of-service (QoS). One way to provide such services is for the network to perform QoS routing, where the path taken must fulfill a given set of 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 Non-deterministic Polynomial time (NP)-complete and therefore no exact algorithm can be found. As such, various heuristics and approximation algorithms have been proposed to solve the MCP problem. This paper proposed a solution to the MCP problem using genetic algorithm (GA). The effectiveness of the proposed algorithm is evaluated through simulation. The performance of the algorithm is then compared with an exact algorithm called the depth first search and a common shortest path algorithm called the Dijkstra's algorithm. The result of the simulation shows that the performance of the proposed algorithm is almost comparable to an exact algorithm, while at the same time can execute much faster. The proposed algorithm has also been shown to have good network link utilization and is able to scale well with network size. � 2011 Academic Journals.en_US
dc.description.natureFinalen_US
dc.identifier.doi10.5897/IJPS11.613
dc.identifier.epage7539
dc.identifier.issue33
dc.identifier.scopus2-s2.0-83655172492
dc.identifier.spage7524
dc.identifier.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-83655172492&doi=10.5897%2fIJPS11.613&partnerID=40&md5=1cfcfb5dc4b9782b2422681561c4a6fd
dc.identifier.urihttps://irepository.uniten.edu.my/handle/123456789/30406
dc.identifier.volume6
dc.pagecount15
dc.sourceScopus
dc.sourcetitleInternational Journal of Physical Sciences
dc.subjectGenetic algorithm
dc.subjectMulti-constrained path problem
dc.subjectQuality-of-service (qos)
dc.subjectRouting
dc.titlePerformance analysis of genetic algorithm (GA)-based multi-constrained path routing algorithmen_US
dc.typeArticleen_US
dspace.entity.typePublication
Files
Collections
SCOPUS