A robust GA-based QoS routing algorithm for solving multi-constrained path problem
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 t...
Saved in:
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Article |
Published: |
2023
|
Subjects: | |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
my.uniten.dspace-30694 |
---|---|
record_format |
dspace |
spelling |
my.uniten.dspace-306942023-12-29T15:51:27Z A robust GA-based QoS routing algorithm for solving multi-constrained path problem Yussof S. See O.H. 16023225600 16023044400 Genetic algorithm Multi-constrained path QoS routing Robust routing Computer simulation Genetic algorithms Routing algorithms Exact solution Heuristics and approximations Multi constrained path Multi-constrained path problems Networked multimedia NP Complete QoS routing QoS routing algorithms Rate of change Robust routing Simulation result State information Approximation algorithms 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. � 2010 Academy Publisher. Final 2023-12-29T07:51:27Z 2023-12-29T07:51:27Z 2010 Article 10.4304/jcp.5.9.1322-1334 2-s2.0-78651523849 https://www.scopus.com/inward/record.uri?eid=2-s2.0-78651523849&doi=10.4304%2fjcp.5.9.1322-1334&partnerID=40&md5=d679a4b302066d817874c535312a41ea https://irepository.uniten.edu.my/handle/123456789/30694 5 9 1322 1334 Scopus |
institution |
Universiti Tenaga Nasional |
building |
UNITEN Library |
collection |
Institutional Repository |
continent |
Asia |
country |
Malaysia |
content_provider |
Universiti Tenaga Nasional |
content_source |
UNITEN Institutional Repository |
url_provider |
http://dspace.uniten.edu.my/ |
topic |
Genetic algorithm Multi-constrained path QoS routing Robust routing Computer simulation Genetic algorithms Routing algorithms Exact solution Heuristics and approximations Multi constrained path Multi-constrained path problems Networked multimedia NP Complete QoS routing QoS routing algorithms Rate of change Robust routing Simulation result State information Approximation algorithms |
spellingShingle |
Genetic algorithm Multi-constrained path QoS routing Robust routing Computer simulation Genetic algorithms Routing algorithms Exact solution Heuristics and approximations Multi constrained path Multi-constrained path problems Networked multimedia NP Complete QoS routing QoS routing algorithms Rate of change Robust routing Simulation result State information Approximation algorithms Yussof S. See O.H. A robust GA-based QoS routing algorithm for solving multi-constrained path problem |
description |
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. � 2010 Academy Publisher. |
author2 |
16023225600 |
author_facet |
16023225600 Yussof S. See O.H. |
format |
Article |
author |
Yussof S. See O.H. |
author_sort |
Yussof S. |
title |
A robust GA-based QoS routing algorithm for solving multi-constrained path problem |
title_short |
A robust GA-based QoS routing algorithm for solving multi-constrained path problem |
title_full |
A robust GA-based QoS routing algorithm for solving multi-constrained path problem |
title_fullStr |
A robust GA-based QoS routing algorithm for solving multi-constrained path problem |
title_full_unstemmed |
A robust GA-based QoS routing algorithm for solving multi-constrained path problem |
title_sort |
robust ga-based qos routing algorithm for solving multi-constrained path problem |
publishDate |
2023 |
_version_ |
1806426146284240896 |
score |
13.214268 |