Linear Programming and Algorithms for Communication Networks

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 communicationsAddresses optimization problems in optical wavelength-routed networksDescribes several routing strategies for maximizing network utilization for various traffic-demand modelsConsiders routing problems in Internet Protocol (IP) networksPresents 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.

Autorentext

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 Swi

Inhalt

Optimization problems for communication networks. Basics of mathematical programming. GLPK (GNU Linear Programming Kit). Basic problems for communication networks. Disjoint Path Routing. Optical wavelength-routed network. Routing and traffic-demand model. IP routing. Routing with Network Coding Effect.