Feedback fluid queues with multiple tresholds

Date

2006

Editor(s)

Advisor

Akar, Nail

Supervisor

Co-Advisor

Co-Supervisor

Instructor

Source Title

Print ISSN

Electronic ISSN

Publisher

Volume

Issue

Pages

Language

English

Type

Journal Title

Journal ISSN

Volume Title

Attention Stats
Usage Stats
2
views
3
downloads

Series

Abstract

Unlike discrete or continuous time queuing systems fed with point processes, workload in fluid queues arrives at the system as a fluid flow rather than jobs or packets. The rate of the fluid flow is governed by a continuous time Markov chain in Markov fluid queues. In first order fluid queues, rates are deterministically determined by a background Markov chain whereas in second order fluid queues, a Brownian motion is additionally inserted to the queue content process. Each of those queues can either accommodate a single regime or multiple regimes (equivalently multiple thresholds) in which the rates and the infinitesimal generator might be different in different regimes but they should be fixed within a single regime. In this thesis, we first generalize the existing solution of first order feedback fluid queues with multiple thresholds for the steady state distribution function of queue occupancy by also allowing the existence of repulsive type boundaries and states with zero rates. Secondly, we complete the boundary conditions for not only the transient but also the steady state solution of second order feedback fluid queues with multiple thresholds. Finally, we apply the theory of feedback fluid queues with multiple thresholds as an effective approximation to the Markov modulated discrete time queueing model that arises in the performance evaluation of an adaptive MPEG video streaming system in UMTS environment. By doing so, we eliminate the state space explosion problem that arises in the original discrete model.

Course

Other identifiers

Book Title

Degree Discipline

Electrical and Electronic Engineering

Degree Level

Master's

Degree Name

MS (Master of Science)

Citation

Published Version (Please cite this version)