ePrints

A Foreground–Background queueing model with speed or capacity modulation

Lookup NU author(s): Emeritus Professor Isi Mitrani

Downloads

• Published version [.pdf]

Licence

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License (CC BY-NC-ND).

Abstract

© 2023 The Author(s)Two models involving a foreground and a background queue are studied in the steady state. Service is provided either by a single server whose speed depends on the total number of jobs present, or by several parallel servers whose number may be controlled dynamically. Job service times have a two-phase Coxian distribution. Incoming jobs join the foreground queue where they execute phase 1, and then possibly move to the background queue for the second phase at lower priority. The trade-offs between holding and energy consumption costs are examined by means of a suitable cost function. Two different two-dimensional Markov processes are solved exactly. The solutions are used in several numerical experiments, aimed at illustrating different aspects of system behaviour.

Publication metadata

Author(s): Marin A, Mitrani I

Publication type: Article

Publication status: Published

Journal: Indagationes Mathematicae

Year: 2023

Volume: 34

Issue: 5

Pages: 1077-1100

Print publication date: 01/09/2023

Online publication date: 27/05/2023

Acceptance date: 02/04/2023

Date deposited: 30/06/2023

ISSN (print): 0019-3577

ISSN (electronic): 1872-6100

Publisher: Elsevier B.V.

URL: https://doi.org/10.1016/j.indag.2023.05.005

DOI: 10.1016/j.indag.2023.05.005

Notes: From the Special Issue dedicated to the memory of J.W. Cohen.

Altmetrics

Share