Abstract
For effective capacity management in access networks, it is essential to have a good insight in the service quality perceived by the users. As users share the service capacity available, one would want to know how the achieved per-user throughput fluctuates over time. In this paper we present a novel method that assesses the per-user throughput performance on the basis of throughput measurements at equidistant points in time. Our method relies on a queueing-theoretic framework, and allows us to explicitly quantify various statistics concerning the minimum per-user throughput obtained in a sample period, given the measured per-user throughput at the end points of that sample period, as well as the measured utilization during the interval. In an extensive numerical study we show the impact of important system parameters on these statistics. In addition, using illustrative examples, we demonstrate how the developed method can be used in practice for capacity management, with a specific focus on applications in cable access networks, an application for which our approach is particularly suitable.
Original language | English |
---|---|
Title of host publication | 2014 IEEE International Conference on Communications, ICC 2014 |
Place of Publication | Piscataway, NJ |
Publisher | IEEE |
Pages | 1197-1203 |
Number of pages | 7 |
ISBN (Electronic) | 978-1-4799-2003-7 |
DOIs | |
Publication status | Published - 2014 |
Event | 2014 1st IEEE International Conference on Communications, ICC 2014 - Sydney, Australia Duration: 10 Jun 2014 → 14 Jun 2014 Conference number: 1 |
Publication series
Name | IEEE International Conference on Communications (ICC) |
---|---|
Publisher | IEEE |
Volume | 2014 |
ISSN (Print) | 1550-3607 |
ISSN (Electronic) | 1938-1883 |
Conference
Conference | 2014 1st IEEE International Conference on Communications, ICC 2014 |
---|---|
Abbreviated title | ICC |
Country/Territory | Australia |
City | Sydney |
Period | 10/06/14 → 14/06/14 |
Keywords
- Birth-death processes
- Capacity management
- Processor sharing
- Queueing theory
- Throughput sampling