Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
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
Proceedings of the fifteenth workshop on Parallel and distributed simulation
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
Hi-index | 0.00 |
The authors discuss an approach to federated network simulations that eases the burdens on the simulation developer in creating space-parallel simulations. Previous approaches have had difficulties that arise from the need for global topology knowledge when forwarding simulated packets between federates. In all but the simplest cases, proper packet-forwarding decisions between federates requires routing tables of size O(mn), where m is the number of nodes modeled in a particular federate, and n is the total number of network nodes in the entire topology. Furthermore, the benefits of the well-known NIx-Vector routing approach cannot be fully achieved without global knowledge of the overall topology. The authors overcome these difficulties by using a topology partitioning methodology that uses ghost nodes. They show experimentally that the memory overhead associated with ghosts is minimal relative to the overall memory footprint of the simulation.