Multicommodity flow models, failure propagation, and reliable loss network design

被引:21
|
作者
Girard, A [1 ]
Sanso, B
机构
[1] INRS Telecommun, Verdun, PQ H3E 1H6, Canada
[2] Ecole Polytech, Dept Math & Genie Ind, Montreal, PQ H3C 3A7, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
adaptive routing; circuit switching; integrated design; network design; reliability;
D O I
10.1109/90.663942
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Multicommodity flow (MF) models are well known and have been widely used in the design of packet-switched networks. They have also been used as approximations in the design of circuit-switched networks with reliability constraints. In this paper, we investigate the usefulness of multicommodity models both as routing models and as an integral part of design models conceived under the failure propagation strategy. First, we compare the performance measures calculated by the models with results produced by a real-time technique. Next, we study the performance of networks dimensioned with flow models and with !mown adaptive models under failures of transmission facilities when a real-time routing technique is used, Results obtained using realistic data show that the MF models compare favorably with exact dimensioning algorithms when failures are considered.
引用
收藏
页码:82 / 93
页数:12
相关论文
共 50 条
  • [31] Design-balanced capacitated multicommodity network design with heterogeneous assets
    Li, Xiangyong
    Wei, Kai
    Aneja, Y. P.
    Tian, Peng
    OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2017, 67 : 145 - 159
  • [32] Applying Quantum Computing to Solve Multicommodity Network Flow Problem
    Niu, Chence
    Rastogi, Purvi
    Soman, Jaikishan
    Tamuli, Kausik
    Dixit, Vinayak
    IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2025,
  • [33] COMPUTATIONAL COMPARISON AMONG 3 MULTICOMMODITY NETWORK FLOW ALGORITHMS
    ALI, A
    HELGASON, R
    KENNINGTON, J
    LALL, H
    OPERATIONS RESEARCH, 1980, 28 (04) : 995 - 1000
  • [34] Algorithms for discrete and continuous multicommodity flow network interdiction problems
    Lim, Churlzu
    Smith, J. Cole
    IIE TRANSACTIONS, 2007, 39 (01) : 15 - 26
  • [35] A computationally efficient method for nonlinear multicommodity network flow problems
    Lin, SY
    Lin, CH
    NETWORKS, 1997, 29 (04) : 225 - 244
  • [36] A MULTICLASS, MULTICOMMODITY FLOW MODEL OF A FAST PACKET SWITCHED NETWORK
    ROSSITER, MH
    HARRIS, RJ
    AUSTRALIAN TELECOMMUNICATION RESEARCH, 1989, 23 (02): : 39 - 46
  • [37] A Combined Matheuristic for the Piecewise Linear Multicommodity Network Flow Problem
    Katayama, Naoto
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2017, 34 (06)
  • [38] Cost Optimisation Tool for Multicommodity Network Flow Problem in Telecommunications
    Mladenovic, Snezana
    Stefanovic, Ivana
    Jankovic, Sladana
    Uzelac, Ana
    Markovic, Goran
    Zdravkovic, Stefan
    PROMET-TRAFFIC & TRANSPORTATION, 2024, 36 (04): : 608 - 622
  • [40] System reliability of a limited-flow network in multicommodity case
    Lin, Yi-Kuei
    IEEE TRANSACTIONS ON RELIABILITY, 2007, 56 (01) : 17 - 25