English
Related papers

Related papers: A 2$\times$2 random switching model and its dual r…

200 papers

In this paper, we consider the number of both arrivals and departures seen by a tagged customer while in service in a classical $M/M/1$ processor sharing queue. By exploiting the underlying orthogonal structure of this queuing system…

Performance · Computer Science 2019-04-12 Fabrice Guillemin , Veronica Quintuna Rodriguez

We introduce a novel single-server queue with general retrial times and event-dependent arrivals. This is a versatile model for the study of service systems, in which the server needs a non-negligible time to retrieve waiting customers upon…

Probability · Mathematics 2022-03-08 Ioannis Dimitriou

Motivated by a bidimensional discrete-time risk model in insurance, we study the second-order asymptotics for two kinds of tail probabilities of the stochastic discounted value of aggregate net losses including two business lines. These are…

Probability · Mathematics 2025-01-22 Bingzhen Geng , Yang Liu , Shijie Wang

We present an analysis of large-scale load balancing systems, where the processing time distribution of tasks depends on both the task and server types. Our study focuses on the asymptotic regime, where the number of servers and task types…

Probability · Mathematics 2023-06-19 Zhisheng Zhao , Debankur Mukherjee

We propose a model of two-way selection system. It appears in the processes like choosing a mate between men and women, making contracts between job hunters and recruiters, and trading between buyers and sellers. In this paper, we propose a…

General Physics · Physics 2015-02-20 Bin Zhou , Shujia Qin , Xiao-Pu Han , Zhe He , Jia-Rong Xie , Bing-Hong Wang

Distributions with a heavy tail are difficult to estimate. If the design of a scheduling policy is sensitive to the details of heavy tail distributions of the service times, an approximately optimal solution is difficult to obtain. This…

Probability · Mathematics 2015-07-28 Vijay Kamble , Jean Walrand

We consider the allocation of $m$ balls (jobs) into $n$ bins (servers). In the standard Two-Choice process, at each step $t=1,2,\ldots,m$ we first sample two randomly chosen bins, compare their two loads and then place a ball in the least…

Discrete Mathematics · Computer Science 2023-12-27 Dimitrios Los , Thomas Sauerwald

The paper studies a multiserver retrial queueing system with $m$ servers. Arrival process is a point process with strictly stationary and ergodic increments. A customer arriving to the system occupies one of the free servers. If upon…

Probability · Mathematics 2021-07-01 Vyacheslav M. Abramov

In this paper, by the singular-perturbation technique, we investigate the heavy-traffic behavior of a priority polling system consisting of three M/M/1 queues with threshold policy. It turns out that the scaled queue-length of the…

Probability · Mathematics 2014-08-20 Zaiming Liu , Yuqing Chu , Jinbiao Wu

We consider a multi-server queueing system under the power-of-two policy with Poisson job arrivals, heterogeneous servers and a general job requirement distribution; each server operates under the first-come first-serve policy and there are…

Performance · Computer Science 2017-01-24 Ane Izagirre , Armand M. Makowski

In this paper, we use a machine learning approach to predict the stationary distributions of the number of customers in a single-staiton multi server system. We consider two systems, the first is $c$ homogeneous servers, namely the…

Performance · Computer Science 2025-04-03 Eliran Sherzer

A broad class of parallel server systems is considered, for which we prove the steady-state asymptotic independence of server workloads, as the number of servers goes to infinity, while the system load remains sub-critical. Arriving jobs…

Probability · Mathematics 2020-12-21 Seva Shneer , Alexander Stolyar

This paper addresses the analysis of the queue-length process of single-server queues under overdispersion, i.e., queues fed by an arrival process for which the variance of the number of arrivals in a given time window exceeds the…

Probability · Mathematics 2020-04-21 Onno Boxma , Mariska Heemskerk , Michel Mandjes

With the rapid development of economy and global trade, flying has increasingly become the main way for people to travel, and taxi is the main transfer tool of the airport, especially in the airport with wide passenger sources and large…

Physics and Society · Physics 2024-08-23 Fang He

Approximations for the mean performance indices for the M/G/c queue rely on the approximate computation of the probability that an arriving request has to wait for service and of the minimum of residual service times if all servers are…

Networking and Internet Architecture · Computer Science 2008-03-14 Thomas Begin , Alexandre Brandwajn

We calculate asymptotics of the distribution of the number of customers in orbit in a two-class priority retrial $M/G/1$-type queueing model. In this model, priority customers wait in line while non-priority customers join an orbit and…

Probability · Mathematics 2018-01-23 Joris Walraevens , Dieter Claeys , Tuan Phung-Duc

We consider a system of N queues with decentralized load balancing such as power-of-D strategies(where D may depend on N) and generic scheduling disciplines. To measure the dependence of the queues, we use the clan of ancestors, a technique…

Probability · Mathematics 2018-09-17 Maria Clara Fittipaldi , Matthieu Jonckheere , Sergio I. Lopez

This paper considers the tail asymptotics for a cumulative process $\{B(t); t \ge 0\}$ sampled at a heavy-tailed random time $T$. The main contribution of this paper is to establish several sufficient conditions for the asymptotic equality…

Probability · Mathematics 2013-12-30 Hiroyuki Masuyama

Efficient use of call center operators through technological innovations more often come at the expense of added operation management issues. In this paper, the stationary characteristics of an $M/G/1$ retrial queue is investigated where…

Networking and Internet Architecture · Computer Science 2021-08-05 Muthukrishnan Senthil Kumar , Aresh Dadlani , Kiseon Kim

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