Sensitivity analysis for discrete-time randomized service priority queues

George Kesidis, Takis Konstantopoulos, Michael Zazanis

Research output: Contribution to journalConference article

2 Citations (Scopus)

Abstract

We consider a collection of queues operating in parallel and sharing a common server via the idling randomized service priority sharing rule. We assume that the service times of the customers (cells) are all constant and identical. This paper is concerned with estimating the sensitivity of the tail of the distribution of the typical sojourn time through these queues to the fraction of server bandwidth given to them by randomized service sharing. Two approaches are considered: 'smoothed' perturbation analysis and stochastic intensity-based estimators.

Original languageEnglish (US)
Pages (from-to)2627-2630
Number of pages4
JournalProceedings of the IEEE Conference on Decision and Control
Volume3
StatePublished - Dec 1 1994
EventProceedings of the 2nd IEEE International Symposium on Requirements Engineering - York, Engl
Duration: Mar 27 1995Mar 29 1995

Fingerprint

Priority Queue
Sensitivity analysis
Sensitivity Analysis
Sharing
Discrete-time
Servers
Queue
Server
Stochastic Intensity
Sojourn Time
Perturbation Analysis
Bandwidth
Tail
Customers
Estimator
Cell

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Modeling and Simulation
  • Control and Optimization

Cite this

@article{f5d33ce7c8db4f138cec9c9539170c1f,
title = "Sensitivity analysis for discrete-time randomized service priority queues",
abstract = "We consider a collection of queues operating in parallel and sharing a common server via the idling randomized service priority sharing rule. We assume that the service times of the customers (cells) are all constant and identical. This paper is concerned with estimating the sensitivity of the tail of the distribution of the typical sojourn time through these queues to the fraction of server bandwidth given to them by randomized service sharing. Two approaches are considered: 'smoothed' perturbation analysis and stochastic intensity-based estimators.",
author = "George Kesidis and Takis Konstantopoulos and Michael Zazanis",
year = "1994",
month = "12",
day = "1",
language = "English (US)",
volume = "3",
pages = "2627--2630",
journal = "Proceedings of the IEEE Conference on Decision and Control",
issn = "0191-2216",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

Sensitivity analysis for discrete-time randomized service priority queues. / Kesidis, George; Konstantopoulos, Takis; Zazanis, Michael.

In: Proceedings of the IEEE Conference on Decision and Control, Vol. 3, 01.12.1994, p. 2627-2630.

Research output: Contribution to journalConference article

TY - JOUR

T1 - Sensitivity analysis for discrete-time randomized service priority queues

AU - Kesidis, George

AU - Konstantopoulos, Takis

AU - Zazanis, Michael

PY - 1994/12/1

Y1 - 1994/12/1

N2 - We consider a collection of queues operating in parallel and sharing a common server via the idling randomized service priority sharing rule. We assume that the service times of the customers (cells) are all constant and identical. This paper is concerned with estimating the sensitivity of the tail of the distribution of the typical sojourn time through these queues to the fraction of server bandwidth given to them by randomized service sharing. Two approaches are considered: 'smoothed' perturbation analysis and stochastic intensity-based estimators.

AB - We consider a collection of queues operating in parallel and sharing a common server via the idling randomized service priority sharing rule. We assume that the service times of the customers (cells) are all constant and identical. This paper is concerned with estimating the sensitivity of the tail of the distribution of the typical sojourn time through these queues to the fraction of server bandwidth given to them by randomized service sharing. Two approaches are considered: 'smoothed' perturbation analysis and stochastic intensity-based estimators.

UR - http://www.scopus.com/inward/record.url?scp=0028738680&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028738680&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:0028738680

VL - 3

SP - 2627

EP - 2630

JO - Proceedings of the IEEE Conference on Decision and Control

JF - Proceedings of the IEEE Conference on Decision and Control

SN - 0191-2216

ER -