No description available.

No description available.

No description available.

No description available.

One of the impacts of the rising demand for community health services, primarily used by seniors, is that hospitals are often faced with the challenge of having patients finish the acute phase of their treatment and yet are unable to discharge them due to the lack of a bed in a more appropriate community care setting. The frequency of this challenge has led to the designation of “alternative level of care” (ALC) being ascribed to patients who remain in the hospitals due to insufficient capacity downstream. The thesis focuses on a model that seeks to address patient flow through the community care network (CCN) and finding capacity allocation policies for the different facilities that resolves the ALC challenge using scenario analysis. A queuing network model with general routings and nodes’ blocking has been developed and a heuristic approximation method has been employed for solving the model. Blocking probabilities and the number of blocked patients are derived as performance metrics of the CCN. We test the accuracy of the queuing model through a simulation model and the behaviours of the system in different scenarios are investigated in the simulation model and our policy insights and conclusions are provided.

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).

Thesis--University of Wisconsin--Madison. / Typescript. Vita. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaves 137-139).

Thesis (M.S.)--University of Wisconsin--Madison, 1962. / Typescript. eContent provider-neutral record in process. Description based on print version record. Includes bibliographical references (leaf 34).