Back to search

Clemson University

Resetting a Degrading Single Server Queue

Abstract

dc:description.abstract

Real life servers do not have IID service times - they slow down over time. This is usually dealt with by resetting or replacing the server. Often, however, it is not known how to determine when the best time to reset the server is. Resetting may be a costly process. We make an assumption that only some arrivals (we do not know which) are harmful. Then, we proceed to find an optimal policy for resetting a server with a given service parameterization by observing the service paremeter directly, service times, or waiting times (with and without arrival times) when the harmful arrivals are IID. Next, we develop some methods for dealing with harmful arrivals that are not IID. Short term memory is used to cope with rapidly changing situations and is found to perform better when each observation contains less information.

Degree

thesis:*
Name thesis:degree_name
Master of Science (MS)
Level thesis:degree_level
Thesis
Discipline thesis:degree_discipline
Computer Science

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Volny iv, Frank
Contributors dc:contributor
  • Dean, Brian C
  • Stevenson , D E
  • Goddard , Wayne

Subjects

dc:subject × 4

Identifiers

dc:identifier.*
Repository record dc:identifier
https://open.clemson.edu/all_theses/312

Chain of custody

source
Harvested from
Clemson University
Base URL
open.clemson.edu/do/oai/
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Volny iv, Frank. Resetting a Degrading Single Server Queue. Thesis thesis, https://open.clemson.edu/all_theses/312