Toward scaling network emulation using topology partitioning
- 22 June 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Scalability is the primary challenge to studying large complex network systems with network emulation. This paper studies topology partitioning, assigning disjoint pieces of the network topology across processors, as a technique to increase emulation capacity with increasing hardware resources. We develop methods to create partitions based on expected communication across the topology. Our evaluation methodology quantifies the communication overhead or efficiency of the resulting partitions. We implement and contrast three partitioning strategies in ModelNet, a large-scale network emulator, using different topologies and uniform communication patterns. Results show that standard graph partitioning algorithms can double the efficiency of the emulation for Internet-like topologies relative to random partitioning.Keywords
This publication has 12 references indexed in Scilit:
- Genesis:a system for large-scale parallel network simulationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- A solver for the network testbed mapping problemACM SIGCOMM Computer Communication Review, 2003
- A generic framework for parallelization of network simulationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Scalability, locality, partitioning and synchronization in PDESPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Applying parallel discrete event simulation to network emulationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- An integrated experimental environment for distributed systems and networksPublished by Association for Computing Machinery (ACM) ,2002
- GloMoSimACM SIGSIM Simulation Digest, 1998
- A Fast and High Quality Multilevel Scheme for Partitioning Irregular GraphsSIAM Journal on Scientific Computing, 1998
- Partitioning Sparse Matrices with Eigenvectors of GraphsSIAM Journal on Matrix Analysis and Applications, 1990
- An Efficient Heuristic Procedure for Partitioning GraphsBell System Technical Journal, 1970