Name
Title | ||
|---|---|---|
Efficiency of time segmentation parallel simulation of queueing networks as a function of the size of the network |
Abstract | ||
|---|---|---|
ABSTRACT In this paper, we study the e ciency of a time paral - lel simulation method, namely the time segmentation approach, that can be applied to simulate long sample paths of a variety of discrete event systems We show that the e ciency of the method is closely related to the amount of time required for sample paths of the system generated with a common sequence of events to couple (i e , become identical) Then we provide bounds and estimates of the expected coupling time for Markovian queueing networks of loss and commu - nication blocking stations as a function of the number of stations and bu er capacities in the network |
Year | DOI | Venue |
|---|---|---|
1997 | 10.1145/268437.268474 | Winter Simulation Conference |
Keywords | Field | DocType |
queueing network,time segmentation parallel simulation | Parallel simulation,Markov process,Coupling,Simulation,Computer science,Segmentation,Layered queueing network,Queueing theory,Discrete event simulation,Distributed computing | Conference |
ISBN | Citations | PageRank |
0-7803-4278-X | 2 | 0.49 |
References | Authors | |
7 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mehdi Hoseyni-Nasab | 1 | 13 | 1.51 |
| Sigrún Andradóttir | 2 | 548 | 55.09 |