Loop-free routing using diffusing computations
IEEE/ACM Transactions on Networking (TON)
An approach for federating parallel simulators
PADS '00 Proceedings of the fourteenth workshop on Parallel and distributed simulation
The MicroGrid: a scientific tool for modeling computational gridsr
Proceedings of the 2000 ACM/IEEE conference on Supercomputing
Experiences parallelizing a commercial network simulator
Proceedings of the 33nd conference on Winter simulation
Computing in Science and Engineering
A Generic Framework for Parallelization of Network Simulations
MASCOTS '99 Proceedings of the 7th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
Stateless Routing in Network Simulations
MASCOTS '00 Proceedings of the 8th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
The Georgia Tech Network Simulator
MoMeTools '03 Proceedings of the ACM SIGCOMM workshop on Models, methods and tools for reproducible network research
Proceedings of the 35th conference on Winter simulation: driving innovation
Traffic-based Load Balance for Scalable Network Emulation
Proceedings of the 2003 ACM/IEEE conference on Supercomputing
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
WNS2 '06 Proceeding from the 2006 workshop on ns-2: the IP network simulator
Parallel Simulation of Hybrid Network Traffic Models
Proceedings of the 21st International Workshop on Principles of Advanced and Distributed Simulation
Parallel Hybrid Network Traffic Models
Simulation
Limitations of network emulation with single-machine and distributed ns-3
Proceedings of the 3rd International ICST Conference on Simulation Tools and Techniques
| Hi-index | 0.00 |
We discuss an approach for creating a federated network simulation that eases the burdens on the simulator user that typically arise from more traditional methods for defining space-parallel simulations. Previous approaches have difficulties that arise from the need for global topology knowledge when forwarding simulated packets between the federates. In all but the simplest cases, proper packet forwarding decisions between federates requires routing tables of size O(mn) (m is the number of nodes modeled in a particular simulator instance, and n is the total number of network nodes in the entire topology) in order to determine how packets should be routed between federates. Further, the benefits of the well-known NIx-Vector routing approach cannot be fully achieved without global knowledge of the overall topology. We seek to overcome these difficulties by utlizing a topology partitioning methodology that uses Ghost Nodes. A ghost node is a simulator object in a federate that represents a simulated network node that is spatially assigned to some other federate, and thus that other federate is responsible for maintaining all state associated with the node. However, ghost nodes do retain topology connectivity information with other nodes, allowing all federate in a space-parallel simulation to obtain a global picture of the network topology. We show with experimental results that the memory overhead associated with the ghosts is minimal relative to the overall memory footprint of the simulation.