Routing, flow, and capacity design in communication and computer networks
In network design, the gap between theory and practice is woefully broad. This book narrows it, comprehensively and critically examining current network design models and methods. You will learn where mathematical modeling and algorithmic optimization have been under-utilized. At the opposite extrem...
| Κύριος συγγραφέας: | Pioro, Michal. |
|---|---|
| Άλλοι συγγραφείς: | Medhi, Deepankar. |
| Μορφή: | Ηλεκτρονική πηγή |
| Γλώσσα: | English |
| Στοιχεία έκδοσης: |
Amsterdam ; Boston :
Elsevier/Morgan Kaufmann,
c2004.
|
| Σειρά: |
Morgan Kaufmann series in networking.
|
| Θέματα: | |
| Διαθέσιμο Online: |
http://www.sciencedirect.com/science/book/9780125571890 |
| Ετικέτες: |
Προσθήκη ετικέτας
Δεν υπάρχουν, Καταχωρήστε ετικέτα πρώτοι!
|
Πίνακας περιεχομένων:
- Foreword
- Preface
- PART I
- INTRODUCTORY NETWORK DESIGN
- Chapter 1
- Overview
- Chapter 2
- Network Design ProblemsNotation and Illustrations
- Chapter 3
- Technology-Related Modeling Examples
- PART II
- DESIGN MODELING AND METHODS
- Chapter 4
- Network Design Problem Modeling
- Chapter 5
- General Optimization Methods for Network Design
- Chapter 6
- Location and Topological Design
- Chapter 7
- Networks With Shortest-Path Routing
- Chapter 8
- Fair Networks
- PART III
- ADVANCED MODELS
- Chapter 9
- Restoration and Protection Design of Resilient Networks
- Chapter 10
- Application of Optimization Techniques for Protection and Restoration Design
- Chapter 11
- Multi-Hour and MultiTime-Period Network Modeling and Design
- Chapter 12
- Multi-Layer Networks: Modeling and Design
- Chapter 13
- Restoration Design of Single- and Multi-Layer Fair Networks
- APPENDICES
- Appendix A
- Optimization Theory Refresher
- Appendix B
- Introduction to Complexity Theory and NP-Completeness
- Appendix C
- Shortest-Path Algorithms
- Appendix D
- Using LP/MIP Packages
- List of Acronyms
- Solutions to Selected Exercises
- Bibliography
- Index.