By Topic

Bandwidth scheduling for wide-area ATM networks using virtual finishing times

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)
A. Hung ; Dept. of Electr. & Comput. Eng., Waterloo Univ., Ont., Canada ; G. Kesidis

The paper is concerned with the design of a class of bandwidth scheduling policies that are suitable for public, wide-area asynchronous transfer mode (ATM) networks. The authors specify design goals for such strategies including ease of implementation and the ability to guarantee minimum bandwidths to individual buffers. Packetized generalized processor sharing is briefly discussed and a minimum bandwidth result for self-clocked fair queueing is given. The authors revisit an approach originally proposed by Zhang (1991) and prove that it is appropriate for ATM. Some novel, related approaches are described and analyzed

Published in:

IEEE/ACM Transactions on Networking  (Volume:4 ,  Issue: 1 )