On the selection of primary paths for a communication network

DOI10.1016/0169-7552(85)90001-7MaRDI QIDQ3713826zbMATH OpenOpenAlexFDO

Authors Dong-wan Tcha, Kiyoshi Maruyama

Publication date 1985

Published in Computer Networks and ISDN Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0169-7552(85)90001-7

zbMATH Keywords

average network delaycommunication networkComputational experiencecongestionconvergenceheuristic algorithmlower boundsmaximum link utilization factormixed 0-1 linear programmingmulticommodity flowsnon-bifurcated static flow assignmentroutingsuboptimal solution

Mathematics Subject Classification ID

Paths and cycles (05C38) Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10) Mixed integer programming (90C11) Applications of graph theory to circuits and networks (94C15)

Recommendations

• scientific article; zbMATH DE number 3922330
• Primary and secondary route selection in backbone communication networks
• scientific article; zbMATH DE number 4149863
• Primary and Secondary Route Selection in Backbone Computer Networks
• The flow deviation method: An approach to store‐and‐forward communication network design

Cited in

(7)

• Primary and secondary route selection in backbone communication networks
• Routing and capacity assignment in backbone communication networks
• Routing and capacity assignment in backbone communication networks under time varying traffic conditions
• Graceful reassignment of excessively long communications paths in networks
• Primary and Secondary Route Selection in Backbone Computer Networks
• An enhanced Benders decomposition method for unique shortest path routing
• Optimal path selection for minimizing the differential delay in Ethernet-over-SONET

This page was built for publication: On the selection of primary paths for a communication network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3713826)