Distribution of the first buffer overflow time in a deterministic service time queue

It has been argued recently that steady-state parameters (like cell loss probability) have important drawbacks when used as quality of service criteria of telecommunication networks. Therefore the first buffer overflow time has been proposed as an alternative, transient characteristic. In this paper...

Full description

Saved in:
Bibliographic Details
Published in:10th IEEE Symposium on Computers and Communications (ISCC'05) pp. 637 - 641
Main Authors: Chydzinski, A., Winiarczyk, R.
Format: Conference Proceeding
Language:English
Published: IEEE 2005
Subjects:
Buffer overflow
Computer networks
Information technology
Laplace equations
Parameter estimation
Quality of service
Queueing analysis
Steady-state
Telecommunication computing
Transient analysis
ISBN:0769523730, 9780769523736
ISSN:1530-1346
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:It has been argued recently that steady-state parameters (like cell loss probability) have important drawbacks when used as quality of service criteria of telecommunication networks. Therefore the first buffer overflow time has been proposed as an alternative, transient characteristic. In this paper the first buffer overflow time in a constant service rate queue is studied. In particular, the formulas for Laplace transform and expected value of its distribution for any initial queue size are proven. Moreover, numerical illustrations of analytical results are presented.
ISBN:0769523730
9780769523736
ISSN:1530-1346
DOI:10.1109/ISCC.2005.54