Inverse Space Filling Curve Partitioning Applied to Wide Area Graphs


Cyprien Gottstein1, Philippe Raipin Parvedy1, Michel Hurfin2, Thomas Hassan1 and Thierry Coupaye1, 1TGI-OLS-DIESE-LCP-DDSD, Orange Labs, France, 2Univ Rennes, France


The most recent developments in graph partitioning research often consider scale-free graphs. Instead we focus on partitioning geometric graphs using a less usual strategy: Inverse Spacefilling Partitioning (ISP). ISP relies on a space filling curve to partition a graph and was previously applied to graphs essentially generated from Meshes. We extend ISP to apply it to a new context where the targets are now Wide Area Graphs. We provide an extended comparison with two state-of-the-art graph partitioning streaming strategies, namely LDG and FENNEL. We also propose customized metrics to better understand and identify the use cases for which the ISP partitioning solution is best suited. Experimentations show that in favourable contexts, edge-cuts can be drastically reduced, going from more 34% using FENNEL to less than 1% using ISP.


Graph, Partitioning, Graph partitioning, Geometric partitioning, Spatial, Geography, Geometric, Space Filling Curve, SFC, ISP.

Full Text  Volume 10, Number 14