We present a case study in which we apply parallelsimulation methods and interoperability techniques to network simulations for simulation-based on-line control of military communication networks. The on-line simulat...
详细信息
ISBN:
(纸本)9780769516080
We present a case study in which we apply parallelsimulation methods and interoperability techniques to network simulations for simulation-based on-line control of military communication networks. The on-line simulations model actual military networks, including wired shipboard sub-networks connected via satellite links, and wireless mobile devices. The modeled scenario depicts the communication requirements of an amphibious landing where a complex network connects troops ashore and naval vessels. The simulations use a heterogeneous set of tools, including ns2 models for shipboard wired networks, and GloMoSim models for the wireless devices. In this paper, we document the challenges we encountered in applying parallel and interoperable simulation methods, and describe our solutions. We describe our experiences in addressing the interoperability problems that naturally arose due to the heterogeneity of scenario models. We also present a preliminary study on the scalability of real-time performance of parallel network simulations, which is crucial for on-line simulations. Salient system characteristics of the subject military network scenarios are described for the benefit of exposure to the modeling and simulation research community. Our exercise not only highlights the relevance of parallel and distributedsimulation techniques to an important real-life problem, but also demonstrates the feasibility of applying those techniques in a practical setting.
Lookback is defined as the ability of a logical process to change its past locally (without involving other logical processes). Logical processes with lookback are able to process out-of-timestamp order events, enabli...
ISBN:
(纸本)9780769516080
Lookback is defined as the ability of a logical process to change its past locally (without involving other logical processes). Logical processes with lookback are able to process out-of-timestamp order events, enabling new synchronization protocols for the parallel discrete event simulation. Two of such protocols, LB-GVT (LookBack-Global Virtual Time) and LB-EIT (LookBack-Earliest Input Time), are presented and their performance on the Closed Queuing Network (CQN) simulation is discussed. We also discuss in detail the relation between lookahead and lookback. Finally, we demonstrate that lookback allows conservative simulations to circumvent the speedup limit imposed by the critical path.
In this paper we discuss and compare three differentcausality inconsistency tracking mechanisms in support ofpreemptive rollback in optimistic parallelsimulation onmyrinet clusters. These mechanisms exhibit different...
ISBN:
(纸本)9780769518534
In this paper we discuss and compare three differentcausality inconsistency tracking mechanisms in support ofpreemptive rollback in optimistic parallelsimulation onmyrinet clusters. These mechanisms exhibit different communication/processing overhead and also different effectivenessin revealing causality inconsistency of the currentlyexecuted simulation event. By the results of an empiricalstudy on a classical simulation benchmark we have foundsome trade-offs between these mechanisms, pointing out indicationsof application contexts for which each mechanismis expected to be well tailored.
A technique called updateable simulations is proposed to reduce the time to complete multiple executions of a discrete event simulation program. This technique updates the results of a prior simulation run rather than...
详细信息
ISBN:
(纸本)9780769516080
A technique called updateable simulations is proposed to reduce the time to complete multiple executions of a discrete event simulation program. This technique updates the results of a prior simulation run rather than re-execute the entire simulation to take into account variations in the underlying simulation model. A framework for creating updateable simulations is presented. This framework is applied to the problem of simulating a set of cascaded ATM multiplexers and a network of ATM switches. Performance measurements of sequential and parallel implementations of these simulations on a shared memory multiprocessor are presented, demonstrating that updateable simulations can yield substantial reductions in the time required to complete multiple simulation runs if there is much similarity among the runs.
Rapid growth in wireless communication systems motivates the development of technology supporting the simulation of large-scale wireless systems. However, it is widely recognized that wireless communications do not ha...
详细信息
ISBN:
(纸本)9780769516080
Rapid growth in wireless communication systems motivates the development of technology supporting the simulation of large-scale wireless systems. However, it is widely recognized that wireless communications do not have substantial "lookahead" needed by conservative synchronization protocols. This paper focuses on identifying and exploiting lookahead for such models. We find lookahead in three ways, exploiting characteristics of low power networks, the transceiver logic, and the way in which protocol stacks are typically constructed. We show how these observations allow a variety of conservative synchronization protocols to take advantage of lookahead, describe a synchronization method we use, and empirically examine the performance this method offers on a large-scale simulation of a sensor network intended for homeland defense scenarios
We describe a novel approach to scalability and efficiency of parallel network simulation that partitions the networks into domains and simulation time into intervals. Each domain is simulated independently of and con...
详细信息
ISBN:
(纸本)9780769516080
We describe a novel approach to scalability and efficiency of parallel network simulation that partitions the networks into domains and simulation time into intervals. Each domain is simulated independently of and concurrently with the others over the same simulation time interval. At the end of each interval, packet delays and drop rates for each inter-domain flow are exchanged between domain simulators. The simulators iterate over the same time interval until the exchanged information converges to a constant value within the prescribed precision. After convergence, all the domain simulators progress to the next time interval. This approach allows the parallelization with infrequent *** biggest challenge for this method is to ensure iteration convergence for protocols, such as TCP, that adjust source rate to the current network conditions. The main contribution of this paper is to demonstrate that by judicious design of the domain processing and information exchange, the proposed approach efficiently parallelizes network simulation with TCP flows.
A new model for communication in MANET is presented: Instead of omnidirectional transmissions, as assumed in most papers and all existing systems, the members are allowed to submit data in a fixed number of different ...
详细信息
ISBN:
(纸本)0769514448
A new model for communication in MANET is presented: Instead of omnidirectional transmissions, as assumed in most papers and all existing systems, the members are allowed to submit data in a fixed number of different directions (sector subdivision) and to adjust the transmission power in each sector separately. A simulation environment (simulation environment for ad hoc networks, SAHNE) is presented that allows simulation of communication strategies in MANET that use sector subdivision, and simulation results are shown where communication paths are selected via hop-minimization or geometric spanner properties. SAHNE is based on C++ and common libraries, which ensures that it can be used on many different platforms. The experiments show the influence of different parameters in realistic scenarios, and using geometric routing seemed to be better than using hop-minimization.
There are many mapping schemes proposed in previous research on parallel proxy servers. The operations of these schemes are mainly URL-based, and therefore cannot fully benefit from the new persistent connection featu...
详细信息
There are many mapping schemes proposed in previous research on parallel proxy servers. The operations of these schemes are mainly URL-based, and therefore cannot fully benefit from the new persistent connection feature of HTTP/1.1. We propose a site-based mapping scheme that forwards all requests targeting on the same Web site to the same proxy server. The scheme then allows the proxy to use a single persistent connection to serve many client requests. The major advantage of the scheme is the reduction in the number of connection establishments. This reduction can save network bandwidth and reduce the user-experienced latency. simulation results show that the proposed site-based scheme reduces 40%-70% of the connection setups and teardowns when compared to a traditional URL-based mapping scheme.
This paper focuses on conservative simulation using distributed-shared memory for inter-processor communication. JavaSpaces, a special service of Java Jini, provides a shared persistent memory for simulation message c...
ISBN:
(纸本)9780769516080
This paper focuses on conservative simulation using distributed-shared memory for inter-processor communication. JavaSpaces, a special service of Java Jini, provides a shared persistent memory for simulation message communication among processors. Two benchmark programs written using our SPaDES/Java parallelsimulation library are used. The first program is a linear pipeline system representing a loosely-coupled open system. The PHOLD program represents a strongly-connected closed system. Experiments are carried out using a cluster of Pentium II PCs. We used a combination of Wood Turner carrier null, flushing and demand-driven algorithms for null message synchronization. To optimize message communication, we replace SPaDES/Java inter-processor communication implemented using Java's Remote Method Invocation (RMI) with one JavaSpace. For PHOLD (16x16, 16) running on eight processors, this change reduces simulation runtime by more than half, null message overhead reduces by a further 15%, and event rate more than doubled. Based on our memory analysis methodology, the memory cost of null message synchronization for PHOLD is less than 9% of the total memory needed by the simulation.
Decentralized control is composed of more than two subsystems. Subsystems communicate each other to control the whole system. In this paper, information of mechanical constraint for a parallel manipulator is analyzed....
详细信息
Decentralized control is composed of more than two subsystems. Subsystems communicate each other to control the whole system. In this paper, information of mechanical constraint for a parallel manipulator is analyzed. When some joints of multi-degrees of freedom parallel manipulators are set to be passive, excessive interference force can be reduced. A case where one joint of 3-linked arms is set to be passive is treated. The influence of a passive joint to the tip of the arm is derived by the configuration and the calculated reference torque. In the active joints, the interference force information from other joints are used to compensate the effect of passive joint. Such information is also used for switching passive joints. As a result, the avoidance of singular point is realized. Taking advantage of a parallel manipulator which has redundant drive joints, fault compensation is achieved by extending the communication of subsystems. Comparison with centralized control represents the availability of the decentralized control system by simulation.
暂无评论