In this paper the information theoretic principle of Maximum Entropy (ME) is applied, as a method of inference, towards the study of the M/G/1 queueing model at equilibrium with either single or multiple server vacation periods under both exhaustive and non-exhaustive scheduling schemes. An analytic ME approximation for the characterisation of a universal form for the queue length distribution ...

We prove asymptotic upper and lower bounds on the asymptotic decay rate of per-session queue length tail distributions for a single constant service rate server queue shared by multiple sessions with the generalized processor sharing (GPS) scheduling discipline. The simpler case of a GPS system with only two queues needs special attention, as under this case, it is shown that the upper bounds a...

In this paper we consider a large deviations problem for a discrete-time polling system consisting of two-parallel queues and a single server. The arrival process of each queue is a superposition of traffic streams generated by a number of mutually independent and identical Markovian on/off sources, and the single server serves the two queues according to the so-called Bernoulli service schedul...

The effect of dependence is mostly ignored in queueing systems due to the difficulty in its analysis; the existing studies about dependent queueing systems have restrictive assumptions, such as considering only the M/M/1 queue with order of dependence lag-1 in interarrival and service times. In this paper, we conduct a simulation study to observe the impact of dependence in a single server queu...

It is well known that a simple relation called proportional relation holds for some queueing models, that is, the stationary queue length distribution of one system can be expressed as the product of a constant and the distribution of another system which is different only in the buffer capacity. Recently, the proportional relation has been verified for various discrete-time single-server queue...

We consider a stationary single-server queue with preemptive-resume last-come, first-served (LCFS-PR) queueing discipline. The LCFS-PR single-server queue has some interesting properties and has been studied in the queueing literature. In this paper, we generalize the previous works such that the input process to the queueing system is described as a general stationary marked point process, and...

This paper is concerned with the analysis of a single-server queue with Bernoulli vacation schedules and general retrial times. We assume that the customers who find the server busy axe queued in the orbit in accordance with an FCFS (first-come-first-served) discipline and only the customer at the head of the queue is allowed access to the server. We first present the necessary and sufficient c...

In this paper, we will develop a tool to analyze polling systems with the autonomous-server, the time-limited, and the k-limited service discipline. It is known that these disciplines do not satisfy the well-known branching property in polling system, therefore, hardly any exact result exists in the literature for them. Our strategy is to apply an iterative scheme that is based on relating in c...

Vacation queueing models have wide range of application in several areas including computer-communication, and manufacturing systems. A finite-butTer single-server queue with renewal input and multiple exponential vacations has been analysed by Karaesmen and Gupta (1996). In this paper we extend the analysis to cover the batch arrivals. i.e. we consider a batch alTiva! single-server queue with ...

Consider a single server fixed batch service queueing system under multiple vacation with a possibility of negative arrival in which the arrival rate λ follows a Poisson process, the service time follows an exponential distribution with parameter μ. Further we assume a negative arrival rate occur at the rate of ν which follows a Poisson process and the length of time the server in vacation foll...