Volume 5 Number 9 (Sep. 2010)
Home > Archive > 2010 > Volume 5 Number 9 (Sep. 2010) >
JCP 2010 Vol.5(9): 1322-1334 ISSN: 1796-203X
doi: 10.4304/jcp.5.9.1322-1334

A Robust GA-based QoS Routing Algorithm for Solving Multi-constrained Path Problem

Salman Yussof1 and Ong Hang See2
1 College of Information Technology, Universiti Tenaga Nasional, Kajang, Selangor, Malaysia
2 College of Engineering, Universiti Tenaga Nasional, Kajang, Selangor, Malaysia


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

Index Terms—Genetic algorithm, multi-constrained path, QoS routing, robust routing.

[PDF]

Cite: Salman Yussof and Ong Hang See, " A Robust GA-based QoS Routing Algorithm for Solving Multi-constrained Path Problem," Journal of Computers vol. 5, no. 9, pp. 1322-1334, 2010.

General Information

ISSN: 1796-203X
Abbreviated Title: J.Comput.
Frequency: Bimonthly
Editor-in-Chief: Prof. Liansheng Tan
Executive Editor: Ms. Nina Lee
Abstracting/ Indexing: DBLP, EBSCO,  ProQuest, INSPEC, ULRICH's Periodicals Directory, WorldCat,etc
E-mail: jcp@iap.org
  • Nov 14, 2019 News!

    Vol 14, No 11 has been published with online version   [Click]

  • Mar 20, 2020 News!

    Vol 15, No 2 has been published with online version   [Click]

  • Dec 16, 2019 News!

    Vol 14, No 12 has been published with online version   [Click]

  • Sep 16, 2019 News!

    Vol 14, No 9 has been published with online version   [Click]

  • Aug 16, 2019 News!

    Vol 14, No 8 has been published with online version   [Click]

  • Read more>>