About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Conference paper
Optimal buffer allocation for packet switches with input and output queueing
Abstract
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.
Related
Conference paper
FDDI performance analysis: Delay approximations
Conference paper