Related papers: Batch Arrival Multiserver Queue with Setup Time
For servers incorporating parallel computing resources, batching is a pivotal technique for providing efficient and economical services at scale. Parallel computing resources exhibit heightened computational and energy efficiency when…
Multi-server queueing systems describe situations in which users require service from multiple parallel servers. Examples include check-in lines at airports, waiting rooms in hospitals, queues in contact centers, data buffers in wireless…
This work introduces a model-based framework that reveals the idle opportunity of modern servers running latency-critical applications. Specifically, three queuing models, M/M/1, cxM/M/1, and M/M/c, are used to estimate the theoretical idle…
Multi-access edge computing (MEC) emerges as an essential part of the upcoming Fifth Generation (5G) and future beyond-5G mobile communication systems. It adds computational power towards the edge of cellular networks, much closer to…
We consider a service system with an infinite number of exponential servers sharing a finite service capacity. The servers are ordered according to their speed, and arriving customers join the fastest idle server. A capacity allocation is…
Multiserver jobs, which are jobs that occupy multiple servers simultaneously during service, are prevalent in today's computing clusters. But little is known about the delay performance of systems with multiserver jobs. We consider queueing…
Modelling and control of energy consumption is an important problem in telecommunication systems.To model such systems, this paper publishes a bounded multi-vacation queue model. The energy consumption predicted by the model shows an…
With the increasing popularity of Internet-based services and applications, power efficiency is becoming a major concern for data center operators, as high electricity consumption not only increases greenhouse gas emissions, but also…
We study the accumulation of resources within a target due to the interplay between continual delivery, driven by 1D stochastic search processes, and sequential consumption. The assumption of sequential consumption is key because it changes…
This paper considers the steady-state performance of load balancing algorithms in a many-server system with distributed queues. The system has $N$ servers, and each server maintains a local queue with buffer size $b-1,$ i.e. a server can…
Mobile-edge computing (MEC) has recently emerged as a promising paradigm to liberate mobile devices from increasingly intensive computation workloads, as well as to improve the quality of computation experience. In this paper, we…
We consider optimizing average queueing delay and average power consumption in a nonpreemptive multi-class M/G/1 queue with dynamic power control that affects instantaneous service rates. Four problems are studied: (1) satisfying per-class…
We present a new framework for designing nonpreemptive and job-size oblivious scheduling policies in the multiserver-job queueing model. The main requirement is to identify a static and balanced sub-partition of the server set and ensure…
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…
We study a make-to-order system with a finite set of customers. Production is stochastic with a nonlinear dependence between the ordered quantity and the production rate. Customers may have to queue until their turn arrives, and therefore…
With the increasing popularity of cloud computing, datacenters are becoming more important than ever before. A typical datacenter typically consists of a large number of homogeneous or heterogeneous servers connected by networks.…
A queue is required when a service provider is not able to handle jobs arriving over the time. In a highly flexible and dynamic environment, some jobs might demand for faster execution at run-time especially when the resources are limited…
The interest to retrial queueing systems is due to their application to telephone systems. The paper studies multiserver retrial queueing systems with $n$ servers. Arrival process is a quite general point process. An arriving customer…
Motivated by applications that involve setting proper staffing levels for multi-server queueing systems with batch arrivals, we present a thorough study of the queue-length process $\{Q(t); t \geq 0\}$, departure process $\{D(t); t \geq…
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…