Linear programming and algorithms for communication networks : a practical guide to network design, control, and management /: a practical guide to network design, control, and management. (2012)
- Record Type:
- Book
- Title:
- Linear programming and algorithms for communication networks : a practical guide to network design, control, and management /: a practical guide to network design, control, and management. (2012)
- Main Title:
- Linear programming and algorithms for communication networks : a practical guide to network design, control, and management
- Further Information:
- Note: Eiji Oki.
- Other Names:
- Oki, Eiji, 1969-
- Contents:
- Optimization Problems for Communications Networks; Shortest path problem; Max flow problem; Minimum-cost flow problem Basics of Linear Programming; Optimization problem; Linear programming problem; Simplex method; Dual problem; Integer linear programming problem GLPK (GNU Linear Programming Kit); How to obtain GLPKand install it; Usage of GLPK Basic Problems for Communication Networks; Shortest path problem; Linear programming problem Dijkstra’s algorithm Bellman-Ford algorithm; Max flow problem Linear programming problem Ford-Fulkerson algorithm Max flow and minimum cut; Minimum-cost flow problem Linear programming problem Cycle-canceling algorithm; Relationship among three problems Disjoint Path Routing; Basic disjoint path problem Integer linear programming problem Disjoint shortest pair algorithm Suurballe’s algorithm; Disjoint paths with shared risk link group Shared risk link group (SRLG) Integer linear programming; Weight-SRLG algorithm; Disjoint paths in multi-cost networks Multi-cost networks Integer linear programming problem KPA: k -penalty with auxiliary link costs matrix; KPI: k -penalty with initial link costs matrix Performance comparison of KPA and KPI Optical Wavelength-Routed Network; Wavelength assignment problem; Graph coloring problem; Integer linear programming; Largest degree first Routing and Traffic-Demand Model; Networkmodel; Pipemodel; Hosemodel; HSDT model; HLT model IP Routing; Routing protocol; Link weights and routing Tabu search; PreventiveOptimization Problems for Communications Networks; Shortest path problem; Max flow problem; Minimum-cost flow problem Basics of Linear Programming; Optimization problem; Linear programming problem; Simplex method; Dual problem; Integer linear programming problem GLPK (GNU Linear Programming Kit); How to obtain GLPKand install it; Usage of GLPK Basic Problems for Communication Networks; Shortest path problem; Linear programming problem Dijkstra’s algorithm Bellman-Ford algorithm; Max flow problem Linear programming problem Ford-Fulkerson algorithm Max flow and minimum cut; Minimum-cost flow problem Linear programming problem Cycle-canceling algorithm; Relationship among three problems Disjoint Path Routing; Basic disjoint path problem Integer linear programming problem Disjoint shortest pair algorithm Suurballe’s algorithm; Disjoint paths with shared risk link group Shared risk link group (SRLG) Integer linear programming; Weight-SRLG algorithm; Disjoint paths in multi-cost networks Multi-cost networks Integer linear programming problem KPA: k -penalty with auxiliary link costs matrix; KPI: k -penalty with initial link costs matrix Performance comparison of KPA and KPI Optical Wavelength-Routed Network; Wavelength assignment problem; Graph coloring problem; Integer linear programming; Largest degree first Routing and Traffic-Demand Model; Networkmodel; Pipemodel; Hosemodel; HSDT model; HLT model IP Routing; Routing protocol; Link weights and routing Tabu search; Preventive start-time optimization (PSO) Three policies to determine link weights PSOmodel PSO-L PSO-W PSO-W algorithm based on tabu search; Performance of PSO-W Mathematical Puzzles; Sudoku puzzle Overview Integer linear programming problem; River crossing puzzle Overview Integer linear programming approach Shortest path approach; Comparison of two approaches; Lattice puzzle Overview Integer linear programming; ; A. Derivation of Eqs. (7.6a)–(7.6c) for hose model; B. Derivation of Eqs. (7.12a)–(7.12c) for HSDT model; C. Derivation of Eqs. (7.16a)–(7.16d) for HLT model Answers to Exercises Index … (more)
- Publisher Details:
- Place of publication not identified : CRC Press
- Publication Date:
- 2012
- Extent:
- 1 online resource (208 pages), (95 illustrations)
- Subjects:
- 004.60151972
Computer networks -- Design and construction
Linear programming
Communication -- Network analysis
Telecommunication - Languages:
- English
- ISBNs:
- 9781466578609
1466578602 - Access Rights:
- Legal Deposit; Only available on premises controlled by the deposit library and to one user at any one time; The Legal Deposit Libraries (Non-Print Works) Regulations (UK).
- Access Usage:
- Restricted: Printing from this resource is governed by The Legal Deposit Libraries (Non-Print Works) Regulations (UK) and UK copyright law currently in force.
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library HMNTS - ELD.DS.145619
- Ingest File:
- 02_098.xml