An anycast routing algorithm based on genetic algorithm

Authors:
Chun Zhu;Min Jin
Affiliations:
Computer Science and Information Technology College, Zhejiang Wanli University, Ningbo, P.R. China;Computer Science and Information Technology College, Zhejiang Wanli University, Ningbo, P.R. China
Venue:
WSEAS Transactions on Computers
Year:
2009

Citing 7
Cited 0

A Routing Protocol for Anycast Messages

IEEE Transactions on Parallel and Distributed Systems
Practical Bilevel Optimization: Algorithms and Applications (Nonconvex Optimization and Its Applications)

Practical Bilevel Optimization: Algorithms and Applications (Nonconvex Optimization and Its Applications)
An orthogonal genetic algorithm for multimedia multicast routing

IEEE Transactions on Evolutionary Computation
QoS routing based on genetic algorithm

Computer Communications
Integrated routing algorithms for anycast messages

IEEE Communications Magazine
Quality-of-service routing for supporting multimedia applications

IEEE Journal on Selected Areas in Communications
Evaluation of multicast routing algorithms for real-time communication on high-speed networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Anycast refers to the transmission of data from a source node to (any) one member in the group of designed recipients in a network, which has been defined a standard communication model of IP version 6. In order to implement multi-destination and multi-path anycast routing on the heavy load network, this paper proposes a new anycast routing algorithm based on genetic algorithm and presents a heuristic genetic algorithmic to solve shortest path routing optimization problem. The network simulation experimental results show that this algorithm can capable of finding optimization anycast routing path and getting more resolution at less time and more balanced network load, enhancing the search ratio.