An Effective Evolutionary Computational Approach for Routing Optimization in Networks with Shared Risk Link Groups

Xubin Luo; Qing Li

Wireless Communications and Applications. First International Conference, ICWCA 2011, Sanya, China, August 1-3, 2011, Revised Selected Papers

Research Article

An Effective Evolutionary Computational Approach for Routing Optimization in Networks with Shared Risk Link Groups

Download

357 downloads

Cite: BibTeX Plain Text

@INPROCEEDINGS{10.1007/978-3-642-29157-9_20,
    author={Xubin Luo and Qing Li},
    title={An Effective Evolutionary Computational Approach for Routing Optimization in Networks with Shared Risk Link Groups},
    proceedings={Wireless Communications and Applications. First International Conference, ICWCA 2011, Sanya, China, August 1-3, 2011, Revised Selected Papers},
    proceedings_a={ICWCA},
    year={2012},
    month={5},
    keywords={routing shared risk link group (SRLG) evolutionary algorithm combined cost},
    doi={10.1007/978-3-642-29157-9_20}
}

Xubin Luo
Qing Li
Year: 2012
An Effective Evolutionary Computational Approach for Routing Optimization in Networks with Shared Risk Link Groups
ICWCA
Springer
DOI: 10.1007/978-3-642-29157-9_20

Xubin Luo¹^,*, Qing Li¹^,*

1: Southwestern University of Finance and Economics

*Contact email: xbluo@swufe.edu.cn, liqt@swufe.edu.cn

Abstract

In this work, we study a routing optimization problem in networks with shared risk link groups (SRLGs). Specifically, a path between a source and a destination is determined such that the combined path cost and the weight of SRLGs to which the links of the path belong is minimized. We develop evolutionary computation based algorithms to solve the problem. The performance of the proposed algorithms is evaluated via extensive simulation and is compared with the solutions obtained by integer linear programming and the heuristic algorithm in [1].

Keywords: routing shared risk link group (SRLG) evolutionary algorithm combined cost

Published: 2012-05-29

: http://dx.doi.org/10.1007/978-3-642-29157-9_20