Traffic engineering using multiple multipoint-to-point LSPs
Traffic engineering using multiple multipoint-to-point LSPs
复制标题
使用多个多点到点 LSP 的流量工程
DOI：
--
复制
发表时间：
2000
期刊：
影响因子：
--
通讯作者：
Makiko Yoshida
中科院分区：
文献类型：
--
作者：
H. Saito;Y. Miyao;Makiko Yoshida
流量工程旨在优化现有网络资源的利用，以实现负载平衡和故障恢复，这些都需要以可扩展的方式完成。本文提出了一种使用多个多点对点标签交换路径（LSP）的流量工程方案，可以减少LSP的数量和链路中所需标签的数量。该方案由m-t-p LSP创建和流量分配两部分组成。首先选择路由，然后设计m-t-p LSP来包含路由。m-t-p LSP设计问题被表述为一个0-1整数规划问题。流分配问题被表述为一个混合整数规划问题，其中最大链路负载即最大拥塞最小化。与传统的点到点LSP方法的数值比较表明，m-t-p LSP方法可以减少所需LSP和标签的数量。此外，与传统的基于最短路径的快速流分配的数值比较表明，该流分配方案可以降低最大链路负载。
Traffic engineering aims to optimize the utilization of existing network resources for load balance and failure recovery, and these are to be accomplished in a scalable fashion. This paper proposes a traffic engineering scheme using multiple multipoint-to-point (m-t-p) label switched paths (LSP) which can reduce the number of LSP and required labels in links. The scheme consists of m-t-p LSP creation and flow assignment. Routes are first selected, and m-t-p LSP are designed to include them. The m-t-p LSP design problem is formulated as a 0-1 integer programming problem. The flow assignment problem is formulated as a mixed integer programming problem in which maximum link load, i.e., maximum congestion, is minimized. Numerical comparisons with the conventional point-to-point LSP approach show that the m-t-p LSP approach can reduce the number of required LSP and labels. Moreover, numerical comparisons with conventional shortest path fast-based flow assignment show that our flow assignment scheme can reduce maximum link load.