Home is where the (fast) internet is: flat-rate compatible incentives for reducing peak load

Parminder Chhabra, Nikolaos Laoutaris, P. Rodriguez, Ravi Sundaram
{"title":"Home is where the (fast) internet is: flat-rate compatible incentives for reducing peak load","authors":"Parminder Chhabra, Nikolaos Laoutaris, P. Rodriguez, Ravi Sundaram","doi":"10.1145/1851307.1851311","DOIUrl":null,"url":null,"abstract":"Internet traffic to homes is surging, driven by the demand for rich content and the proliferation of home networks. This creates a huge problem for ISPs since residential customers expect the certainty of a fixed bill while ISPs do not want to upgrade backhaul equipment frequently in the absence of extra revenue streams. We consider simple variants on existing flat-rate schemes that will enable homes to self-select a portion of their peak hours traffic and move it to non-peak hours to benefit from offered incentives. We present a well-defined formulation of the problem and characterize its computational complexity. We show that a simple fractional algorithm achieves the optimal traffic reallocation and is realizable with small modifications to existing infrastructure. The fractional model also captures the reality that homes may be willing to move a fraction of their delay-tolerant traffic in response to appropriate incentives. Using trace-driven simulations based on well-accepted utility models and actual backbone traffic from a large ISP, we demonstrate that our incentive scheme can substantially lower peak congestion while still satisfying the increased demand of home networks.","PeriodicalId":287385,"journal":{"name":"HomeNets '10","volume":"30 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"HomeNets '10","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1851307.1851311","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11

Abstract

Internet traffic to homes is surging, driven by the demand for rich content and the proliferation of home networks. This creates a huge problem for ISPs since residential customers expect the certainty of a fixed bill while ISPs do not want to upgrade backhaul equipment frequently in the absence of extra revenue streams. We consider simple variants on existing flat-rate schemes that will enable homes to self-select a portion of their peak hours traffic and move it to non-peak hours to benefit from offered incentives. We present a well-defined formulation of the problem and characterize its computational complexity. We show that a simple fractional algorithm achieves the optimal traffic reallocation and is realizable with small modifications to existing infrastructure. The fractional model also captures the reality that homes may be willing to move a fraction of their delay-tolerant traffic in response to appropriate incentives. Using trace-driven simulations based on well-accepted utility models and actual backbone traffic from a large ISP, we demonstrate that our incentive scheme can substantially lower peak congestion while still satisfying the increased demand of home networks.
家是(快速)互联网所在的地方:降低峰值负荷的统一费率兼容激励
由于对丰富内容的需求和家庭网络的扩散,家庭的互联网流量正在激增。这给互联网服务提供商带来了一个巨大的问题,因为住宅用户期望固定账单的确定性,而互联网服务提供商在没有额外收入流的情况下不希望频繁升级回程设备。我们考虑了现有固定费率计划的简单变体,使家庭能够自行选择高峰时段的一部分交通,并将其转移到非高峰时段,以从提供的激励措施中受益。我们提出了这个问题的一个定义良好的公式,并描述了它的计算复杂性。我们证明了一个简单的分数算法可以实现最优的交通重新分配,并且可以通过对现有基础设施的少量修改来实现。分数模型还抓住了这样一个现实,即在适当的激励措施下,家庭可能愿意移动其可容忍延迟的交通的一小部分。利用基于广泛接受的实用新型和大型ISP的实际骨干流量的跟踪驱动模拟,我们证明了我们的激励方案可以大大降低高峰拥塞,同时仍然满足家庭网络日益增长的需求。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信