Exact queueing asymptotics multiple heavy-tailed on-off flows

Bert Zwart, Sem Borst, Michel Mandjes

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

53 Downloads (Pure)

Abstract

We consider a fluid queue fed by multiple on-off flows with heavy-tailed (regularly varying) on-periods. Under fairly mild assumptions, we prove that the workload distribution is asymptotically equivalent to that in a reduced system. The reduced system consists of a dominant subset of the flows, with the original service rate subtracted by the mean rate of the other flows. We describe how a dominant set may be determined from a simple knapsack formulation. We exploit a powerful intuitive argument to obtain the exact asymptotics for the reduced system. Combined with the reduced-load equivalence, the results for the reduced system provide an asymptotic characterization of the buffer behavior
Original languageEnglish
Title of host publicationIEEE INFOCOM 2001
Subtitle of host publicationTwentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings
PublisherIEEE
Pages279-288
Number of pages10
ISBN (Print)0-7803-7016-3
DOIs
Publication statusPublished - 2001
Event20th Annual Joint Conference of the IEEE Computer and Communications Societies, IEEE INFOCOM 2001 - Hilton Anchorage Hotel, Anchorage, United States
Duration: 22 Apr 200126 Apr 2001
Conference number: 20

Conference

Conference20th Annual Joint Conference of the IEEE Computer and Communications Societies, IEEE INFOCOM 2001
Abbreviated titleIEEE INFOCOM
CountryUnited States
CityAnchorage
Period22/04/0126/04/01

Keywords

  • IR-72119
  • EWI-18031

Fingerprint Dive into the research topics of 'Exact queueing asymptotics multiple heavy-tailed on-off flows'. Together they form a unique fingerprint.

  • Cite this

    Zwart, B., Borst, S., & Mandjes, M. (2001). Exact queueing asymptotics multiple heavy-tailed on-off flows. In IEEE INFOCOM 2001: Twentieth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings (pp. 279-288). IEEE. https://doi.org/10.1109/INFCOM.2001.916710