By Topic

Shape-controlled traffic patterns that maximize overflow probabilities in high-speed 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
$33 $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)
G. Kesidis ; Dept. of Electr. & Comput. Eng., Waterloo Univ., Ont., Canada ; T. Konstantopoulos

We consider the problem of allocation of network resources for a variable bit rate connection requiring a probabilistic bound on cell delay. We only make the standard assumption that the connection has a deterministically controlled shape as specified by a (a, p) constraint, simultaneously with a (0, π) (or peak-rate) constraint. This paper settles one instance of this open problem raised by Doshi (1994), which is motivated by the need to obtain worst-case probabilistic bounds, and is particularly applicable to situations where no statistical descriptors of network traffic are available. In particular, we describe that traffic pattern which maximizes the “overflow probability” P(Q0>b), for a given buffer level b, where {Qt} is the buffer occupancy process, in steady-state, when the service rate is some constant c between ρ and π. This result could be used for resource provisioning of connections or for performance evaluation of network devices

Published in:

Decision and Control, 1998. Proceedings of the 37th IEEE Conference on  (Volume:1 )

Date of Conference: