Most Probable Path Techniques for Gaussian Queueing Systems

Authors:
Ilkka Norros
Affiliations:
-
Venue:
NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
Year:
2002

Citing 5
Cited 1

A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
On the self-similar nature of Ethernet traffic (extended version)

IEEE/ACM Transactions on Networking (TON)
Effective bandwidths with priorities

IEEE/ACM Transactions on Networking (TON)
A most probable path approach to queueing systems with general Gaussian input

Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Advances in modeling and engineering of Longe-Range dependent traffic
Extending the effective bandwidth concept to networks with priority classes

IEEE Communications Magazine

Sample-path large deviations for generalized processor sharing queues with Gaussian inputs

Performance Evaluation - Long range dependence and heavy tail distributions

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper is a review of an approach to queueing systems where the cumulative input is modelled by a general Gaussian process with stationary increments. The examples include priority and Generalized Processor Sharing systems, and a system where service capacity is allocated according to predicted future demand. The basic technical idea is to identify the most probable path in the threshold exceedance event, or a heuristic approximation of it, and then use probability estimates based on this path. The method is particularly useful for long-range dependent traffic and complicated traffic mixes, which are difficult to handle with traditional queueing theory.