相关论文: Batch latency analysis and phase transitions for a…
In this paper we consider the problem of maximum throughput for tandem queueing system. We modeled this system as a Quasi-Birth-Death process. In order to do this we named level the number of customers waiting in the first buffer (including…
The problem of exact evaluation of the mean service cycle time in tandem systems of single-server queues with both infinite and finite buffers is considered. It is assumed that the interarrival and service times of customers form sequences…
A many-server queueing system is considered in which customers arrive according to a renewal process and have service and patience times that are drawn from two independent sequences of independent, identically distributed random variables.…
Max-algebra models of tandem single-server queueing systems with both finite and infinite buffers are developed. The dynamics of each system is described by a linear vector state equation similar to those in the conventional linear systems…
This paper studies a service system in which arriving customers are provided with information about the delay they will experience. Based on this information they decide to wait for service or to leave the system. Specifically, every…
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…
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…
In this paper we analyze a single server queue with batch arrivals and semi-Markovian service times. We also include the feature that the first service of each busy period might have a different distribution than subsequent service times.…
Tandem queues with finite buffer capacity commonly exist in practical applications. By viewing a tandem queue as an integrated system, an innovative approach has been developed to analyze its performance through the insight from reduction…
A parallel server system with $n$ identical servers is considered. The service time distribution has a finite mean $1/\mu$, but otherwise is arbitrary. Arriving customers are be routed to one of the servers immediately upon arrival.…
Understanding the detailed queueing behavior of a networking session is critical in enabling low-latency services over the Internet. Especially when the packet arrival and service rates at the queue of a link vary over time and moreover…
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…
In this paper, we investigate overlap times in a two-dimensional infinite server tandem queue. Specifically, we analyze the amount of time that a pair of customers spend overlapping in any station of the two dimensional tandem network. We…
We study the sojourn time in a queueing system with a single exponential server, serving a Poisson stream of customers in order of arrival. Service is provided at low or high rate, which can be adapted at exponential inspection times. When…
We analyze a tandem network of polling queues with two product types and two stations. We assume that external arrivals to the network follow a Poisson process, and service times at each station are exponentially distributed. For this…
Due to the widespread applicability of discrete-time queues in wireless networks or telecommunication systems, this paper analyzes an infinite-buffer batch-service queue with single and multiple vacation where customers/messages arrive…
Tandem queueing networks are widely used to model systems where services are provided in sequential stages. In this study, we assume that each station in the tandem system operates under a general renewal process. Additionally, we assume…
We consider an M/M/Infinity service system in which an arriving customer is served by the first idle server in an infinite sequence S_1, S_2, ... of servers. We determine the first two terms in the asymptotic expansions of the moments of L…
Queues with setup time are extensively studied because they have application in performance evaluation of power-saving data centers. In a data center, there are a huge number of servers which consume a large amount of energy. In the current…
We consider a load balancing system comprised of a fixed number of single server queues, operating under the well-known Join-the-Shortest Queue policy, and where jobs/customers are impatient and abandon if they do not receive service after…