|
Published Articles >> Table of Contents >> Abstract
The Quantitative Evaluation of Systems, First International Conference on (QEST'04)
pp. 82-89
Bit-Level and Packet-Level, or Pollaczec-Khintchine Formulae Revisited
Incera Incera, ITAM, México
Gerardo Rubino, IRISA/INRIA Rennes, France
Full Article Text:
 
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/QEST.2004.10046
Send link to a friend
| Abstract |
|
When we analyze the performance of a packet communication network using a queuing model, it is usual to see packets as tokens and to consider that they remain in service for an amount of time proportional to their lengths (the proportionality constant being the reciprocal of the transmission speed). In this paper we show that this paradigm may misrepresent the dynamics of the system, because of its implications on the way memory is used and, in particular, freed. Simulation and analytical results illustrate our claim. Concerning the latter, we provide modified Pollaczec-Khintchine formulas in the M/GI/1 case where we take into account the usual way memory is handled in a communication node.
|
 Additional Information
|
Citation:
Incera Incera, Gerardo Rubino,
"Bit-Level and Packet-Level, or Pollaczec-Khintchine Formulae Revisited,"
qest,
pp. 82-89,
The Quantitative Evaluation of Systems, First International Conference on (QEST'04),
2004
|
|
