Taylor & Francis GroupTaylor & Francis Group
Search all titles
  • Login
  • Hi, User  
    • Your Account
    • Logout
  • Search all titles
  • Search all collections
Linear Programming and Algorithms for Communication Networks
loading
Linear Programming and Algorithms for Communication Networks

A Practical Guide to Network Design, Control, and Management

Linear Programming and Algorithms for Communication Networks

A Practical Guide to Network Design, Control, and Management

ByEiji Oki
Edition 1st Edition
First Published 2012
eBook Published 24 August 2012
Pub. location Boca Raton
Imprint CRC Press
DOIhttps://doi.org/10.1201/b12733
Pages 208 pages
eBook ISBN 9781466552647
SubjectsEngineering & Technology, Mathematics & Statistics
Get Citation

Get Citation

Oki, E. (2013). Linear Programming and Algorithms for Communication Networks. Boca Raton: CRC Press, https://doi.org/10.1201/b12733
ABOUT THIS BOOK

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 m

TABLE OF CONTENTS
chapter 1|4 pages
Optimization problems for communications networks
View abstract
chapter 2|20 pages
Basics of linear programming
View abstract
chapter 3|6 pages
GLPK (GNU Linear Programming Kit)
View abstract
chapter 4|34 pages
Basic problems for communication networks
View abstract
chapter 5|28 pages
Disjoint path routing
View abstract
chapter 6|10 pages
Optical wavelength-routed network
View abstract
chapter 7|20 pages
Routing and traffic-demand model
View abstract
chapter 8|22 pages
IP routing
View abstract
chapter 9|22 pages
Mathematical puzzles
View abstract
chapter |2 pages
A Derivation of Eqs. (7.6a)–(7.6c) for hose model
View abstract
chapter |4 pages
B Derivation of Eqs. (7.12a)–(7.12c) for HSDT model
View abstract
chapter C|4 pages
C Derivation of Eqs. (7.16a)–(7.16d) for HLT model
View abstract
chapter |17 pages
Answers to Exercises
View abstract

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 m

TABLE OF CONTENTS
chapter 1|4 pages
Optimization problems for communications networks
View abstract
chapter 2|20 pages
Basics of linear programming
View abstract
chapter 3|6 pages
GLPK (GNU Linear Programming Kit)
View abstract
chapter 4|34 pages
Basic problems for communication networks
View abstract
chapter 5|28 pages
Disjoint path routing
View abstract
chapter 6|10 pages
Optical wavelength-routed network
View abstract
chapter 7|20 pages
Routing and traffic-demand model
View abstract
chapter 8|22 pages
IP routing
View abstract
chapter 9|22 pages
Mathematical puzzles
View abstract
chapter |2 pages
A Derivation of Eqs. (7.6a)–(7.6c) for hose model
View abstract
chapter |4 pages
B Derivation of Eqs. (7.12a)–(7.12c) for HSDT model
View abstract
chapter C|4 pages
C Derivation of Eqs. (7.16a)–(7.16d) for HLT model
View abstract
chapter |17 pages
Answers to Exercises
View abstract
CONTENTS
ABOUT THIS BOOK

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 m

TABLE OF CONTENTS
chapter 1|4 pages
Optimization problems for communications networks
View abstract
chapter 2|20 pages
Basics of linear programming
View abstract
chapter 3|6 pages
GLPK (GNU Linear Programming Kit)
View abstract
chapter 4|34 pages
Basic problems for communication networks
View abstract
chapter 5|28 pages
Disjoint path routing
View abstract
chapter 6|10 pages
Optical wavelength-routed network
View abstract
chapter 7|20 pages
Routing and traffic-demand model
View abstract
chapter 8|22 pages
IP routing
View abstract
chapter 9|22 pages
Mathematical puzzles
View abstract
chapter |2 pages
A Derivation of Eqs. (7.6a)–(7.6c) for hose model
View abstract
chapter |4 pages
B Derivation of Eqs. (7.12a)–(7.12c) for HSDT model
View abstract
chapter C|4 pages
C Derivation of Eqs. (7.16a)–(7.16d) for HLT model
View abstract
chapter |17 pages
Answers to Exercises
View abstract

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 m

TABLE OF CONTENTS
chapter 1|4 pages
Optimization problems for communications networks
View abstract
chapter 2|20 pages
Basics of linear programming
View abstract
chapter 3|6 pages
GLPK (GNU Linear Programming Kit)
View abstract
chapter 4|34 pages
Basic problems for communication networks
View abstract
chapter 5|28 pages
Disjoint path routing
View abstract
chapter 6|10 pages
Optical wavelength-routed network
View abstract
chapter 7|20 pages
Routing and traffic-demand model
View abstract
chapter 8|22 pages
IP routing
View abstract
chapter 9|22 pages
Mathematical puzzles
View abstract
chapter |2 pages
A Derivation of Eqs. (7.6a)–(7.6c) for hose model
View abstract
chapter |4 pages
B Derivation of Eqs. (7.12a)–(7.12c) for HSDT model
View abstract
chapter C|4 pages
C Derivation of Eqs. (7.16a)–(7.16d) for HLT model
View abstract
chapter |17 pages
Answers to Exercises
View abstract
ABOUT THIS BOOK
ABOUT THIS BOOK

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 m

TABLE OF CONTENTS
chapter 1|4 pages
Optimization problems for communications networks
View abstract
chapter 2|20 pages
Basics of linear programming
View abstract
chapter 3|6 pages
GLPK (GNU Linear Programming Kit)
View abstract
chapter 4|34 pages
Basic problems for communication networks
View abstract
chapter 5|28 pages
Disjoint path routing
View abstract
chapter 6|10 pages
Optical wavelength-routed network
View abstract
chapter 7|20 pages
Routing and traffic-demand model
View abstract
chapter 8|22 pages
IP routing
View abstract
chapter 9|22 pages
Mathematical puzzles
View abstract
chapter |2 pages
A Derivation of Eqs. (7.6a)–(7.6c) for hose model
View abstract
chapter |4 pages
B Derivation of Eqs. (7.12a)–(7.12c) for HSDT model
View abstract
chapter C|4 pages
C Derivation of Eqs. (7.16a)–(7.16d) for HLT model
View abstract
chapter |17 pages
Answers to Exercises
View abstract

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 m

TABLE OF CONTENTS
chapter 1|4 pages
Optimization problems for communications networks
View abstract
chapter 2|20 pages
Basics of linear programming
View abstract
chapter 3|6 pages
GLPK (GNU Linear Programming Kit)
View abstract
chapter 4|34 pages
Basic problems for communication networks
View abstract
chapter 5|28 pages
Disjoint path routing
View abstract
chapter 6|10 pages
Optical wavelength-routed network
View abstract
chapter 7|20 pages
Routing and traffic-demand model
View abstract
chapter 8|22 pages
IP routing
View abstract
chapter 9|22 pages
Mathematical puzzles
View abstract
chapter |2 pages
A Derivation of Eqs. (7.6a)–(7.6c) for hose model
View abstract
chapter |4 pages
B Derivation of Eqs. (7.12a)–(7.12c) for HSDT model
View abstract
chapter C|4 pages
C Derivation of Eqs. (7.16a)–(7.16d) for HLT model
View abstract
chapter |17 pages
Answers to Exercises
View abstract
Taylor & Francis Group
Policies
  • Privacy Policy
  • Terms & Conditions
  • Cookie Policy
Journals
  • Taylor & Francis Online
  • CogentOA
Corporate
  • Taylor & Francis
    Group
  • Taylor & Francis Group
Help & Contact
  • Students/Researchers
  • Librarians/Institutions

Connect with us

Registered in England & Wales No. 3099067
5 Howick Place | London | SW1P 1WG © 2018 Informa UK Limited