Analysis of an open tandem queueing network with population constraint and constant service times 1

Rhee, Young Sun; Perros, Harry G.

doi:10.1016/0377-2217(95)00291-x

Cited by 13 publications

(5 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To obtain the probability generating function (PGF) of the queue size at an arbitrary time epoch, the following probability generating functions are defined Let P (z) be the probability generating function of the queue size at an arbitrary time epoch. Then (15) By multiplying the equations from ( 9)-( 14) with suitable powers of 𝑧 𝑛 and summing over n, then by using (15), we get…”

Section: Probability Generating Function (Pgf)mentioning

confidence: 99%

See 1 more Smart Citation

Performance Analysis of Rdx Mechanism in Data Transmission Using Ibm Web Sphere, Ai and Tandem Queue

NIRANJAN,

LATHA

2024

Preprint

View full text Add to dashboard Cite

In this paper we have discussed tandem queue with two service nodes. In this system, the customer require services at both nodes elaborated RDX mechanism and IBM web sphere in artificial intelligence (AI). The first essential service (FES) starts in data search and initiating the data to be required in using the RDX mechanism then the second essential service (SES) starts from validating the information in IBM web sphere and insight with the use of AI. After the completion of a service at node1 if the minimum number of customer is less than ‘a’ then the server leaves for secondary job. The service started once the vacation reaches the threshold value. When the service ends at node 1, it departs from here to proceed node 2 and receive the second service from there. We have to find PGF of a queue size at an arbitrary time epoch by using supplementary variable technique. Various characteristics of the queueing system are also obtained with a numerical solution.

show abstract

Section: Probability Generating Function (Pgf)mentioning

confidence: 99%

“…Young Rhee and Harry Perros [15] analyzed on an open tandem queueing network with a population constraint and constant service times. The researchers proposed a transformation technique that allows the queueing network to be simplified into a two-node queueing network.…”

Section: Introductionmentioning

confidence: 99%

Performance Analysis of Rdx Mechanism in Data Transmission Using Ibm Web Sphere, Ai and Tandem Queue

NIRANJAN,

LATHA

2024

Preprint

View full text Add to dashboard Cite

show abstract

“…For the two partial derivative terms in (17), the partial derivatives are performed and then the series expansion of the CGF given by (18) is inserted where appropriate. Specifically, for the first partial derivative,…”

Section: Ordinary Differential Equationsmentioning

confidence: 99%

“…The models he considers may be time-as well as state-dependent. Rhee and Perros [17] develop bounds on the waiting time of customers in a tandem queueing network operating in steady state. The network they consider is subject to a state constraint described through a semaphore queue.…”

Section: Introductionmentioning

confidence: 99%

Transient analysis of state-dependent queueing networks via cumulant functions

Matis

Feldman

2001

Journal of Applied Probability

View full text Add to dashboard Cite

A new procedure that generates the transient solution of the first moment of the state of a Markovian queueing network with state-dependent arrivals, services, and routeing is developed. The procedure involves defining a partial differential equation that relates an approximate multivariate cumulant generating function to the intensity functions of the network. The partial differential equation then yields a set of ordinary differential equations which are numerically solved to obtain the first moment.

show abstract

“…The proof is given in Rhee and Perros[13].For a queueing network with constant service times, the number of tokens in the network, i.e. the size of the window, may influence where customers wait internally in the network.…”

mentioning

confidence: 99%

Analysis of an open tandem queueing network with population constraint and constant service times

Rhee

Perros

MASCOTS '95. Proceedings of the Third International Workshop on Modeling, Analysis, and Simulation of Computer and Telecommunic

View full text Add to dashboard Cite

We consider an open tandem queueing network with population constraint and constant service times. The total number of customers that may be present in the network can not exceed a given value Ii'. Customers arriving at the queueing network when there are more than I< customers are forced to wait in an external queue. The arrival process to the queueing network is assumed to be arbitrary.We show that this queueing network can be transformed into a simple network involving only two nodes. We obtain an upper and lower bound on the mean waiting time. Validations against simulation data establish the tightness of these bounds.KEY WORDS: open queueing network, population constraint, constant service times, semaphore queue. 189 0-8186-6902-0/95 $4.00 Q 1995 IEEE

show abstract

Analysis of an open tandem queueing network with population constraint and constant service times 1

Cited by 13 publications

References 18 publications

Performance Analysis of Rdx Mechanism in Data Transmission Using Ibm Web Sphere, Ai and Tandem Queue

Performance Analysis of Rdx Mechanism in Data Transmission Using Ibm Web Sphere, Ai and Tandem Queue

Transient analysis of state-dependent queueing networks via cumulant functions

Analysis of an open tandem queueing network with population constraint and constant service times

Contact Info

Product

Resources

About