More Books
Routing TCP IP Volume I CCIE Professional Development
Routing TCP/IP, Volume I (CCIE Professional Development)
Table of Contents
Copyright
About the Author
About the Reviewers
Introduction
Objectives
Audience
Organization
Conventions and Features
Foreword
Part I: Routing Basics
Chapter 1. Basic Concepts: Internetworks, Routers, and Addresses
Bicycles with Motors
Data Link Addresses
Repeaters and Bridges
Routers
Network Addresses
Looking Ahead
Recommended Reading
Review Questions
Chapter 2. TCP/IP Review
The TCP/IP Protocol Layers
The IP Packet Header
IP Addresses
ARP
ICMP
The Host-to-Host Layer
Looking Ahead
Summary Table: Chapter 2 Command Review
Recommended Reading
Review Questions
Configuration Exercises
Troubleshooting Exercises
Chapter 3. Static Routing
The Route Table
Configuring Static Routes
Troubleshooting Static Routes
Looking Ahead
Summary Table:Chapter 3 Command Review
Review Questions
Configuration Exercises
Troubleshooting Exercises
Chapter 4. Dynamic Routing Protocols
Routing Protocol Basics
Distance Vector Routing Protocols
Link State Routing Protocols
Interior and Exterior Gateway Protocols
Static or Dynamic Routing?
Looking Ahead
Recommended Reading
Review Questions
Part II: Interior Routing Protocols
Chapter 5. Routing Information Protocol (RIP)
Operation of RIP
Configuring RIP
Troubleshooting RIP
Looking Ahead
Summary Table: Chapter 5 Command Review.
Recommended Reading
Review Questions
Configuration Exercises
Troubleshooting Exercises
Chapter 6. Interior Gateway Routing Protocol (IGRP)
Operation of IGRP
Configuring IGRP
Troubleshooting IGRP
Looking Ahead
Summary Table: Chapter 6 Command Review
Recommended Reading
Review Questions
Configuration Exercises
Troubleshooting Exercises
Chapter 7. Routing Information Protocol Version 2
Operation of RIPv2
Configuring RIPv2
Troubleshooting RIPv2
Looking Ahead
Summary Table:Chapter 7 Command Review
Recommended Reading
Review Questions
Configuration Exercises
Troubleshooting Exercises
Chapter 8. Enhanced Interior Gateway Routing Protocol (EIGRP)
Figure 8.1. The four major components of EIGRP. RTP and neighbor discovery are lower-level protocols that enable the correct operation of DUAL. DUAL can perform route computations for multiple routed protocols.
Configuring EIGRP
Troubleshooting EIGRP
Looking Ahead
Summary Table:Chapter 8 Command Review
Review Questions
Configuration Exercises
Troubleshooting Exercises
Chapter 9. Open Shortest Path First
Neighbors and Adjacencies
Configuring OSPF
Troubleshooting OSPF
Looking Ahead
Summary Table: Chapter 9 Command Review
Recommended Reading
Review Questions
Configuration Exercises
Troubleshooting Exercises
Chapter 10. Integrated IS-IS
Operation of Integrated IS-IS
Configuring Integrated IS-IS
Troubleshooting Integrated IS-IS
Looking Ahead
Summary Table: Chapter 10 Command Review
Review Questions
Configuration Exercises
Troubleshooting Exercises
Part III: Route Control and Interoperability
Chapter 11. Route Redistribution
Principles of Redistribution
Configuring Redistribution
Looking Ahead
Summary Table: Chapter 11 Command Review
Review Questions
Configuration Exercises
Troubleshooting Exercises
Chapter 12. Default Routes and On-Demand Routing
Fundamentals of Default Routes
Fundamentals of On-Demand Routing
Configuring Default Routes and ODR
Looking Ahead
Summary Table: Chapter 12 Command Review
Review Questions
Chapter 13. Route Filtering
Configuring Route Filters
Looking Ahead
Summary Table: Chapter 13 Command Review
Configuration Exercises
Troubleshooting Exercises
Chapter 14. Route Maps
Basic Uses of Route Maps
Configuring Route Maps
Looking Ahead
Summary Table: Chapter 14 Command Review
Review Questions
Configuration Exercises
Troubleshooting Exercises
Part IV: Appendixes
Appendix A. Tutorial: Working with Binary and Hex
Working with Binary Numbers
Working with Hexadecimal Numbers
Appendix B. Tutorial: Access Lists
Access List Basics
Standard IP Access Lists
Extended IP Access Lists
Calling the Access List
Keyword Alternatives
Named Access Lists
Filter Placement Considerations
Access List Monitoring and Accounting
Appendix C. CCIE Preparation Tips
Laying the Foundations
Hands-On Experience
Intensifying the Study
The Final Six Months
Exam Day
Appendix D. Answers to Review Questions
Chapter 1
Chapter 2
Chapter 3
Chapter 4
Chapter 5
Chapter 6
Chapter 7
Chapter 8
Chapter 9
Chapter 10
Chapter 11
Chapter 12
Chapter 14
Appendix E. Solutions to Configuration Problems
Chapter 2
Chapter 3
Chapter 5
Chapter 6
Chapter 7
Chapter 8
Chapter 9
Chapter 10
Chapter 11
Chapter 13
Chapter 14
Appendix F. Solutions to Troubleshooting Exercises
Chapter 2
Chapter 3
Chapter 5
Chapter 6
Chapter 7
Chapter 8
Chapter 9
Chapter 10
Chapter 11
Chapter 13
Chapter 14
Index
index_SYMBOL
index_A
index_B
index_C
index_D
index_E
index_F
index_G
index_H
index_I
index_K
index_L
index_M
index_N
index_O
index_P
index_Q
index_R
index_S
index_T
index_U
index_V
index_W
index_Z
 

Data Link Addresses

In a certain community in Colorado, two individuals are named Jeff Doyle. One Jeff Doyle frequently receives telephone calls for the person with whom he shares a name—so much so that his clever wife has posted the correct number next to the phone to redirect errant callers to their desired destination. In other words, because two individuals cannot be uniquely identified, data is occasionally delivered incorrectly and a process must be implemented to correct the error.

Among family, friends, and associates, a given name is usually sufficient for accurately distinguishing individuals. However, as this example shows, most names become inaccurate over a larger population. A more unique identifier, such as a United States Social Security number, is needed to distinguish one person from every other.

Note

Frame


Devices on a LAN must also be uniquely and individually identified or they, like humans sharing the same name, will receive data not intended for them. When data is to be delivered on aLAN , it is encapsulated within an entity called a frame, a kind of binary envelope. Think of data encapsulation as being the digital equivalent of placing a letter inside an envelope, as in Figure 1.1[1] . A destination address and a return (source) address are written on the outside of the envelope. Without a destination address, the postal service would have no idea where to deliver the letter. Likewise, when a frame is placed on a data link, all devices attached to the link "see" the frame; therefore, some mechanism must indicate which device should pick up the frame and read the enclosed data.

[1] As will be seen later, creating a data link layer frame is really more like putting an envelope inside a larger envelope.

Figure 1.1. Encapsulation means putting data into a frame—a kind of digital "envelope" for delivery.

graphics/01fig01.gif

Figure 1.2 shows the format of most common LAN frames. Notice that every case includes a destination address and a source address. The format of the address depends on the particular MAC protocol, but all the addresses serve the same purpose: to uniquely identify the machine for which the frame is destined and the device from which it was sent.

Figure 1.2. The frame format of a few common LAN data link frames.

graphics/01fig02.gif

The three most common data links currently used in LANs are Ethernet, Token Ring, and FDDI. Although each link is drastically different from the others, they share a common format for addressing devices on the network. This format, originally standardized by Xerox's Palo Alto Research Center (PARC)[2] and now administered by the Institute of Electrical and Electronics Engineers (IEEE), is variously called the burned-in address,[3] the physical address, the machine address, or most commonly, the MAC address.

[2] The full name, as reading any modern text on networking will tell you, is The Now Famous Xerox PARC.

[3] The address is usually permanently programmed, or burned in, to a ROM on the network interface.

The MAC address is a 48-bit number, which, as Figure 1.3 shows, is designed so that every device anywhere on the planet should be uniquely identifiable. Most everyone has heard the legends of large batches of network interface cards being turned out with identical burned-in addresses by unscrupulous "cloning" companies or as the result of "stuck" programming code. Although most of those stories are nothing more than legends, one can imagine what would happen if all devices on a LAN had the same MAC address: Imagine a town in which every resident is named Wessvick Smackley. Men, women, children, dogs, and cats all named Wessvick Smackley. Everyday communication, not to mention the career of the town gossip, would be unimaginably difficult.[4]

[4] In real life, duplicate MAC addresses on a network are most likely to occur as the result of network administrators using locally administered addresses. This occurrence is common enough on Token Ring networks that one step of the Token Ring insertion process is a duplicate address check.

Figure 1.3. A MAC address.

graphics/01fig03.gif

Although the MAC addresses are by convention referred to as "addresses," they are really names. Think about it: Because the identifier is burned in, or permanently assigned, to a device, it is a part of that device and goes wherever the device goes.[5]

[5] Although some data link addresses may be or must be administratively configured, the point is that they are identifiers, unique within a network.

Most adults have several street addresses through their lives, but few have more than one given name. A name identifies an entity—whether a person or a PC. An address describes where that person or PC is located.

In the interest of clarity, this book uses the term data link identifier or MAC identifier instead of MAC address. The reason for making such a distinction will soon be clear.