By Topic

Bit-level and packet-level, or Pollaczec-Khintchine formulae revisited

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)
Incera, J. ; ITAM, Mexico City, Mexico ; Rubino, G.

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/G1/1 case where we take into account the usual way memory is handled in a communication node.

Published in:

Quantitative Evaluation of Systems, 2004. QEST 2004. Proceedings. First International Conference on the

Date of Conference:

27-30 Sept. 2004