By Topic

Sizing a packet reassembly buffer at a host computer in an ATM network

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)
Smith, D.E. ; Bellcore, Red Bank, NJ, USA ; Chao, H.J.

This paper develops a queueing model of a buffer that collects cells for reassembly into packets for a protocol layer above the asynchronous transfer mode (ATM) layer. Whenever the buffer fills with all packets incomplete, a packet must be sacrificed to make room for others. The queueing model estimates the equilibrium fraction of packets sacrificed under one algorithm for selecting the packet to be sacrificed. The paper also uses simulation to compare three sacrifice algorithms. The model's predicted packet loss probabilities bound from above the loss probabilities in the simulations of the different algorithms. Applications to sizing the buffer for a prescribed loss probability are given

Published in:

Networking, IEEE/ACM Transactions on  (Volume:3 ,  Issue: 6 )