Finding multi-constrained path using genetic algorithm

To 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) prob...

全面介绍

Saved in:
书目详细资料
Main Authors: Yussof S., See O.H.
其他作者: 16023225600
格式: Conference paper
出版: 2023
主题:
标签: 添加标签
没有标签, 成为第一个标记此记录!
实物特征
总结:To 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.