Target-rate driven resource sharing in queueing systems

Zhou, Zhengyuan; Bambos, Nicholas

doi:10.1109/cdc.2015.7402991

Cited by 7 publications

(1 citation statement)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Finally, we note that deadlines are essential to many applications besides Internet services such as wireless communication [16], [17], patient scheduling [18], low latency computing [19], [20], and utility computing [21], [22], [23]. Consequently, we feel that we may be able to apply similar modeling ideas to other application domains.…”

Section: Discussionmentioning

confidence: 95%

Infinite server queueing networks with deadline based routing

Master

Bambos

2016

2016 IEEE 55th Conference on Decision and Control (CDC)

Self Cite

View full text Add to dashboard Cite

Abstract-Motivated by timeouts in Internet services, we consider networks of infinite server queues in which routing decisions are based on deadlines. Specifically, at each node in the network, the total service time equals the minimum of several independent service times (e.g. the minimum of the amount of time required to complete a transaction and a deadline). Furthermore, routing decisions depend on which of the independent service times achieves the minimum (e.g. exceeding a deadline will require the customer to be routed so they can re-attempt the transaction). Because current routing decisions are dependent on past service times, much of the existing theory on product-form queueing networks does not apply. In spite of this, we are able to show that such networks have product-form equilibrium distributions. We verify our analytic characterization with a simulation of a simple network. We also discuss extensions of this work to more general settings.

show abstract

Section: Discussionmentioning

confidence: 95%

Infinite server queueing networks with deadline based routing

Master

Bambos

2016

2016 IEEE 55th Conference on Decision and Control (CDC)

Self Cite

View full text Add to dashboard Cite

show abstract

Dynamics on Linear Influence Network Games Under Stochastic Environments

Zhou

Bambos

2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

An infinite dimensional model for a many server priority queue

Master

Zhou

Bambos

2017

2017 51st Annual Conference on Information Sciences and Systems (CISS)

Self Cite

View full text Add to dashboard Cite

We consider a Markovian many server queueing system in which customers are preemptively scheduled according to exogenously assigned priority levels. The priority levels are randomly assigned from a continuous probability measure rather than a discrete one and hence, the queue is modeled by an infinite dimensional stochastic process. We analyze the equilibrium behavior of the system and provide several results. We derive the Radon-Nikodym derivative (with respect to Lebesgue measure) of the measure that describes the average distribution of customer priority levels in the system; we provide a formula for the expected sojourn time of a customer as a function of his priority level; and we provide a formula for the expected waiting time of a customer as a function of his priority level. We verify our theoretical analysis with discrete-event simulations. We discuss how each of our results generalizes previous work on infinite dimensional models for single server priority queues.

show abstract

Target-rate driven resource sharing in queueing systems

Cited by 7 publications

References 18 publications

Infinite server queueing networks with deadline based routing

Infinite server queueing networks with deadline based routing

Dynamics on Linear Influence Network Games Under Stochastic Environments

An infinite dimensional model for a many server priority queue

Contact Info

Product

Resources

About