book

Designing Large Scale Lans

Name: Designing Large Scale Lans
Author: Kevin Dooley
ISBN: 9780596001506

by Kevin Dooley

November 2001

Intermediate to advanced

404 pages

14h 48m

English

O'Reilly Media, Inc.

Read now

Unlock full access

Designing Large-Scale LANs
Preface
AudienceOrganizationConventions Used in This BookComments and QuestionsAcknowledgments
1. Networking Objectives
1.1. Business Requirements1.1.1. Money1.1.2. Geography1.1.3. Installed Base1.1.4. Bandwidth1.1.5. Security1.1.6. Philosophical and Policy Requirements1.2. OSI Protocol Stack Model1.2.1. The Seven Layers1.2.1.1. Layer 11.2.1.2. Layer 21.2.1.3. Layer 31.2.1.4. Layer 41.2.1.5. Layer 51.2.1.6. Layer 61.2.1.7. Layer 71.2.2. Where the OSI Model Breaks Down1.3. Routing Versus Bridging1.4. Top-Down Design Philosophy
2. Elements of Reliability
2.1. Defining Reliability2.1.1. Failure Is a Reliability Issue2.1.2. Performance Is a Reliability Issue2.2. Redundancy2.2.1. Guidelines for Implementing Redundancy2.2.2. Redundancy by Protocol Layer2.2.3. Multiple Simultaneous Failures2.2.4. Complexity and Manageability2.2.5. Automated Fault Recovery2.2.5.1. Always let network equipment perform network functions2.2.5.2. Intrinsic versus external automation2.2.5.3. Examples of automated fault recovery2.2.5.4. Fault tolerance through load balancing2.2.5.5. Avoid manual fault-recovery systems2.2.6. Isolating Single Points of Failure2.2.7. Predicting Your Most Common Failures2.2.7.1. Mean time between failures2.2.7.2. Multiple simultaneous failures2.2.7.3. Combining MTBF values2.3. Failure Modes2.3.1. Congestion2.3.2. Traffic Anomalies2.3.3. Software Problems2.3.4. Human Error
3. Design Types
3.1. Basic Topologies3.1.1. Basic Concepts3.1.1.1. Bus topology3.1.1.2. Ring topology3.1.1.3. Star topology3.1.1.4. Mesh Topology3.1.2. Scalability3.2. Reliability Mechanisms3.2.1. Spanning Tree3.2.1.1. Spanning Tree eliminates loops3.2.1.2. Spanning Tree activates backup links and devices3.2.2. Layer 3 Recovery Mechanisms3.3. VLANs3.3.1. Avoid Spaghetti VLANs3.3.2. Protocol-Based VLAN Systems3.4. Toward Larger Topologies3.4.1. Collapsed Backbone3.4.1.1. Why collapse a backbone?3.4.1.2. Backbone capacity3.4.1.3. Backbone redundancy3.4.2. Distributed Backbone3.4.2.1. Trunk capacity3.4.2.2. Trunk fault tolerance3.4.3. Switching Versus Routing3.4.3.1. Ancient history3.4.3.2. Modernizing the old rule3.5. Hierarchical Design3.5.1. Routing Strategies3.5.1.1. One-armed routers and Layer 3 switches3.5.1.2. Redundancy3.5.1.2.1. Router-to-router segments3.5.1.2.2. Physical diversity3.5.1.3. Filtering3.5.1.3.1. Filtering for security3.5.1.3.2. Filtering for application control3.5.1.3.3. Policy-based routing3.5.2. Switching and Bridging Strategies3.5.2.1. Containing broadcasts3.5.2.2. Redundancy in bridged networks3.5.2.3. Filtering3.5.3. VLAN-Based Topologies3.5.3.1. Trunk design3.5.3.2. Trunking through a router3.5.3.3. Trunks3.5.3.3.1. Trunk protocols3.5.3.3.2. Trunk redundancy3.5.3.3.3. Trunks on servers3.5.3.4. VLAN Distribution Areas3.5.3.5. Sizing VLAN Distribution Areas3.6. Implementing Reliability3.6.1. Multiple Connections3.7. Large-Scale LAN Topologies3.7.1. Routers in the Core Level3.7.2. Routers in the Distribution Level3.7.3. Routers in Both the Core and Distribution Levels3.7.4. Connecting Remote Sites3.7.5. General Comments on Large-Scale Topology
4. Local Area Network Technologies
4.1. Selecting Appropriate LAN Technology4.1.1. Cost Efficiency4.1.2. Installed Base4.1.3. Maintainability4.1.4. Performance4.2. Ethernet and Fast Ethernet4.2.1. Ethernet Framing Standards4.2.1.1. Ethernet addresses4.2.2. Collision Detection4.2.3. Hubs, Bridges, and Switches4.2.4. Transceivers4.3. Token Ring4.3.1. MAUs, Bridges, and Switches4.4. Gigabit and 10 Gigabit Ethernet4.4.1. Gigabit to the Desk4.4.2. Gigabit as a Backbone Protocol4.5. ATM4.5.1. ATM LAN Services4.6. FDDI4.7. Wireless4.8. Firewalls and Gateways4.9. Structured Cabling4.9.1. Horizontal Cabling4.9.2. Vertical Cabling
5. IP
5.1. IP-Addressing Basics5.2. IP-Address Classes5.3. ARP and ICMP5.3.1. ARP5.3.2. ICMP5.4. Network Address Translation5.5. Multiple Subnet Broadcast5.6. General IP Design Strategies5.6.1. Unregistered Addresses5.6.2. IP Addressing Schemes5.6.2.1. Easily summarized ranges of addresses5.6.2.2. Sufficient capacity in each range5.6.2.3. Standard subnet masks for common uses5.6.2.4. Flexibility for future requirements5.6.3. The Default Gateway Question5.7. DNS and DHCP
6. IP Dynamic Routing
6.1. Static Routing6.1.1. Floating Static Routes6.2. Types of Dynamic Routing Protocols6.3. RIP6.3.1. RIP Functionality6.3.2. Avoiding Loops6.3.3. Split Horizons in RIP6.3.4. Variable Subnet Masks6.3.5. Redistributing with Other Routing Protocols6.4. IGRP and EIGRP6.4.1. Basic Functionality6.4.2. Active and Stuck-in-Active Routes6.4.3. Interconnecting Autonomous Systems6.4.4. Redistributing with Other Routing Protocols6.5. OSPF6.5.1. Area Types6.5.2. Area Structures6.5.3. Interconnecting Autonomous Systems6.5.4. Redistributing with Other Routing Protocols6.5.5. IP Addressing Schemes for OSPF6.5.6. OSPF Costs6.6. BGP6.6.1. Autonomous System Numbers6.6.2. Where to Use BGP
7. IPX
7.1. Dynamic Routing7.1.1. Novell RIP and SAP7.1.2. EIGRP7.1.3. NLSP7.2. General IPX Design Strategies7.2.1. IPX Addressing Schemes7.2.2. RIP and SAP Accumulation Zones7.2.3. Efficiency in IPX Networks
8. Elements of Efficiency
8.1. Using Equipment Features Effectively8.2. Hop Counts8.3. MTU Throughout the Network8.4. Bottlenecks and Congestion8.5. Filtering8.6. Quality of Service and Traffic Shaping8.6.1. QoS Basics8.6.2. Layer 2 and Layer 3 QoS8.6.3. Buffering and Queuing8.6.4. Integrated and Differentiated Services8.6.4.1. Assured Forwarding in Differentiated Services8.6.4.2. Expedited Forwarding in Differentiated Services8.6.5. IP TOS and Diffserv DSCP8.6.6. Traffic Shaping8.6.7. Defining Traffic Types8.6.8. RSVP8.6.9. Network-Design Considerations

9. Network Management
9.1. Network-Management Components9.1.1. Configuration Management9.1.2. Fault Management9.1.3. Performance Management9.1.4. Security Management9.1.5. Accounting Management9.2. Designing a Manageable Network9.3. SNMP9.3.1. How to Monitor9.3.2. What to Monitor9.3.3. Ad Hoc SNMP9.3.4. Automated Activities9.4. Management Problems9.4.1. DHCP9.4.2. Architectural Problems9.4.2.1. VLAN structures9.4.2.2. LAN extension9.4.2.3. Filtering9.4.2.4. Firewalls9.4.2.5. Redundancy features9.4.2.6. Tunnels9.4.3. Out-of-Band Management Techniques
10. Special Topics
10.1. IP Multicast Networks10.1.1. Multicast Addressing10.1.2. Multicast Services10.1.3. IGMP10.1.4. Group Membership10.1.5. Multicast Routing10.1.5.1. MOSPF10.1.5.2. DVMRP10.1.5.3. PIM10.1.5.4. BGMP10.1.6. Network-Design Considerations for Multicast Networks10.1.6.1. Multicast administrative zones10.1.6.2. Multicast and QoS10.2. IPv610.2.1. Header Structure10.2.2. Addressing10.2.3. Quality of Service10.2.4. Security10.2.5. Autoconfiguration10.2.6. Multicast and Anycast10.2.7. Migrating from IPv4 to IPv610.3. Security10.3.1. Hub and Switch Port-Level Security10.3.2. Filtering Traffic10.3.3. IPsec
A. Appendix: Combining Probabilities
Glossary
Bibliography
Books and Articles
Index
About the Author
Colophon
Copyright

Content preview from Designing Large Scale Lans

Appendix A. Appendix: Combining Probabilities

Start with one flip of a coin. If you flip the coin once, you know the answer. Call the probability of getting heads P, so the probability of getting tails is (1-P). The symbol kPn represents the probability of getting k heads in n flips.

Flip the coin a second time. Now there are several possibilities. You could have two tails, two heads, a head and a tail, or a tail and a head. I wrote down the probabilities for one flip. The probabilities for the second flip are the same, but I have to multiply the first flip by the second. The probability of getting two heads in a row is the probability of getting heads on the first toss times the probability of getting heads on the second toss:

The most interesting example is the ₁ P ₂. It says that the probability of getting one head in two tosses is the probability of getting a head then a tail, plus a tail then a head. Substituting in the values for ₀ P ₁ and ₁ P ₁ from the previous example ...

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.

Read now

Unlock full access

More than 5,000 organizations count on O’Reilly

O’Reilly covers everything we've got, with content to help us build a world-class technology community, upgrade the capabilities and competencies of our teams, and improve overall team performance as well as their engagement.

Julian F.

Head of Cybersecurity

I wanted to learn C and C++, but it didn't click for me until I picked up an O'Reilly book. When I went on the O’Reilly platform, I was astonished to find all the books there, plus live events and sandboxes so you could play around with the technology.

Addison B.

Field Engineer

I’ve been on the O’Reilly platform for more than eight years. I use a couple of learning platforms, but I'm on O'Reilly more than anybody else. When you're there, you start learning. I'm never disappointed.

Amir M.

Data Platform Tech Lead

I'm always learning. So when I got on to O'Reilly, I was like a kid in a candy store. There are playlists. There are answers. There's on-demand training. It's worth its weight in gold, in terms of what it allows me to do.

Mark W.

Embedded Software Engineer

Publisher Resources

ISBN: 0596001509Errata

Cloud Computing

Data Engineering

Data Science

AI & ML

Programming Languages

Software Architecture

IT/Ops

Security

Design

Business

Soft Skills

Designing Large Scale Lans

by Kevin Dooley

Appendix A. Appendix: Combining Probabilities

Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.