Abstract
Most residential broadband services are described in terms of their maximum potential throughput rate, often advertised as having speeds “up to X Mbps”. Though such promises are often met, they are fairly limited in scope and, unfortunately, there is no basis for an appeal if a customer were to receive compromised quality of service. While this ‘best effort’ model was sufficient in the early days, we argue that as broadband customers and their devices become more dependent on Internet connectivity, we will see an increased demand for more encompassing Service Level Agreements (SLA). In this paper, we study the design space of broadband SLAs and explore some of the trade-offs between the level of strictness of SLAs and the cost of delivering them. We argue that certain SLAs could be offered almost immediately with minimal impact on retail prices, and that ISPs (or third parties) could accurately infer the risk of offering SLA to individual customers – with accuracy comparable to that in the car or credit insurance industry – and price the SLA service accordingly.
Original language | English (US) |
---|---|
Title of host publication | Passive and Active Measurement - 18th International Conference, PAM 2017, Proceedings |
Editors | Steve Uhlig, Johanna Amann, Mohamed Ali Kaafar |
Publisher | Springer Verlag |
Pages | 156-169 |
Number of pages | 14 |
ISBN (Print) | 9783319543277 |
DOIs | |
State | Published - 2017 |
Event | 18th International Conference on Passive and Active Measurement, PAM 2017 - Sydney, Australia Duration: Mar 30 2017 → Mar 31 2017 |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 10176 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Other
Other | 18th International Conference on Passive and Active Measurement, PAM 2017 |
---|---|
Country/Territory | Australia |
City | Sydney |
Period | 3/30/17 → 3/31/17 |
Funding
We thank our shepherd Monia Ghobadi and the anonymous reviewers for their invaluable feedback. This work was supported in part by the National Science Foundation through Award CNS 1218287.
ASJC Scopus subject areas
- Theoretical Computer Science
- General Computer Science