A service system with randomly behaving on-demand agents

Lam M. Nguyen, Alexander L. Stolyar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We consider a service system where agents (or, servers) are invited on-demand. Customers arrive as a Poisson process and join a customer queue. Customer service times are i.i.d. exponential. Agents' behavior is random in two respects. First, they can be invited into the system exogenously, and join the agent queue after a random time. Second, with some probability they rejoin the agent queue after a service completion, and otherwise leave the system. The objective is to design a real-time adaptive agent invitation scheme that keeps both customer and agent queues/waiting-times small. We study an adaptive scheme, which controls the number of pending agent invitations, based on queue-state feedback. We study the system process uid limits, in the asymp- Totic regime where the customer arrival rate goes to infinity. We use the machinery of switched linear systems and com- mon quadratic Lyapunov functions to derive suffcient condi- Tions for the local stability of uid limits at the desired equi-librium point (with zero queues). We conjecture that, for our model, local stability is in fact suffcient for global stability of uid limits; the validity of this conjecture is supported by numerical and simulation experiments. When the local stability conditions do hold, simulations show good overall performance of the scheme.

Original languageEnglish (US)
Title of host publicationSIGMETRICS/ Performance 2016 - Proceedings of the SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Science
PublisherAssociation for Computing Machinery, Inc
Pages365-366
Number of pages2
ISBN (Electronic)9781450342667
DOIs
StatePublished - Jun 14 2016
Externally publishedYes
Event13th Joint International Conference on Measurement and Modeling of Computer Systems, ACM SIGMETRICS / IFIP Performance 2016 - Antibes Juan-les-Pins, France
Duration: Jun 14 2016Jun 18 2016

Publication series

NameSIGMETRICS/ Performance 2016 - Proceedings of the SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Science

Other

Other13th Joint International Conference on Measurement and Modeling of Computer Systems, ACM SIGMETRICS / IFIP Performance 2016
CountryFrance
CityAntibes Juan-les-Pins
Period6/14/166/18/16

Fingerprint

Lyapunov functions
State feedback
Machinery
Linear systems
Servers
Experiments

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computational Theory and Mathematics
  • Hardware and Architecture

Cite this

Nguyen, L. M., & Stolyar, A. L. (2016). A service system with randomly behaving on-demand agents. In SIGMETRICS/ Performance 2016 - Proceedings of the SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Science (pp. 365-366). (SIGMETRICS/ Performance 2016 - Proceedings of the SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Science). Association for Computing Machinery, Inc. https://doi.org/10.1145/2896377.2901484

A service system with randomly behaving on-demand agents. / Nguyen, Lam M.; Stolyar, Alexander L.

SIGMETRICS/ Performance 2016 - Proceedings of the SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Science. Association for Computing Machinery, Inc, 2016. p. 365-366 (SIGMETRICS/ Performance 2016 - Proceedings of the SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Science).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Nguyen, LM & Stolyar, AL 2016, A service system with randomly behaving on-demand agents. in SIGMETRICS/ Performance 2016 - Proceedings of the SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Science. SIGMETRICS/ Performance 2016 - Proceedings of the SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Science, Association for Computing Machinery, Inc, pp. 365-366, 13th Joint International Conference on Measurement and Modeling of Computer Systems, ACM SIGMETRICS / IFIP Performance 2016, Antibes Juan-les-Pins, France, 6/14/16. https://doi.org/10.1145/2896377.2901484
Nguyen LM, Stolyar AL. A service system with randomly behaving on-demand agents. In SIGMETRICS/ Performance 2016 - Proceedings of the SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Science. Association for Computing Machinery, Inc. 2016. p. 365-366. (SIGMETRICS/ Performance 2016 - Proceedings of the SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Science). https://doi.org/10.1145/2896377.2901484
Nguyen, Lam M. ; Stolyar, Alexander L. / A service system with randomly behaving on-demand agents. SIGMETRICS/ Performance 2016 - Proceedings of the SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Science. Association for Computing Machinery, Inc, 2016. pp. 365-366 (SIGMETRICS/ Performance 2016 - Proceedings of the SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Science).
@inproceedings{3d4f30ec5f3f4da5b3925c23b50131c2,
title = "A service system with randomly behaving on-demand agents",
abstract = "We consider a service system where agents (or, servers) are invited on-demand. Customers arrive as a Poisson process and join a customer queue. Customer service times are i.i.d. exponential. Agents' behavior is random in two respects. First, they can be invited into the system exogenously, and join the agent queue after a random time. Second, with some probability they rejoin the agent queue after a service completion, and otherwise leave the system. The objective is to design a real-time adaptive agent invitation scheme that keeps both customer and agent queues/waiting-times small. We study an adaptive scheme, which controls the number of pending agent invitations, based on queue-state feedback. We study the system process uid limits, in the asymp- Totic regime where the customer arrival rate goes to infinity. We use the machinery of switched linear systems and com- mon quadratic Lyapunov functions to derive suffcient condi- Tions for the local stability of uid limits at the desired equi-librium point (with zero queues). We conjecture that, for our model, local stability is in fact suffcient for global stability of uid limits; the validity of this conjecture is supported by numerical and simulation experiments. When the local stability conditions do hold, simulations show good overall performance of the scheme.",
author = "Nguyen, {Lam M.} and Stolyar, {Alexander L.}",
year = "2016",
month = "6",
day = "14",
doi = "10.1145/2896377.2901484",
language = "English (US)",
series = "SIGMETRICS/ Performance 2016 - Proceedings of the SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Science",
publisher = "Association for Computing Machinery, Inc",
pages = "365--366",
booktitle = "SIGMETRICS/ Performance 2016 - Proceedings of the SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Science",

}

TY - GEN

T1 - A service system with randomly behaving on-demand agents

AU - Nguyen, Lam M.

AU - Stolyar, Alexander L.

PY - 2016/6/14

Y1 - 2016/6/14

N2 - We consider a service system where agents (or, servers) are invited on-demand. Customers arrive as a Poisson process and join a customer queue. Customer service times are i.i.d. exponential. Agents' behavior is random in two respects. First, they can be invited into the system exogenously, and join the agent queue after a random time. Second, with some probability they rejoin the agent queue after a service completion, and otherwise leave the system. The objective is to design a real-time adaptive agent invitation scheme that keeps both customer and agent queues/waiting-times small. We study an adaptive scheme, which controls the number of pending agent invitations, based on queue-state feedback. We study the system process uid limits, in the asymp- Totic regime where the customer arrival rate goes to infinity. We use the machinery of switched linear systems and com- mon quadratic Lyapunov functions to derive suffcient condi- Tions for the local stability of uid limits at the desired equi-librium point (with zero queues). We conjecture that, for our model, local stability is in fact suffcient for global stability of uid limits; the validity of this conjecture is supported by numerical and simulation experiments. When the local stability conditions do hold, simulations show good overall performance of the scheme.

AB - We consider a service system where agents (or, servers) are invited on-demand. Customers arrive as a Poisson process and join a customer queue. Customer service times are i.i.d. exponential. Agents' behavior is random in two respects. First, they can be invited into the system exogenously, and join the agent queue after a random time. Second, with some probability they rejoin the agent queue after a service completion, and otherwise leave the system. The objective is to design a real-time adaptive agent invitation scheme that keeps both customer and agent queues/waiting-times small. We study an adaptive scheme, which controls the number of pending agent invitations, based on queue-state feedback. We study the system process uid limits, in the asymp- Totic regime where the customer arrival rate goes to infinity. We use the machinery of switched linear systems and com- mon quadratic Lyapunov functions to derive suffcient condi- Tions for the local stability of uid limits at the desired equi-librium point (with zero queues). We conjecture that, for our model, local stability is in fact suffcient for global stability of uid limits; the validity of this conjecture is supported by numerical and simulation experiments. When the local stability conditions do hold, simulations show good overall performance of the scheme.

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

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

U2 - 10.1145/2896377.2901484

DO - 10.1145/2896377.2901484

M3 - Conference contribution

AN - SCOPUS:84978775557

T3 - SIGMETRICS/ Performance 2016 - Proceedings of the SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Science

SP - 365

EP - 366

BT - SIGMETRICS/ Performance 2016 - Proceedings of the SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Science

PB - Association for Computing Machinery, Inc

ER -