Abstract
A discrete-time finite queue where an arriving packet of variable length occupied as many places in the buffer as its length was considered. An approximation for the loss probability was obtained which turned out to be a geometric function of the buffer size. Accuracy of the approximation was illustrated by some numerical examples.
Original language | English |
---|---|
Pages (from-to) | 578-580 |
Number of pages | 3 |
Journal | Electronics Letters |
Volume | 39 |
Issue number | 6 |
DOIs | |
Publication status | Published - 2003 Mar 20 |
ASJC Scopus subject areas
- Electrical and Electronic Engineering