High Performance Switches and Routers / Edition 1

Hardcover (Print)
Used and New from Other Sellers
Used and New from Other Sellers
from $148.42
Usually ships in 1-2 business days
(Save 17%)
Other sellers (Hardcover)
  • All (3) from $148.42   
  • New (2) from $148.42   
  • Used (1) from $148.99   

Overview

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.

Read More Show Less

Editorial Reviews

From the Publisher
"Unique in its approach and scope, and written in an easy-to-follow manner, I strongly recommend it to the interested reading community." (ComputingReviews.com, December 17, 2007)
Read More Show Less

Product Details

  • ISBN-13: 9780470053676
  • Publisher: Wiley
  • Publication date: 3/23/2007
  • Edition number: 1
  • Pages: 640
  • Product dimensions: 7.34 (w) x 10.24 (h) x 1.37 (d)

Meet the Author

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.

Read More Show Less

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 Load-Balanced Birkhoff–von Neumann SwitchesWith FIFO Service.

15 OPTICAL PACKET SWITCHES.

15.1 Opto-Electronic Packet Switches.

15.2 Optoelectronic Packet Switch Case Study I.

15.3 Optoelectronic Packet Switch Case Study II.

15.4 All Optical Packet Switches.

15.5 Optical Packet Switch with Shared Fiber Delay Lines Single-stage Case.

15.6 All Optical Packet Switch with Shared Fiber Delay Lines – Three Stage Case.

16 HIGH-SPEED ROUTER CHIP SET.

16.1 Network Processors (NPs).

16.2 Co-Processors for Packet Classification.

16.3 Traffic Management Chips.

16.4 Switching Fabric Chips.

INDEX.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)