In this paper we deal withthe problem of monitoring network latency. Indeed, latency is a key network metric related to both network performance and Quality of Service, since it directly impacts on the overall user...
详细信息
ISBN:
(纸本)9798400706486
In this paper we deal withthe problem of monitoring network latency. Indeed, latency is a key network metric related to both network performance and Quality of Service, since it directly impacts on the overall user's experience. High latency leads to unacceptably slow response times of network services, and may increase network congestion and reduce the throughput, in turn disrupting communications and the user's experience. A common approach to monitoring network latency takes into account the frequently skewed distribution of latency values, and therefore specific quantiles are monitored, such as the 95th, 98th, and 99th percentiles. We present a parallel, message-passing based version of the FRUGAL algorithm that can be used for monitoring network latency quickly and accurately. A distributed version is also discussed.
In this paper, a novel distributed Cross-Layer QoS (DCLQ) architecture based on node disjoint multipath routing is proposed to provide QoS guarantees for realtime traffic and best-effort traffic in mobile ad hoc netwo...
详细信息
ISBN:
(纸本)076952611X
In this paper, a novel distributed Cross-Layer QoS (DCLQ) architecture based on node disjoint multipath routing is proposed to provide QoS guarantees for realtime traffic and best-effort traffic in mobile ad hoc networks. Without any extra control overhead, DCLQ can schedule packets of real-time flows according to their perhop QoS requirements. DCLQ implements per-hop delay QoS-aware priority scheduling and QoS consideration of IvMC layer to ensure that real-timeflows and best-effort flows can achieve their desired service level.
Computer simulations continue to grow in size and complexity and are moving towards exascale. simulations at this scale can generate outputs that exceed both storage capacity and the bandwidth available for transferri...
详细信息
ISBN:
(纸本)9781728186726
Computer simulations continue to grow in size and complexity and are moving towards exascale. simulations at this scale can generate outputs that exceed both storage capacity and the bandwidth available for transferring to storage, making traditional offline statistical inference challenging. therefore, it is desirable to embed statistical analyses in the simulation framework while the simulation is running - a strategy called in situ inference - to alleviate the burden of storage. In this work, we focus on adapting Principal Component Analysis (PCA) - a statistical method for reducing dimensionality of big data - to the in situ setting. We develop TributaryPCA: a distributed version of Oja's algorithm for streaming PCA that uses the Message Passing Interface (MPI) standard. Our approach significantly reduces data storage requirements of offline PCA and avoids excessive communication across compute nodes. We illustrate the method using data generated from the SHIELDS Framework for space weather simulation.
this paper addresses issues of task clustering-the coalition of several fine grain tasks into single coarser grain tasks called task clusters-and task cluster scheduling on distributed processors. the performance of v...
详细信息
this paper describes a procedure for assigning simulation trials to a set of parallel processors for the purpose of conducting a simulation study, involving a complex simulation model, in near real time. Unlike distri...
详细信息
ISBN:
(纸本)0769520367
this paper describes a procedure for assigning simulation trials to a set of parallel processors for the purpose of conducting a simulation study, involving a complex simulation model, in near real time. Unlike distributedsimulation, where a complex simulation model is decomposed and its parts run in a parallel environment, the parallel replications approach discussed here involves running simulation replications to completion for the entire model. the unique element here is that the workload involved in running the simulation study is too time consuming to execute on a single workstation, so that the simulation analyst must utilize computer resources available through the web. New statistical methodology is needed for running a complex simulation study in a web-based, parallel replications environment.
Time Warp (TW), although generally accepted as a potentially effective parallel and distributedsimulation mechanism for timed Petri nets, can reveal deficiencies in certain model domains. Particularly, the unlimited ...
详细信息
Time Warp (TW), although generally accepted as a potentially effective parallel and distributedsimulation mechanism for timed Petri nets, can reveal deficiencies in certain model domains. Particularly, the unlimited optimism underlying TW can lead to excessive aggressiveness in memory consumption due to saving state histories, and waste of CPU cycles due to overoptimistically progressing simulations that eventually have to be "rolled back" Furthermore, in TW simulations executing in distributed memory environments,the communication overhead induced by the rollback mechanism can cause pathological overall simulation performance. In this work, an adaptive optimism control mechanism for TW is developed to overcome these shortcomings. By monitoring and statistically analyzing the arrival processes of synchronization messages, TW simulation progress is probabilistically throttled based on the forecasted timestamp of forthcoming messages. Two classes of arrival process characterizations are studied, reflecting that a natural tradeoff exists among the computational and space complexity, and the respective prediction accuracy: While forecasts based on metrics of central tendency are computationally cheap but yield inadequate predictions for correlated arrivals (thus negatively affecting performance), time series based forecast methods give higher prediction accuracy, but at higher computational cost. the sensitivity of the adaptive optimism control with respect to forecast accuracy and computational overhead is analyzed for very large Petri net simulation models executed withthe TW protocol on the Meiko CS-2 multiprocessor, and for a stress case scenario on the CM-5. Empirical evidence is delivered showing that: 1) probabilistic optimism control, regardless of the communication-computation speed ratio of the target execution platform, automatically finds the most appropriate synchronization policy in the spectrum between optimistic TW and conservative Chandy/Misra/Bryant
In this paper, we present the implementation of a parallel road traffic. simulation using the concept of Lane Cut Points (LCPs) in the Spider programming environment. LCPs are storage buffers inserted into lane data s...
详细信息
ISBN:
(纸本)0769520367
In this paper, we present the implementation of a parallel road traffic. simulation using the concept of Lane Cut Points (LCPs) in the Spider programming environment. LCPs are storage buffers inserted into lane data structures at the road network partition edges. Vehicles enter a partition at the edges from an LCP and exit a partition edge into an LCP at the end of every simulation. step. Spider, a parallel programming environment, which runs on PVM, coordinates the execution of the parallel traffic simulation.
In this paper we propose an efficient transmission strategy for the two-way relay channel (TWRC) with multiple relays, when these are multiple-input multiple-output (MIMO) transceivers that apply the amplify-and-forwa...
详细信息
ISBN:
(纸本)9781467310710
In this paper we propose an efficient transmission strategy for the two-way relay channel (TWRC) with multiple relays, when these are multiple-input multiple-output (MIMO) transceivers that apply the amplify-and-forward (AF) protocol. Although the optimal beamforming strategy is known, it requires a central node, with channel state information (CSI) of the entire network, to compute all the beamforming matrices, which is impractical. To reduce the overhead, in this paper we present a distributed algorithm for the computation of the relay beamforming matrices. the proposed algorithm divides the problem in two stages. First, each relay computes its own beamforming matrix in parallel using only local CSI. Next, a distributed beamforming is applied to make the signals add up coherently at the nodes. Although the proposed algorithm is suboptimal, we show through simulations that it performs very close to the optimal achievable rate region.
the Grid enables large-scale resource sharing and makes it viable for running large-scale parallel and distributedsimulations. the High Level Architecture (HLA) paradigm provides a software platform and interoperabil...
详细信息
ISBN:
(纸本)0769520367
the Grid enables large-scale resource sharing and makes it viable for running large-scale parallel and distributedsimulations. the High Level Architecture (HLA) paradigm provides a software platform and interoperability interface for simulation components to utilize these hardware resources. However, neither the Grid nor the HLA provides mechanism for resource management for parallel and distributedsimulations. It is also noticed that substantial effort is required for writing program that conforms to the Runtime Infrastructure (RTI) requirements because of its complexity. In this paper, we introduce a framework for designing and executing parallelsimulation using the RTI. the framework is also designed to assist load balancing and checkpointing. Withthe code library from our framework, the modeler is able to complete the design of a parallelsimulationthat runs on RTI by specifying the simulation configuration and the handling detail of each event. Our framework incorporates automatic code generation. It also uses Data Distribution Management to route simulation events (interactions) to achieve efficient use of network bandwidth.
暂无评论