Resource sharing with subexponential distributions Conference Paper uri icon

abstract

  • We investigate the distribution of the waiting time V in an M/G/1 processor sharing queue with traffic intensity < 1. This queue represents a baseline model for evaluating efficient and fair network resource sharing algorithms, e.g. TCP flow control. When the distribution of job size B belongs to a class of subexponential distributions with tails heavier than e-x, it is shown that as x [V > x] = [B > (1 - )x](1 + o(1)). Furthermore, we demonstrate that the preceding relationship does not hold if the job distribution has a lighter tail than e-x. This result provides a new tool for analyzing network congestion points with moderately heavy-tailed characteristics, e.g. lognormal distributions, that have been recently empirically discovered in Web traffic. The accuracy of our approximation is confirmed with simulation experiments.

name of conference

  • Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies

published proceedings

  • IEEE INFOCOM 2002: THE CONFERENCE ON COMPUTER COMMUNICATIONS, VOLS 1-3, PROCEEDINGS

author list (cited authors)

  • Jelenkovic, P., & Momcilovic, P.

citation count

  • 14

complete list of authors

  • Jelenkovic, P||Momcilovic, P

publication date

  • January 2002