Asymptotically accurate flow completion time distributions under fair queueing
Paper
Paper/Presentation Title | Asymptotically accurate flow completion time distributions under fair queueing |
---|---|
Presentation Type | Paper |
Authors | Addie, R. G. (Author) and Yevdokimov, Oleksiy (Author) |
Editors | Green, Richard |
Journal or Proceedings Title | Proceedings of the Australasian Telecommunication Networks and Applications Conference (ATNAC 2007) |
ERA Conference ID | 50278 |
Number of Pages | 7 |
Year | 2008 |
Place of Publication | Piscataway, NJ. United States |
ISBN | 9781424415571 |
9781424415588 | |
Digital Object Identifier (DOI) | https://doi.org/10.1109/ATNAC.2007.4665290 |
Web Address (URL) of Paper | http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4665290 |
Conference/Event | Australasian Telecommunication Networks and Applications Conference (ATNAC 2007): Next Generation Networks: Enabling Closer International Cooperation |
Australasian Telecommunication Networks and Applications Conference | |
Event Details | Australasian Telecommunication Networks and Applications Conference (ATNAC 2007): Next Generation Networks: Enabling Closer International Cooperation Event Date 02 to end of 05 Dec 2007 Event Location Christchurch, New Zealand |
Event Details | Australasian Telecommunication Networks and Applications Conference ATNAC |
Abstract | Fair Queueing (FQ) is a very important queue discipline because it is sometimes viewed as a satisfactory model of the way Internet routers share their time between flows at present, and sometimes viewed as an ideal to which Internet router queueing algorithms aspire. The really important performance measure for flows is {\em flow completion time} FCT), however no formula for the distribution of FCT is known at present under realistic assumptions for flow size distribution. In this paper, we discover that the distribution of the number of active flows under FQ when flows have a Pareto distribution (a realistic model for flow lengths) is approximately geometric, where the approximation is asymptotically accurate as the flow distributions become more heavy tailed. This then provides an estimate for the FCT distribution. |
Keywords | fair queueing; internet router queueing algorithms; Pareto distribution; flow completion time distributions; flow size distribution |
ANZSRC Field of Research 2020 | 490510. Stochastic analysis and modelling |
400604. Network engineering | |
400699. Communications engineering not elsewhere classified | |
Public Notes | © 2008 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. |
Byline Affiliations | Department of Mathematics and Computing |
https://research.usq.edu.au/item/9y94x/asymptotically-accurate-flow-completion-time-distributions-under-fair-queueing
2075
total views146
total downloads0
views this month0
downloads this month