By Topic

Leaky-bucket buffer admission scheme for supporting ATM GFR services with FIFO queuing

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

4 Author(s)

The ATM Forum has defined a data service called Guaranteed Frame Rate (GFR) Service. This service aims to support minimum bandwidth guarantee for a virtual connection (VC) and allows any excess bandwidth in the network to be shared among the contending VCs in a fair manner. It was proposed that the service requirement of GFR may be supported using the generic cell rate algorithm (GCRA), or equivalently, a leaky-bucket algorithm. Such an approach has significant implementation and cost advantage because most commercial ATM switches already have hardware implemented for GCRA, which is used for example in VBR service. However, previous ATM Forum contributions showed that a straightforward application of GCRA may not always guarantee both minimum bandwidth and fairness of excess bandwidth, particularly when bursty TCP traffic is considered. In this paper, we present an enhanced leaky-bucket buffer admission scheme in switches with FIFO queuing for supporting the GFR service requirements. Simulation results are presented to show that our scheme performs well under various TCP and UDP traffic environments

Published in:

Global Telecommunications Conference, 1999. GLOBECOM '99  (Volume:2 )

Date of Conference:

1999