Date of Award

Winter 2019

Document Type

Open Access Thesis

Degree Name

Master of Science (MS)

Department

Mathematics & Statistics

First Advisor

Muhammad El-Taha

Second Advisor

Abou El-Makarim Aboueissa

Third Advisor

Weston Viles

Abstract

The following examination of computational methods related to queues with general arrivals (i:i:d: but of unknown distribution), multiple identical servers with i:i:d: exponential service times, and ordinary first come, first served service (hereafter referred to as G/M/c to use existing naming conventions) seeks to investigate the current models and provide new results based on a draft convolution method proposed by El-Taha[3]. The new model will demonstrate the use of distributions with coefficients of variance ranging from zero to near infinity to provide flexibility in simulating a range of potential arrival distributions, and we include detailed results and software for both small-scale and large-scale models.

Share

COinS