Improving Centralized Path Calculation Based on Graph Compression

作     者：Zhenglian Li Lixin Ji Ruiyang Huang Shuxin Liu 

作者机构：National Digital Switching System Engineering&Technological R&D CenterZhengzhouChina 

出 版 物：《China Communications》 (中国通信（英文版）)

年 卷 期：2018年第15卷第6期

页      面：120-124页

核心收录：

学科分类：12[管理学] 1201[管理学-管理科学与工程(可授管理学、工学学位)] 08[工学] 081201[工学-计算机系统结构] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：supported by the National Natural Science Foundation of China(No.61521003) 

主　　题：graph representation path compression shortest path 

摘      要：Shortest-path calculation on weighted graphs are an essential operation in computer networks. The performance of such algorithms has become a critical challenge in emerging software-defined networks(SDN),since SDN controllers need to centralizedly perform a shortest-path query for every flow,usually on large-scale network. Unfortunately,one of the challenges is that current algorithms will become incalculable as the network size increases. Therefore, inspired by the compression graph in the field of compute visualization,we propose an efficient shortest path algorithm by compressing the original big network graph into a small one, but the important graph properties used to calculate path is reserved. We implement a centralized version of our approach in SDN-enabled network,and the evaluations validate the improvement compared with the well-known algorithms.