Always Learning

Interconnections: Bridges, Routers, Switches, and Internetworking Protocols, 2/E
Radia Perlman, Sun Microsystems, Inc.

ISBN-10: 0201634481
ISBN-13:  9780201634488

Publisher:  Addison-Wesley Professional
Copyright:  2000
Format:  Cloth; 560 pp
Published:  09/14/1999
Status: Instock


Customers outside the U.S., click here.


Print this content

In this section:


Table of Contents



Preface.


Roadmap to the Book.


Acknowledgments.


1. Essential Networking Concepts.

Layers.

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.

Hubs.

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.

Addresses.

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.

IP.

IPX.

IPX+.

IPv6.

CLNP Network Layer Addresses.

AppleTalk Network Layer Addresses.

DECnet Phases III and IV.

NAT/NAPT.



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.

LANs.

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.

RIP.

RTMP, IPX-RIP, and DECnet.

IS-IS, OSPF, NLSP, and PNNI.

Interdomain Routing Protocols.



15. WAN Multicast.

Introduction.

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.

Summary.

For Further Reading.



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

Switches.

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.

Parameters.

Making Multiprotocol Operation Possible.

Running over Layer 3 versus Layer.

Robustness.

Determinism versus Stability.

Performance for Correctness.

In Closing.



Glossary.


Index. 0201634481T04062001



Back to top

Print this content

In this section:


Author Bios

Radia Perlman's work has had a profound impact on the field of networking. She was recently featured in the 25th anniversary edition of Data Communications magazine as one of the 25 people whose work has most influenced the industry. She is the creator of the spanning tree algorithm upon which bridges (switches) are based, and the algorithms that allow robust and efficient link state routing, upon which all modern link state routing protocols (such as IS-IS, OSPF, and PNNI) are based. Radia designed IS-IS, Simple Multicast, and sabotage-proof routing. She is also co-author of Network Security: Private Communication in a Public World. Both of her books were listed in the top 10 most useful networking reference books in the March, 1988 issue of Network Magazine. She is currently a Distinguished Engineer at Sun Microsystems, Inc. She holds about 50 patents and a Ph.D. from M.I.T.



0201634481AB04062001


Backcover Copy

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


0201634481B04062001

Back to top

Print this content

This product is a member of the following series. Click on the series name to see the full list of products in the series.

Back to top

Log in to the Instructor Resource Center

Login name: 

  Password: 

Forgot login/password?  |  Need to redeem an access code?

        

Instructor Resource Center File Download

This work is protected by local and international copyright laws and is provided solely for the use of instructors in teaching their courses and assessing student learning. Dissemination or sale of any part of this work (including on the World Wide Web) will destroy the integrity of the work and is not permitted. The work and materials from this site should never be made available to students except by instructors using the accompanying text in their classes. All recipients of this work are expected to abide by these restrictions and to honor the intended pedagogical purposes and the needs of other instructors who rely on these materials.

Cancel     I accept, proceed with download

Print this content

Pearson Higher Education offers special pricing when you choose to package your text with other student resources. If you're interested in creating a cost-saving package for your students contact your Pearson Higher Education representative.

Back to top