首页> 外文期刊>IEEE/ACM Transactions on Networking >Elastic Traffic Engineering Subject to a Fair Bandwidth Allocation via Bilevel Programming
【24h】

Elastic Traffic Engineering Subject to a Fair Bandwidth Allocation via Bilevel Programming

机译:弹性交通工程通过Bilevel编程,通过BileVel编程进行公平的带宽分配

获取原文
获取原文并翻译 | 示例

摘要

The ability of TCP’s congestion control scheme to adapt the rate of traffic flows and fairly use all the available resources is one of the Internet’s pillars. So far, however, the elasticity of traffic has been disregarded in traffic engineering (TE) methodologies mainly because, only recently, the increase in access capacity has moved the bottlenecks from the access network to the operator network and hungry cloud-based applications have begun to use all the available bandwidth. We propose a new approach to TE with elastic demands which models the interaction between the network operator and the end-to-end congestion control scheme as a Stackelberg game . Given a set of elastic traffic demands only specified by their origin-destination pairs, the network operator chooses a set of routing paths (leader’s problem) which, when coupled with the fair bandwidth allocation that the congestion control scheme would determine for the chosen routing (follower’s problem), maximizes a network utility function. We present bilevel programming formulations for the above TE problem with two widely-adopted bandwidth allocation models, namely, max-min fairness and proportional fairness, and derive corresponding exact and approximate single-level mathematical programming reformulations. After discussing some key properties, we report on computational results obtained for different network topologies and instance sizes. Interestingly, even feasible solutions to our bilevel TE problems with large optimality gaps yield substantially higher network utility values than those obtained by solving a standard single-level TE problem and then fairly reallocating the bandwidth a posteriori .
机译:TCP拥塞控制方案适应交通流量的能力和相当使用的所有可用资源都是互联网的支柱之一。然而,到目前为止,流量的弹性已经忽略了交通工程(TE)方法,主要是因为,只有最近,访问能力的增加已经将来自接入网络的瓶颈移动到操作员网络和饥饿的基于云的应用程序已经开始使用所有可用带宽。我们提出了一种具有弹性需求的TE的新方法,这些方法模拟了网络运营商与端到端拥塞控制方案之间的交互作为<斜体XMLNS:MML =“http://www.w3.org/1998/math / mathml“xmlns:xlink =”http://www.w3.org/1999/xlink“> Stackelberg游戏。给定一组仅由他们的原始目标对指定的弹性流量需求,网络运营商选择一组路由路径(领导者的问题),当耦合与拥塞控制方案将确定所选路由的公平带宽分配时(追随者的问题),最大化网络实用程序功能。我们为上述TE问题提供了双重采用的带宽分配模型,即MAX-MIN公平性和比例公平性,并导出了相应的精确和近似单级数学规划重新装配。在讨论某些关键属性之后,我们报告为不同的网络拓扑和实例大小获得的计算结果。有趣的是,对于我们的Bilevel TE问题的甚至可行的解决方案具有大的最优性差距的问题,而不是通过解决标准单级TE问题而获得的网络实用程序值,然后相当重新分配带宽<斜斜体XMLNS:MML =“http:// www .w3.org / 1998 / math / mathml“xmlns:xlink =”http://www.w3.org/1999/xlink“> postiori

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号