On performance comparison of MR/GI/1 queues

In this paper we are interested in the effect that dependencies in the arrival process to a queue have on queueing properties such as mean queue length and mean waiting time. We start with a review of the well known relations used to compare random variables and random vectors, e.g., stochastic orderings, stochastic increasing convexity, and strong stochastic increasing concavity. These relations and others are used to compare interarrival times in Markov renewal processes first in the case where the interarrival time distributions depend only on the current state in the underlying Markov chain and then in the general case where these interarrivai times depend on both the current state and the next state in that chain. These results are used to study a problem previously considered by Patuwo et al. [14].Then, in order to keep the marginal distributions of the interarrivai times constant, we build a particular transition matrix for the underlying Markov chain depending on a single parameter,p. This Markov renewal process is used in the Patuwo et al. [14] problem so as to investigate the behavior of the mean queue length and mean waiting time on a correlation measure depending only onp. As constructed, the interarrival time distributions do not depend onp so that the effects we find depend only on correlation in the arrival process.As a result of this latter construction, we find that the mean queue length is always larger in the case where correlations are non-zero than they are in the more usual case of renewal arrivals (i.e., where the correlations are zero). The implications of our results are clear.     

Sojourn time analysis for a cyclic-service tandem queueing model with general decrementing service

A sojourn time analysis is provided for a cyclic-service tandem queue with general decrementing service which operates as follows: starting once a service of queue 1 in the first stage, a single server continues serving messages in queue 1 until either queue 1 becomes empty, or the number of messages decreases to k less than that found upon the server's last arrival at queue 1, whichever occurs first, where 1 ≤ k ≤ ∞. After service completion in queue 1, the server switches over to queue 2 in the second stage and serves all messages in queue 2 until it becomes empty. It is assumed that an arrival stream is Poissonian, message service times at each stage are generally distributed and switch-over times are zero. This paper analyzes joint queue-length distributions and message sojourn time distributions.     

Kornai－Weibull排队模型的纰漏，修正与分析

本文首先指出Ｋｏｒｎａｉ－Ｗｅｉｂｕｌｌ排队模型（Ａ）中之接待率ｒ（ｙ_１）的定义是不正确的，并给出接待率ｒ（ｙ_１，ｙ₂）的正确定义．其次，证明了修正模型（１）有“正常状态”的充要条件是接待能力(?)于是，本文发现接待能力Ｓ的分歧值是Ｓ^＊；当Ｓ＜Ｓ^＊时，市场是短缺的；当Ｓ≥Ｓ^＊时，市场是不短缺的．     

Statistical Multiplexing of Homogeneous Fractional Brownian Streams

In this paper, the statistical multiplexing of independent fractional Brownian traffic streams with the same Hurst value 0.5<H<1 is studied. The buffer overflow probabilities based on steady-state and transient queue length tail distributions are used respectively as the common performance criterion. Under general conditions, the minimal buffer allocation to the merged traffic is identified in either case so that strictly positive bandwidth savings are realized. Impact of the common H value on multiplexing gains is investigated. The analytical results are applicable in data network engineering problems, where ATM is deployed as the transport network carrying long-range dependent data traffic.     

Analysis of an retrial queue

We consider a single server retrial queueing system in which each customer (primary or retrial customer) has discrete service times taking on value D_j with probability , and . An arriving primary customer who finds the server busy tries later. Moreover, each retrial customer has its own orbit, and the retrial customers try to enter the service independently of each other. We call this retrial queue an M/{D_n}/1 retrial queue. A necessary and sufficient condition for this system stability is given. In the steady state, we derive the joint distribution of the state of the server and the number of customers in the retrial orbits. The explicit expressions of some performance measures are given. In addition, the steady-state distribution of the waiting time is discussed.     

带有反馈与起动故障的M/G/1重新访问排队系统的适定性分析

文章研究一个带有贝努利反馈且系统服务台经常遭受启动故障的重新访问排队系统模型,利用线性算子半群理论,通过对描述其系统行为的偏微分方程组的研究,证明了该模型所描述的系统所确定的算子是闭稠定耗散算子,生成C0压缩半群,从而得到系统的适定性.在证明1是算子的预解点时,采用了共轭方法.     

The interdeparture-time distribution for each class in the ∑ i M i /G i /1 queue

A stationary queueing system is described in which a single server handles several competing Poisson arrival streams on a first-come first-served basis. Each class has its own generally distributed service time characteristics. The principal result is the Laplace-Stieltjes transform, for each class, of the interdeparture time distribution function. Examples are given and applications are discussed.     

On balking from an empty queue

The intuition while observing the economy of queueing systems, is that one’s motivation to join the system, decreases with its level of congestion. Here we present a queueing model where sometimes the opposite is the case. The point of departure is the standard first-come first-served single server queue with Poisson arrivals. Customers commence service immediately if upon their arrival the server is idle. Otherwise, they are informed if the queue is empty or not. Then, they have to decide whether to join or not. We assume that the customers are homogeneous and when they consider whether to join or not, they assess their queueing costs against their reward due to service completion. As the whereabouts of customers interact, we look for the (possibly mixed) join/do not join Nash equilibrium strategy, a strategy that if adopted by all, then under the resulting steady-state conditions, no one has any incentive not to follow it oneself. We show that when the queue is empty then depending on the service distribution, both ‘avoid the crowd’ (ATC) and ‘follow the crowd’ (FTC) scenarios (as well as none-of-the-above) are possible. When the queue is not empty, the situation is always that of ATC. Also, we show that under Nash equilibrium it is possible (depending on the service distribution) that the joining probability when the queue is empty is smaller than it is when the queue is not empty. This research was supported by The Israel Science Foundation Grant No. 237/02.     

兼职辅助工作的机器维修模型

本文研究了单修理工有效利用闲期兼职辅助工作的机器维修模型。这个模型被视为带休假策略的有限源排队问题，利用拟生灭过程的方法，给出了系统在稳态下机器故障数的分布和机器等待维修时间的分布，并将结果与经典的机器维修模型作了比较。     

Analysis of a statistical multiplexer with generalized periodic sources

We provide solution techniques for the analysis of multiplexers with periodic arrival streams, which accurately account for the effects of active and idle periods and of gradual arrival. In the models considered in this paper, it is assumed that each source alternates (periodically) between active and idle periods of fixed durations. Incoming packets are transmitted on the network link and excess information is stored in the multiplexing buffer when the aggregate input rate exceeds the capacity of the link. We are interested in the probability distribution of the buffer content for a given network link speed as a function of the number of sources and their characteristics, i.e., rate and duration of idle and active periods. We derive this distribution from two models: discrete time and continuous time systems. Discrete time systems operate in a slotted fashion, with a slot defining the base unit for data generation and transmission. In particular, in each slot the link is capable of transmitting one data unit and conversely an active source generates one data unit in that time. The continuous time model of the paper falls in the category of fluid models. Compared to previous works we allow a more general model for the periodic packet arrival process of each source. In discrete time, this means that the active period of a source can now extend over several consecutive slots instead of a single slot as in previous models. In continuous time, packet arrivals are not required to be instantaneous, but rather the data generation process can now take place over the entire duration of the active period. In both cases, these generalizations allow us to account for the progressive arrival of source data as a function of both the source speed and the amount of data it generates in an active period.This work was done while at the IBM T.J. Watson Research Center.This work was done while at the IBM T.J. Watson Research Center.Part of the work was done while visiting the IBM T.J. Watson Research Center.