Space-parallel network simulations using ghosts

Space-parallel network simulations using ghosts
复制标题

使用幽灵的空间并行网络模拟

DOI:
10.1145/1013329.1013357
复制
发表时间:
2004
期刊:
18th Workshop on Parallel and Distributed Simulation, 2004. PADS 2004.
影响因子:
--
通讯作者:
M. Ammar
M. Ammar
中科院分区:
--
文献类型:
--
作者:
G. Riley;Talal M. Jaafar;R. Fujimoto;M. Ammar

文献摘要

被引文献

相似文献

我们讨论了一种创建联邦网络模拟的方法,该方法减轻了通常由定义空间并行模拟的更传统方法引起的模拟器用户的负担。以前的方法存在困难,因为在联邦之间转发模拟数据包时需要全局拓扑知识。除了最简单的情况外,在联邦之间正确的数据包转发决策需要大小为O(mn)的路由表(m是在特定模拟器实例中建模的节点数,n是整个拓扑中网络节点的总数),以便确定在联邦之间应该如何路由数据包。此外,如果没有整体拓扑的全局知识,就无法充分实现众所周知的nix矢量路由方法的优势。我们试图利用使用幽灵节点的拓扑划分方法来克服这些困难。虚节点是联邦中的模拟器对象,它表示空间上分配给其他联邦的模拟网络节点,因此其他联邦负责维护与该节点相关的所有状态。然而,幽灵节点确实保留了与其他节点的拓扑连通性信息,允许空间并行模拟中的所有联邦获得网络拓扑的全局图像。我们通过实验结果表明,与幽灵相关的内存开销相对于模拟的总体内存占用是最小的。
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 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 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 utilizing 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.