arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1707.02503math.OCcs.NI
收藏

蜂窝网络中的需求整形

Demand Shaping in Cellular Networks

Xinyang Zhou, Lijun Chen

摘要:

需求整形是在存在不断增加的无线数据需求的情况下缓解无线蜂窝容量不足的有希望的方式。在本文中,我们制定的需求塑造作为一个最优化问题,最大限度地减少总流量的变化。设计了一个完全交通信息下的分布式随机离线需求整形算法,并证明了算法的几乎必然收敛性。我们进一步考虑一个更现实的设置,其中的交通信息是不完整的,但未来的交通可以预测到一定程度的准确性。我们设计了一个在线的需求整形算法,更新的时间表的可推迟的应用程序(DA)的每一次,当新的信息是可用的,在每个时隙的基础上解决一个最优化问题在一个缩小的地平线从当前时间到一天结束。我们比较的性能的在线算法对最佳的离线算法,并提供数值例子来补充理论分析。

英文摘要:

Demand shaping is a promising way to mitigate the wireless cellular capacity shortfall in the presence of ever-increasing wireless data demand. In this paper, we formulate demand shaping as an optimization problem that minimizes the variation in aggregate traffic. We design a distributed and randomized offline demand shaping algorithm under complete traffic information and prove its almost surely convergence. We further consider a more realistic setting where the traffic information is incomplete but the future traffic can be predicted to a certain degree of accuracy. We design an online demand shaping algorithm that updates the schedules of deferrable applications (DAs) each time when new information is available, based on solving at each timeslot an optimization problem over a shrinking horizon from the current time to the end of the day. We compare the performance of the online algorithm against the optimal offline algorithm, and provide numerical examples to complement the theoretical analysis.

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

↑