Advertising Network Addresses
Each of the hosts in the Internet needed to be uniquely identifiable. In the Internet's two-level hierarchy, this required an address with two parts Together, these two types of addresses could uniquely identify any and all machines connected via the Internet. It is possible that the needs of a small, networked community could be satisfied with just host addresses, as is the case with LANs. Network addresses, however, are necessary for end systems on different networks to communicate with each...
The Seven Layers
The OSI model categorizes the various processes needed in a communications session into seven distinct functional layers. The layers are organized based on the natural sequence of events that occur during a communications session. Figure 1-1 illustrates the OSI reference model. Layers 1-3 provide network access, and Layers 4-7 are dedicated to the logistics of supporting end-to-end communications. Figure 1-1 The OSI reference model. Figure 1-1 The OSI reference model. The bottom layer, or Layer...
IP Routing Fundamentals
An Introduction to Internetworking Understanding Internetwork Addresses Internet Protocols Versions The Mechanics of Routing Protocols Internetworking with Dissimilar Protocols HOME CONTENTS PREVI& US NEXT GLOSSARY FEEDBACK SEARCH HELP Copyright 1989-1999 Cisco Systems Inc. Welcome to the employee only Cisco Press web site. The above Welcome page link presents a FAQ sheet for Cisco Press, including information about how you can buy Cisco Press books . New information on the Cisco Press...
The Media Access Domain
A media access domain consists of all the devices connected to a LAN that must share the LAN's bandwidth. The name and nature of this domain depends on the media access methodology employed in a LAN. The two primary methodologies for regulating media access are contention and token passing. Other media access arbitration techniques exist, but these two account for the vast majority of existing LANs. More importantly, they will adequately demonstrate the differences between a media access domain...
Pv4 Addressing Scheme
IPv4 uses a 32-bit binary addressing scheme to identify networks, network devices, and network-connected machines. These addresses, known as IP addresses, are strictly regulated by the Internet Assigned Numbers Authority (IANA) to ensure their uniqueness in the Internet. This function is currently being transitioned out of the hands of the U.S. government in favor of a private organization. This reflects both the desire of the U.S. government to control its expenses, and the undeniably global...
- Blueprint for Success
- Closer Look at Routers
- A route can expire
- Acknowledgment Packets
- Addressing Considerations
- After You Build the WAN
- An Introduction to Internetworking
- An Overview of IGRP
- Area Border Routers
- Atm
- Authenticated Message Format
- Authentication
- Authentication Concerns
- Authentication Conventions
- Authentication Header
- Average Traffic Volumes
- Backbone routers
- Backbone Routers
- Backward Compatibility with IGRP
- Bandwidth
- Before You Build the WAN
- Benefits and Uses of Multilayer Switches
- Binary Versus Decimal Numbers
- Bridge Emulation
- Bridging Today
- Building Internetworks - 2
- Calculating Distance Vectors
- Calculating Routes
- Calculating the Load
- Calculating Vectors
- Carrier System Standards
- Cell Switched Facilities
- Circuit Switched Facilities
- Cisco Press Help
- Ciscos Solution
- Classless Addressing
- Classless Interdomain Routing
- Collapsed Backbones
- Component Uptime - 2
- Convergence - 2
- Convergence Time
- Convergence Using EIGRP
- Copyright and License Information
- Costs of the WAN - 2
- Counting to Infinity
- Default Routes
- Default routing costs Homogeneous Networks
- Defining Variance
- Delay - 2
- Determining Backbone Loads
- Dissimilar Architectures
- Dissimilar Convergence Mechanisms
- Dissimilar Routed Protocols
- Dissimilar Routing Protocols
- Distances
- Distance Vector Routing
- Drawbacks to Distance Vector Routing
- Drawbacks to Link State Routing
- Duplicate LSAs
- EIGRP Data Structures
- EIGRP Packet Types
- EIGRPs Improvements
- Encryption
- Enhanced Interior Gateway Routing Protocol
- Enhanced Route Aggregation
- Equal Cost Load Balancing
- Ethernet
- Event Driven Updates
- Fddi
- FDDI Connection Types
- FDDI Transmission Media
- Feasible Successors
- Figure 111 A small EIGRP network
- Figure 314 An example of a collapsed backbone
- Figure 316 Using a router as an Ip Wan gateway
- Figure 39 Translating bridges can also be used to interconnect clientserver LANs using a highperformance LAN architecture
- Figure 41 An access control list can reduce the risks of internetworking
- Figure 43 Exterior routers from the perspective of the private networks
- Figure 45 Routing between adjacent networks
- Figure 51 A comparison of OSI and TCPIP reference models
- Figure 64 Frame Relay requires the establishment of logical pairs of data link connections
- Figure 71 A simple internetwork with static routes
- Figure 72 A link failure in a statically programmed internetwork can disrupt communications
- Figure 73 An internetwork using a distancevector routing protocol
- Figure 74 A fourgateway internetwork
- Figure 813 Router D has failed
- Figure 815 A and C believe that they can access D through B
- Figure 819 Counting to infinity with three gateways
- Figure 83 The RIP packet format with two table entries
- Figure 84 Each RIP node advertises the contents of its routing table to its immediate neighbors
- Figure 86 Hop counts are modified to differentiate between primary and alternative routes
- Figure 89 RIP can deliver datagrams to gateways
- Figure 92 The RIP2 packet format with two table entries
- Figure 94 The RIP2 packet format with one routing entry and authentication activated
- Figure 96 The T3 route cannot be discovered by routers 1 and
- Fixed Metrics
- Fixing Performance Problems
- Flash Update
- Frame Relay
- Full Mesh
- Gateway Router Routing Table Contents
- Gateways
- Gigabit Ethernet MDIs
- Hello Packets
- Hold Timer
- Hold Down Timers
- Hold Downs
- Hop Count
- Hop Count Limit
- How CIDR Works
- Hybrid Topologies
- Hybridized
- Hybridized Routing
- Identifying Invalid Routes
- Initiating Table Updates
- Integrated Routing Protocols
- Integrated Services Digital Network
- Interior Gateway Routing Protocol
- Internal Area Routers
- Internet Protocol Version 4 IPv4
- Internet Protocol Version 6 IPv6
- Internet Protocols Versions
- Internet Service Provider Unicast Address
- Internetworking Nonadjacent Networks
- Internetworking Scenarios
- Internetworking with Dissimilar Protocols
- Introduction
- IP Addressing
- IP Network Domains
- IP Routing Primer
- IP Switching
- IPSec
- Pv4 Address Formats
- Pv4 Conclusion
- Pv4Mapped IPv6 Unicast Address
- Pv6 Anycast Address Structures
- Pv6 Multicast Address Structures
- Isochronous Services
- ITUs Digital Signal Hierarchy
- Lack of Load Balancing
- LAN Backbones
- LAN Domains
- LAN Segmentation
- LAN Technologies
- Leased Lines
- Limitations of RIP
- Limitations of RIP2
- Link Local
- Link State Routing
- Load
- Logical Adjacency
- Logical Interconnectivity
- LSA Header
- Manually Setting Values
- Maximum Traffic Volumes
- Mbps Ethernet MDIs - 2
- Misperceptions About the OSI Reference Model
- Mtu
- Multicasting
- Multilayer Switches
- Multipath Routing
- Needed Capabilities
- Neighbor Discovery and Recovery
- New Features Found in EIGRP
- Next Hop Identification
- Next Generation Routing
- No Common Routing Metric
- Note Active Versus Passive Nodes
- Note Availability Versus Uptime
- Note Configuring an IGRP Default Metric
- Note Route Flapping
- Note Route Tagging with EIGRP
- Note The Differences Between Reference Models
- Note Twisted Pair Wiring
- Note Two Functional Classes of Dynamic Routing Protocols
- Open Shortest Path First - 2
- Operational Mechanics - 2
- OSPF Areas
- OSPF Data Structures
- Packet Tagging
- Packet Switched Facilities
- Parallel Backbones
- Partial Mesh Topology
- Partial Redundancy
- Peerto Peer Topology
- Performance Characteristics of Hybridized Routing
- Performance Delays
- Physical Components
- Physical Interconnectivity
- Placing Gateways
- Poison Reverse Updates
- Port Switching
- Preconvergence Routing Table Contents
- Problems with Route Redistribution
- Processing LSA Updates
- Protocol Specific Modules
- Purging Invalid Routes
- Quantity of Metrics
- Query and Reply Packets
- Receiving the Bit Stream
- Redistributing Routing Information
- Redistribution Between Same Protocol Networks
- Redistribution from Network A to Network B
- Redundant Routed Protocols
- Redundant Routing Protocols
- Reliability - 2
- Reliable Transport Protocol
- Rfc 1058
- RFC 2328 OSPF Version
- Ring Topology
- RIP Packet Format
- RIP2 Message Format
- RIP2 Request Message
- Rip2 Rfc 1723
- RIP2s New Features
- Roles of the Router in WANs
- Route Calculation and Maintenance
- Routed
- Routeflush timer
- Router 2s Perspective
- Router 3s Perspective
- Router A Routing Table Contents with a Link Failure
- Router Functions
- Router Physical Resources
- Router Physical Resources Rates
- Routers
- Routers and LANs - 2
- Routers and WANs
- Routing
- Routing Between Adjacent Networks
- Routing Between Gateways
- Routing Between Networks
- Routing Between Segments
- Routing Information Protocol
- Routing Information Protocol Version
- Routing Table Contents
- Routing Table Deletions
- Routing to a Gateway
- Routing Types
- Routing Updates
- Routing Within a Network
- Scale
- Security
- Segment Switching
- Segmenting with Bridges
- Segmenting with Routers
- Segmenting with Switches
- Selecting Routing Protocols
- Selecting Transmission Technologies
- Slow Convergence
- SONETs Carrier Systems
- Speed Buffering Bridges
- Split Horizon
- Split Horizon with Poisoned Reverse
- Split Horizons
- Star Network Topology
- Static Routing
- Static Versus Dynamic Metrics
- Storing Multiple Routes
- Subnet Masks
- Subnetting
- Summary - 2 3 4 5 6 7 8 9 10 11 12 13 14 15
- Supernetting
- Switched
- Switching Contention Based Networks
- Table 61 ANSIs Digital Signal Standards
- Table 62 ITUs CEPT Digital Signal Standards
- Table 76 Routers that Share Routing Information with Immediate Neighbors
- TCarrier Services
- Testing for Feasibility
- The AFI Field
- The Command Field
- The Dangers of Multipath Routing
- The Database Description Packet
- The Differences Between Bridges Switches and Routers
- The Distributed Update Algorithm
- The Effects of IPv6
- The Emergence of Subnetworks
- The Future of Routing
- The Hello Packet
- The Hostto Host Layer
- The Internet Layer
- The Internets Address Architecture
- The Link State Acknowledgment Packet
- The Link State Request Packet
- The Link State Update Packet
- The MAC Broadcast Domain
- The Mechanics of Logical Adjacency
- The Mechanics of Route Redistribution
- The Mechanics of Routing Protocols
- The Metric Field
- The Need to Route
- The Need to Update RIP
- The Network Address Field
- The Network Layer
- The New Uses of Computer Based Routing
- The Origins of IGRP
- The Origins of OSPF
- The Origins of RIP
- The OSI Reference Model
- The RIP Routing Table
- The Route Tag Field
- The Routing Table
- The Shortest Path Tree
- The STS System
- The TCarrier System
- The topology table
- The Topology Table
- The Transport Layer
- The Version Number Field
- The Zero Fields
- Three Tiered Topology
- Todays Products
- Token Ring
- Topological Changes
- Topologies for Simple Internetworks
- Traffic Volumes - 2
- Transmission Facilities
- Transmission Facility Rates
- Transmission Technologies
- Tunnel mode
- Tunnels
- Two Tiered Topology
- Typical IPv4 Operation
- Unauthorized Gateways
- Understanding Internetwork Addresses - 2
- Unequal Cost Load Balancing
- Update Packets
- Updating the Routing Table
- Using Autocalculation
- Using Default Route Costs
- Using the Gateway
- Using the Metrics
- Vlsm
- WAN Gateway
- WAN Performance Criteria
- WAN Technologies
- Whats Distance Vector Routing Good
- Whats Link State Routing Good
- Whats Static Routing Good
- Wraparounds
- X
- Xeroxs RIP


