학술논문

Iterative partitioning scheme for distributed simulation of dynamic networks
Document Type
Conference
Source
2011 IEEE 16th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD) Computer Aided Modeling and Design of Communication Links and Networks (CAMAD), 2011 IEEE 16th International Workshop on. :92-96 Jun, 2011
Subject
Computing and Processing
Communication, Networking and Broadcast Technologies
Load modeling
Computational modeling
Partitioning algorithms
Program processors
Clustering algorithms
Heuristic algorithms
Load management
dynamic network simulation
parallel simulation
graph partitioning
distributed systems
Language
ISSN
2378-4865
2378-4873
Abstract
Network model partitioning is a key component of distributed network simulations. Simulations slow down considerably due to inequitable load balancing and heavy inter-host communication leading to unbounded synchronization overhead. Also, regularly refreshing the node partition is necessary due to to the dynamic nature of simulation load and event generation. In this paper, we propose a distributed method for network partitioning which includes a coarse initial partitioning followed by iterative improvements in the partition. We suggest a sparse-cut based method to identify nodes eligible for exchange.