Two methods for minimum cost synthesis of link-disjoint, hop-limited virtual paths in ATM networks

被引：0

作者：

Choudhury, S ^{[1
]}

Berry, LTM ^{[1
]}

机构：

[1] RMIT Univ, Dept Comp Syst Engn, Melbourne, Vic 3001, Australia

来源：

TELETRAFFIC ENGINEERING IN A COMPETITIVE WORLD | 1999年 / 3卷

关键词：

ATM; network planning; hop-limit; minimum cost flow; network synthesis; virtual paths;

D O I：

暂无

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

A method for synthesising link-disjoint Virtual Paths (VPs) at minimum cost in ATM networks is described in [1]; in the minimum cost synthesis, a physical network topology is determined and transmission capacities are allocated to the VPs. In this paper, we extend the method to allow for a hop-limit constraint in the VP synthesis. To solve the problem of minimum cost VP synthesis subject to a hop-limit constraint, we have developed two effective heuristic methods for solving a hop-limited minimum cost flow problem with link-disjoint path constraints. The link cost functions are the sums of constant costs and variable (capacity dependent) costs. The methods are analysed and illustrated with examples.

引用

页码：613 / 622

页数：10