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 |
| Ετικέτες: |
Προσθήκη ετικέτας
Δεν υπάρχουν, Καταχωρήστε ετικέτα πρώτοι!
|
| LEADER | 04219nam a2200325 a 4500 | ||
|---|---|---|---|
| 001 | 1/45256 | ||
| 008 | 140821s2004 ne 001 0 eng | ||
| 020 | |a 9780125571890 | ||
| 020 | |a 0125571895 | ||
| 035 | |l 48215 | ||
| 040 | |a OPELS |b eng |c OPELS |d OCLCQ |d OCLCF |d GR-PeUP | ||
| 100 | 1 | |a Pioro, Michal. | |
| 245 | 1 | 0 | |a Routing, flow, and capacity design in communication and computer networks |h [electronic resource] / |c Michal Pioro, Deepankar Medhi. |
| 260 | |a Amsterdam ; |a Boston : |b Elsevier/Morgan Kaufmann, |c c2004. | ||
| 300 | |a 1 online resource (xxviii, 765 p.) : |b ill. | ||
| 490 | 1 | |a The Morgan Kaufmann series in networking | |
| 520 | |a 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 extreme, you will learn where they tend to fail to contribute to the twin goals of network efficiency and cost-savings. Most of all, you will learn precisely how to tailor theoretical models to make them as useful as possible in practice. Throughout, the authors focus on the traffic demands encountered in the real world of network design. Their generic approach, however, allows problem formulations and solutions to be applied across the board to virtually any type of backbone communication or computer network. For beginners, this book is an excellent introduction. For seasoned professionals, it provides immediate solutions and a strong foundation for further advances in the use of mathematical modeling for network design. Written by leading researchers with a combined 40 years of industrial and academic network design experience. Features Considers the development of design models for different technologies, including TCP/IP, IDN, MPLS, ATM, SONET/SDH, and WDM Discusses recent topics such as shortest path routing and fair bandwidth assignment in IP/MPLS networks Addresses proper multi-layer modeling across network layers using different technologiesfor example, IP over ATM over SONET, IP over WDM, and IDN over SONET. Covers restoration-oriented design methods that allow recovery from failures of large-capacity transport links and transit nodes. Presents, at the end of each chapter, exercises useful to both students and practitioners. | ||
| 505 | 0 | |a 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. | |
| 504 | |a Includes bibliographical references (p. 679-711) and index. | ||
| 650 | 4 | |a Computer network. | |
| 650 | 4 | |a Telecommunication |x Traffic. | |
| 650 | 4 | |a Routers (Computer networks) | |
| 650 | 4 | |a Computer architecture. | |
| 655 | 4 | |a Electronic books. | |
| 700 | 1 | |a Medhi, Deepankar. | |
| 830 | 0 | |a Morgan Kaufmann series in networking. | |
| 852 | |a INST |b UNIPILB |c EBOOKS |e 20140821 |p 00b48215 |q 00b48215 |t ONLINE |y 0 | ||
| 856 | 4 | 0 | |3 ScienceDirect |u http://www.sciencedirect.com/science/book/9780125571890 |
| 856 | 4 | |d /webopac/covers/03/48215_9780125571890.jpg | |
| 856 | 4 | |d /webopac/covers/03/48215_0125571895.jpg | |