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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Stephanos, A.T., Spinellis, D.: A Survey of Peer-to-Peer Content Distribution Technologies. ACM Computing Surveys 36(4), 335–371 (2004)
Ingalls, R. G.: Introduction to Simulation. In: Proceedings of the 2002 Winter Simulation Conference (WSC 2002) San Diego, California, USA (2002)
Joseph, S.: An Extendible Open Source P2P Simulator. P2P Journal (2003)
Sedgewick, R.: Algorithms in Java. Parts 1-4, 3rd edn. vol. 1, Tsinghua University Publisher (2004)
Buckly, F., Lewinter, M.: A Friendly Introdution to Graph Theory. 1st edn. Tsinghua University Publisher (2005)
Pilkingtong, J., Baden, S.: Partition With Spacefilling Curves. Technical Report CS94-394, Dept.of Computer Science And Engineering, Univ. of California (1994)
Hager, W., Krylyuk, Y.: Graph Partition And Continuous Quadratic Programming. SIAM Journal on Discrete Mathematics (1999)
Simon, H., Sohn, A., Biswas, R.: HARP: a Fast Spectral Partition. In: Proceedings of 9th ACM Symposium on Parallel Algorithms And Architectures, Newport, Rhode Island(1997)
Karypis, G., Kumar, V.: A Fast and High Quality Multilevel Scheme for Partition Irregular Graphs. SIAM Journal on Scientific Computing, pp. 359–392 (1998)
Karypis, G., Kumar, V.: Multilevel k-way Partition Scheme for Irregular Graphs. Journal of Parallel and Distributed Computing (1998)
Monien, B., Preis, R., Diekmann, R.: Quality Matching And Local Improvement for Multilevel Graph – Partition. Technical Report, University of Paderborn (1999)
Walshaw, C., Cross, M.: Parallel Optimization Algorithms for Multilevel Mesh Partitioning. Technical Report 99/IM/44 [A], University of Greenwich, London, UK (1999)
Arora, S., Rao, S., Vazirani. U.: Expander Flows, Geometric Embeddings and Graph Partition. ACM Symposium on Theory of Computing (STOC 2004), Chicago, Illinois, USA (2004)
Ji, X.: Graph Partition Problems With Minimum Size Constraints. Rensselaer Polytechnic Institute, Troy, New York (2004)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, C., Zhou, S., Wei, L., Luo, J., Wang, Y., Yang, X. (2007). A New k-Graph Partition Algorithm for Distributed P2P Simulation Systems. In: Jin, H., Rana, O.F., Pan, Y., Prasanna, V.K. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2007. Lecture Notes in Computer Science, vol 4494. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72905-1_35
Download citation
DOI: https://doi.org/10.1007/978-3-540-72905-1_35
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72904-4
Online ISBN: 978-3-540-72905-1
eBook Packages: Computer ScienceComputer Science (R0)