Related papers: A Paradox for Admission Control of Multiclass Queu…
The models studied in the steady state involve two queues which are served either by a single server whose speed depends on the number of jobs present, or by several parallel servers whose number may be controlled dynamically. Job service…
Despite the significant advances in vehicle automation and electrification, the next-decade aspirations for massive deployments of autonomous electric mobility on demand (AEMoD) services are still threatened by two major bottlenecks, namely…
We study optimal scheduling in multi-class queueing systems with reentrance, where jobs may return for additional service after completion. Such reentrance creates feedback loops that fundamentally alter congestion dynamics and challenge…
The combination of recent emerging technologies such as network function virtualization (NFV) and network programmability (SDN) gave birth to the novel Network Slicing paradigm. 5G networks consist of multi-tenant infrastructures capable of…
In this paper, we compare two analytical models for evaluation of cache coherence overhead of a shared bus multiprocessor with private caches. The models are based on a closed queuing network with different service disciplines. We find that…
Classical queuing network control strategies typically rely on accurate knowledge of model data, i.e., arrival and service rates. However, such data are not always available and may be time-variant. To address this challenge, we consider a…
The paper studies a closed queueing network containing two types of node. The first type (server station) is an infinite server queueing system, and the second type (client station) is a single server queueing system with autonomous…
A single server retrial queueing system with two-classes of orbiting customers, and general class dependent service times is considered. If an arriving customer finds the server unavailable, it enters a virtual queue, called the orbit,…
We study a queueing network with a strictly upper-triangular routing matrix, where each column contains at most one non-negative entry, and the root node receives input from a spectrally positive L\'{e}vy process. Our aim is to characterize…
Multiserver-job systems, where jobs require concurrent service at many servers, occur widely in practice. Much is known in the dropping setting, where jobs are immediately discarded if they require more servers than are currently available.…
The key challenge in admission control in wireless networks is to strike an optimal trade-off between the blocking probability for new requests while minimizing the dropping probability of ongoing requests. We consider two approaches for…
In this paper, we propose a model for evaluating the transmission performance of multipath transport. Previous researches focused exclusively on single pair users in simple scenarios. The distinct perspective in this paper is to build…
The main target of this paper is to present the Markov chain C that, not giving explicitly the queue lengths stationary probabilities, has the necessary information to its determination for open networks of queues with several classes of…
To leverage prediction models to make optimal scheduling decisions in service systems, we must understand how predictive errors impact congestion due to externalities on the delay of other jobs. Motivated by applications where prediction…
We study scheduling control of parallel processing networks in which some resources need to simultaneously collaborate to perform some activities and some resources multitask. Resource collaboration and multitasking give rise to…
The problem of learning simultaneously several related tasks has received considerable attention in several domains, especially in machine learning with the so-called multitask learning problem or learning to learn problem [1], [2].…
In many different settings, requests for service can arrive in near or true simultaneity with one another. This creates batches of arrivals to the underlying queueing system. In this paper, we study the staffing problem for the batch…
We consider a queueing network operating under a strictly upper-triangular routing matrix with per column at most one non-negative entry. The root node is fed by a Gaussian process with stationary increments. Our aim is to characterize the…
Recent studies indicate that in many situations service times are affected by the experienced queueing delay of the particular customer. This effect has been detected in different areas, such as health care, call centers and…
The presented study elaborates a multi-server priority queueing model considering the pre-emptive repeat policy and phase-type distribution (PH) for retrial process. The incoming heterogeneous calls are categorized as handoff calls and new…