English
Related papers

Related papers: Strategic Arrivals into Queueing Networks: The Net…

200 papers

A fluid queuing network constitutes one of the simplest models in which to study flow dynamics over a network. In this model we have a single source-sink pair and each link has a per-time-unit capacity and a transit time. A dynamic…

Computer Science and Game Theory · Computer Science 2021-12-21 Roberto Cominetti , José Correa , Neil Olver

Network capacity region of multi-queue multi-server queueing system with random ON-OFF connectivities and stationary arrival processes is derived in this paper. Specifically, the necessary and sufficient conditions for the stability of the…

Information Theory · Computer Science 2010-01-14 Hassan Halabian , Ioannis Lambadaris , Chung-Horng Lung

We study the strategic purchasing of priorities in a time-dependent accumulating priority M/G/$1$ queue. We formulate a non-cooperative game in which customers purchase priority coefficients with the goal of reducing waiting costs in…

Computer Science and Game Theory · Computer Science 2017-04-12 Moshe Haviv , Liron Ravner

Bounding the price of anarchy, which quantifies the damage to social welfare due to selfish behavior of the participants, has been an important area of research. In this paper, we study this phenomenon in the context of a game modeling…

Computer Science and Game Theory · Computer Science 2020-03-17 Jason Gaitonde , Eva Tardos

Today's queueing network systems are more rapidly evolving and more complex than those of even a few years ago. The goal of this paper is to study customers' behavior in an unobservable Markovian M/M/1 queue where consumers have to choose…

Optimization and Control · Mathematics 2019-01-11 Tesnim Naceur , Yezekael Hayel

In this paper, we study scheduling of a queueing system with zero knowledge of instantaneous network conditions. We consider a one-hop single-server queueing system consisting of $K$ queues, each with time-varying and non-stationary arrival…

Optimization and Control · Mathematics 2023-03-07 Jiatai Huang , Leana Golubchik , Longbo Huang

We consider a game of decentralized timing of jobs to a single server (machine) with a penalty for deviation from a due date, and no delay costs. The jobs' sizes are homogeneous and deterministic. Each job belongs to a single decision…

Computer Science and Game Theory · Computer Science 2017-10-17 Amihai Glazer , Refael Hassin , Liron Ravner

We study service scheduling problems in a slotted system in which agents arrive with service requests according to a Bernoulli process and have to leave within two slots after arrival, service costs are quadratic in service rates, and there…

Systems and Control · Electrical Eng. & Systems 2022-04-26 Ramya Burra , Chandramani Singh , Joy Kuri

We study a queueing network with a single shared server, that serves the queues in a cyclic order according to the gated service discipline. External customers arrive at the queues according to independent Poisson processes. After…

Probability · Mathematics 2014-09-11 Marko Boon , Rob van der Mei , Erik Winands

Dynamic queueing networks (DQN) model queueing systems where demand varies strongly with time, such as airport terminals. With rapidly rising global air passenger traffic placing increasing pressure on airport terminals, efficient…

Queues that feature multiple entities arriving simultaneously are among the oldest models in queueing theory, and are often referred to as "batch" (or, in some cases, "bulk") arrival queueing systems. In this work we study the affect of…

Probability · Mathematics 2019-02-05 Andrew Daw , Jamol Pender

We consider a queueing facility where customers decide when to arrive. All customers have the same desired arrival time (w.l.o.g.\ time zero). There is one server, and the service times are independent and exponentially distributed. The…

Optimization and Control · Mathematics 2017-09-12 Eliran Sherzer , Yoav Kerner

This paper presents a heavy traffic analysis of the behavior of multi-class acyclic queueing networks in which the customers have deadlines. We assume the queueing system consists of J stations, and there are K different customer classes.…

Probability · Mathematics 2016-09-07 Lukasz Kruk , John Lehoczky , Steven Shreve , Shu-Ngai Yeung

We investigate the long-run behavior of single-server queues with Hawkes arrivals and general service distributions and related optimization problems. In detail, utilizing novel coupling techniques, we establish finite moment bounds for the…

Probability · Mathematics 2023-11-14 Xinyun Chen , Guiyu Hong

This work considers a many-server queueing system in which impatient customers with i.i.d., generally distributed service times and i.i.d., generally distributed patience times enter service in the order of arrival and abandon the queue if…

Probability · Mathematics 2010-11-15 Weining Kang , Kavita Ramanan

This paper introduces and analyzes the notion of throughput suboptimality for many-server queueing systems in heavy traffic. The queueing model under consideration has multiple customer classes, indexed by a finite set $\mathcal{I}$, and…

Probability · Mathematics 2009-06-15 Rami Atar , Gennady Shaikhet

We consider the problem of customer equilibrium behavior of a single server Markovian queue with dynamic control of the service rate. Customers arrive according a Poisson procedure and the system administrator makes a service rate choice…

Optimization and Control · Mathematics 2018-05-17 Apostolos Burnetas , Yiannis Dimitrakopoulos

Many economic transactions, including those of online markets, have a time lag between the start and end times of transactions. Customers need to wait for completion of their transaction (order fulfillment) and hence are also interested in…

Optimization and Control · Mathematics 2018-10-19 Manu K. Gupta , N. Hemachandra

In the era of Industry 5.0, data-driven decision-making has become indispensable for optimizing systems across Industrial Engineering. This paper addresses the value of big data analytics by proposing a novel non-linear hybrid approach for…

Machine Learning · Computer Science 2025-07-08 Ali Nikseresht

We consider a strategic M/M/1 queueing model under a first-come-first-served regime, where customers are split into two classes and class $A$ has priority over class $B$. Customers can decide whether to join the queue or balk, and, in case…

Computer Science and Game Theory · Computer Science 2025-02-11 Maurizio D'Andrea , Marco Scarsini