arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2204.12588cs.GT
收藏

带宽分配游戏

Bandwidth Allocation Games

Niloofar Bayat, Vishal Misra, Dan Rubenstein

摘要:

互联网提供商通常提供数据计划,对于每个用户的每月计费周期,该数据计划保证高速率的固定数据量,直到达到字节阈值,在该点处,用户的数据率在该周期的剩余部分被调节到较低速率。在实践中,节流的阈值和速率可能会出现,并且可能是任意的。在本文中,我们评估的阈值和速率的选择作为一个优化问题(遗憾最小化),并表明,直观的配方客户端遗憾,保持理想的公平性,导致优化问题,具有易处理的可计算的解决方案。我们首先探索使用阈值机制来调节整体带宽消耗的有效性。接下来,我们分别考虑希望在固定速率的有限时间段上观看内容的作为{ \em流式传输器}的异构用户和希望以其最高可获得速率每月获得固定量的带宽的作为{ \em文件下载器}的用户的遗憾。我们将我们的分析扩展到一个博弈论的设置,用户可以从各种计划中选择不同的上限上的无限速率数据,并证明了收敛的游戏。我们的模型提供了一个新的角度公平分配资源的需求高于容量,同时专注于现实世界的现象,带宽节流实行互联网服务提供商。我们展示了如何解决优化问题的结果分配,表现出几个理想的公平性之间的用户的容量必须进行分区。

英文摘要:

Internet providers often offer data plans that, for each user's monthly billing cycle, guarantee a fixed amount of data at high rates until a byte threshold is reached, at which point the user's data rate is throttled to a lower rate for the remainder of the cycle. In practice, the thresholds and rates of throttling can appear and may be somewhat arbitrary. In this paper, we evaluate the choice of threshold and rate as an optimization problem (regret minimization) and demonstrate that intuitive formulations of client regret, which preserve desirable fairness properties, lead to optimization problems that have tractably computable solutions. We begin by exploring the effectiveness of using thresholding mechanisms to modulate overall bandwidth consumption. Next, we separately consider the regret of heterogeneous users who are {\em streamers}, wishing to view content over a finite period of fixed rates, and users who are {\em file downloaders}, desiring a fixed amount of bandwidth per month at their highest obtainable rate. We extend our analysis to a game-theoretic setting where users can choose from a variety of plans that vary the cap on the unbounded-rate data, and demonstrate the convergence of the game. Our model provides a fresh perspective on a fair allocation of resources where the demand is higher than capacity, while focusing on the real-world phenomena of bandwidth throttling practiced by ISPs. We show how the solution to the optimization problem results in allocations that exhibit several desirable fairness properties among the users between whom the capacity must be partitioned.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑