Picture 1 of 1
Stock photo
Picture 1 of 1
Stock photo
Addison-Wesley Professional Computing Ser.: Interconnections : Bridges, Routers, Switches, and Internetworking Protocols by Radia Perlman (1999, Hardcover)
World of Books was Second Sale (4666966)
98.7% positive feedback
Price:
$4.68
Free shipping
Returns:
30 days returns. Seller pays for return shipping.
Condition:
Notes: Item in very good condition!
- Buy It NowInterconnections: Bridges, Routers, Switches, and Internetworking Pr - VERY GOOD
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
About this product
Product Identifiers
PublisherAddison Wesley Professional
ISBN-100201634481
ISBN-139780201634488
eBay Product ID (ePID)1166012
Product Key Features
Number of Pages560 Pages
LanguageEnglish
Publication NameInterconnections : Bridges, Routers, Switches, and Internetworking Protocols
SubjectNetworking / General, Networking / Local Area Networks (Lans), Networking / Network Protocols, Networking / Hardware
Publication Year1999
FeaturesRevised
TypeTextbook
AuthorRadia Perlman
Subject AreaComputers
SeriesAddison-Wesley Professional Computing Ser.
FormatHardcover
Dimensions
Item Height1.3 in
Item Weight37.4 Oz
Item Length9.5 in
Item Width7.7 in
Additional Product Features
Edition Number2
Intended AudienceScholarly & Professional
LCCN99-037086
Dewey Edition21
IllustratedYes
Dewey Decimal004.6/2
Edition DescriptionRevised edition
Table Of ContentPreface. 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
SynopsisRadia Perlmans 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 experts 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 algori
LC Classification NumberTK5105.543.P47 2000
