By Topic

Worst closed-loop controlled bulk distributions of stochastic arrival processes for queue performance

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

1 Author(s)
Lee, Daniel C. ; Department of Computer Science and Engineering at Wright State University, Dayton, OH, USA; Department of Electrical Engineering at University of Southern California, Los Angeles, CA, USA

This paper presents basic queueing analysis contributing to teletraffc theory, with commonly accessible mathematical tools. This paper studies queueing systems with bulk arrivals. It is assumed that the number of arrivals and the expected number of arrivals in each bulk are bounded by some constraints B and λ, respectively. Subject to these constraints, convexity argument is used to show that the bulk-size probability distribution that results in the worst mean queue performance is an extremal distribution with support {1, B} and mean equal to λ. Furthermore, from the viewpoint of security against denial-of-service attacks, this distribution remains the worst even if an adversary were allowed to choose the bulk-size distribution at each arrival instant as a function of past queue lengths; that is, the adversary can produce as bad queueing performance with an open-loop strategy as with any closed-loop strategy. These results are proven for an arbitrary arrival process with bulk arrivals and a general service model.

Published in:

Communications and Networks, Journal of  (Volume:7 ,  Issue: 1 )