Continuous Models for Capacity Design of Large Packet-Switched Telecommunication Networks

DOI10.1287/IJOC.1.4.271MaRDI QIDQ4020664zbMATH OpenOpenAlexFDO

Authors Ronald V. Simmons, Larry J. Le Blanc

Publication date 17 January 1993

Published in ORSA Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.1.4.271

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Nonlinear programming (90C30)

Cited in

(11)

• An algorithm for network dimensioning under reliability considerations
• Optimal design of LAN-WAN internetworks: An approach using simulated annealing
• The design of service systems with queueing time cost, workload capacities and backup service
• Solution procedures for the service system design problem
• Routing and capacity assignment in backbone communication networks
• Service system design for managing interruption risks: a backup-service risk-mitigation strategy
• A tabu search algorithm for the routing and capacity assignment problem in computer networks
• Routing and capacity assignment in backbone communication networks under time varying traffic conditions
• Shortest paths, single origin‐destination network design, and associated polyhedra
• The multi-hour service system design problem
• Designing service system networks with interruption risks

This page was built for publication: Continuous Models for Capacity Design of Large Packet-Switched Telecommunication Networks

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