Repository landing page

We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.

M/M/1 polling models with two finite queues

Abstract

Ankara : Department of Industrial Engineering and the Institute of Engineering and Science of Bilkent University, 1995.Thesis (Master's) -- Bilkent University, 1995.Includes bibliographical references leaves 92-95.Polling models are special kinds of queueing models where multiple-customer type single-stage is considered. In this thesis, first an overview and a classification of polling models will be given. Then two-costomer one server M /M /l polling models will be analyzed and the performance of models will be developed for exhaustive, gated, and G-limited service policies. We give analytical methods for a special type of polling model where we solve the system to get mean queue lengths and thruput rates by three methods. The first one is based on solving the steady state distribution of the Markov Process. The second is a decompositon aiming to decrease the size of the problem. The third one is an approximation method that uses the earlier results and it is very accurate. The thesis will be concluded with possible future extensions.Daşçı, AbdullahM.S

Similar works

This paper was published in Bilkent University Institutional Repository.

Having an issue?

Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.