Designing Least-Cost Nonblocking Broadband Networks

DOI10.1006/JAGM.1997.0866zbMATH Open0884.68004OpenAlexW2068811470MaRDI QIDQ4360132FDOQ4360132

Authors: J. Andrew Fingerhut, Subhash Suri, Jonathan S. Turner 

Publication date: 20 October 1997

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/2716b03dc7adf935839404fb6ef33f57c160d9ab

Recommendations

• scientific article; zbMATH DE number 1532275
• Fast, efficient equipment placement heuristics for broadband switched or internet router net\-works
• scientific article; zbMATH DE number 1862257
• On the design problem of multitechnology networks

zbMATH Keywords

multimedia applicationsintegrated network technologies

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cited In (36)

• Competitive and deterministic embeddings of virtual networks
• Topological design and dimensioning of agile all-photonic networks
• On maximum-sum matchings of points
• Design of trees in the hose model: the balanced case
• Computational Geometry Column 34
• Robust combinatorial optimization with knapsack uncertainty
• Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE
• Robust routing and optimal partitioning of a traffic demand polytope
• Single-sink fractionally subadditive network design
• Fast, efficient equipment placement heuristics for broadband switched or internet router net\-works
• A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation
• Multipolar robust optimization
• Single-commodity robust network design with finite and hose demand sets
• On the robustness of potential-based flow networks
• Polynomial traffic demand polytope partitioning
• Robust alternative fuel refueling station location problem with routing under decision-dependent flow uncertainty
• Center of maximum-sum matchings of bichromatic points
• On the approximability of robust network design
• A capacitated hub location problem under hose demand uncertainty
• Robust optimal discrete arc sizing for tree-shaped potential networks
• A note on hierarchical hubbing for a generalization of the VPN problem
• Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors
• Exploring the tractability of the capped hose model
• Network design with a discrete set of traffic matrices
• A comparison of routing sets for robust network design
• Static and dynamic routing under disjoint dominant extreme demands
• Robust network design: formulations, valid inequalities, and computations
• Short paper -- A note on robust combinatorial optimization with generalized interval uncertainty
• On improving optimal oblivious routing
• Affine routing for robust network design
• New discoveries of domination between traffic matrices
• The robust network loading problem with dynamic routing
• Generalized hose uncertainty in single-commodity robust network design
• A mathematical framework for designing a low-loss, low-delay internet
• A mathematical model and related problems of optimal management and design in a broadband integrated services network
• Oblivious OSPF routing with weight optimization under polyhedral demand uncertainty

This page was built for publication: Designing Least-Cost Nonblocking Broadband Networks

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