Routing, flow, and capacity design in communication and computer networks

著者

    • Pióro, Michał
    • Medhi, Deepankar

書誌事項

Routing, flow, and capacity design in communication and computer networks

Michał Pióro, Deepankar Medhi

(The Morgan Kaufmann series in networking)

Elsevier / Morgan Kaufmann, c2004

大学図書館所蔵 件 / 9

この図書・雑誌をさがす

注記

Includes bibliographical references (p. 679-711) and index

内容説明・目次

内容説明

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.

目次

ForewordPrefacePART I - INTRODUCTORY NETWORK DESIGNChapter 1 - OverviewChapter 2 - Network Design Problems-Notation and IllustrationsChapter 3 - Technology-Related Modeling ExamplesPART II - DESIGN MODELING AND METHODSChapter 4 - Network Design Problem ModelingChapter 5 - General Optimization Methods for Network DesignChapter 6 - Location and Topological DesignChapter 7 - Networks With Shortest-Path RoutingChapter 8 - Fair NetworksPART III - ADVANCED MODELSChapter 9 - Restoration and Protection Design of Resilient NetworksChapter 10 - Application of Optimization Techniques for Protection and Restoration DesignChapter 11 - Multi-Hour and Multi-Time-Period Network Modeling and DesignChapter 12 - Multi-Layer Networks: Modeling and DesignChapter 13 - Restoration Design of Single- and Multi-Layer Fair NetworksAPPENDICESAppendix A - Optimization Theory RefresherAppendix B - Introduction to Complexity Theory and NP-CompletenessAppendix C - Shortest-Path AlgorithmsAppendix D - Using LP/MIP PackagesList of AcronymsSolutions to Selected ExercisesBibliographyIndex

「Nielsen BookData」 より

関連文献: 1件中  1-1を表示

詳細情報

ページトップへ