By Topic

Optimal buffer allocation for packet switches with input and output queueing

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

2 Author(s)
Chen, J.S.-C. ; IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA ; Stern, T.E.

The authors investigate optimal buffer allocation strategies for a family of space-division packet switches implementing input and output queueing and having varying degrees of speedup. A general model to describe this family of switch is presented. Based on this model, input and output queue-length distributions are obtained for various speedup factors. From these distributions, packet blocking probability for finite-buffer systems can be estimated. The blocking probability is found to consist of convex functions with respect to the finite input and output buffer sizes. Thus, given fixed buffer budgets, there exist optimal placements of buffers among input and output ports to minimize the blocking probability. Numerical results are provided to illustrate these strategies

Published in:

Global Telecommunications Conference, 1990, and Exhibition. 'Communications: Connecting the Future', GLOBECOM '90., IEEE

Date of Conference:

2-5 Dec 1990