Packet Models Revisited: Tandem and Priority Systems

Authors:
Michel Mandjes
Affiliations:
CWI, Advanced Communication Networks, P.O. Box 94079, 1090 GB Amsterdam, The Netherlands and Department of Applied Mathematics, University of Twente, P.O. Box 217, 7500 AE Enschede, The Netherland ...
Venue:
Queueing Systems: Theory and Applications
Year:
2004

Citing 3
Cited 1

Ballot theorems applied to the transient analysis of nD/D/1 queues

IEEE/ACM Transactions on Networking (TON)
Delay analysis for CBR traffic under static-priority scheduling

IEEE/ACM Transactions on Networking (TON)
A Queue with Superpositiojn of Arrival Streams with an Application to Packet Voice Technology

Performance '90 Proceedings of the 14th IFIP WG 7.3 International Symposium on Computer Performance Modelling, Measurement and Evaluation

Delays in a series of queues with correlated service times

Journal of Network and Computer Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We examine two extensions of traditional single-node packet-scale queueing models: tandem networks and (strict) priority systems. Two generic input processes are considered: periodic and Poisson arrivals. For the two-node tandem, an exact expression is derived for the joint distribution of the total queue length, and the queue length of the first queue, implicitly determining the distribution of the second queue. Similarly we derive the distribution of the low-priority queue in a two-class priority system. We also provide explicit approximations based on the Brownian bridge.