Skip to:Content
|
Bottom
Cover image for Linear programming and algorithms for communication networks : a practical guide to network design, control, and management
Title:
Linear programming and algorithms for communication networks : a practical guide to network design, control, and management
Personal Author:
Publication Information:
Boca Raton : CRC Press, 2013
Physical Description:
xiii, 194 p. : ill. ; 24 cm.
ISBN:
9781466552630
General Note:
Includes index

Available:*

Library
Item Barcode
Call Number
Material Type
Item Category 1
Status
Searching...
35000000002483 TK5105.5 O35 2013 Open Access Book Book
Searching...
Searching...
30000010315768 TK5105.5 O35 2013 Open Access Book Book
Searching...

On Order

Summary

Summary

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.


Author Notes

Eiji Oki is an Associate Professor at the University of Electro-Communications, Tokyo, Japan. He received the B.E. and M.E. degrees in instrumentation engineering and a Ph.D. degree in electrical engineering from Keio University, Yokohama, Japan, in 1991, 1993, and 1999, respectively. In 1993, he joined Nippon Telegraph and Telephone Corporation (NTT) Communication Switching Laboratories, Tokyo, Japan. He has been researching network design and control, traffic-control methods, and high-speed switching systems. From 2000 to 2001, he was a Visiting Scholar at the Polytechnic Institute of New York University, Brooklyn, New York, where he was involved in designing terabit switch/router systems. He was engaged in researching and developing high-speed optical IP backbone networks with NTT Laboratories. He joined the University of Electro-Communications, Tokyo, Japan, in July 2008.

He has been active in THE standardization of path computation element (PCE) and GMPLS in IETF. He wrote more than ten IETF RFCs and drafts. He served as a Guest Co-Editor for the Special Issue on "Multi-Domain Optical Networks: Issues and Challenges," June 2008, in IEEE Communications Magazine; a Guest Co-Editor for the Special Issue on Routing, "Path Computation and Traffic Engineering in Future Internet," December 2007, in the Journal of Communications and Networks; a Guest Co-Editor for the Special Section on "Photonic Network Technologies in Terabit Network Era," April 2011, in IEICE Transactions on Communications; a Technical Program Committee (TPC) Co-Chair for the Workshop on High-Performance Switching and Routing in 2006, 2010 and 2012; a Track Co-Chair on Optical Networking for ICCCN 2009; a TPC Co-Chair for the International Conference on IP+Optical Network (iPOP 2010); and a Co-Chair of Optical Networks and Systems Symposium for IEEE International Conference on Communications (ICC 2011).

Prof. Oki was the recipient of the 1998 Switching System Research Award and the 1999 Excellent Paper Award presented by IEICE, the 2001 Asia-Pacific Outstanding Young Researcher Award presented by IEEE Communications Society for his contribution to broadband network, ATM, and optical IP technologies, and the 2010 Telecom System Technology Prize by the Telecommunications Advanced Foundation.

He has co-authored three books, Broadband Packet Switching Technologies, published by John Wiley, New York, in 2001, GMPLS Technologies, published by CRC Press, Boca Raton, FL, in 2005, and Advanced Internet Protocols, Services, and Applications, which will be published by Wiley in March 2012. He is an IEEE Senior Member.


Table of Contents

Prefacep. ix
1 Optimization problems for communications networksp. 1
1.1 Shortest path problemp. 2
1.2 Max flow problemp. 2
1.3 Minimum-cost flow problemp. 3
2 Basics of linear programmingp. 5
2.1 Optimization problemp. 5
2.2 Linear programming problemp. 7
2.3 Simplex methodp. 14
2.4 Dual problemp. 18
2.5 Integer linear programming problemp. 20
3 GLPK (GNU Linear Programming Kit)p. 25
3.1 How to obtain GLPK and install itp. 25
3.2 Usage of GLPKp. 26
4 Basic problems for communication networksp. 31
4.1 Shortest path problemp. 31
4.1.1 Linear programming problemp. 31
4.1.2 Dijkstra's algorithmp. 40
4.1.3 Bellman-Ford algorithmp. 43
4.2 Max flow problemp. 45
4.2.1 Linear programming problemp. 45
4.2.2 Ford-Fulkerson algorithmp. 50
4.2.3 Max flow and minimum cutp. 53
4.3 Minimum-cost flow problemp. 54
4.3.1 Linear programming problemp. 54
4.3.2 Cycle-canceling algorithmp. 59
4.4 Relationship among three problemsp. 62
5 Disjoint path routingp. 65
5.1 Basic disjoint path problemp. 65
5.1.1 Integer linear programming problemp. 65
5.1.2 Disjoint shortest pair algorithmp. 69
5.1.3 Suurballe's algorithmp. 70
5.2 Disjoint paths with shared risk link groupp. 71
5.2.1 Shared risk link group (SRLG)p. 71
5.2.2 Integer linear programmingp. 73
5.2.3 Weight-SRLG algorithmp. 77
5.3 Disjoint paths in multi-cost networksp. 80
5.3.1 Multi-cost networksp. 80
5.3.2 Integer linear programming problemp. 81
5.3.3 KPA: k-penalty with auxiliary link costs matrixp. 82
5.3.4 KPI: k-penalty with initial link costs matrixp. 87
5.3.5 Performance comparison of KPA and KPIp. 87
6 Optical wavelength-routed networkp. 93
6.1 Wavelength assignment problemp. 93
6.2 Graph coloring problemp. 96
6.3 Integer linear programmingp. 96
6.4 Largest degree firstp. 99
7 Routing and traffic-demand modelp. 103
7.1 Network modelp. 103
7.2 Pipe modelp. 104
7.3 Hose modelp. 105
7.4 HSDT modelp. 108
7.5 HLT modelp. 113
8 IP routingp. 123
8.1 Routing protocolp. 123
8.2 Link weights and routingp. 124
8.2.1 Tabu searchp. 126
8.3 Preventive start-time optimization (PSO)p. 131
8.3.1 Three policies to determine link weightsp. 131
8.3.2 PSO modelp. 132
8.3.3 PSO-Lp. 133
8.3.4 PSO-Wp. 137
8.3.5 PSO-W algorithm based on tabu searchp. 137
8.4 Performance of PSO-Wp. 138
9 Mathematical puzzlesp. 145
9.1 Sudoku puzzlep. 145
9.1.1 Overviewp. 145
9.1.2 Integer linear programming problemp. 146
9.2 River crossing puzzlep. 149
9.2.1 Overviewp. 149
9.2.2 Integer linear programming approachp. 150
9.2.3 Shortest path approachp. 159
9.2.4 Comparison of two approachesp. 161
9.3 Lattice puzzlep. 161
9.3.1 Overviewp. 161
9.3.2 Integer linear programmingp. 162
A Derivation of Eqs. (7.6a)-(7.6c) for hose modelp. 167
B Derivation of Eqs. (7.12a)-(7.12c) for HSDT modelp. 169
C Derivation of Eqs. (7.16a)-(7.16d) for HLT modelp. 173
Answers to Exercisesp. 177
Indexp. 193
Go to:Top of Page