相关论文: Convexity of Workload Autocorrelation in a Station…

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…

As a follow-up to a recent paper considering two symmetric queues, the \textit{Shortest Queue First} service discipline is presently analysed for two general asymmetric queues. Using the results previously established and assuming…

Two independent Poisson streams of jobs flow into a single-server service system having a limited common buffer that can hold at most one job. If a type-i job (i=1,2) finds the server busy, it is blocked and routed to a separate type-i…

Traffic to any server is rarely constant over time. In addition, the workload brought by each service request is typically unknown in advance, and each request may bring a different workload to the server. Cha and Lee (2011) proposed a…

We present the explicit construction of a stable queue with several servers and impatient customers, under stationary ergodic assumptions. Using a stochastic comparison of the (multivariate) workload sequence with two monotonic stochastic…

We consider the problem of selfish agents in discrete-time queuing systems, where competitive queues try to get their packets served. In this model, a queue gets to send a packet each step to one of the servers, which will attempt to serve…

In this paper, we consider modeling time-dependent multi-server queues that include abandonments and retrials. For the performance analysis of those, fluid and diffusion models called "strong approximations" have been widely used in the…

We consider a multivariate L\'evy process where the first coordinate is a L\'evy process with no negative jumps which is not a subordinator and the others are nondecreasing. We determine the Laplace-Stieltjes transform of the steady-state…

Motivated by a number of recent experimental and computational studies of the dynamics of fluids plunged in quenched-disordered external fields, we report on a theoretical investigation of this topic within the framework of the…

Consider a single server queue with renewal arrivals and i.i.d. service times in which the server operates under a processor sharing service discipline. To describe the evolution of this system, we use a measure valued process that keeps…

This paper studies the limiting behavior of a closed queueing network with multiple single-server and infinite-server stations. Under a heavy traffic asymptotic regime$\unicode{x2014}$where the number of jobs and single-server service rates…

In this article statistical bounds for certain output characteristics of the $M/GI/1/n$ and $GI/M/1/n$ loss queueing systems are derived on the basis of large samples of an input characteristic of these systems, such as service time in the…

We consider a single server queue that serves a finite population of $n$ customers that will enter the queue (require service) only once, also known as the $\Delta_{(i)}/G/1$ queue. This paper presents a method for analyzing heavy-traffic…

This paper considers the time evolution of a queue that is embedded in a Poisson point process of moving wireless interferers. The queue is driven by an external arrival process and is subject to a time-varying service process that is a…

This work considers a parallel task execution strategy in vehicular edge computing (VEC) networks, where edge servers are deployed along the roadside to process offloaded computational tasks of vehicular users. To minimize the overall…

This paper considers a parallel system of queues fed by independent arrival streams, where the service rate of each queue depends on the number of customers in all of the queues. Necessary and sufficient conditions for the stability of the…

We present an improved method for calculating the parallel and perpendicular velocity correlation functions directly from peculiar velocity surveys using weighted maximum-likelihood estimators. A central feature of the new method is the use…

The load-balancing system, built on the basis of a subsystem load balancer and subsystem control and monitoring that closely interact with each other was propose in work. This system is presented as a queuing system with priority service…

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…

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…