By Topic

An approach to the design of high speed networks for bursty traffic

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

1 Author(s)
V. Anantharam ; Sch. of Electr. Eng., Cornell Univ., Ithaca, NY, USA

The class of message flows that satisfy the condition that the amount of traffic in an interval is upper bounded by an affine function of the length of the interval has been found to be a useful class of models for traffic on internal links in networks that have to handle bursty traffic. We make the key observation that there is a simple recursively updatable number, which we call the virtual backlog, which plays the role of a state for these models, in that it completely summarizes the information gained at any time by having observed the flow and can be recursively updated. This allows the formulation of control and resource allocation problems at nodes within the network as a stochastic game

Published in:

Decision and Control, 1993., Proceedings of the 32nd IEEE Conference on

Date of Conference:

15-17 Dec 1993