In this paper, we consider an MAP/G/1 queue with MAP arrivals of negative customers, where there are two types of service times and two classes of removal rules: the RCA and RCH, as introduced in Section 2. We provide an approach for analyzing the system. This approach is based on the classical supplementary variable method, combined with the matrix-analytic method and the censoring technique. ...

This paper presents a problem of queuing theoretic performance modeling and analysis of Orthogonal Frequency Division Multiple Access (OFDMA) under broad-band wireless networks. We consider a single-cell WiMAX environment in which the base station allocates sub channels to the subscriber stations in its coverage area. The sub channels allocated to a subscriber station are shared by multiple con...

A class of discrete time GI/D/k systems is considered for which the interarrival times have finite support and customers are served in first-in first-out FIFO order. The system is formulated as a single server queue with new general independent interarrival times and constant service duration by assuming cyclic assignment of customers to the identical servers. Then the queue length is set up as...

We present a Markov model to approximate the queueing behavior at the G(t)/G(t)/s(t) + G(t) queue with exhaustive discipline and abandonments. The performance measures of interest are: (1) the average number of customers in queue, (2) the variance of the number of customers in queue, (3) the average number of abandonments and (4) the virtual waiting time distribution of a customer when arriving...

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...

We consider a nonstationary Markov multiserver queueing model where waiting customers may abandon and subsequently retry. In this paper we derive uid and di usion approximations for the associated waiting time process. The uid and di usion approximations for the corresponding queue length process were obtained in [4] (see also [5]).

In this paper, we consider a cognitive scenario where an energy harvesting secondary user (SU) coexisting with a primary user (PU). The energy harvesting secondary source helps the primary source in delivering its undelivered packets during periods of silence of the primary source. The primary source has a queue for storing its data packets, whereas the secondary source has two data queues; a q...

This paper extended a mathematical technique to model the behaviour of token-passing protocol in a star-coupled wavelength-division multiplexing (WDM) optical network for traffic multiplicity, based on a semi-Markov process. This analytical model is able to predict the results accurately. It is found that the proposed static priority scheme performs reasonably well in relatively stable and pred...

Some analytical results for exhaustive polling systems with semi-Markov delays, such as Pollaczek-Khintchin virtual and steady state analog are presented. Numerical solutions for k busy period, probability of states and queue length distribution are obtained. Numerical examples are presented.

We consider a tandem queue with coupled processors and analyze the two-dimensional Markov process representing the numbers of jobs in the two stations. A functional equation for the generating function of the stationary distribution of this two-dimensional process is derived and solved through the theory of Riemann-Hilbert boundary value problems.