Worst Traffic Passing Virtual Frame Regulation: Analysis with Dynamic Programming

Authors:
Daniel C. Lee
Affiliations:
University of Southern California, Department of Electrical Engineering – Systems, 3740 McClintock Avenue, Los Angeles, CA 90089-2565, USA dclee@usc.edu
Venue:
Queueing Systems: Theory and Applications
Year:
2001

Citing 4
Cited 0

Dynamic programming: deterministic and stochastic models

Dynamic programming: deterministic and stochastic models
Data networks (2nd ed.)

Data networks (2nd ed.)
Worst-case traffic in a tree network of ATM multiplexers

IEEE/ACM Transactions on Networking (TON)
Characterising the worst traffic profile passing through an ATM-UNI

Proceedings of the Second IFIP Workshop on Performance Modelling and Evaluation of ATM Networks: ATM Networks, Performance Modelling and Analysis, Volume 1

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper studies a discrete-time queueing system in which the traffic regulation places an upper bound on the number of arrivals in each of the non-overlapping time windows (virtual frames) of a fixed length. The worst traffic passing through this traffic regulation is characterized. As a criterion for traffic comparison, this paper employs the weighted sum of queueing delays with the weighting factors decaying geometrically over the time horizon. This paper uses dynamic programming techniques and convexity argument to characterize the worst traffic.