Queueing delays on virtual circuits using a sliding window flow control scheme

Authors:
G. Varghese;W. Chou;A. A. Nilsson
Affiliations:
North Carolina State University, Raleigh, N, C.;North Carolina State University, Raleigh, N, C.;North Carolina State University, Raleigh, N, C.
Venue:
SIGMETRICS '83 Proceedings of the 1983 ACM SIGMETRICS conference on Measurement and modeling of computer systems
Year:
1983

Citing 3
Cited 1

Computational algorithms for closed queueing networks with exponential servers

Communications of the ACM
Calculating equilibrium probabilities for &lgr;(n)/Ck/1/N queues

PERFORMANCE '80 Proceedings of the 1980 international symposium on Computer performance modelling, measurement and evaluation
Theory, Volume 1, Queueing Systems

Theory, Volume 1, Queueing Systems

A new 'building block' for performance evaluation of queueing networks with finite buffers

SIGMETRICS '84 Proceedings of the 1984 ACM SIGMETRICS conference on Measurement and modeling of computer systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A tandem queue model is developed that models the end-to-end delay behavior in networks that employ sliding window flow control. Messages arriving to find the window filled are assumed to be queued outside the network to await their turn to enter. The model is analyzed using a hierarchical decomposition method; the key step entails incorporating the fact that the interdeparture process is not exponentially distributed. End-to-end delay in virtual circuits can then be obtained by modelling a virtual route as a tandem queue [1] using the method of “adjusted rates.”