A multipopulation parallel genetic simulated annealing-based QoS routing and wavelength assignment integration algorithm for multicast in optical networks

Cheng, Hui; Wang, Xingwei; Yang, Shengxiang; Huang, Min

doi:10.1016/j.asoc.2008.09.008

Cited by 18 publications

(9 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Another future work is to investigate the application of GAs studied in this paper for solving other dynamic routing problems in MANETs. For example, applying GA approaches for the multicasting routing problem [7] in dynamic network environments is to be investigated in the future.…”

Section: Discussionmentioning

confidence: 99%

Genetic Algorithms With Immigrants and Memory Schemes for Dynamic Shortest Path Routing Problems in Mobile Ad Hoc Networks

Yang

Cheng

Wang

2010

IEEE Trans. Syst., Man, Cybern. C

162

View full text Add to dashboard Cite

Abstract-In recent years, the static shortest path (SP) problem has been well addressed using intelligent optimization techniques, e.g., artificial neural networks, genetic algorithms (GAs), particle swarm optimization, etc. However, with the advancement in wireless communications, more and more mobile wireless networks appear, e.g., mobile networks [mobile ad hoc networks (MANETs)], wireless sensor networks, etc. One of the most important characteristics in mobile wireless networks is the topology dynamics, i.e., the network topology changes over time due to energy conservation or node mobility. Therefore, the SP routing problem in MANETs turns out to be a dynamic optimization problem. In this paper, we propose to use GAs with immigrants and memory schemes to solve the dynamic SP routing problem in MANETs. We consider MANETs as target systems because they represent new-generation wireless networks. The experimental results show that these immigrants and memory-based GAs can quickly adapt to environmental changes (i.e., the network topology changes) and produce high-quality solutions after each change.Index Terms-Dynamic optimization problem (DOP), dynamic shortest path routing problem (DSPRP), genetic algorithm (GA), immigrants scheme, memory scheme, mobile ad hoc network (MANET).

show abstract

Section: Discussionmentioning

confidence: 99%

Genetic Algorithms With Immigrants and Memory Schemes for Dynamic Shortest Path Routing Problems in Mobile Ad Hoc Networks

Yang

Cheng

Wang

2010

IEEE Trans. Syst., Man, Cybern. C

162

View full text Add to dashboard Cite

show abstract

“…In [40], a set of dynamic genetic algorithms are proposed to solve the dynamic delay-constrained SP problem in mobile ad hoc networks. Genetic algorithm and its variants have also been applied to the clustering problem [41], joint QoS multicast routing and channel assignment problem [42], and QoS routing and wavelength assignment problem [43].…”

Section: Evolutionary Algorithms For Qos Multicast Routingmentioning

confidence: 99%

QoS multicast routing protocol oriented to cognitive network using competitive coevolutionary algorithm

Wang

Cheng

Huang

2014

Expert Systems with Applications

Self Cite

View full text Add to dashboard Cite

Abstract:The human intervention in the network management and maintenance should be reduced to alleviate the ever-increasing spatial and temporal complexity. By mimicking the cognitive behaviours of human being, the cognitive network improves the scalability, self-adaptation, self-organization, and self-protection in the network. To implement the cognitive network, the cognitive behaviours for the network nodes need to be carefully designed. Quality of service (QoS) multicast is an important network problem. Therefore, it is appealing to develop an effective QoS multicast routing protocol oriented to cognitive network.In this paper, we design the cognitive behaviours summarized in the cognitive science for the network nodes. Based on the cognitive behaviours, we propose a QoS multicast routing protocol oriented to cognitive network, named as CogMRT. It is a distributed protocol where each node only maintains local information. The routing search is in a hop by hop way. Inspired by the small-world phenomenon, the cognitive behaviours help to accumulate the experiential route information. Since the QoS multicast routing is a typical combinatorial optimization problem and it is proved to be NP-Complete, we have applied the competitive coevolutionary algorithm (CCA) for the multicast tree construction. The CCA adopts novel encoding method and genetic operations which leverage the characteristics of the problem. We implement and evaluate CogMRT and other two promising alternative protocols in NS2 platform. The results show that CogMRT has remarkable advantages over the counterpart traditional protocols by exploiting the cognitive favours.

show abstract

“…Then it solves the problem by well-designed genetic algorithms. In [8] a multi-population parallel genetic algorithm is used for MRWA problem. The GA presented in the paper is hybridized with simulated annealing technique.…”

Section: Previous Workmentioning

confidence: 99%

An Efficient Multicast Routing Technique Using Genetic Algorithm over WDM Mesh Networks

Barat¹,

Ghosh²,

Dutta³

et al. 2015

JACN

View full text Add to dashboard Cite

Abstract-MulticastCommunication over an optical fiber network is treated as a major problem in optical domain. As the need of one-to-many communication is increasing day by day, researchers are trying to devise novel and efficient approaches to solve this problem. Although the most of the efforts done in this field is heuristic in nature, evolutionary approaches are also started to be used to solve this as an optimization problem. In this paper we have used Genetic Algorithm to find an efficient multicast route (tree) to establish a multicast connection in WDM mesh network. We have proposed a novel fitness function which can optimize multiple objectives: reaching maximum no. of destinations, minimizing usage of optical channels, minimizing usage of splitters, very efficiently. We have established the truth of our claim by simulating our proposed algorithm over various optical fiber networks.

show abstract

A multipopulation parallel genetic simulated annealing-based QoS routing and wavelength assignment integration algorithm for multicast in optical networks

Cited by 18 publications

References 25 publications

Genetic Algorithms With Immigrants and Memory Schemes for Dynamic Shortest Path Routing Problems in Mobile Ad Hoc Networks

Genetic Algorithms With Immigrants and Memory Schemes for Dynamic Shortest Path Routing Problems in Mobile Ad Hoc Networks

QoS multicast routing protocol oriented to cognitive network using competitive coevolutionary algorithm

An Efficient Multicast Routing Technique Using Genetic Algorithm over WDM Mesh Networks

Contact Info

Product

Resources

About