Publication:
Finding multi-constrained path using genetic algorithm

Simple item page
dc.citedby13
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-28T08:57:34Z
dc.date.available2023-12-28T08:57:34Z
dc.date.issued2007
dc.description.abstractTo properly support networked multimedia applications, it is important for the network to provide quality-of-service (QoS) guarantees. One way to provide QoS guarantees 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 therefore no exact algorithm can be found. As such, various heuristics and approximation algorithms have been proposed to solve the MCP problem. This paper presents a solution to the MCP problem using genetic algorithm (GA). Through simulation, this algorithm has been shown to give a high probability of finding a feasible path if such paths exist. �2007 IEEE.en_US
dc.description.natureFinalen_US
dc.identifier.ArtNo4448579
dc.identifier.doi10.1109/ICTMICC.2007.4448579
dc.identifier.epage718
dc.identifier.scopus2-s2.0-48349139409
dc.identifier.spage713
dc.identifier.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-48349139409&doi=10.1109%2fICTMICC.2007.4448579&partnerID=40&md5=645eb116880b3b93668d16d08ddc2966
dc.identifier.urihttps://irepository.uniten.edu.my/handle/123456789/29757
dc.pagecount5
dc.sourceScopus
dc.sourcetitleProceeding - 2007 IEEE International Conference on Telecommunications and Malaysia International Conference on Communications, ICT-MICC 2007
dc.subjectGenetic algorithm
dc.subjectMulti-constrained path
dc.subjectQoS routing
dc.subjectAlgorithms
dc.subjectBioelectric phenomena
dc.subjectDiesel engines
dc.subjectFood additives
dc.subjectGenetic algorithms
dc.subjectHeuristic programming
dc.subjectImage storage tubes
dc.subjectNuclear propulsion
dc.subjectQuality of service
dc.subjectTelecommunication systems
dc.subjectExact algorithms
dc.subjectGenetic algorithm
dc.subjectGenetic Algorithm (GA)
dc.subjectHigh probability
dc.subjectInternational conferences
dc.subjectMalaysia
dc.subjectMulti-constrained path
dc.subjectMultimedia applications
dc.subjectNP-Complete
dc.subjectOne way
dc.subjectQoS guarantees
dc.subjectQoS routing
dc.subjectApproximation algorithms
dc.titleFinding multi-constrained path using genetic algorithmen_US
dc.typeConference paperen_US
dspace.entity.typePublication
Files
Collections
SCOPUS