Linear Programming and Algorithms for Communication Networks
Authors: Eiji Oki
ISBN-10: 1138034096
ISBN-13: 9781138034099
Edition 版次: 1
Publication Date 出版日期: 2016-11-16
Print Length 页数: 208 pages
Book Description
By finelybook
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.
Contents
Preface
1. Optimization problems for communications networks
2. Basics of linear programming
3. GLPK(GNU Linear Programming Kit)
4. Basic problems for communication networks
5. Disjoint path routing
6. Optical wavelength-routed network
7. Routing and traffic-demand model
8. IP routing
9. Mathematical puzzles
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
