A Fast Routing Selection Method Based on Ant Colony Optimization

Author

Zhao Jian-Peng ; Guo Shi-Ze ; Zheng Kang-Feng ; Hu Yi-Xun ; Jia Wei

Author_Institution

Inf. Security Centre, Beijing Univ. of Posts & Telecommun., Beijing, China

fYear

2012

fDate

8-10 Dec. 2012

Firstpage

797

Lastpage

801

Abstract

A fast clustering routing algorithm based on ant colony optimization and Dijkstra Algorithm is proposed on account of the router-level network topology simulation. First, FCRSA takes advantages of ant colony optimization to cluster the nodes in the network, then uses the improved Dijkstra algorithm to search for the shortest paths in the clusters, reducing the time needed for path selecting in router-level network topology simulation effectively. Experimental results show that the FCRSA-based simulation system of network topology is adequate for topology simulation on router-level.

Keywords

ant colony optimisation; telecommunication network routing; telecommunication network topology; Dijkstra algorithm; FCRSA-based simulation system; ant colony optimization; fast clustering routing algorithm; fast routing selection method; path selecting; router-level network topology simulation; Algorithm design and analysis; Clustering algorithms; Internet; Joining processes; Network topology; Routing; Topology; Dijkstra algorithm; ant colony optimization; router-level topology simulation; shortest path;

fLanguage

English

Publisher

ieee

Conference_Titel

Instrumentation, Measurement, Computer, Communication and Control (IMCCC), 2012 Second International Conference on

Conference_Location

Harbin

Print_ISBN

978-1-4673-5034-1

Type

conf

DOI

10.1109/IMCCC.2012.192

Filename

6429027