Algorithms for distributing telecommunication traffic on a multiple-ring SONET-based network.

DOI10.1016/S0377-2217(02)00804-4zbMath1053.90022MaRDI QIDQ1420448

J. Cole Smith

Publication date: 2 February 2004

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

Integer programming; Telecommunications; Network flows; Synchronous optical network

Mathematics Subject Classification ID

90B18: Communication networks in operations research

90C05: Linear programming

Related Items

Cutting plane algorithms for solving a stochastic edge-partition problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational investigations of maximum flow algorithms
• Optimal placement of add/drop multiplexers: Static and dynamic models
• Sonet ring sizing with genetic algorithms
• SONET/SDH ring assignment with capacity constraints
• Exact solution of the SONET ring loading problem
• Optimal Placement of Add/Drop Multiplexers: Heuristic and Exact Algorithms
• Enhanced Model Representations for an Intra-Ring Synchronous Optical Network Design Problem Allowing Demand Splitting
• A new approach to the maximum-flow problem
• Facets of the knapsack polytope
• Improved Algorithms for Bipartite Network Flow
• Optimal Load Balancing on Sonet Bidirectional Rings
• The SONET edge‐partition problem
• Clustering for the Design of SONET Rings in Interoffice Telecommunications
• Recent developments in maximum flow algorithms
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm