By Topic

Recurrence times of buffer overflows in Jackson networks

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)
Meyn, S.P. ; Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA ; Frater, M.R.

The estimation of the statistics of buffer overflows in networks of queues by means of simulation is inherently costly, simply because of the rarity of these events. An alternative analytic approach is presented, with very low computational cost, for calculating the recurrence time of buffer overflows for Jackson networks in which the recurrence times of buffer overflows in a network are expressed in terms of the recurrence times for overflows of individual buffers, isolated from the network. This result is applied to the buffer allocation problem for queueing networks, providing extensions and further justification for a previously derived heuristic approach to this problem

Published in:

Information Theory, IEEE Transactions on  (Volume:39 ,  Issue: 1 )