Articles via Databases
Articles via Journals
Online Catalog
E-books
Research & Information Literacy
Interlibrary loan
Theses & Dissertations
Collections
Policies
Services
About / Contact Us
Administration
Littman Architecture Library
This site will be removed in January 2019, please change your bookmarks.
This page will redirect to https://digitalcommons.njit.edu/theses/2283/ in 5 seconds

The New Jersey Institute of Technology's
Electronic Theses & Dissertations Project

Title: Performance analysis of queueing systems with synchronous server
Author: Hur, Wonmu
View Online: njit-etd1992-081
(viii, 19 pages ~ 0.5 MB pdf)
Department: Department of Computer and Information Science
Degree: Master of Science
Program: Computer and Information Science
Document Type: Thesis
Advisory Committee: Chao, Daniel Y. (Committee chair)
Date: 1992-10
Keywords: Queueing theory
Availability: Unrestricted
Abstract:

The performance measures are derived for a queueing system which is characterized by its synchronous server operations. This property is the one which normal queueing systems lack. A system of this nature contains a single common server to which multiple number of buffers are connected in parallel, where the server operates only when all system buffers are occupied.

In this thesis, the analysis is carried out focusing on the simplest system involving only two buffers. Throughout the analysis, a symmetricity of the system is assumed (i.e., system is symmetrical in terms of arriving customer statistics.). Also assumed are the Poisson arrival and the exponential service time distribution.

As a first step, the behaviour of the original system is investigated and, as a result, it is converted into an equivalent M/G/1 with the new probability density function of the arriving packets. Once we obtain the equivalent model, we apply M/G/1 analyzing method to the model and derive the probability of queue length in a closed form. The deviation of the result from that of M/M/1 are considered. All the performance measures directly follow from the probability of queue length equation.


If you have any questions please contact the ETD Team, libetd@njit.edu.

 
ETD Information
Digital Commons @ NJIT
Theses and DIssertations
ETD Policies & Procedures
ETD FAQ's
ETD home

Request a Scan
NDLTD

NJIT's ETD project was given an ACRL/NJ Technology Innovation Honorable Mention Award in spring 2003