论文部分内容阅读
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 com-pression graph in the field of compute visual-ization, we propose an efficient shortest path algorithm by compressing the original big network graph into a small one, but the im-portant graph properties used to calculate path is reserved. We implement a centralized ver-sion of our approach in SDN-enabled network, and the evaluations validate the improvement compared with the well-known algorithms.