Back to search

Marshall University

Non-Preemptive Shunting in M/M/1 and Dynamic Service Queueing Systems

Abstract

dc:description.abstract

We provide a study of two queueing systems, namely, an M/M/1 queueing system in which an incoming customer shunts, or skips line, and a dynamic server in an infinite capacity system moving among service nodes. In the former, we explore various aspects of the system, including waiting time, and the relationships between shunting and position in queue and rate of service. Through use of global balance equations, we find the probability that an arriving non-priority customer, finding customers waiting in the system, will shunt to a position other than behind the queue. In the latter, we explore a system in which a server with infinite capacity moves among indexed linear service nodes, receives customers at various nodes, and transports the customers to other indexed nodes in the hierarchy. We determine the expected waiting times at the nodes, expected service times, expected number of customers at a given node, expected number in the system, and expected number in service. The probabilities that an arrival finds n customers at a particular node, and in the entire system are obtained.

Degree

thesis:*
Name thesis:degree_name
Mathematics
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
College of Science

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Lacek, Steven
Contributors dc:contributor
  • Alfred Akinsete
  • Yulia Dementieva
  • Ariyadasa Aluthge

Subjects

dc:subject × 5

Identifiers

dc:identifier.*
Repository record dc:identifier
https://mds.marshall.edu/etd/697

Chain of custody

source
Harvested from
Marshall University
Base URL
mds.marshall.edu/do/oai/
Last updated
2026-11-21
Source record
OAI-PMH GetRecord
citation

Lacek, Steven. Non-Preemptive Shunting in M/M/1 and Dynamic Service Queueing Systems. Thesis thesis, https://mds.marshall.edu/etd/697