Maximum Throughput Routing of Traffic in the Hose Model
Maximum Throughput Routing of Traffic in the Hose Model
复制标题
软管模型中流量的最大吞吐量路由
DOI：
--
复制
发表时间：
2006
期刊：
影响因子：
--
通讯作者：
S. Sengupta
中科院分区：
文献类型：
--
作者：
M. Kodialam;T. V. Lakshman;S. Sengupta
一种计算机实现的方法，用于计算由链路互连的节点网络的数据路由方案的吞吐量，所述节点网络具有至少一个入口点和至少一个出口点。该方法包括：从第一线性规划和第二线性规划的组合导出多项式大小的线性规划，并求解所述多项式大小的线性规划。第一线性规划具有无限约束并且最小化入口点和出口点之间的路径中的链路的最大链路利用率。第二线性程序确定是否违反第一线性程序的任何约束。
A computer-implemented method of computing throughput of a data-routing scheme for a network of nodes interconnected by links and having at least one ingress point and at least one egress point. The method includes: deriving a polynomial-size linear program from a combination of a first linear program and a second linear program and solving the polynomial-size linear program. The first linear program has infinite constraints and minimizes maximum-link utilization of a link in a path between the ingress point and the egress point. The second linear program determines whether any constraint of the first linear program is violated.