Back to search

University of British Columbia

The impact of balking queues on n-redundancy in computer systems

Abstract

dc:description

We study the steady state queue length probabilities for a queueing system for file downloading in which files are stored with redundancy. In particular, we address how the ability of a download file request to leave the system after seeing the queue length but before joining the queue. While it has been thoroughly proven that redundancy improves the performance of queueing systems, previous work has failed to address the inclusion of request loss affects a queueing system with redundancy. We develop a model for a queueing system with redundancy and request loss based on the Supermarket Model. Using that model, we solve for steady state queue length distribution and provide numerical results comparing systems with and without request loss. These numerical simulations show that in a queueing system with redundancy and request loss, the probability of having a particular number of requests in the system decreases as the number increases.

Degree

thesis:*
Name thesis:degree_name
Master of Science - MSc
Level thesis:degree_level
master's
Discipline thesis:degree_discipline
Mathematics
Grantor dc:publisher
University of British Columbia
Year dc:date
2018

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Sadeghi, Maryam

Rights

dc:rights
Statement dc:rights
  • Attribution-NonCommercial-NoDerivatives 4.0 International
Language dc:language
eng

Identifiers

dc:identifier.*
Handle dc:identifier
http://hdl.handle.net/2429/65814

Chain of custody

source
Harvested from
University of British Columbia
Base URL
circle.library.ubc.ca/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
related terms
citation

Sadeghi, Maryam. The impact of balking queues on n-redundancy in computer systems. master's thesis, University of British Columbia, 2018. http://hdl.handle.net/2429/65814