Study of scalability properties of two LP-based algorithms for traffic engineering in a flat differentiated services network

2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552) Pub Date : 2001-05-29 DOI:10.1109/HPSR.2001.923628

S. Van den Bosch, P. de La Vallee-Poussin, G. Van Hoey, H. de Neve, G. Petit

引用次数: 1

Abstract

Two mixed-integer linear programming (MILP) formulations of a centralized, off-line traffic engineering tool are compared with respect to their scalability properties. Such an algorithm can be used to optimize the routing configuration in a DiffServ network. It is shown that a considerable reduction of the number of variables and constraints can be obtained by pairing primary and protection path candidates prior to the routing optimization. Simulations of networks with different sizes evidence this result,.

查看原文本刊更多论文

扁平差别化业务网络中两种基于lp的流量工程算法的可扩展性研究

比较了集中式离线流量工程工具的两种混合整数线性规划(MILP)公式的可扩展性。该算法可用于优化DiffServ网络中的路由配置。结果表明，在优化路径之前，通过对主路径和保护路径进行配对，可以大大减少变量和约束的数量。对不同规模网络的模拟证明了这一结果。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552)

自引率

0.00%

发文量