Home > Store

Navigating Network Complexity: Next-generation routing with SDN, service virtualization, and service chaining

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

Navigating Network Complexity: Next-generation routing with SDN, service virtualization, and service chaining

Book

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

eBook (Watermarked)

  • Your Price: $46.39
  • List Price: $57.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.

About

Features

  • The first complete and practical exploration of network complexity: theoretical ideas and design implications
  • Indispensable reading for network professionals in the early stages of planning and deploying SDNs, NFV, OpenFlow, and related technologies
  • Presents a single-source overview of modern control planes, from layer 2 to layer 7, including their operation and use cases
  • Invaluable for every network architect and engineer who wants their network designs to reflect solid design principles and a strong understanding of complexity theory

Description

  • Copyright 2016
  • Dimensions: 7" x 9-1/8"
  • Pages: 320
  • Edition: 1st
  • Book
  • ISBN-10: 0-13-398935-6
  • ISBN-13: 978-0-13-398935-9

Design your networks to successfully manage their growing complexity

Network professionals have often been told that today’s modern control planes would simplify their networks. The opposite has happened: Technologies like SDN and NFV, although immensely valuable, are exacerbating complexity instead of solving it. Navigating Network Complexity is the first comprehensive guide to managing this complexity in both deployment and day-to-day operations.

Russ White and Jeff Tantsura introduce modern complexity theory from the standpoint of the working network engineer, helping you apply it to the practical problems you face every day. Avoiding complex mathematical models, they show how to characterize network complexity, so you can understand it and control it.

The authors examine specific techniques and technologies associated with network control planes, including SDNs, fast reroute, segment routing, service chaining, and cloud computing. They reveal how each of these affects network design and complexity and help you anticipate causes of failure in highly complex systems.

Next, they turn to modern control planes, examining the fundamental operating principles of SDNs, such as OpenFlow and I2RS, network and other service function virtualization, content distribution networks, Layer 2 fabrics, and service chaining solutions. You’ll learn how each of these might both resolve and increase complexity in network design and operations and what you can do about it.

Coverage includes:

  • Defining complexity, understanding its components, and measuring it
  • Mastering a straightforward “state, speed, and surface” model for analyzing complexity
  • Controlling complexity in design, deployment, operations, protocols, and programmable networks
  • Understanding how complex network systems begin to fail and how to prevent failure
  • Recognizing complexity tradeoffs in service virtualization and service chaining
  • Managing new challenges of complexity in virtualized and cloud environments
  • Learning why constructs such as hierarchical design, aggregation, and protocol layering work and when they work best
  • Choosing the right models to contain complexity as your network changes

From start to finish, Navigating Network Complexity helps you assess the true impact of new network technologies, so they can capture more value with fewer problems.

Sample Content

Online Sample Chapter

Measuring Network Complexity

Sample Pages

Download the sample pages (includes Chapter 3 and Index)

Table of Contents

Introduction . . . . . . . . . . . . xvii

    How This Book Is Organized . . . . . . . xvii

Chapter 1: Defining Complexity . . . . . . . . . 1

    What Is Complexity? . . . . . . . . . 3

        Anything I Don’t Understand . . . . . . 3

        Anything with a Lot of Parts . . . . . . . 5

        Anything for Which There Is More State Than Required to

        Achieve a Goal . . . . . . . . . 9

        Unintended Consequences . . . . . . 11

    Why So Much Complexity? . . . . . . . . 13

        Future Extensions versus New Protocols . . . . 16

        Unexpected Errors . . . . . . . . 17

    Why Not Build Infinitely Complex Systems? . . . . . 18

        Quick, Cheap, and High Quality: Choose Two . . . 20

        Consistency, Availability, and Partition Tolerance:

        Choose Two . . . . . . . . . 21

    Journey into the Center of Complexity . . . . . . 22

Chapter 2: Components of Complexity . . . . . . . 25

    Network Convergence . . . . . . . . . 26

        Path Vector: A BGP Example . . . . . . 26

        Distance Vector: An EIGRP Example . . . . . 28

        Link State: OSPF and IS-IS Convergence . . . . 30

    State . . . . . . . . . . . . 31

        Amount of Information . . . . . . . 32

        An Example of State Failure in the Real World . . . 33

        Final Thoughts on State . . . . . . . 34

    Speed . . . . . . . . . . . . 35

        The Network That Never Converges . . . . . 35

        The Flapping Link . . . . . . . . 37

        Final Thoughts on Speed . . . . . . . 38

    Surface . . . . . . . . . . . . 38

    The Hourglass Model . . . . . . . . . 41

    Optimization . . . . . . . . . . . 44

    A Final Thought . . . . . . . . . . 46

Chapter 3: Measuring Network Complexity . . . . . . 47

    Some Measures of Network Complexity . . . . . 49

        Network Complexity Index . . . . . . 49

        Modeling Design Complexity . . . . . . 51

        NetComplex . . . . . . . . . 53

    Organized Complexity . . . . . . . . . 55

    Is This a Waste of Time? . . . . . . . . . 58

        A Final Thought . . . . . . . . . . 58

Chapter 4: Operational Complexity . . . . . . . . 61

    Exploring the Problem Space . . . . . . . . 61

        The Cost of Human Interaction with the System . . . 61

        Policy Dispersion versus Optimal Traffic Handling . . 66

    Solving the Management Complexity Problem . . . . 69

        Automation as a Solution to Management Complexity . 69

        Modularity as a Solution to Management Complexity . 72

        Protocol Complexity versus Management Complexity . 74

        A Final Thought . . . . . . . . . . 77

Chapter 5: Design Complexity . . . . . . . . . 79

    Control Plane State versus Stretch . . . . . . . 81

        Aggregation versus Stretch . . . . . . . 83

        Traffic Engineering . . . . . . . . 85

        State versus Stretch: Some Final Thoughts . . . . 87

    Topology versus Speed of Convergence . . . . . . 88

        Ring Topology Convergence . . . . . . 88

        Redundancy versus Resilience . . . . . . 90

        Topology versus Speed of Convergence:

        Some Final Thoughts . . . . . . . 93

    Fast Convergence versus Complexity . . . . . . 94

        Improving Convergence with Intelligent Timers: Talk Faster . . . . . . . . . 96

        Removing Timers from Convergence: Precompute . . 99

        Working around Topology: Tunneling to the Loop-Free

        Alternate . . . . . . . . . 101

        Some Final Thoughts on Fast Convergence . . . 104

    Virtualization versus Design Complexity . . . . . 106

        Functional Separation . . . . . . . 108

        Forwarding Plane Complexity . . . . . . 109

        Control Plane Complexity . . . . . . 109

        Shared Fate Risk Groups . . . . . . . 111

    A Final Thought . . . . . . . . . . 111

Chapter 6: Managing Design Complexity . . . . . . 113

    Modularity . . . . . . . . . . . 113

        Uniformity . . . . . . . . . 114

        Interchangeable Modules . . . . . . . 120

        How Modularity Attacks the Complexity Problem . . 121

    Information Hiding . . . . . . . . . 122

        Aggregation . . . . . . . . . 122

        Failure Domains and Information Hiding . . . . 126

        Final Thoughts on Information Hiding . . . . 128

    Models . . . . . . . . . . . 129

        Waterfall . . . . . . . . . . 129

        Places in the Network . . . . . . . 131

        Hierarchical . . . . . . . . . 132

        UML . . . . . . . . . . . 134

    A Final Thought . . . . . . . . . . 136

Chapter 7: Protocol Complexity . . . . . . . . 137

    Flexibility versus Complexity: OSPF versus IS-IS . . . . 138

    Layering versus Protocol Complexity . . . . . . 141

        The Seven-Layer Model . . . . . . . 143

        The Four-Layer Model . . . . . . . 146

        The Iterative Model . . . . . . . . 147

        Protocol Stacks and Design . . . . . . 148

    Protocol Complexity versus Design Complexity . . . . 149

        Microloops and Fast Reroute . . . . . . 149

        EIGRP and the Design Conundrum . . . . . 158

    Final Thoughts on Protocol Complexity . . . . . 162

Chapter 8: How Complex Systems Fail . . . . . . . 163

    Feedback Loops . . . . . . . . . . 164

        Positive Feedback Loops in Network Engineering . . 169

        Speed, State, and Surface: Stability in the

        Network Control Plane . . . . . . . 174

    Shared Fate . . . . . . . . . . . 177

        Virtual Circuits . . . . . . . . . 177

        TCP Synchronization as a Shared Fate Problem . . 179

    A Final Thought . . . . . . . . . . 181

        Thoughts on Root Cause Analysis . . . . . 181

        Engineering Skills and Failure Management . . . 182

Chapter 9: Programmable Networks . . . . . . . 185

    Drivers and Definition . . . . . . . . . 186

        Business Drivers . . . . . . . . 186

        The Ebb and Flow of Centralization . . . . . 188

        Defining Network Programmability . . . . . 191

    Use Cases for Programmable Networks . . . . . 193

        Bandwidth Calendaring . . . . . . . 193

        Software-Defined Perimeter . . . . . . 196

    Programmable Network Interfaces . . . . . . 200

    The Programmable Network Landscape . . . . . 201

        OpenFlow . . . . . . . . . . 202

        YANG . . . . . . . . . . 204

        Path Computation Element Protocol . . . . . 207

        Interface to the Routing System . . . . . 210

    A Final Thought . . . . . . . . . . 212

Chapter 10: Programmable Network Complexity . . . . . 215

    The Subsidiarity Principle . . . . . . . . 216

    Policy Management . . . . . . . . . 217

        Policy Dispersion . . . . . . . . 220

        Policy Consistency . . . . . . . . 222

        Policy Complexity . . . . . . . . 223

    Surface and the Programmable Network . . . . . 224

    Impact on Failure Domains . . . . . . . . 226

        Wide Area Failure Domains . . . . . . 227

        Data Center Failure Domains . . . . . . 228

        Application to Control Plane Failure Domain . . . 229

        Controller to Controller Failure Domain . . . . 229

        Final Thoughts on Failure Domains . . . . . 229

    A Final Thought . . . . . . . . . . 230

Chapter 11: Service Virtualization and Service Chaining . . . . 233

    Network Function Virtualization . . . . . . . 234

        NFV: A Use Case . . . . . . . . 236

    Service Chaining . . . . . . . . . . 242

        Service Function Chaining . . . . . . 243

        Segment Routing . . . . . . . . 245

    A Final Thought . . . . . . . . . . 248

Chapter 12: Virtualization and Complexity . . . . . . 249

    Policy Dispersion and Network Virtualization . . . . 250

        State and Service Chaining . . . . . . 253

        State and Optimization . . . . . . . 254

        Surface and Policy Interaction . . . . . . 255

        Surface and Policy Proxies . . . . . . 255

    Other Design Considerations . . . . . . . 256

        Coupling and Failure Domains . . . . . . 257

        Troubleshooting . . . . . . . . 260

    The Orchestration Effect . . . . . . . . 262

    Managing Complexity . . . . . . . . . 264

    A Final Thought . . . . . . . . . . 266

Chapter 13: Complexity and the Cloud . . . . . . . 267

    Where Does the Complexity Live? . . . . . . 268

        Cloud Centric . . . . . . . . . 269

        Vendor Centric . . . . . . . . . 270

        Network Centric . . . . . . . . 271

        Is There a “Right Way?” . . . . . . . 271

    Centralize What? . . . . . . . . . . 272

    Cloudy Complications . . . . . . . . . 273

        Security . . . . . . . . . . 273

        Data Portability . . . . . . . . 276

    A Final Thought . . . . . . . . . . 277

Chapter 14: A Simple Ending . . . . . . . . . 279

    Defining Complexity . . . . . . . . . 279

        Difficult to Understand . . . . . . . 280

        Unintended Consequences . . . . . . 280

        Large Numbers of Interacting Parts . . . . . 280

        What Makes Something “Too Complex”? . . . 281

    Complexity Is a Tradeoff . . . . . . . . 282

    Modeling Complexity . . . . . . . . . 284

    Managing Complexity in the Real World . . . . . 286

        Don’t Ignore Complexity . . . . . . . 286

        Find a Model to Contain the Complexity . . . . 287

    A Final Thought . . . . . . . . 288

TOC, 9780133989359, 10/28/2015

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