Queueing models and stability of message flows in distributed simulators of open queueing networks

Authors:
Manish Gupta;Anurag Kumar;Rajeev Shorey
Affiliations:
Electrical Communication Engineering, Indian Institute of Science, Bangalore, Bangalore, India, 560012;Electrical Communication Engineering, Indian Institute of Science, Bangalore, Bangalore, India, 560012;Electrical Communication Engineering, Indian Institute of Science, Bangalore, Bangalore, India, 560012
Venue:
PADS '96 Proceedings of the tenth workshop on Parallel and distributed simulation
Year:
1996

Citing 4
Cited 4

Virtual time

ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed discrete-event simulation

ACM Computing Surveys (CSUR)
Parallel discrete event simulation

Communications of the ACM - Special issue on simulation
Stability of event synchronisation in distributed discrete event simulation

PADS '94 Proceedings of the eighth workshop on Parallel and distributed simulation

Instability and performance limits of distributed simulators of feedforward queueing networks

ACM Transactions on Modeling and Computer Simulation (TOMACS)
Performance modeling of the IDES framework

Proceedings of the eleventh workshop on Parallel and distributed simulation
A nonblocking algorithm for the distributed simulation of FCFS queueing networks with irreducible Markovian routing

PADS '98 Proceedings of the twelfth workshop on Parallel and distributed simulation
Clustering in stochastic asynchronous algorithms for distributed simulations

SAGA'05 Proceedings of the Third international conference on StochasticAlgorithms: foundations and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study message flow processes in distributed simulators of open queueing networks. We develop and study queueing models for distributed simulators with maximum lookahead sequencing. We characterize the "external'' arrival process, and the message feedback process in the simulator of a simple queueing network with feedback. We show that a certain "natural'' modelling construct for the arrival process is exactly correct, whereas an ``obvious'' model for the feedback process is wrong; we then show how to develop the correct model. Our analysis throws light on the stability of distributed simulators of queueing networks with feedback. We show how the stability of such simulators depends on the parameters of the queueing network.