Back to search

Carleton University

Simplifying Layered Queueing Network Models

Abstract

dc:description.abstract

The amount of detail to include in a performance model is usually regarded as a judgment to be made by an expert modeler and the question "how much detail is necessary?" is seldom asked and is difficult to answer. However, if a simpler model gives essentially the same performance predictions, it may be more useful than a detailed model. It may solve more quickly, for instance, and may be easier to understand. Or a model for a complex sub-system such as a database server may be usefully simplified so it can be included in larger system models. This research proposes an aggregation process for layered queuing models that reduces the number of queues (called tasks and hosts/processors, in layered models) while preserving the total execution demand and the bottleneck characteristics (the highest saturated resource(s)) of the detailed model. This thesis demonstrates how the simplification process can greatly reduce the number of tasks and processors with a very small relative error. The application of proposed simplification process is applied on a number of case studies. A Java application called "LQN model simplifier" was built that takes an LQN model as input and generates a series of simplified models after applying simplification operations to the original model.

Degree

thesis:*
Name thesis:degree_name
Doctor of Philosophy (Ph.D.)
Level thesis:degree_level
Doctoral
Discipline thesis:degree_discipline
Engineering, Electrical and Computer
Grantor dc:publisher
Carleton University
Year dc:date.issued
2018

Author and committee

dc:creator, dc:contributor.*
Author dc:creator
  • Islam, Farhana

Subjects

dc:subject × 1

Rights

dc:rights
Statement dc:rights
  • Copyright © 2018 the author(s). Theses may be used for non-commercial research, educational, or related academic purposes only. Such uses include personal study, research, scholarship, and teaching. Theses may only be shared by linking to Carleton University Institutional Repository and no part may be used without proper attribution to the author. No part may be used for commercial purposes directly or indirectly via a for-profit platform; no adaptation or derivative works are permitted without consent from the copyright owner.
Language dc:language.iso
en

Identifiers

dc:identifier.*

Chain of custody

source
Harvested from
Carleton University
Base URL
carleton.scholaris.ca/server/oai/request
Last updated
2026-11-19
Source record
OAI-PMH GetRecord
citation

Islam, Farhana. Simplifying Layered Queueing Network Models. Doctoral thesis, Carleton University, 2018. https://hdl.handle.net/20.500.14718/39574