A path-oriented encoding evolutionary algorithm for network coding resource minimization

Huanlai Xing, Rong Qu, Graham Kendall and Ruibin Bai
Additional contact information
Huanlai Xing: 1] University of Nottingham, Nottingham, UK[2] Southwest Jiaotong University, Chengdu, China
Rong Qu: University of Nottingham, Nottingham, UK
Graham Kendall: 1] University of Nottingham, Nottingham, UK[2] University of Nottingham, Malaysia Campus, Kuala Lumpur, Malaysia
Ruibin Bai: University of Nottingham Ningbo, Ningbo, China

Journal of the Operational Research Society, 2014, vol. 65, issue 8, 1261-1277

Abstract: Network coding is an emerging telecommunication technique, where any intermediate node is allowed to recombine incoming data if necessary. This technique helps to increase the throughput, however, very likely at the cost of huge amount of computational overhead, due to the packet recombination performed (ie coding operations). Hence, it is of practical importance to reduce coding operations while retaining the benefits that network coding brings to us. In this paper, we propose a novel evolutionary algorithm (EA) to minimize the amount of coding operations involved. Different from the state-of-the-art EAs which all use binary encodings for the problem, our EA is based on path-oriented encoding. In this new encoding scheme, each chromosome is represented by a union of paths originating from the source and terminating at one of the receivers. Employing path-oriented encoding leads to a search space where all solutions are feasible, which fundamentally facilitates more efficient search of EAs. Based on the new encoding, we develop three basic operators, that is, initialization, crossover and mutation. In addition, we design a local search operator to improve the solution quality and hence the performance of our EA. The simulation results demonstrate that our EA significantly outperforms the state-of-the-art algorithms in terms of global exploration and computational time.

Date: 2014
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.palgrave-journals.com/jors/journal/v65/n8/pdf/jors201379a.pdf Link to full text PDF (application/pdf)
http://www.palgrave-journals.com/jors/journal/v65/n8/full/jors201379a.html Link to full text HTML (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pal:jorsoc:v:65:y:2014:i:8:p:1261-1277

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().