Keywords: Queueing Tandem queueing system Marked Markovian arrival process Phase-type distribution Laplace–Stieltjes transform a b s t r a c t A tandem queueing system with infinite and finite intermediate buffers, heterogeneous customers and generalized phase-type service time distribution at the second stage is investigated. The first stage of the tandem has a finite number of servers without...

Measurement-based traac characterization has come to acquire a great deal of importance in high-speed networks. In this paper, we segregate the traac behaviour into the macrody-namics and microdynamics depending on the time scales at which the process is observed. We examine the validity of the Markovian assumption which is commonly made for modeling the macrodynamics of correlated traac in net...

One of the most important performance measures in the analysis of data networks is the average delay required to deliver a packet from origin to destination. The packet delay will aaect the choice and performance of several network algorithms such as routing and ow control. Queueing theory is the primary methodological framework for analyzing network delay. It provides a basis for adequate dela...

In this paper, a queueing system is formulated, analyzed and applied for the study of the queueing behavior of a DQDB station. At rst, an appropriate process is deened to capture the station's perception of the state of the distributed global queue (DQDB network) and a queueing model is formulated. In the sequel, a general queueing system is considered; the packet service time requirement is as...

We consider queueing systems in which the service rate is the controlled variable. The cost depends on the queue length and selected rate. The objective is to choose the service rate dynamically, based on the state of the system so as to minimize the average cost over an infinite horizon. Six classes, either known in the literature or new, are studied in detail: queueing systems with vacations,...

The subject of this paper is the heavy traffic behavior of a general class of queueing networks with first-in-first-out (FIFO) service discipline. For special cases which require various assumptions on the network structure, several authors have proved heavy traffic limit theorems to justify the approximation of queueing networks by reflected Brownian motions (RBM's). Based on these theorems, s...

We study the infinite horizon optimal control problem for N-network queueing systems, which consist of two customer classes and two server pools, under average (ergodic) criteria in the Halfin–Whitt regime. We consider three control objectives: 1) minimizing the queueing (and idleness) cost, 2) minimizing the queueing cost while imposing a constraint on idleness at each server pool, and 3) mini...

This paper concerns discrete-time queueing systems operating under a first-come-first-served queueing discipline, with deterministic service times of one slot and subject to independent server interruptions. We derive a relationship between the probability generating functions of the system contents during an arbitrary slot and of the system delay of an arbitrary customer. This relationship is ...

A comprehensive algorithmic analysis of finite state dependent queueing models and exponentially distributed workstations is formulated and presented. The material handling system is modeled with finite state dependent queueing network M/G/c/c models and the individual workstations are modeled with exponentially distributed single and multi-server M/M/c queueing models. The coupling of these qu...

High performance of advanced packet switches can be achieved by providing queueing both at the input ports as well as at the output ports. This paper considers such a switch where output buffer sharing is introduced. A better memory utilization is expected when the output queueing space is shared among all the output ports as opposed to having dedicated queues at each output port. An analytical...