enter search term and/or author name
Efficient importance sampling schemes for a feed-forward network
Leila Setayeshgar, Hui Wang
Article No.: 21
The aim of this article is to construct efficient importance sampling schemes for a rare event, namely, the buffer overflow associated with a feed-forward network with discontinuous dynamics. This is done through a piecewise constant change of...
Rare-event simulation for stochastic recurrence equations with heavy-tailed innovations
Jose Blanchet, Henrik Hult, Kevin Leder
Article No.: 22
In this article, rare-event simulation for stochastic recurrence equations of the form
On the validity of flow-level tcp network models for grid and cloud simulations
Pedro Velho, Lucas Mello Schnorr, Henri Casanova, Arnaud Legrand
Article No.: 23
Researchers in the area of grid/cloud computing perform many of their experiments using simulations that must capture network behavior. In this context, packet-level simulations, which are widely used to study network protocols, are too...
The classical activity cycle diagram (ACD), which is a bipartite directed graph, is easy to learn and use for describing the dynamic behavior of a discrete-event system. However, the complexity of the classical ACD model increases...
Synchronised range queries in distributed simulations of multiagent systems
Vinoth Suryanarayanan, Georgios Theodoropoulos
Article No.: 25
Range queries are an increasingly important associative form of data access encountered in different computational environments including peer-to-peer systems, wireless communications, database systems, distributed virtual environments, and, more...