AEU - International Journal of Electronics and Communications
An improved quantum-inspired evolutionary algorithm for coding resource optimization based network coding multicast scheme
Introduction
Network coding technology is a new communication paradigm and is superior to traditional routing in many aspects, especially in increasing multicast throughput [1], [2]. Traditional routing adopts store-and-forward data processing scheme with which any intermediate node simply replicates the incoming data information (namely, data packets) and forwards a copy to its downstream node(s). However, the maximum throughput of a multicast scenario could not be often achieved by using such data processing scheme [1], [2]. With code-and-forward data processing scheme at network-layer, network coding allows any intermediate node to combine (also called code) data information received from different incoming links and to output the coded information if necessary, being able to obtain a multicast throughput that is maximized according to MAX-FLOW MIN-CUT theorem [2].
Fig. 1 shows the advantages of network coding compared to traditional routing with respect to the achieved maximum multicast throughput. Fig. 1(a) shows a network with source s and two sinks y, z. Each direct link has a capacity of one bit per unit time. Source s expects to send two bits, a and b, to y and z. According to the MAX-FLOW MIN-CUT theorem, the min cut between s and the set of destinations y, z is two bits per unit time, which means the maximum multicast throughput from s to y (or to z) should be two bits per unit time. However, if traditional routing is adopted, the multicast throughput is 1.5 bits information per unit time. This is because link could only forward one bit (a or b) to x, and thus y and z cannot simultaneously receive two bits, a and b, as indicated in Fig. 1(b). In Fig. 1(c), if the intermediate node w is allowed to code the two bits it receives from t and u respectively into one bit (here, symbol is Exclusive-OR operation) and to output to x, sink y and sink z are able to obtain a, and b, respectively, which means two bits information is available at both y and z. Meanwhile, y and z can use a, and b, to get b and a by calculating and respectively.
Currently, most of the network-coding-related research works suppose that coding operation should be implemented at all coding-possible intermediate nodes [3], [4], [5]. However, to achieve a desired throughput, coding operation may only be necessary at a subset of all coding-possible nodes [3], [4], [5]. In Fig. 2, there are two network coding schemes that could both achieve the maximum multicast throughput. Network coding scheme A adopts all coding-possible nodes, namely m and n, as shown in Fig. 2(a). Nevertheless, the same throughput is also obtained by network coding scheme B when only one of the two coding-possible nodes, m, is required to perform coding operation (see Fig. 2(b)). Since coding operation consumes computing time and increases date processing complexity, it is of great interest to minimize the amount of coding operation. Such problem is proven to be NP-Hard [3], [4].
In order to solve this problem, several algorithms have been proposed, which are mainly based on either greedy algorithms or evolutionary algorithms [3], [4], [5], [6], [7], [8]. In [6], [7], greedy algorithms were used to minimize coding resource. However, both of the above algorithms assume that the nodes with multiple incoming links must carry out network coding. And their optimal efficiency depends on the selected sub-graph and the link traversal order. In [8], linear programming formulations were proposed to optimize various network coding resources. Nevertheless, the number of variables and the number of constraints both grow with the number of destination nodes. Thus, this method limits itself to the case where the number of sinks is not large. Some genetic algorithms (GAs) with both centralized and distributed versions were put forward to minimize the network coding resources where coding is required [3], [4], [5]. In addition, GA based algorithms seem to perform much better than minimal algorithms above. However, due to the inherent shortcomings of GA such as pre-maturity, slow convergence speed and weak global searching capability, poor optimization performance is usually led to.
Quantum-inspired evolutionary algorithm (QEA), a combination of quantum computation and genetic algorithm, has been widely studied [9], [10], [11], [12], [13], [14], [15], [16]. Exploration and exploitation could be provided simultaneously, only if suitable evolution parameter values are selected. Having a great effect on optimization performance of QEA, the selection of suitable evolutionary parameters must be paid sufficient attention to. However, in most of the existing QEAs, the determination of evolutionary parameters does not take the differences among individuals into consideration. In [9], [10], [11], [12], fixed rotation angle step (FRAS) schemes have been put forward. At arbitrary evolutionary generation, FRAS-based algorithm uses the same rotation angle step (RAS) strategy to evolve its population. If any two chromosomes are in the same case with respect to the corresponding lookup table, they will use the same RAS value to update. QEA with FRAS scheme often results in slow convergence since the RAS values in lookup table never change. Later, the dynamic rotation angle step (called DRAS below) schemes were proposed in [13], [14], where new RAS values are provided adaptively at each generation. With DRAS schemes, the searching grid of QEA varies from large to small automatically, and it is of some help to accelerate the convergence and to achieve better optimal solutions. However, at any evolutionary generation, all individuals under DRAS schemes only refer to one lookup table to update, which means DRAS schemes are also designed for a population but may be not suitable for every individual.
If we define that Single-granularity Evolution (SE) mechanism is a mechanism under which all chromosomes at the same generation use the same RAS scheme to evolve themselves, we can see that all QEA algorithms above utilize SE mechanism. Due to this mechanism, the optimization performance of the above algorithms overly depend on the selection of RAS values at each generation. Unless the RAS values could be allocated properly, sub-optimal solutions will appear easily. Mutation is an effective operation to prevent premature convergence and to raise global search capability. However, it is not adopted as a basic evolution operation in conventional QEA. Although, quantum mutation operations are introduced in [12], [16], the differences among individuals are not taken into consideration so that the algorithm may sometimes be trapped in local search.
In order to provide an efficient network coding multicast scheme with less coding resource occupied and to overcome the problems caused by SE mechanism and conventional quantum mutation operation, this paper offers a new parallel evolutionary algorithm called multi-granularity evolution quantum-inspired evolutionary algorithm (MEQEA). Against SE mechanism, the multi-granularity evolution (ME) mechanism assigns different RAS schemes to different chromosomes. Thus, the case that the efficiency of the algorithm overly depends on one RAS scheme will never exist, and therefore it is no longer necessary to find one very good RAS scheme which is actually difficult to be found. When adaptive quantum mutation (AQM) operation is implemented, the differences among individuals are taken into full consideration, and therefore pre-maturity is avoided easily. We confirm the performance of MEQEA over a number of multicast scenarios. Simulation results show that our algorithm performs better than genetic algorithm (GA) and traditional quantum-inspired evolutionary algorithm (QEA) in terms of robustness, success ratio, convergence and global search capability.
Section snippets
Problem formulation
A communication network can be modeled as a directed graph , where V is the set of nodes and E is the set of links [2]. Assume that each link has a unit capacity. A single multicast scenario could be considered as a 4-tuple set (G, s, T, R) that includes a graph G (V, E), a source node , a set of sinks , and data rate R at which s wishes to transmit to all sinks T. Rate R is said to be achievable only if there exists a transmission scheme that enables all sinks
An overview of QEA
QEA is a probabilistic search algorithm which exploits the power of quantum computation in order to accelerate genetic procedures [9]. The basic unit of information in QEA is the quantum-bit (qubit). A qubit is a two-level quantum system which may be in the state, in the state, or in any superposition of the two. The state of a qubit can be represented aswhere , and both and are complex numbers that specify the probability amplitude of the corresponding
The proposed algorithm
This section provides an efficient coding resource optimization based network coding multicasting scheme which is based on QEA with ME mechanism and AQM operation. At first, the ME mechanism and AQM operation are introduced and discussed. Then, other indispensable components are described and discussed. In the end, we give the structure of the proposed algorithm.
Experimental result
In order to evaluate the performance of the presented algorithm, comparisons of GA [3], QEA [9], QEA with ME mechanism but without AQM (called MEQEA1 below) and QEA with both ME mechanism and AQM (called MEQEA2 below) have been carried out over three network topologies with the following parameters: Set-1 (20 nodes, 32 links, 6 sinks, rate 3), Set-2 (40 nodes, 76 links, 15 sinks, rate 4) and Set-3 (60 nodes, 114 links, 20 sinks, rate 4) constructed by the algorithm in [17]. The population size
Conclusions
An improved QEA has been proposed for coding resource optimization based network coding multicast routing problem. By adopting ME mechanism and AQM operation, the performance of the proposed algorithm is enhanced to a large extent. The simulation results clearly demonstrate the superiority of this algorithm over GA and QEA in terms of robustness, high success ratio, fast convergence and excellent capacity on global searching.
Acknowledgements
This research was supported in part by the National 863 Program (no. 2009AA01z255), NSFC (nos. 60772024 and 60711140087), National 973 Program (no. 2007CB310705), PCSIRT (no. IRT0609), ISTCP (no. 2006DFA11040), SRFDP of MOE (200800130001), PR China.
Huanlai Xing was born in Tangshan, China, in 1983. He received his B.E. in Communications Engineering from Southwest Jiaotong University, Chengdu, PR China (in 2006) and his M.E. in Electromagnetic Field and Microwave Technology from Beijing University of Posts and Telecommunications, Beijing, PR China (in 2009). He is currently working towards his Ph.D. degree at ASAP group, School of Computer Science, The University of Nottingham, UK. His research interests include Meta-heuristics,
References (17)
- et al.
Generating connected acyclic digraphs uniformly at random
Information Processing Letters
(2004) - et al.
Network information flow
IEEE Transactions on Information Theory
(2000) - et al.
Linear network coding
IEEE Transactions on Information Theory
(2003) - Kim M, Ahn CW, Médard M, Effros M. On minimizing network coding resources: an evolutionary approach. Second workshop on...
- Kim M, Médard M, Aggarwal V, Reilly VO, Kim W, Ahn CW, Effros M. Evolutionary approaches to minimizing network coding...
- Kim M, Aggarwal V, Reilly VO, Médard M, Kim W. Genetic representations for evolutionary optimization of network coding....
- et al.
Information flow decomposition for network coding
IEEE Transactions on Information Theory
(2006) - et al.
The encoding complexity of network coding
IEEE Transactions on Information Theory
(2006)
Cited by (27)
Parallel quantum-inspired evolutionary algorithms for community detection in social networks
2017, Applied Soft Computing JournalCitation Excerpt :A QIEA has excellent ability of global search due to its diversity caused by the probabilistic representation, and it can approach better solutions than classical EA algorithms in a short time [38b]. Since the first proposal of Han and Kim [33], quantum-inspired evolutionary algorithm and its variants have been applied successfully for several other problems like the disk allocation problem [50], flow shop scheduling problem [28,114], data clustering [101], SVM parameter selection [105], image processing [17,56], job shop scheduling [28,99,100], multiple sequence alignment [42], face detection or verification [43b,43a], network design problems [102], power system optimization [97], and many more. Comprehensive surveys detailing applications and extensions of the QIEA algorithm may be found in [109,24,62].
A hybrid EDA for load balancing in multicast with network coding
2017, Applied Soft Computing JournalCitation Excerpt :For each array, once there are at least two 1’s, the remaining 0’s are replaced with 1’s. QEA1: Quantum-inspired evolutionary algorithm (QEA) [44]. A number of quantum-bit based individuals are maintained, each represents a probabilistic distribution model over the genotype space.
An improved MOEA/D algorithm for multi-objective multicast routing with network coding
2017, Applied Soft Computing JournalCitation Excerpt :Early studies include greedy-based optimization approaches [8,9] and genetic algorithms (GAs) [10]. Recently, researchers adapt estimation of distribution algorithms (EDAs) for minimizing coding cost, e.g. quantum-inspired evolutionary algorithms [11], population based incremental learning (PBIL) [12] and compact GA [13]. Moreover, Evolutionary algorithms (EAs) with other techniques incorporated, such as entropy-based evaluation relaxation, path-oriented encoding and artificial ant colonies, have been investigated [14–16].
Peer-assisted video streaming based on network coding and Beer-Quiche game
2017, AEU - International Journal of Electronics and CommunicationsCitation Excerpt :In contrast, because of incoming packet process possibility for the intermediate nodes, the nature of wireless mesh and p2p systems are compatible with this approach. Generally, NC is qualified for multicast traffic schemes especially for increasing throughput [56]. For example, authors in [57] employed NC to improve the quality of service for time critical application in wireless networks.
Hamming-distance-based adaptive quantum-inspired evolutionary algorithm for network coding resources optimization
2015, Journal of China Universities of Posts and TelecommunicationsA nondominated sorting genetic algorithm for bi-objective network coding based multicast routing problems
2013, Information SciencesCitation Excerpt :When incorporating network coding into multicast, the most attractive advantage is that (according to the MAX-FLOW MIN-CUT Theorem) the theoretical maximal throughput is always guaranteed [34]. Fig. 1 shows a comparison between network coding and traditional routing regarding the average data rate to receivers [46]. Fig. 1a is a network, where source s multicasts two-bit information (a) and (b) to node y and node z. Each link can forward a single bit at each time.
Huanlai Xing was born in Tangshan, China, in 1983. He received his B.E. in Communications Engineering from Southwest Jiaotong University, Chengdu, PR China (in 2006) and his M.E. in Electromagnetic Field and Microwave Technology from Beijing University of Posts and Telecommunications, Beijing, PR China (in 2009). He is currently working towards his Ph.D. degree at ASAP group, School of Computer Science, The University of Nottingham, UK. His research interests include Meta-heuristics, evolutionary algorithms and routing problems in telecommunication network.
Yuefeng Ji was born in Shanghai, China. He received his Ph.D. degree from Beijing University of Posts and Telecommunications (BUPT), PR China. He is currently a professor, the executive dean of the Institute of Optical Communications and Optoelectronics of BUPT, and the executive deputy Director of Key Laboratory of IPOC of MOE, PR China. His research interests are primarily in the areas of broadband optical networks and modern telecommunication technologies, with emphasis on key theory, realization of technology, and applications.
Lin Bai was born in Chongqi, China. She received her M.Sc. degree from Beijing University of Posts and Telecommunications (BUPT), PR China. She is currently a professor of BUPT. Her research interests are primarily in the algorithms of broadband network.
Yongmei Sun received B.E. and M.E. degrees from Xi’an Jiaotong University, China, in 1992 and 1995 respectively, and Ph.D. degree from the University of Tokyo, Japan, in 2006. She has been in Beijing University of Posts and Telecommunications (BUPT) since 1995, and currently an associate professor at BUPT. From 2007 to 2009, she stayed in NTT Network Innovation Laboratories as an associate researcher. Her research interests include optical multicasting based on network coding, optical parallel transmission and optical circuit/burst/packet switching. She is a member of IEICE.