A novel graph compression algorithm for data-intensive scientific networks. (19th September 2019)

• Record Type: Journal Article
• Authors: Lin, Xiao; Du, Haizhou; Chen, Shenshen
• Is Part Of: International journal of high performance computing and networking. Volume 14:Number 4(2019)
• Page Start: 425
• Page End: 434
• Publication Date: 2019-09-19
• Subjects: network topology -- data-intensive -- compression -- shortest path tree -- SPT -- weighted graph -- high performance networking; High performance computing -- Periodicals; Computer networks -- Periodicals; High performance computing; Periodicals; 004.05
• Languages: English
• ISSNs: 1740-0562

Abstract

As one of the world's leading scientific and data-intensive computing grids, the worldwide LHC computing grid (WLCG) faces the challenge of improving its computing efficiency and network utilisation. To achieve this goal, WLCG needs an important piece of information: the network topology graphs of participating computing grids. Directly collecting such information from all of the grids, however, would cause high communication overhead and raise many security issues. In this paper, we address these issues by proposing a novel algorithm to compress such a large network topology into a compact, equivalent network topology. We formally define our problem, develop a novel, efficient topology compression algorithm and evaluate its performance using real-world network topologies. Our results show that our algorithm not only achieves a much higher topology compression ratio than state-of-the-art topology transformation algorithms, but also leads to at most 100× reduction in computation time.