By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chydzinski, A. ; Inst. of Comput. Sci., Silesian Tech. Univ., Gliwice, Poland ; Winiarczyk, R.

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.

Published in:

Computers and Communications, 2005. ISCC 2005. Proceedings. 10th IEEE Symposium on

Date of Conference:

27-30 June 2005