Browse by Category

Linear Programming and Algorithms for Communication Networks: A Practical Guide to Network Design, Control,...
— —
Eiji Oki (Communication and Computer Engineering, Grad School of Informatics, Kyoto University)

# Linear Programming and Algorithms for Communication Networks: A Practical Guide to Network Design, Control, and Management

### Eiji Oki (Communication and Computer Engineering, Grad School of Informatics, Kyoto University)

#### 208 pages

##### \$90.99
###### We can order this in for you How long will it take?
order qty:

Explaining how to apply to mathematical programming to network design and control, Linear Programming and Algorithms for Communication Networks: A Practical Guide to Network Design, Control, and Management fills the gap between mathematical programming theory and its implementation in communication networks. From the basics all the way through to more advanced concepts, its comprehensive coverage provides readers with a solid foundation in mathematical programming for communication networks.

Addressing optimization problems for communication networks, including the shortest path problem, max flow problem, and minimum-cost flow problem, the book covers the fundamentals of linear programming and integer linear programming required to address a wide range of problems. It also:

Examines several problems on finding disjoint paths for reliable communications Addresses optimization problems in optical wavelength-routed networks Describes several routing strategies for maximizing network utilization for various traffic-demand models Considers routing problems in Internet Protocol (IP) networks Presents mathematical puzzles that can be tackled by integer linear programming (ILP) Using the GNU Linear Programming Kit (GLPK) package, which is designed for solving linear programming and mixed integer programming problems, it explains typical problems and provides solutions for communication networks. The book provides algorithms for these problems as well as helpful examples with demonstrations. Once you gain an understanding of how to solve LP problems for communication networks using the GLPK descriptions in this book, you will also be able to easily apply your knowledge to other solvers.

By:   Eiji Oki (Communication and Computer Engineering Grad School of Informatics Kyoto University)
Imprint:   CRC Press
Country of Publication:   United Kingdom
Dimensions:   Height: 235mm,  Width: 156mm,
Weight:   381g
ISBN:   9781138034099
ISBN 10:   1138034096
Pages:   208
Publication Date:   November 2016
Audience:   College/higher education ,  College/higher education ,  Primary ,  Primary
Format:   Paperback
Publisher's Status:   Active

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 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