Huanlai Xing
On minimizing coding operations in network coding based multicast: an evolutionary algorithm
Xing, Huanlai; Qu, Rong; Bai, Lin; Ji, Yuefeng
Abstract
In telecommunications networks, to enable a valid data transmission based on network coding, any intermediate node within a given network is allowed, if necessary, to perform coding operations. The more coding operations needed, the more coding resources consumed and thus the more computational overhead and transmission delay incurred. This paper investigates an efficient evolutionary algorithm to minimize the amount of coding operations required in network coding based multicast. Based on genetic algorithms, we adapt two extensions in the proposed evolutionary algorithm, namely a new crossover operator and a neighbourhood search operator, to effectively solve the highly complex problem being concerned. The new crossover is based on logic OR operations to each pair of selected parent individuals, and the resulting offspring are more likely to become feasible. The aim of this operator is to intensify the search in regions with plenty of feasible individuals. The neighbourhood search consists of two moves which are based on greedy link removal and path reconstruction, respectively. Due to the specific problem feature, it is possible that each feasible individual corresponds to a number of, rather than a single, valid network coding based routing subgraphs. The neighbourhood search is applied to each feasible individual to find a better routing subgraph that consumes less coding resource. This operator not only improves solution quality but also accelerates the convergence. Experiments have been carried out on a number of fixed and randomly generated benchmark networks. The results demonstrate that with the two extensions, our evolutionary algorithm is effective and outperforms a number of state-of-the-art algorithms in terms of the ability of finding optimal solutions.
Citation
Xing, H., Qu, R., Bai, L., & Ji, Y. (2014). On minimizing coding operations in network coding based multicast: an evolutionary algorithm. Applied Intelligence, 41(3), https://doi.org/10.1007/s10489-014-0559-4
Journal Article Type | Article |
---|---|
Publication Date | Oct 1, 2014 |
Deposit Date | Mar 15, 2015 |
Publicly Available Date | Mar 15, 2015 |
Journal | Applied Intelligence |
Print ISSN | 0924-669X |
Electronic ISSN | 1573-7497 |
Publisher | Springer Verlag |
Peer Reviewed | Peer Reviewed |
Volume | 41 |
Issue | 3 |
DOI | https://doi.org/10.1007/s10489-014-0559-4 |
Public URL | https://nottingham-repository.worktribe.com/output/994378 |
Publisher URL | http://link.springer.com/article/10.1007%2Fs10489-014-0559-4 |
Additional Information | The final publication is available at Springer via http://dx.doi.org/10.1007/s10489-014-0559-4. |
Files
APIN14.pdf
(428 Kb)
PDF
You might also like
A pattern-based algorithm with fuzzy logic bin selector for online bin packing problem
(2024)
Journal Article
Self-Bidirectional Decoupled Distillation for Time Series Classification
(2024)
Journal Article
Densely Knowledge-Aware Network for Multivariate Time Series Classification
(2024)
Journal Article
Downloadable Citations
About Repository@Nottingham
Administrator e-mail: discovery-access-systems@nottingham.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2024
Advanced Search