scientific article; zbMATH DE number 2150800

Publication date: 30 March 2005

Full work available at URL: http://www.sciencedirect.com/science/book/9780125571890

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

optimization models traffic routing computer network design resource capacity optimization

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Network design and communication in computer systems (68M10)

Related Items (56)

Survivable network design with shared-protection routing ⋮ Integral flow decomposition with minimum longest path length ⋮ Near optimal design of wavelength routed optical networks ⋮ Max-min fairness in multi-commodity flows ⋮ A hybrid column generation with GRASP and path relinking for the network load balancing problem ⋮ A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem ⋮ Network design in scarce data environment using moment-based distributionally robust optimization ⋮ Traffic engineering of tunnel-based networks with class specific diversity requirements ⋮ Mixed integer non-linear programming models for green network design ⋮ A mixed-integer approach to Core-Edge design of storage area networks ⋮ Telecommunications network design: Technology impacts and future directions ⋮ An extreme‐point tabu‐search algorithm for fixed‐charge network problems ⋮ An efficient approach to optimization of semi‐stable routing in multicommodity flow networks ⋮ A Flow Deviation Algorithm for Joint Optimization of Unicast and Anycast Flows in Connection-Oriented Networks ⋮ Survivable network design with demand uncertainty ⋮ A nonlinear multiobjective bilevel model for minimum cost network flow problem in a large-scale construction project ⋮ An Integer Programming Algorithm for Routing Optimization in IP Networks ⋮ On a bicriterion server allocation problem in a multidimensional Erlang loss system ⋮ Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs ⋮ Optimal design of virtual links in AFDX networks ⋮ Fractional routing using pairs of failure-disjoint paths ⋮ A Hierarchical Multiobjective Routing Model for MPLS Networks with Two Service Classes ⋮ Path generation for affine flow thinning ⋮ Nash equilibrium design and price-based coordination in hierarchical systems ⋮ Lagrangean heuristic for primary routes assignment in survivable connection-oriented networks ⋮ Maximizing residual capacity in connection-oriented networks ⋮ Intra-domain traffic engineering with shortest path routing protocols ⋮ Models for the piecewise linear unsplittable multicommodity flow problems ⋮ Modeling the steering of international roaming traffic ⋮ Large margin shortest path routing ⋮ An \(s\)-\(t\) connection problem with adaptability ⋮ Optimizing Flow Thinning Protection in Multicommodity Networks with Variable Link Capacity ⋮ Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE ⋮ An integer programming algorithm for routing optimization in IP networks ⋮ Intra-domain traffic engineering with shortest path routing protocols ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs ⋮ Optimization algorithms for resilient path selection in networks ⋮ Realizing secret sharing with general access structure ⋮ A New Necessary Condition for Shortest Path Routing ⋮ Towards optimizing the deployment of optical access networks ⋮ On the isometric path partition problem ⋮ Inequality measures and equitable locations ⋮ Securely Connected Facility Location in Metric Graphs ⋮ Graphs and Algorithms in Communication Networks on Seven League Boots ⋮ Routing Optimization in Optical Burst Switching Networks: a Multi-path Routing Approach ⋮ Optimization of OSPF Routing in IP Networks ⋮ An improved Benders decomposition applied to a multi-layer network design problem ⋮ Refined parameterizations for computing colored cuts in edge-colored graphs ⋮ Core-edge design of storage area networks-a single-edge formulation with problem-specific cuts ⋮ Threshold accepting heuristic for fair flow optimization in wireless mesh networks ⋮ Editorial. Fair optimization and networks: models, algorithms, and applications ⋮ An approximation algorithm for the facility location problem with lexicographic minimax objective ⋮ Fair optimization and networks: a survey

This page was built for publication: