A new k-graph partition algorithm for distributed P2P simulation systems

Abstract

While simulating a P2P system with distributed simulator, it generally requires that one single large network topology should be pre-divided into some small sub-nets, each of which denotes a group of peers in the P2P system. Because of interconnectivity of the simulated network, the sub-nets running on different simulation node must exchange message with each other to complete the simulation task. Based on the knowledge of degree sequence and breadth-first search, this paper proposes a novel approximate algorithm of k-graph partition. By this optimized algorithm, a large P2P network topology can be divided into k sub-nets while not only the traffic among different sub-net is minimized, but also the tasks of simulation are balanced. Through the analysis of time complexity, load balance and edge-cut experimental results for different network topology, it shows our algorithm is a feasible method applied for distributed P2P simulation systems. © Springer-Verlag Berlin Heidelberg 2007.