Home > Store

High Availability Networking with Cisco

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

High Availability Networking with Cisco

Book

  • Sorry, this book is no longer in print.
Not for Sale

Description

  • Copyright 2001
  • Dimensions: 7-3/8x9-1/4
  • Pages: 688
  • Edition: 1st
  • Book
  • ISBN-10: 0-201-70455-2
  • ISBN-13: 978-0-201-70455-6

Keeping a network continuously available despite the many potential hazards that can shut it down is a job that network implementors and technical managers struggle with every day. High Availability Networking with Cisco shows those charged with that increasingly important task how to achieve higher network availability both in theory and in practice. Using a "divide-and-conquer" approach, each chapter dissects the general need of high availability network design. The specific challenges and available solutions for each need are first discussed on a theoretical level. When appropriate, one or more implementation examples are presented, showing how the theory translates into working Cisco router configurations.

Although the examples use Cisco routers, the underlying theory is vendor-independent, and most of the solutions presented easily can be adapted to routers and switches from any vendor. Similarly, the theoretical aspects discussed in this book can be applied to networks of all sizes and technologies. Sample solutions focus on the needs of moderately sized extended corporate networks using IP version 4.0 and stable performance technologies such as frame relay, ISDN, and Ethernet.

Readers will find an invaluable survey of all aspects of high availability network design, including the following:

  • Network vulnerabilities and appropriate counter measures
  • Selecting and tuning bridging and routing protocols for higher availability
  • Multihomed hosts from individual client-to-server clusters
  • Dial backup over asynchronous and ISDN links
  • Single points of failure despite multiple routers at a single site
  • Hub and spokes design approaches that scale
  • Linking to another private network
  • Multiple links to one or more Internet service providers
  • Alternate routing through redundant firewalls without sacrificing security
  • Supporting legacy systems using Data Link Switching (DLSw)
  • Disaster-recovery options, including hot backup and load sharing approaches
  • Management considerations ranging from status monitoring to total quality control

By using many examples drawn from working configurations proven to be successful in actual corporate networks, High Availability Networking with Cisco reflects the author's extensive experience helping clients minimize the impact of failure on network operations



0201704552B04062001

Sample Content

Downloadable Sample Chapter

Click below for Sample Chapter related to this title:
jones06.pdf

Table of Contents



1. Reliability Theory.

The Need for Network Availability.

Mathematics of Reliability and Availability.

Network Vulnerabilities.

Designing for Improved Network Availability.



2. Bridging and Routing.

Basic Connectivity Considerations.

Bridging for Higher Availability.

Routing for Higher Availability.



3. Multihomed Hosts.

Two Network Interfaces with Independent Addresses.

Two Network Interfaces with One IP Address.

Two Systems with One IP Address.



4. Dial Backup for Permanent Links.

General Considerations.

Dial Backup Approaches.

Basic ISDN Dial Backup.



5. Advanced Dial Backup.

Dial Backup over Asynchronous Links.

Combining Channel for Higher Bandwidth.

Supporting IPX along with IP.

BGP-Driven Dial Backup.



6. Multiple Routers at a Single Site.

Protecting LAN Users from Router Loss.

Dial Backup by One Router for a Line on Another.

Protecting against LAN Segmentation.



7. Hub and Spokes Topology.

Routing Protocols for Hubs with Many Spokes.

Dial Backup with Multiple Dial Access Servers.

Using More Than One Hub.



8. Connecting to Service Providers.

Multiple Links to an External Network.

Connecting to an Internet Service Provider.

Connecting through Multiple Internet Service Providers.



9. Connecting through Firewalls.

Firewalls Concepts.

Firewalls in a Fully Redundant Network.

Automating Failover in Redundant Firewall Networks.



10. IBM Mainframe Connections.

Data Link Switching (DLSw) Protocol.

DLSw for Ethernet Attached Devices.

DLSw through Firewalls.



11. Disaster Recovery Considerations.

Disaster Recovery Requirements.

Traditional Approaches.

Hot Backup Facility Approaches.

Load Sharing Approaches.



12. Management Considerations.

Network Monitoring.

Configuration Management.

Total Quality Control. 0201704552T04062001

Preface

This book explores and discusses a wide range of potential approaches to improving network availability, allowing you to choose those most appropriate for your organization and its unique needs and constraints. The goal is to show how to achieve higher network availability both in theory and in practice. In economic terms, this means pushing the design to the point where the cost of eliminating further unavailability exceeds the cost to the organization of the losses due to downtime.

While the theoretical aspects apply to networks of all sizes and technologies, the example solutions provided focus on the needs of moderate sized extended corporate networks using IP version 4 and stable, moderate performance technologies such as frame relay, ISDN, and Ethernet--not because these technologies are fundamentally more or less reliable than others, but because these tend to be the networks which have grown to the point of being critical to the day-to-day operations of the organization without a staff of dedicated network designers and architects to provide optimization and support.

How to Use This Book

This book is written for those looking for design techniques to cost effectively improve network availability. The reader is assumed to be knowledgeable in the fundamentals of large network design and comfortable going to other references for more details on specific protocols and functions.

The basic approach of this book is divide and conquer. Each chapter attacks a general need of high availability network design, from defining what high availability really means and requires in the first chapter to the final chapter's discussion of the essential commitment to a full range of network management capabilities. Within each chapter, the general need is broken down into specific requirements. Within each specific requirement, the problem being addressed and possible solutions are first discussed on a general theoretical level. Wherever practical, one or more specific scenarios are defined and example solutions implemented, typically using Cisco routers.

Please read through the example implementations even if you never expect to touch a Cisco system. The examples and their accompanying discussions serve to flesh out the theoretical framework, showing typical adjustments required to get the theory presented to actually work in a real world environment. Many of these adjustments have nothing to do with Cisco, but rather reflect limitations in the current implementations of network protocols.

Technical managers and others will find this book's survey of all aspects of high availability network design invaluable. There are a vast array of considerations which should be part of any design and tunnel vision can be costly. It is very easy (and common) to implement point solutions which in the process of eliminating one weakness introduce other modes of failure. Choosing the best solution is rarely possible without a system-wide perspective.

Network implementors in a Cisco environment will find this book a cookbook of Cisco solutions that they can modify and install in their own network. These readers should still pay attention to the theoretical discussions preceding each example so they can identify modifications necessary to fit their unique environment.

It is essential for all to keep in mind that high availability is not just a design parameter, it is also an executive management commitment to funding adequate resources, staffing and training for the life of the network. At the same time, even though this book focuses on enhancing the availability of the network, we must always keep our sense of perspective. From the user's viewpoint, it is immaterial whether it is the network, the server, the software or the client platform which fails. Cost effective availability improvement needs to be balanced across all causes of failure to ensure that the resources required are applied where they will have the most impact on the bottom line.

This is much easier to say than it is to do, as few organizations even know what their current availability is or keep any statistics on the causes of failure. Even fewer organizations have proceeded to the stage of analyzing their bottom line costs for various failure modes. But higher network availability remains indisputably important. Fortunately, it is never too late to start on the road to higher availability.

Chapter by Chapter

Chapter 1, "Reliability and Availability," introduces the theory and technology of high availability networks. First the stage is set with the potential cost of network downtime for mundane production as well as ''must run'' networks. The mathematical basis behind predicting availability, different approaches to providing higher availability, and the availability challenges unique to computer networks form the core of the chapter. The chapter ends with the need to provide physical diversity in multiply connected WANs and LANs, setting the stage for the rest of the book.

High availability is not an automatic result of adding redundant links and components to a network. Adding redundancy adds complexity to the network, which must be recognized and utilized. Chapter 2,"Bridging and Routing," starts out with a quick review of network terminology, then surveys the available layer two bridging approaches (simple learning, SR and TST) and popular layer three routing protocols for IP (static, RIP, OSPF, Integrated IS-IS, EIGRP and BGP), briefly discussing how each works and the strengths and weaknesses of each. Along the way, parameter tuning which may be appropriate to speed up response to failures is explored and examples provided.

Chapter 3, "Multihomed Hosts," extends the availability benefits of redundant connectivity all the way to the end system in an IP network. Starting with the simple step of adding a second NIC to an end system, the challenges presented in supporting applications when the server (or client) has two IP addresses are explored. Then two approaches to giving the two NICs the appearance of a single IP address (proprietary and via routing) are examined, with full configuration examples for the latter. The chapter concludes with a discussion of server cluster terminology, techniques and limitations.

Dial backup is a popular alternative to installing additional ''permanent'' links. In Chapter 4, "Dial Backup for Permanent Links," the first of two dedicated to dial backup, three different dial backup approaches are introduced, distinguished by how the router determines the need to place a call. After exploring the underlying assumptions behind each and how those assumptions affect their suitability for various applications, a basic ''how to'' for IP dial backup is provided. Using examples of ISDN dial backup applied to leased lines, frame relay, and DSL, the critical factors requisite to successful implementation are highlighted.

Chapter 5, "Advanced Dial Backup," extends the general concepts introduced in chapter 4 to meet the specific needs of a range of requirements. It starts with the challenge of using asynchronous modems rather than ISDN, then moves on to explore techniques for combining multiple dial links to provide higher bandwidth. After a brief look at providing IPX support, the chapter concludes with how to use BGP with generic dial-on-demand routing to provide dial backup driven by routing table changes without the limitations associated with Cisco's proprietary dialer watch facility.

Chapter 6, "Multiple Routers at a Single Site," focuses on eliminating the router as a single point of failure from the viewpoint of preventing end-systems at a location from being isolated from the rest of the WAN. Starting with solutions to the limitations inherent in the IP concept of a default gateway, the chapter then explores how to provide a second router without doubling the WAN communications costs by getting one router to provide dial backup for a link on another router. It then finishes with how to configure the routers on a physically extended LAN so that even if the LAN is split in two by a failure, IP systems on both halves of the LAN can still communicate with the outside world.

Chapter 7, "Hub and Spokes Topology," explores the unique requirements of hub and spokes networks. Hub and spokes is a popular topology for HQ data center and other applications because it allows major simplifications in the routing structure, but it can also introduce complications. The chapter starts with a discussion on how to get around limitations on the number of peers supportable on a single router and how to scale a hub and spokes design to handle an arbitrary number of spokes without requiring the spoke routers to maintain more than a handful of routes each. The focus then shifts to configuring dial-on-demand routing so that a spoke router can dial any of several routers at the hub without concern for which answers. Finally, critical considerations when the hub expands to actually be multiple sites, such as a primary and backup data center, are explored.

Chapter 8, "Connecting to Service Providers," looks at the special considerations which apply when connecting with networks outside our control. The challenge is split into two levels: connecting to well-defined, relatively trustworthy external networks and connecting to ''The Internet.'' For the former, the focus is on solving the problem of redundant connectivity using floating static routes driven by an IGP. For the latter, the focus is on the limits of static routing and how to make the most of BGP for both multiple connections to a single ISP and redundant connections to multiple ISPs.

Any time we can't trust ''the other network'' we should firewall it. The problem is that a firewall not only blocks traffic from ''the bad guys,'' it also blocks desirable traffic such as routing information. Chapter 9, "Connecting through Firewalls," focuses on how firewalls are integrated into a network and the various ways traffic can be routed to the appropriate firewall. Starting with an example of a fully redundant network with no firewall failover capability, it looks at different ways to provide useful redundancy for the firewalls without sacrificing security.

Many organizations also use DLSw to support IBM SNA communications. Chapter 10, "IBM Mainframe Connections," looks at the challenges of supporting DLSw in a fully redundant manner, starting with token ring LAN support where support of redundant DLSw links is automatic. Then the challenge of providing working redundant fallback in support of Ethernet attached devices is addressed. The chapter ends with how to implement high availability redundant DLSw in a firewalled environment.

Chapter 11, "Disaster Recovery," scales the survey of high availability design techniques to consider continued operations in the event of a site-wide or regional disaster. The cost of full scale disaster recovery combined with fundamental weaknesses in the IPv4 protocol suite means every solution is a compromise. The chapter looks at some of the key considerations in planning for disaster recovery with little or no service interruption, some of the potential failure modes that need to be designed around, and the use of commercially available load sharing approaches to implement high availability disaster recovery.

Chapter 12, "Management Considerations," finishes the book with a look at network management. In a network design with redundant capabilities for high availability, network management is not an option. It is essential that faults be found and fixed as quickly as possible, even though they may have no immediate impact on network functionality. Surveying the technical and management skills and discipline required to run a high availability network, the chapter focus on the critical roles of network monitoring, configuration management, and total quality control.

An extensive Glossary is also included in recognition of the huge range of acronyms and technical terms required in a book covering as wide a variety of concerns as this one.

Product Disclaimer

For those of you not using Cisco products, I apologize for the exclusive use of Cisco routers in the router configuration examples provided. I strongly encourage you to continue reading regardless, as many of the challenges and tradeoffs discussed as part of the Cisco configuration apply to routers and switches from other vendors as well. Even though the terminology, command syntax, and feature sets differ, the underlying protocols are based on the same standards and the same set of constraints.

For those of you who are using Cisco products, I have tried to indicate in each configuration the oldest version of Cisco IOS that the particular configuration can be expected to run on. In indicating a minimum IOS, I ignored interim release trains (such as 11.1 and 11.3) and all releases prior to 11.0. My assumption is that in a network requiring maximum availability, only mainstream IOS releases which are actively supported and in General Distribution status will be of interest.

This book reflects techniques I have used over the years to help my clients minimize the impact of failure on network operations. Almost all the examples are extracted from working configurations that have been proven in production environments, then adapted and sanitized for publication. As a service to readers, all the example configurations are available on the Networking Unlimited, Inc. web site at http://www.networkingunlimited.com. All feedback is welcome.



0201704552P04062001

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