Flow-level and efficient traffic engineering in conventional routing systems

Flow-level and efficient traffic engineering in conventional routing systems
复制标题

传统路由系统中的流级和高效流量工程

DOI:
10.1016/j.comnet.2020.107671
复制
发表时间:
2020-11
期刊:
Elsevier Computer Networks
影响因子:
--
通讯作者:
Mingwei Xu
Mingwei Xu
中科院分区:
其他
文献类型:
--
作者:
Nan Geng;Yuan Yang;Mingwei Xu

文献摘要

参考文献

相似文献

现有的流级流量工程(TE)解决方案通常依赖于SDN或MPLS的部署。本文在传统逐跳路由协议的基础上,设计了一种流级高效的TE方案,即,OSPF。通过对真实的网络流量的分析和建模,提出了一种对少量大流量进行实时检测和调度的方法。大流量的重路由路径在一个集中式服务器中计算,并通过扩展的OSPF分布。一些ACL条目用于流级转发。我们形式化了基于链路权重分配的大流调度问题,并证明了该问题是NP-难的。我们建议预先计算几个候选路径,以减少决策计算开销和路径拉伸。我们开发了一个算法的性能界限分配大流量的路径,和两个算法,以减少额外的LSA数为不同的系统设计。实验结果表明,该方案可以在0.5s内实现大流量的重路由.仿真结果表明,我们的方案得到的拥塞度量值(即,性能比)比基于源地址和目的地地址的流的最优值差10%。我们的优化机制减少了额外的LSA数量和计算时间分别为87%和83%,我们的计划与预先计算的路径。
Existing solutions of flow-level traffic engineering (TE) usually depend on the deployment of SDN or MPLS. In this paper, we design a flow-level and efficient TE scheme based on the conventional hop-by-hop routing protocol, i.e., OSPF. Motivated by the analysis and modeling on the real Internet traffic, we propose to detect and schedule a few large flows in real-time. The rerouting paths for large flows are computed in a centralized server and are distributed through extended OSPF. A few ACL entries are used for flow-level forwarding. We formalize the link weight assignment-based large flow scheduling problem and prove the problem is NP-hard. We propose to precompute several candidate paths to reduce decision computation overhead and path stretch. We develop an algorithm with performance bounds to allocate large flows to paths, and two algorithms to reduce extra LSA number for different system designs. Experiment results show our scheme can reroute large flows within 0.5 s. Simulation results show our scheme gets congestion metric values (i.e., performance ratios) 10% worse than the optimal for source and destination addresses-based flows. Our optimization mechanisms reduce the extra LSA number and computation time by 87% and 83% respectively for our scheme with pre-computed paths.
DOI: 10.1109/icdcs.2010.57
发表时间: 2010-06
期刊: 2010 IEEE 30th International Conference on Distributed Computing Systems
影响因子: --
作者:
Chengchen Hu;B. Liu;Hongbo Zhao;Kai Chen;Yan Chen;Chunming Wu;Y. Cheng
通讯作者: Chengchen Hu;B. Liu;Hongbo Zhao;Kai Chen;Yan Chen;Chunming Wu;Y. Cheng
DOI: 10.1109/infcom.2013.6567024
发表时间: 2013-04
期刊: 2013 Proceedings IEEE INFOCOM
影响因子: --
作者:
Sugam Agarwal;M. Kodialam;T. V. Lakshman
通讯作者: Sugam Agarwal;M. Kodialam;T. V. Lakshman
DOI: 10.1145/863955.863991
发表时间: 2003-08
期刊: --
影响因子: --
作者:
David L. Applegate;E. Cohen
通讯作者: David L. Applegate;E. Cohen
DOI: 10.1007/bf02579324
发表时间: 1987-01-01
期刊: COMBINATORICA
影响因子: 1.1
作者:
RAGHAVAN, P;THOMPSON, CD
通讯作者: THOMPSON, CD
DOI: 10.1145/633025.633041
发表时间: 2002-10
期刊: --
影响因子: --
作者:
A. Medina;N. Taft;Kave Salamatian;S. Bhattacharyya;C. Diot
通讯作者: A. Medina;N. Taft;Kave Salamatian;S. Bhattacharyya;C. Diot