Home > Store

Optimal Routing Design (paperback)

Register your product to gain access to bonus material or receive a coupon.

Optimal Routing Design (paperback)

Best Value Purchase

Book + eBook Bundle

  • Your Price: $77.49
  • List Price: $133.98
  • Includes EPUB and PDF
  • About eBook Formats
  • This eBook includes the following formats, accessible from your Account page after purchase:

    ePub EPUB The open industry format known for its reflowable content and usability on supported mobile devices.

    Adobe Reader PDF The popular standard, used most often with the free Acrobat® Reader® software.

    This eBook requires no passwords or activation to read. We customize your eBook by discreetly watermarking it with your name, making it uniquely yours.

More Purchase Options

Book

  • Your Price: $54.39
  • List Price: $67.99
  • Usually ships in 24 hours.

eBook

  • Your Price: $52.79
  • List Price: $65.99
  • Includes EPUB and PDF
  • About eBook Formats
  • This eBook includes the following formats, accessible from your Account page after purchase:

    ePub EPUB The open industry format known for its reflowable content and usability on supported mobile devices.

    Adobe Reader PDF The popular standard, used most often with the free Acrobat® Reader® software.

    This eBook requires no passwords or activation to read. We customize your eBook by discreetly watermarking it with your name, making it uniquely yours.

Description

  • Copyright 2005
  • Dimensions: 7-3/8" x 9-1/8"
  • Pages: 504
  • Edition: 1st
  • Book
  • ISBN-10: 1-58714-244-9
  • ISBN-13: 978-1-58714-244-4

Techniques for optimizing large-scale IP routing operation and managing network growth

  • Understand the goals of scalable network design, including tradeoffs between network scaling, convergence speed, and resiliency
  • Learn basic techniques applicable to any network design, including hierarchy, addressing, summarization, and information hiding
  • Examine the deployment and operation of EIGRP, OSPF, and IS-IS protocols on large-scale networks
  • Understand when and how to use a BGP core in a large-scale network and how to use BGP to connect to external networks
  • Apply high availability and fast convergence to achieve 99.999 percent, or “five 9s” network uptime
  • Secure routing systems with the latest routing protocol security best practices
  • Understand the various techniques used for carrying routing information through a VPN

Optimal Routing Design provides the tools and techniques, learned through years of experience with network design and deployment, to build a large-scale or scalable IP-routed network. The book takes an easy-to-read approach that is accessible to novice network designers while presenting invaluable, hard-to-find insight that appeals to more advanced-level professionals as well.

Written by experts in the design and deployment of routing protocols, Optimal Routing Design leverages the authors’ extensive experience with thousands of customer cases and network designs. Boiling down years of experience into best practices for building scalable networks, this book presents valuable information on the most common problems network operators face when seeking to turn best effort IP networks into networks that can support Public Switched Telephone Network (PSTN)-type availability and reliability.

Beginning with an overview of design fundamentals, the authors discuss the tradeoffs between various competing points of network design, the concepts of hierarchical network design, redistribution, and addressing and summarization. This first part provides specific techniques, usable in all routing protocols, to work around real-world problems. The next part of the book details specific information on deploying each interior gateway protocol (IGP)—including EIGRP, OSPF, and IS-IS—in real-world network environments. Part III covers advanced topics in network design, including border gateway protocol (BGP), high-availability, routing protocol security, and virtual private networks (VPN). Appendixes cover the fundamentals of each routing protocol discussed in the book; include a checklist of questions and design goals that provides network engineers with a useful tool when evaluating a network design; and compare routing protocols strengths and weaknesses to help you decide when to choose one protocol over another or when to switch between protocols.

“The complexity associated with overlaying voice and video onto an IP network involves thinking through latency, jitter, availability, and recovery issues. This text offers keen insights into the fundamentals of network architecture for these converged environments.”

—John Cavanaugh, Distinguished Services Engineer, Cisco Systems®

This book is part of the Networking Technology Series from Cisco Press‚ which offers networking professionals valuable information for constructing efficient networks, understanding new technologies, and building successful careers.

Sample Content

Sample Pages

Download the sample pages (includes Chapter 2 and Index)

Table of Contents

Contents

Foreword

Introduction

Part I Network Design Overview

Chapter 1 Network Design Goals and Techniques

Goals for Network Design

Reliability

Packet Delivery Reliability

Packet Delivery Times

Delay and Jitter Budgets

The Impact of Network Design on Delay and Jitter Budgets

Reliability and Resiliency

Defining Network Failure

Network Recovery Time

Manageability

Day-to-Day Operational Maintenance

Taking a Network Baseline

Network Documentation

Emergency Management

Scalability

Redundancy

How Redundancy Increases Resiliency

Statistical Analysis

How Redundancy Can Increase Management Complexity

How Redundancy Can Reduce Scalability

Layering

Hiding Information

Hiding Topology Information

Hiding Reachability Information

Separate Functionality

Summary

Review Questions

Chapter 2 Applying the Fundamentals

Hierarchical Design

Abstraction Through Layering

Horizontal Layers in a Network

Layer Functions

Forwarding Traffic

Aggregation of Routing Information

Definition and Implementation of Routing Policies

User Attachment

Controlling Traffic Admittance into the Network

Network Hierarchies

Two-Layer Hierarchy

Three-Layer Hierarchy

Determining How Many Layers to Use in Network Design

Hiding Layers Within Layers

Creating Layers

Creating Choke Points

Separating Complexity from Complexity

Addressing and Summarization

Assigning Addresses in a Network

Working Around Addressing

Leaking More Specifics

Smaller Summary Blocks

Change the Logical Layout

Summary Issues

Summarization Black Holes

Summary Suboptimal Routing

Summary Metrics

Redistribution

Alternatives to IGP to IGP Redistribution

Single Point of Redistribution

Multiple Points of Redistribution

Filters

Tags

Review Questions

Part II Interior Gateway Protocols

Chapter 3 EIGRP Network Design

Deploying EIGRP on a Large-Scale Three-Layer Hierarchical Network

Analyzing the Network Core for Summarization

Summarizing from the Core to the Distribution Layer

Summarizing into the Core at Its Edge

Analyzing the Network Distribution Layer for Summarization

Summarizing Toward the Network Core

Summarizing Toward the Remote Sites

Analyzing Routing in the Network Access Layer

Single-Homed Sites

Dual-Homed Remotes

Analyzing Use of the Stub Feature in Access Routers

Analyzing Routes to External Connections

Analyzing Routes to the Common Services Area

Analyzing Routes to Dial-In Clients

Host Routes

Bandwidth Issues

Deploying EIGRP on a Two-Layer Hierarchical Network

Summarization in the Core

Summarization in the Aggregation Layer

Summary of EIGRP Network Design

New Features in EIGRP

Third-Party Next Hop

NBMA Hub-and-Spoke Network

Redistributed Next Hop

Enhanced Route Map Support

Before Enhanced Route Map Support

Route Map Enhancements

Enhanced EIGRP Active Process

Case Study: Summarization Methods

IP Summary Addresses

Distribute Lists

Case Study: Controlling Query Propagation

Case Study: A Plethora of Topology Table Entries

Case Study: Troubleshooting EIGRP Neighbor Relationships

EIGRP Neighbor Relationships: Common Problem 1

EIGRP Neighbor Relationships: Common Problem 2

Case Study: Troubleshooting SIA Routes

Case Study: Redistribution

Using Distribute Lists to Prevent Redistribution Routing Loops

Using Route Maps to Prevent Redistribution Routing Loops

Using Prefix Lists to Prevent Redistribution Routing Loops

Setting the Administrative Distance to Troubleshoot Redistribution Routing Loops

Using External Flags to Prevent Redistribution Routing Loops

Case Study: Retransmissions and SIA

The Hold Timer

SIA Timer

Interaction Between the Hold Timer and the SIA Timer

Case Study: Multiple EIGRP Autonomous Systems

Review Questions

Chapter 4 OSPF Network Design

Summarization and Aggregation

Deploying OSPF on a Three-Layer Hierarchy

The Core Routers as ABRs

The Distribution Layer Routers as ABRs

Mixing ABR Locations

Deploying OSPF on a Two-Layer Hierarchy

Reducing Flooding Through Stub Areas

Stub Areas

Totally Stubby Areas

Not-So-Stubby Areas

Totally NSSA

Totally Stubby Not Really Full Areas

When to Use Stub Areas

Aggregating Routes in OSPF

Filtering Routes in OSPF

Deploying OSPF on Specific Topologies

Redistribution into OSPF

External Route Metrics

External Route Selection at ABRs

Route Selection Between Processes

Full Mesh Topologies

Hub-and-Spoke Topologies

Treating the NBMA Interface as a Broadcast Interface

Treating the NBMA Interface as a Set of Point-to-Point Interfaces

Treating an NBMA Interface as a Broadcast Point-to-Multipoint Interface

Treating an NBMA Interface as a Nonbroadcast Point-to-Multipoint Interface

Summary of Interface and OSPF Link-Type Options

Reducing Flooding to the Spokes

Links Parallel to Area Boundaries

Dial Links

Point-to-point Broadcast Links

Case Study: OSPF Externals and the Next Hop

Case Study: Troubleshooting OSPF Neighbor Adjacencies

Review Questions

Chapter 5 IS-IS Network Design

Deploying IS-IS on a Three-Layer Hierarchy

The Entire Network as a Single Routing Domain

The Core as the L2 Domain

Merging the Core and Distribution Layers into Level 2

Mixing and Overlapping the Level 1/Level 2 Border

Deploying IS-IS on a Two-Layer Hierarchy

Working with IS-IS Routing Areas

Leaking Routes into an L1 Routing Domain

Aggregating Routes in IS-IS

Deploying IS-IS on Specific Topologies

Redistribution

Full Mesh Topologies

Hub-and-Spoke Topologies

Point-to-Point Links

Broadcast Interfaces

Point-to-Point Broadcast Links

Links Parallel to Area Boundaries

Other Considerations in IS-IS Scaling

Metrics

Excessive Link-State Flooding

LSP Corruption

Maximum Number of Pseudonodes

Prefix-Driven Routing Table Installation

Hello Padding Suppression

Case Study: Troubleshooting IS-IS Neighbor Relationships

Review Questions

Part II Advanced Network Design

Chapter 6 BGP Cores and Network Scalability

Case Study: Troubleshooting BGP Neighbor Relationships

No IP Connectivity

eBGP Multihop

Other BGP Neighbor Problems

Logging Neighbor Changes

BGP in the Core

Case Study: Sample Migration

Scaling Beyond the Core

Dividing the Network into Pieces

Regional IGPs

BGP Network Growing Pains

BGP Update Generation Issues

Reducing the Number of Updates Generated

Case Study: Route Reflectors as Route Servers

External Connections

Case Study: Dual-Homed Connections to the Internet

Load Sharing on the Outbound Side

Load Sharing on the Inbound Side

Being a Transit AS

Case Study: Conditional Advertisement

Case Study: Route Dampening

Review Questions

Chapter 7 High Availability and Fast Convergence

Considerations in Fast Convergence

Network Meltdowns

Solving the Meltdown

Designing Routing Protocols Not to Melt

Do Not Report Everything You See

Non-Stop Forwarding

Graceful Restart

EIGRP Graceful Restart

OSPF Graceful Restart

IS-IS Graceful Restart

BGP Graceful Restart

Fast Down Detection

Detecting a Link or Adjacency Failure Using Polling

Bidirectional Forwarding Detection

Detecting a Link or Adjacency Failure Using Event-Driven Link Failure Notification

SONET

Frame Relay

Ethernet

Slowing Down When the Network Speeds Up

Link-State Exponential Backoff

Configuring OSPF Exponential Backoff for LSA Generation

Configuring OSPF Exponential Backoff for Running SPF

Configuring IS-IS Exponential Backoff

IP Event Dampening

Configuring IP Event Dampening

Calculating the Route Faster

EIGRP Feasible Successors

Link-State Partial SPF

Link-State Incremental SPF

Deploying GR and Fast Convergence Technologies

Graceful Restart Versus Fast Down Detection

How Fast Can GR Work?

Balancing Between GR and Fast Down Detection

Deploying Graceful Restart with BGP and an Interior Gateway
Protocol (IGP)

Deploying Exponential Backoff for Fast Convergence

Setting SPF Exponential Backoff Timers

Review Questions

Chapter 8 Routing Protocol Security

Fundamentals of Routing and Security

Understanding What a Routing System Is

Thoughts on Authorization and Authentication

Defining Authentication and Authorization

Transiting Authentication and Authorization

Transiting Authorization in a Routing System

Trust and Security

Determining the Reasons for an Attack on the Routing System

Types of Attacks Against Routing Systems

Disrupting Peering

Transport-Level Attacks Against OSPF and IS-IS

Transport-Level Attacks Against EIGRP

Transport-Level Attacks Against Border Gateway Protocol (BGP)

Protocol-Layer Attacks

Falsifying Routing Information

Disrupting Routing Domain Stability

Protecting Routing Domain Legitimacy

Protecting Routers from Being Compromised

Use Passwords

Filter Access to Routers

Protecting Against Illegitimate Devices Joining the Routing Domain

MD5 Authentication

Issues with MD5 Peer Authentication

IPSec

Protecting Routers from Denial-of-Service Attacks

Edge Filters

The Generalized TTL Security Mechanism

Protecting Routing Information

Extranet Connections

Use an Exterior Gateway Protocol for All Extranet Connections

Filter Routes Aggressively at the Extranet Edge

Dampen Prefixes Aggressively at the Extranet Edge

Limiting Route Count at the Extranet Edge

Connections to the Internet

Route Filtering

Protecting Against Transit

Route Dampening

Future Directions in Routing Protocol Security

Protecting Against Illegitimate Devices Joining the Routing Domain

Secure Origin BGP (soBGP)

Begin at the Beginning: Who Are You?

The First Goal: Are You Authorized?

The Second Goal: Do You Really Have a Path?

Review Questions

References

Chapter 9 Virtual Private Networks

MPLS

MPLS Basics

Overlay Routing over MPLS VPNs

Peer-to-Peer (Redistributed) Routing over MPLS VPNs

BGP/MPLS VPNs

EIGRP

OSPF

IPSec

GRE

NHRP

Case Study: NHRP in an ATM Network

Dynamic Multipoint IPSec VPNs

Review Questions

References

Part II Appendixes

Appendix A EIGRP for IP Basics of Operation

Appendix B OSPF Basics of Operation

Appendix C Integrated IS-IS Basics of Operation

Appendix D Border Gateway Protocol 4 Basics of Operation

Appendix E IP Network Design Checklist

Appendix F Answers to Review Questions

Appendix G Which Routing Protocol?

Index

Updates

Submit Errata

More Information

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.

Overview


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information


To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.

Surveys

Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.

Newsletters

If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information


Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.

Security


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.

Children


This site is not directed to children under the age of 13.

Marketing


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information


If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.

Choice/Opt-out


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information


Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents


California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure


Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.

Links


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact


Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice


We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020