...
首页> 外文期刊>Communications, IEEE Transactions on >Opportunistic link overbooking for resource efficiency under per-flow service guarantee
【24h】

Opportunistic link overbooking for resource efficiency under per-flow service guarantee

机译:每流服务保证下的机会性链接超量预订以提高资源效率

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

获取外文期刊封面封底 >>

       

摘要

The trade-off between resource efficiency and Quality of Service (QoS) is always a vital issue for communication networks, and link overbooking is a common technique used to improve resource efficiency. How to properly overbook a link and analytically determine its overbooking factor under QoS constraints are still problems, especially when achieving advanced QoS by per-flow queueing, as urged by the emerging mobilized applications in the access networks. This paper first proposes an Opportunistic Link Overbooking (OLO) scheme for an edge gateway to improve its link efficiency, and then develops an integrated analytical framework for determining the suitable link overbooking factor with service guarantee on flow level. In our scheme, once the idle time of a high priority flow¿s quasi-dedicated link is larger than a specified threshold, the link is temporarily overbooked to a low priority flow; and then when the high priority flow¿s subsequent packets start arriving, the link can be recovered at the expense of a setup delay. To explore the balance between link efficiency and the flow¿s QoS in the proposed scheme, we develop the corresponding queueing model under either bounded packet delay (relevant to delaysensitive flow) or finite buffer size (relevant to loss-sensitive flow). Our queueing analysis reveals the inherent trade-offs among the link overbooking factor, packet loss rate and delay/jitter under different traffic patterns.
机译:资源效率与服务质量(QoS)之间的权衡始终是通信网络的重要问题,链路超额预订是用于提高资源效率的常用技术。在接入网络中新兴的移动应用程序的推动下,如何在QoS约束下正确地超额预订链路并分析确定其超额预订因素仍然是个问题,尤其是当通过按流排队实现高级QoS时。本文首先提出了一种边缘网关机会性链路超额预订(OLO)方案,以提高其链路效率,然后开发了一个综合分析框架,用于确定流量级别的服务保证下合适的链路超额预订因子。在我们的方案中,一旦高优先级流的准专用链路的空闲时间大于指定的阈值,则该链路将被暂时超额预订为低优先级流;然后当高优先级流的后续数据包开始到达时,可以以建立延迟为代价恢复链接。若要探索链路效率和流的QoS在提出的方案之间的平衡,我们在有界包延迟(与延迟敏感流有关)或有限缓冲区大小(与丢失敏感流有关)下开发了相应的排队模型。我们的排队分析揭示了在不同流量模式下链路超额预订因子,丢包率和延迟/抖动之间的内在平衡。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号