An algorithm for optimal minimax routing in ATM networks

DOI10.1007/BF02031597MaRDI QIDQ1319832zbMATH OpenFDO

Authors Ming-Jeng Lee, James R. Yee

Publication date 9 May 1994

Published in Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

multicommodity network flowATM networkglobal optimal flow assignmentminimax routing algorithm

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Recommendations

• scientific article; zbMATH DE number 3922330
• ATM network design: Traffic models and optimization-based heuristics
• scientific article; zbMATH DE number 1332662
• A parallel optimization approach to ATM network survivability
• ATM routing algorithms for multimedia traffic in private ATM networks

Cites work

• scientific article; zbMATH DE number 3791942 (Why is no real title available?)
• A Minimum Delay Routing Algorithm Using Distributed Computation
• Analysis of Circuit-Switched Networks Employing Originating-Office Control with Spill-Forward
• Optimal Routing in a Packet-Switched Computer Network
• The flow deviation method: An approach to store‐and‐forward communication network design

Cited in

(7)

• scientific article; zbMATH DE number 98410 (Why is no real title available?)
• ATM network design: Traffic models and optimization-based heuristics
• Asynchronous transfer mode networks with parallel links and multiple service classes
• ATM routing algorithms for multimedia traffic in private ATM networks
• Optimal routing in non-geostationary satellite ATM networks with intersatellite link capacity constraints
• A parallel optimization approach to ATM network survivability
• On the design of efficient ATM routing schemes

This page was built for publication: An algorithm for optimal minimax routing in ATM networks

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