Optical networks: a practical perspective
Optical networks: a practical perspective
A Routing Protocol for Anycast Messages
IEEE Transactions on Parallel and Distributed Systems
On Finding Feasible Solutions for the Delay Constrained Group Multicast Routing Problem
IEEE Transactions on Computers
Routing Algorithms for Anycast Messages
ICPP '98 Proceedings of the 1998 International Conference on Parallel Processing
WDM Multicasting in IP over WDM Networks
ICNP '99 Proceedings of the Seventh Annual International Conference on Network Protocols
IP Over WDM: building the next-generation optical internet
IP Over WDM: building the next-generation optical internet
A genetic algorithm for shortest path routing problem and the sizing of populations
IEEE Transactions on Evolutionary Computation
On anycast routing with bandwidth constraint
Computer Communications
Genetic algorithms for multiple multicast on WDM ring network
Computer Communications
Integrated routing algorithms for anycast messages
IEEE Communications Magazine
IEEE Journal on Selected Areas in Communications
Optimal routing and wavelength assignment in WDM ring networks
IEEE Journal on Selected Areas in Communications
Subpath protection for scalability and fast recovery in optical WDM mesh networks
IEEE Journal on Selected Areas in Communications
Genetic algorithm for finding minimal cost light forest of multicast routing on WDM networks
Journal of Artificial Evolution and Applications - Regular issue
Genetic algorithm for finding minimal cost light-forest of multicast routing on WDM networks
Artificial Intelligence Review
Static manycast routing and wavelength assignment over wavelength-routed optical WDM networks
ANTS'09 Proceedings of the 3rd international conference on Advanced networks and telecommunication systems
On finding minimum cost tree for multi-resource manycast in mesh networks
Optical Switching and Networking
| Hi-index | 0.24 |
Anycast refers to the transmission of data from a source node to (any) one member in the group of designed recipients in a network. In WDM network, the anycast requests can be used as an optimization tool to ensure survivability. If the anycast requests can be routed and delivered carefully, it is enough to find more free lightpath (or wavelengths) to other traffic (unicast or multicast). When the WDM network and the set of anycast requests are given, the anycast routing and wavelength assignment (ARWA) problem is to find a set of light-paths, one for each source, for anycasting messages to any one of the member in the anycast destination group such that not any path using the same wavelength passes through the same link. The goal of the ARWA problem is to minimize the number of used wavelengths. In this paper, the ARWA problem is formulated and studied; since ARWA problem is NP-hard, a hybrid method which combines simulated annealing and genetic algorithm technologies is proposed to solve it. In the proposed algorithm, the random routing method is used to generate the routing path from source to destination, heuristic algorithm is used to find the assigning wavelength of routing path. Nine types of perturbation schemes are proposed to generate the neighboring configuration, these perturbation schemes can avoid the proposed algorithm to trap into local optimum. Moreover, iterative improving technique is used to reduce the computing time for finding the new wavelength assignment. Simulated results show that the proposed algorithm can get better performance than other GA and heuristic algorithms.