Bibliography: leaves 147-152.

The objective of many steady-state simulations is to study the behavior of a nonterminating system with a peak load of infinite duration. Due to the complexity of the system, the initial conditions of the system are often atypical that often requires the simulators to start the system with the empty and idle conditions. Consequently, deletion of some initial observations is required to reduce the initialization bias induced by atypical initial conditions. This paper studies the application of Schriber's truncation rule to the complex queueing systems (specifically, the two-machine and three-machine tandem queueing system) and the effects of parameter selection (i.e. parameters batch size and time between observations) on performance measures. Based on the previous studies of Schriber's rule on the one-machine system, parameters batch count and tolerance are held constant. Mean-squared error and half length are used as measures of accuracy and interval precision in comparing the results. The results of both systems show that time between observations and batch size are significant parameters, and the recommendations for the two-machine system can be generalized for the three-machine system. Increasing the number of machines in the system from two to three requires a careful reduction in the value of time between observations. Besides, multiple replications should be used to minimize the extreme results in determining the steady-state mean number of entities and the truncation point. / Graduation date: 1992

No description available.

No description available.

No description available.

No description available.

No description available.

No description available.

This thesis is devoted to the construction and analysis of models which can be used to evaluate the performance and reliability of distributed systems. The general object of the research therefore is to extend the types of queueing models with breakdowns which have been solved, with a particular interest in networking structures. The systems that are studied involve various collections of servers and their associated queues. These range from isolated nodes, though parallel nodes coupled by the effect of breakdowns on arrivals, to pipelines of such parallel stages and more general networks. The issues that are explored include the influence of breakdowns and repairs on delays, job losses and optimal routeing. Obtaining performance measures for interacting queues is difficult, however a degree of abstraction has been used here which allows long run averages to be calculated (exactly in many cases) for quite complex systems. A variety of different techniques are used in order to obtain solutions to these models, including exact equations, exact numerical and approximate numerical techniques.

Thesis (M.S.)--State University of New York at Binghamton, Department of Electrical and Computer Engineering, 2006. / Includes bibliographical references (leaves 126-128).