Evolutionary Computation with Spatial Receding Horizon Control to Minimize Network Coding ResourcesReportar como inadecuado

Evolutionary Computation with Spatial Receding Horizon Control to Minimize Network Coding Resources - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

The Scientific World Journal - Volume 2014 2014, Article ID 268152, 23 pages -

Research Article

State Key Laboratory of Earth Surface Processes and Resource Ecology, Beijing Normal University, Beijing 100875, China

School of Engineering, University of Warwick, Coventry CV4 7AL, UK

Received 7 November 2013; Accepted 30 December 2013; Published 14 April 2014

Academic Editors: Z. Cui and X. Yang

Copyright © 2014 Xiao-Bing Hu and Mark S. Leeson. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


The minimization of network coding resources, such as coding nodes and links, is a challenging task, not only because it is a NP-hard problem, but also because the problem scale is huge; for example, networks in real world may have thousands or even millions of nodes and links. Genetic algorithms GAs have a good potential of resolving NP-hard problems like the network coding problem NCP, but as a population-based algorithm, serious scalability and applicability problems are often confronted when GAs are applied to large- or huge-scale systems. Inspired by the temporal receding horizon control in control engineering, this paper proposes a novel spatial receding horizon control SRHC strategy as a network partitioning technology, and then designs an efficient GA to tackle the NCP. Traditional network partitioning methods can be viewed as a special case of the proposed SRHC, that is, one-step-wide SRHC, whilst the method in this paper is a generalized -step-wide SRHC, which can make a better use of global information of network topologies. Besides the SRHC strategy, some useful designs are also reported in this paper. The advantages of the proposed SRHC and GA for the NCP are illustrated by extensive experiments, and they have a good potential of being extended to other large-scale complex problems.

Autor: Xiao-Bing Hu and Mark S. Leeson

Fuente: https://www.hindawi.com/


Documentos relacionados