Title :
A Routing Computation Strategy Based on Improved Clustering Algorithm
Author :
Zhao Jian-Peng ; Guo Shi-Ze ; Zheng Kang-Feng ; Hu Yi-Xun ; Dai Fang-Fang
Author_Institution :
Inf. Security Centre, Beijing Univ. of Posts & Telecommun., Beijing, China
Abstract :
A routing computation strategy based on improved clustering algorithm is proposed in this paper. It uses a clustering algorithm based on K-means and Dijkstra (CAKD) in topology partitioning. The routing information of each node can be computed during the clustering process, and CAKD reduces the time cost in routing computation and the storage in storing routing information. Experiments showed that, compared with using Dijkstra to cluster, CAKD cost less time. Meanwhile, compared with the strategy of global shortest path, the routing computation strategy based on improved clustering algorithm costs less storage in storing routing information.
Keywords :
Internet; graph theory; pattern clustering; telecommunication network routing; telecommunication network topology; CAKD; clustering algorithm based on K-means and Dijkstra; global shortest path strategy; improved clustering algorithm; routing computation strategy; routing information; topology partitioning; Algorithm design and analysis; Clustering algorithms; Computational modeling; Computers; Network topology; Routing; Topology; Dijkstra algorithm; K-means algorithm; routing computation strategy; topology partitioning;
Conference_Titel :
Instrumentation, Measurement, Computer, Communication and Control (IMCCC), 2012 Second International Conference on
Conference_Location :
Harbin
Print_ISBN :
978-1-4673-5034-1
DOI :
10.1109/IMCCC.2012.120
