Resource Sharing with Subexponential Distributions

@inproceedings{Jelenkovic2002ResourceSW,
  title={Resource Sharing with Subexponential Distributions},
  author={Predrag R. Jelenkovic and Petar Momcilovic},
  booktitle={INFOCOM},
  year={2002}
}
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− √ , it is shown that as x → ∞ P[V > x] = P[B > (1 − ρ)x](1 + o(1)). Furthermore, we demonstrate that the preceding relationship does… CONTINUE READING
9 Citations
42 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 42 references

Processor-Sharing Models for Integrated-Services Networks, Ph.D

  • R. Núnez-Queija
  • thesis, Eindhoven University of Technology,
  • 2000
Highly Influential
10 Excerpts

Sojourn times in a multiclass processor sharing queue

  • B. Zwart
  • Proc. ITC-16, Edinburgh, UK, June 1999.
  • 1999
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…