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

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

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

Original languageEnglish
Pages (from-to)7524-7539
Number of pages16
JournalInternational Journal of Physical Sciences
Volume6
Issue number33
DOIs
Publication statusPublished - 09 Dec 2011

Fingerprint

Routing algorithms
genetic algorithms
Genetic algorithms
Quality of service
Approximation algorithms
Heuristic algorithms
multimedia
polynomials
Polynomials
simulation

All Science Journal Classification (ASJC) codes

  • Electronic, Optical and Magnetic Materials
  • Physics and Astronomy(all)

Cite this

@article{89b5cd51bc184b739fdce00be724f79f,
title = "Performance analysis of genetic algorithm (GA)-based multi-constrained path routing algorithm",
abstract = "To 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.",
author = "Salman Yussof",
year = "2011",
month = "12",
day = "9",
doi = "10.5897/IJPS11.613",
language = "English",
volume = "6",
pages = "7524--7539",
journal = "International Journal of Physical Sciences",
issn = "1992-1950",
publisher = "Academic Journals",
number = "33",

}

Performance analysis of genetic algorithm (GA)-based multi-constrained path routing algorithm. / Yussof, Salman.

In: International Journal of Physical Sciences, Vol. 6, No. 33, 09.12.2011, p. 7524-7539.

Research output: Contribution to journalArticle

TY - JOUR

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

AU - Yussof, Salman

PY - 2011/12/9

Y1 - 2011/12/9

N2 - To 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.

AB - To 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.

UR - http://www.scopus.com/inward/record.url?scp=83655172492&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=83655172492&partnerID=8YFLogxK

U2 - 10.5897/IJPS11.613

DO - 10.5897/IJPS11.613

M3 - Article

VL - 6

SP - 7524

EP - 7539

JO - International Journal of Physical Sciences

JF - International Journal of Physical Sciences

SN - 1992-1950

IS - 33

ER -