Home > Store

Interconnections: Bridges, Routers, Switches, and Internetworking Protocols, 2nd Edition

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

Interconnections: Bridges, Routers, Switches, and Internetworking Protocols, 2nd Edition


  • Your Price: $67.99
  • List Price: $84.99
  • Usually ships in 24 hours.


  • Copyright 1999
  • Dimensions: 7-3/8" x 9-1/4"
  • Pages: 560
  • Edition: 2nd
  • Book
  • ISBN-10: 0-201-63448-1
  • ISBN-13: 978-0-201-63448-8

Radia Perlman's Interconnections is recognized as a leading text on networking theory and practice. It provides authoritative and comprehensive information on general networking concepts, routing algorithms and protocols, addressing, and the mechanics of bridges, routers, switches, and hubs. This Second Edition is expanded and updated to cover the newest developments in the field, including advances in switching and bridge technology, VLANs, Fast Ethernet, DHCP, ATM, and IPv6. Additional new topics include IPX, AppleTalk, and DECnet. You will gain a deeper understanding of the range of solutions possible and find valuable information on protocols for which documentation is not readily available elsewhere.

Written by the inventor of many of the algorithms that make switching and routing robust and efficient, Interconnections, Second Edition offers an expert's insight into how and why networks operate as they do. Perlman describes all of the major networking algorithms and protocols in use today in clear and concise terms, while exploring the engineering trade-offs that the different approaches represent.

The book contains extensive coverage of such topics as:

  • The spanning tree algorithm
  • The differences between bridges, routers, and switches
  • Virtual LANs (VLANs) and Fast Ethernet
  • Addressing and packet formats for IP, IPv6, IPX, CLNP, AppleTalk, and DECnet
  • Autoconfiguration of addresses; strategies in various protocol suites
  • Routing protocols, including RIP, IS-IS, OSPF, PNNI, NLSP, and BGP
  • Layer 3 multicast protocols, including IGMP, DVMRP, MOSPF, CBT, PIM, BGMP, Simple Multicast, and Express
  • Sabotage-proof routing
  • Protocol design folklore



Related Article

Protocol Design Folklore

Sample Content

Table of Contents


Roadmap to the Book.


1. Essential Networking Concepts.


Service Models.

Important Properties of a Network.

Reliable Data Transfer Protocols.

2. Data Link Layer Issues.

Generic LANs.

IEEE 802 LANs.

Names, Addresses, Routes.

LAN Addresses.

Multicast versus Unicast Addresses.

The Broadcast Address.

Multiplexing Field.

Bit Order.

Logical Link Control.

Issues in 802.3.

Issues in 802.5.

Packet Bursts.

Reasons for Bridges.

Point-to-Point Links.

3. Transparent Bridges.

The No-Frills Bridge.

The Learning Bridge.

Spanning Tree Algorithm.

Spanning Tree Algorithm Refinements.

Bridge Message Formats.

Other Bridge Issues.

Remote Bridges.

4. Source Routing Bridges.

Pure Source Routing.

SR-TB Bridges.

SRT Bridges.

End-system Algorithms.

Source Routing versus Transparent Bridging.

Ideas for Improving Source Route Bridging.

5. Hubs, Switches, Virtual LANs, and Fast Ethernet.


Faster LANs.

Virtual LANs (VLANs).

6. Network Interface: Service Models.

What Is the Network Layer?

Network Service Types.

7. Connection-oriented Nets: X.25 and ATM.

Generic Connection-oriented Network.

X.25: Reliable Connection-oriented Service.

Implementing X.25 Inside the Net.

Asynchronous Transfer Mode.

8. Generic Connectionless Service.

Data Transfer.


Hop Count.

Service Class Information.

Network Feedback.

Fragmentation and Reassembly.

Maximum Packet Size Discovery.

9. Network Layer Addresses.

Hierarchical Addresses with Fixed Boundaries.

Hierarchical Addresses with Flexible Boundaries.

Owning versus Renting Addresses.

Types of Addresses.





CLNP Network Layer Addresses.

AppleTalk Network Layer Addresses.

DECnet Phases III and IV.


10. Connectionless Data Packet Formats.

Pieces of a Connectionless Network Layer.

Data Packets.

Summary of Packet Formats for Easy Reference.

Technical Issues and Comparisons in Data Packet Formats.

Source Routing.

The Great IPX Frame Format Mystery.

Error Reports and Other Network Feedback to the Endnode.

11. Neighbor Greeting and Autoconfiguration.

Endnodes Attached via Point-to-Point Links.

Endnodes Attached via LANs.

Endnodes Attached via Nonbroadcast Multiaccess Media.

Finding Things.

12. Routing Algorithm Concepts.

Distance Vector Routing.

Link State Routing.

Comparison of Link State and Distance Vector Routing.

Load Splitting.

Link Costs.

Migrating Routing Algorithms.


Types of Service.

Partition Repair: Level 1 Subnetwork Partition.

13. Fast Packet Forwarding.

Using an Additional Header.

Address Prefix Matching.

Longest Prefix Match with Trie.

Binary Search.

14. Specific Routing Protocols.

A Brief History of Intradomain Routing Protocols.


RTMP, IPX-RIP, and DECnet.


Interdomain Routing Protocols.

15. WAN Multicast.


Multicast in IP.

16. Sabotage-proof Routing.

The Problem.

All You Need to Know about Cryptography.

Overview of the Approach.

Detailed Description of the Approach.


For Further Reading.

17. To Route, Bridge, or Switch: Is That the Question?


Bridges versus Routers.

Extensions to Bridges.

Extensions to Routers.

18. Protocol Design Folklore.

Simplicity versus Flexibility versus Optimality.

Knowing the Problem You're Trying to Solve.

Overhead and Scaling.

Operation Above Capacity.

Compact IDs versus Object Identifiers.

Optimizing for the Most Common or Important Case.

Forward Compatibility.

Migration: Routing Algorithms and Addressing.


Making Multiprotocol Operation Possible.

Running over Layer 3 versus Layer.


Determinism versus Stability.

Performance for Correctness.

In Closing.


Index. 0201634481T04062001


Interconnections, Second Edition is about what goes on inside the boxes that move data around the Internet. These boxes are variously called bridges, routers, switches, and hubs. The book also describes the devices that connect to the network.

There is considerable confusion in this area. Most of the terminology is ill defined and is used in conflicting ways. The terminology and the specifications tend to be daunting. Some knowledge is spread among many different documents; much is unwritten folk wisdom. Adding to the confusion is dogma. Beliefs are accepted as truth, and questioning any of the dogma is often greeted with hostility. But good engineering demands that we understand what we're doing and why, keep an open mind, and learn from experience.

In Interconnections, Second Edition, instead of diving right into the details of one protocol, I first focus on the problems to be solved. I examine various solutions to each of these problems and discuss the engineering trade-offs involved. Then I look at a variety of solutions that have been deployed and compare the approaches. I give technical arguments for any opinions, and if you think I have missed any arguments I welcome email discussion. My email address is at the back of the book, which I hope you will find after having read the book cover to cover.

In the first edition, my intention was to help people understand the problems and the general types of solutions, assuming that they would read the specifications to get the details of specific protocols. But people used the book as a reference in addition to using it to understand the issues. So in this edition I have documented many more of the protocols in detail.

I believe that to understand something deeply you need to compare it to something else. The first edition was "minimalist" in that I always used only two examples: two types of bridges, bridges versus routers, connection-oriented versus connectionless network layer protocols, and two examples of connectionless protocols (CLNP and IP). In this edition I add a lot more examples, including ATM, IPv6, IPX, AppleTalk, and DECnet. I did this in part because these protocols exist, and it is hard to get information about them. But mostly I did it because the protocols embody interesting ideas that should not be lost. When we design new protocols, we should learn from previous ideas, both good and bad. Also, it takes very little additional effort, after the problem is described generically, to describe several examples.

Roadmap to the Book

The first four chapters are not significantly different from their counterparts in the first edition, but the rest of the book has been largely rewritten. Chapters 1 through 4 cover general networking concepts, data link issues such as addressing and multiplexing, transparent bridges and the spanning tree algorithm, and source routing bridges. Chapter 5 is completely new and explains how the notion of a switch evolved into a rediscovery of the bridge. It also covers VLANs and fast Ethernet.

The remainder of the book concentrates on layer 3 (the network layer). Chapter 6 gives an overview of the network layer. Chapter 7 covers connection-oriented networks, including ATM and X.25. Chapter 8 discusses the issues in a generic connectionless network layer. Chapter 9 covers layer 3 addressing generically and gives a detailed comparison of IP, IPv6, CLNP, DECnet, AppleTalk, and IPX. Chapter 10 covers the information that should appear in a network layer header and contrasts the headers of several protocols.

Chapter 11 covers autoconfiguration and neighbor discovery, including protocols such as ARP and DHCP. Chapter 12 covers routing algorithms generically.

Chapter 13 discusses the problem of doing longest-prefix matching, which is required in order to forward IP packets quickly. Chapter 14 discusses the specifics of various routing protocols including RIP, IS-IS, OSPF, PNNI, NLSP, and BGP. Chapter 15 covers network layer multicast. Chapter 16 explains how to design a network that is invulnerable to sabotage, an idea whose time may come.

The final two chapters summarize the book, and I hope they will be mostly light and entertaining reading. Chapter 17 probes the mystery of what, if anything, distinguishes a router from a bridge. Chapter 18 attempts to capture folk wisdom about how to design a protocol.

Finally, there is an extensive glossary. I try to define terms when I first use them, but if I ever fail to do that, you will probably find them in the glossary.


Writing this section is scary because I am afraid I will leave people out. I'd like to thank the people who reviewed all or part of the book: Peter Memishian, Paul Koning, Tony Lauck, Craig Partridge, Dan Pitt, Brian Kernighan, Paul Bottorff, Joel Halpern, Charlie Kaufman, Mike Speciner, Andy Tanenbaum, Phil Rosenzweig, Dan Senie, William Welch, Craig Labovitz, Chase Bailey, George Varghese, and Suchi Raman. Other people who have been helpful by answering questions are Ariel Hendel, Rich Kubota, Stuart Cheshire, Tom Maufer, Steve Deering, and John Moy. The first time I sent an email question in the middle of the night (when I did most of my work on this book) to Craig Partridge, the co-series editor for this book, the beep indicating incoming mail happened so immediately that I assumed it was an automatic mail responder informing me he was on vacation. But it was an answer to my question. I assume he doesn't have an automatic mail responder so clever that it can answer technical questions, so I thank him for being so prompt and available. Brian Kernighan, the other series editor, also had detailed and helpful comments on the entire book.

The people at Addison-Wesley have been amazingly patient with me for the many years in which I've been working on this edition. I'm not sure they had any alternative besides patience, but it was nice that they believed I'd finish even when I wasn't so sure. So thank you to Mary Hart, Karen Gettman, Jacquelyn Doucette, and Jason Jones. And I'd also like to thank my copy editor, Betsy Hardinger. She of all people will have read every word of the book, while maintaining the concentration to note inconsistencies and ways of removing excess words here and there. I know it's her job, but I'm still impressed.

Mike Speciner helped me figure out the mysteries of Framemaker. Ray Perlner made sure that I maintained some humor in the book and watched over my shoulder while I typed the last chapter to see that I had enough funny bad real-life protocols. Dawn Perlner has been terrifically supportive, convincing her friends and even strangers in bookstores to buy my books. She used to be my child. Now she's a wonderful friend.




Page xiii: This paragraph added at bottom of page: "I'd like to thank the readers who have sent in errata items. The errata are listed at http://www.awprofessional.com/titles/0-201-63448-1. I'd especially like to thank Akira Kato, who gave the book a really thorough review in the process of translating it into Japanese."

Page 48, Figure 3.4: A ">" symbol was inserted in front of the second "100".

Page 49, Figure 3.6: Figure moved to top of page.

Page 49, Line 6: "(see Figure 3.6)" was omitted.

Page 138, Line 9: "data link header source = c and destination = d, and IP header source = a.b.c.C and destination a.b.c.D" now reads "data link header source = h and destination = d, and IP header source = a.b.c.H and destination a.b.c.H"

Page 142, Line 5: "on 802.3" was omitted.

Page 143, Line 3: "Notice that in this format there is" now reads "Notice that in this format there are".

Page 146, Line 29: "minimum delay, or minimum delay variance" now reads "maximum delay, or maximum delay variance".

Page 157, Line 12: Second occurence of "DCE" changed to "DTE".

Page 186, Line 31: "the router fragments into 1,000 and 2,000" now reads "the router fragments into 1,000 and 200".

Page 193, Line 13: A "(" symbol was inserted at the beginning of the line.

Page 196, Line 2: "and the address of a BOOTP server" was omitted.

Page 206, Line 30: "73::/8, or 73:0:0:0:0:0:0:0/8" now reads "7300::/8, or 7300:0:0:0:0:0:0:0/8".

Page 209, Line 26: "FEA0::/10" now reads "FEC0::/10"

Page 213, Line 17: "getting an IPD" now reads "getting an IDP".

Page 215, Line 19: "(DTE address 84)" now reads "(DTE address 83)".

Page 263, Line 6: "unrecognizeed IPv6 option" now reads "unrecognized IPv6 option".

Page 269: Tenth paragraph was omitted.

Page 292, Line 19: "Next Hop Resoloution Protocol" now reads "Next Hop Resolution Protocol".

Page 322, Line 13: "64 bits for link cost is sufficient." now reads "64 values for link cost is sufficient."

Page 325, Line 16: "the new path to TENT was found." now reads "the new path to DEST was found."

Page 352, Line 5: "2 for prefixes 1 more than a multiple of 4" now reads "2 for prefixes 3 more than a multiple of 4"

Page 354, Line 5: "1-padded prefix." now reads "0-padded prefix or exact match."

Page 354, Line 17: "addresses covered by 101." now reads "addresses covered by 001."

Page 359, Line 17: "starts with 0010-1," now reads "starts with 0010-110,".

Page 361, Line 22: "note the size the prefix was," now reads "note that the size the prefix was".

Page 457, Line 29: "reply sent to the switch," now reads "reply sent to the router,".

Page 457, Line 31: "switch." now reads "router.".

Page 458, Line 2: "addressed to the switch" now reads "addressed to the router".

Page 465, Figure 15.8: "Core" now reads "RP".

Page 469, Line 15: "from Stanford" now reads "from Stanford University."

Page 471, Figures 15.10: The B node is now labelled R.

Page 471, Figure 15.11: In Figure 15.11, the line between R3 and R4 is no longer bold. Instead, the lines between R3 and R6 as well as the lines between R6 and R are now bold. The B node is now labelled R.

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.


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.


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.


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.


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.


This site is not directed to children under the age of 13.


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.


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.


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