首页> 外文会议>IEEE Global Communications Conference >Predictive delay-aware network selection in data offloading
【24h】

Predictive delay-aware network selection in data offloading

机译:数据卸载中的预测延迟感知网络选择

获取原文

摘要

To address the increasingly severe congestion problem in cellular networks, mobile operators are actively considering offloading the cellular traffic to other complementary networks. In this paper, we study the online network selection problem in operator-initiated data offloading with multiple mobile users, taking into account the operation cost, queueing delay, and traffic load in different access networks (e.g., cellular macrocell, femtocell, and Wi-Fi networks). We first design a Delay-Aware Network Selection (DNS) algorithm based on the Lyapunov optimization technique. The DNS algorithm yields an operation cost within O (1/V) bound of the optimal value, and guarantees an O (V) traffic delay for any control parameter V > 0. Next, we incorporate the prediction of users' mobilities and traffic arrivals into the network selection. Specifically, we assume that the users' locations and traffic arrivals in the next few time slots can be estimated accurately, and propose a Predictive Delay-Aware Network Selection (P-DNS) algorithm to utilize this information based on a novel frame-based design. We characterize the performance bounds of P-DNS in terms of cost-delay tradeoff theoretically. To further reduce the computational complexity, we propose a Greedy Predictive Delay-Aware Network Selection (GP-DNS) algorithm, where the operator solves the network selection problem approximately and iteratively. Numerical results show that GP-DNS improves the cost-delay performance over DNS, and reduces the queueing delay by roughly 40% with the same operation cost.
机译:为了解决蜂窝网络中日益严重的拥塞问题,移动运营商正在积极考虑将蜂窝业务分流到其他互补网络。在本文中,我们考虑了运营成本,排队延迟和不同接入网络(例如,蜂窝宏小区,毫微微小区和Wi- Fi网络)。我们首先设计基于Lyapunov优化技术的延迟感知网络选择(DNS)算法。 DNS算法产生的运营成本在最佳值的O(1 / V)范围内,并保证对于任何控制参数V> 0的O(V)流量延迟。接下来,我们结合了对用户移动性和流量到达的预测进入网络选择。具体来说,我们假设可以精确估计接下来几个时隙中用户的位置和到达的流量,并基于一种新颖的基于帧的设计,提出了一种预测延迟感知网络选择(P-DNS)算法来利用此信息。从理论上讲,我们在成本延迟方面权衡了P-DNS的性能界限。为了进一步降低计算复杂度,我们提出了一种贪婪预测延迟感知网络选择(GP-DNS)算法,运营商可以近似并迭代地解决网络选择问题。数值结果表明,与相同的操作成本相比,GP-DNS可以提高DNS的成本延迟性能,并减少大约40%的排队延迟。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号