Linear Capacity Algorithms for Multicommodity Flow Problems in Computer WAN

2017 25th International Conference on Systems Engineering (ICSEng) Pub Date : 2017-08-01 DOI:10.1109/ICSEng.2017.17

A. F. Zantuti

引用次数: 0

Abstract

The problem consists in selection of multicommodity flow routes and channel capacities and the paper presents the algorithm for capacity and routing assignment problem to minimize the average delay per packet subject to the budget constraint.

查看原文本刊更多论文

计算机广域网中多商品流问题的线性容量算法

该问题包括多商品流路由和通道容量的选择，本文提出了在预算约束下最小化平均数据包延迟的容量和路由分配问题的算法。

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

求助全文

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

来源期刊

2017 25th International Conference on Systems Engineering (ICSEng)

自引率

0.00%

发文量