Available:*
Library | Item Barcode | Call Number | Material Type | Item Category 1 | Status |
|---|---|---|---|---|---|
Searching... | 30000010139603 | TK5105.35 C42 2007 | Open Access Book | Book | Searching... |
On Order
Summary
Summary
As Internet traffic grows and demands for quality of service become stringent, researchers and engineers can turn to this go-to guide for tested and proven solutions. This text presents the latest developments in high performance switches and routers, coupled with step-by-step design guidance and more than 550 figures and examples to enable readers to grasp all the theories and algorithms used for design and implementation.
Author Notes
H. Jonathan Chao , PhD, is Department Head and Professor of Electrical and Computer Engineering at Polytechnic University, Brooklyn, New York. He holds more than twenty-six patents and is an IEEE Fellow. His research focuses on terabit switches and routers, network security, quality of service control, and optical switching.
Bin Liu , PhD, is Professor in the Department of Computer Science at Tsinghua University, Beijing, China. His research interests include high performance switches and routers, network security, network processors, and traffic engineering. Dr. Liu holds more than ten patents in China.
Table of Contents
| Preface |
| Acknowledgments |
| 1 Introduction |
| 1.1 Architecture of the Internet: Present and Future |
| 1.2 Router Architectures |
| 1.3 Commercial Core Router Examples |
| 1.4 Design of Core Routers |
| 1.5 IP Network Management |
| 1.6 Outline of the Book |
| 2 IP Address Lookup |
| 2.1 Overview |
| 2.2 Trie-Based Algorithms |
| 2.3 Hardware-Based Schemes |
| 2.4 IPv6 Lookup |
| 2.5 Comparison |
| 3 Packet Classification |
| 3.1 Introduction |
| 3.2 Trie-Based Classifications |
| 3.3 Geometric Algorithms |
| 3.4 Heuristic Algorithms |
| 3.5 TCAM-Based Algorithms |
| 4 Traffic Management |
| 4.1 Quality of Service |
| 4.2 Integrated Services |
| 4.3 Differentiated Services |
| 4.4 Traffic Policing and Shaping |
| 4.5 Packet Scheduling |
| 4.6 Buffer Management |
| 5 Basics of Packet Switching |
| 5.1 Fundamental Switching Concept |
| 5.2 Switch Fabric Classification |
| 5.3 Buffering Strategy in Switching Fabrics |
| 5.4 Multiplane Switching and Multistage Switching |
| 5.5 Performance of Basic Switches |
| 6 Shared-Memory Switches |
| 6.1 Linked List Approach |
| 6.2 Content Addressable Memory Approach |
| 6.3 Space-Time-Space Approach |
| 6.4 Scaling the Shared-Memory Switches |
| 6.5 Multicast Shared-Memory Switches |
| 7 Input-Buffered Switches |
| 7.1 Scheduling in VOQ-Based Switches |
| 7.2 Maximum Matching |
| 7.3 Maximal Matching |
| 7.4 Randomized Matching Algorithms |
| 7.5 Frame-based Matching |
| 7.6 Stable Matching with Speedup |
| 8 Banyan-Based Switches |
| 8.1 Banyan Networks |
| 8.2 Batcher-Sorting Network |
| 8.3 Output Contention Resolution Algorithms |
| 8.4 The Sunshine Switch |
| 8.5 Deflection Routing |
| 8.6 Multicast Copy Networks |
| 9 Knockout-Based Switches |
| 9.1 Single-Stage Knockout Switch |
| 9.2 Channel Grouping Principle |
| 9.3 Two-Stage Multicast Output-Buffered ATM Switch (MOBAS) |
| 9.4 Appendix |
| 10 The Abacus Switch |
| 10.1 Basic Architecture |
| 10.2 Multicast Contention Resolution Algorithm |
| 10.3 Implementation of Input Port Controller |
| 10.4 Performance |
| 10.5 ATM Routing and Concentration (ARC) Chip |
| 10.6 Enhanced Abacus Switch |
| 10.7 Abacus Switch for Packet Switching |
| 11 Crosspoint Buffered Switches |
| 11.1 Combined Input and Crosspoint Buffered Switches |
| 11.2 Combined Input and Crosspoint Buffered Switches with VOQ |
| 11.3 OCF_OCF: Oldest Cell First Scheduling |
| 11.4 LQF_RR: Longest Queue First and Round-Robin Scheduling in CIXB-1 |
| 11.5 MCBF: Most Critical Buffer First Scheduling |
| 12 CLOS-Network Switches |
| 12.1 Routing Property of Clos Network Switches |
| 12.2 Looping Algorithm |
| 12.3 m-Matching Algorithm |
| 12.4 Euler Partition Algorithm |
| 12.5 Karol's Algorithm |
| 12.6 Frame-Based Matching Algorithm for Clos Network (f-MAC) |
| 12.7 Concurrent Matching Algorithm for Clos Network (c-MAC) |
| 12.8 Dual-Level Matching Algorithm for Clos Network (d-MAC) |
| 12.9 The ATLANTA Switch |
| 12.10 Concurrent Round-Robin Dispatching (CRRD) Scheme |
| 12.11 The Path Switch |
| 13 Multi-Plane Multi-Stage Buffered Switch |
| 13.1 TrueWay Switch Architecture |
| 13.2 Packet Scheduling |
| 13.3 Stage-To-Stage Flow Control |
| 13.4 Port-To-Port Flow Control |
| 13.5 Performance Analysis |
| 13.6 Prototype |
| 14 Load-Balanced Switches |
| 14.1 Birkhoff-Von Neumann Switch |
| 14.2 Load-Balanced Birkhoff-von Neumann Switches |
| 14.3 |
