book

Computer Networks, Fourth Edition

by Andrew S. Tanenbaum

August 2002

Intermediate to advanced

912 pages

27h 47m

English

Pearson

Read now

Unlock full access

Dedication
1.1. Uses of Computer Networks1.1.1. Business Applications1.1.2. Home Applications1.1.3. Mobile Users1.1.4. Social Issues1.2. Network Hardware1.2.1. Local Area Networks1.2.2. Metropolitan Area Networks1.2.3. Wide Area Networks1.2.4. Wireless Networks1.2.5. Home Networks1.2.6. Internetworks1.3. Network Software1.3.1. Protocol Hierarchies1.3.2. Design Issues for the Layers1.3.3. Connection-Oriented and Connectionless Services1.3.4. Service Primitives1.3.5. The Relationship of Services to Protocols1.4. Reference Models1.4.1. The OSI Reference ModelThe Physical LayerThe Data Link LayerThe Network LayerThe Transport LayerThe Session LayerThe Presentation LayerThe Application Layer1.4.2. The TCP/IP Reference ModelThe Internet LayerThe Transport LayerThe Application LayerThe Host-to-Network Layer1.4.3. A Comparison of the OSI and TCP/IP Reference Models1.4.4. A Critique of the OSI Model and ProtocolsBad TimingBad TechnologyBad ImplementationsBad Politics1.4.5. A Critique of the TCP/IP Reference Model1.5. Example Networks1.5.1. The InternetThe ARPANETNSFNETInternet UsageArchitecture of the Internet1.5.2. Connection-Oriented Networks: X.25, Frame Relay, and ATMX.25 and Frame RelayAsynchronous Transfer ModeATM Virtual CircuitsThe ATM Reference Model1.5.3. Ethernet1.5.4. Wireless LANs: 802.111.6. Network Standardization1.6.1. Who’s Who in the Telecommunications World1.6.2. Who’s Who in the International Standards World1.6.3. Who’s Who in the Internet Standards World1.7. Metric Units1.8. Outline of the Rest of the Book1.9. SummaryProblems
2.1. The Theoretical Basis for Data Communication2.1.1. Fourier Analysis2.1.2. Bandwidth-Limited Signals2.1.3. The Maximum Data Rate of a Channel2.2. Guided Transmission Media2.2.1. Magnetic Media2.2.2. Twisted Pair2.2.3. Coaxial Cable2.2.4. Fiber OpticsTransmission of Light through FiberFiber CablesFiber Optic NetworksComparison of Fiber Optics and Copper Wire2.3. Wireless Transmission2.3.1. The Electromagnetic Spectrum2.3.2. Radio Transmission2.3.3. Microwave TransmissionThe Politics of the Electromagnetic Spectrum2.3.4. Infrared and Millimeter Waves2.3.5. Lightwave Transmission2.4. Communication Satellites2.4.1. Geostationary Satellites2.4.2. Medium-Earth Orbit Satellites2.4.3. Low-Earth Orbit SatellitesIridiumGlobalstarTeledesic2.4.4. Satellites versus Fiber2.5. The Public Switched Telephone Network2.5.1. Structure of the Telephone System2.5.2. The Politics of Telephones2.5.3. The Local Loop: Modems, ADSL, and WirelessModemsDigital Subscriber LinesWireless Local Loops2.5.4. Trunks and MultiplexingFrequency Division MultiplexingWavelength Division MultiplexingTime Division MultiplexingSONET/SDH2.5.5. SwitchingCircuit SwitchingMessage SwitchingPacket Switching2.6. The Mobile Telephone System2.6.1. First-Generation Mobile Phones: Analog VoiceAdvanced Mobile Phone SystemChannelsCall Management2.6.2. Second-Generation Mobile Phones: Digital VoiceD-AMPS—The Digital Advanced Mobile Phone SystemGSM—The Global System for Mobile CommunicationsCDMA—Code Division Multiple Access2.6.3. Third-Generation Mobile Phones: Digital Voice and Data2.7. Cable Television2.7.1. Community Antenna Television2.7.2. Internet over Cable2.7.3. Spectrum Allocation2.7.4. Cable Modems2.7.5. ADSL versus Cable2.8. SummaryProblems
3.1. Data Link Layer Design Issues3.1.1. Services Provided to the Network Layer3.1.2. Framing3.1.3. Error Control3.1.4. Flow Control3.2. Error Detection and Correction3.2.1. Error-Correcting Codes3.2.2. Error-Detecting Codes3.3. Elementary Data Link Protocols3.3.1. An Unrestricted Simplex Protocol3.3.2. A Simplex Stop-and-Wait Protocol3.3.3. A Simplex Protocol for a Noisy Channel3.4. Sliding Window Protocols3.4.1. A One-Bit Sliding Window Protocol3.4.2. A Protocol Using Go Back N3.4.3. A Protocol Using Selective Repeat3.5. Protocol Verification3.5.1. Finite State Machine Models3.5.2. Petri Net Models3.6. Example Data Link Protocols3.6.1. HDLC—High-Level Data Link Control3.6.2. The Data Link Layer in the InternetPPP—The Point-to-Point Protocol3.7. SummaryProblems
4.1. The Channel Allocation Problem4.1.1. Static Channel Allocation in LANs and MANs4.1.2. Dynamic Channel Allocation in LANs and MANs4.2. Multiple Access Protocols4.2.1. ALOHAPure ALOHASlotted ALOHA4.2.2. Carrier Sense Multiple Access ProtocolsPersistent and Nonpersistent CSMACSMA with Collision Detection4.2.3. Collision-Free ProtocolsA Bit-Map ProtocolBinary Countdown4.2.4. Limited-Contention ProtocolsThe Adaptive Tree Walk Protocol4.2.5. Wavelength Division Multiple Access Protocols4.2.6. Wireless LAN ProtocolsMACA and MACAW4.3. Ethernet4.3.1. Ethernet Cabling4.3.2. Manchester Encoding4.3.3. The Ethernet MAC Sublayer Protocol4.3.4. The Binary Exponential Backoff Algorithm4.3.5. Ethernet Performance4.3.6. Switched Ethernet4.3.7. Fast Ethernet4.3.8. Gigabit Ethernet4.3.9. IEEE 802.2: Logical Link Control4.3.10. Retrospective on Ethernet4.4. Wireless LANs4.4.1. The 802.11 Protocol Stack4.4.2. The 802.11 Physical Layer4.4.3. The 802.11 MAC Sublayer Protocol4.4.4. The 802.11 Frame Structure4.4.5. Services4.5. Broadband Wireless4.5.1. Comparison of 802.11 with 802.164.5.2. The 802.16 Protocol Stack4.5.3. The 802.16 Physical Layer4.5.4. The 802.16 MAC Sublayer Protocol4.5.5. The 802.16 Frame Structure4.6. Bluetooth4.6.1. Bluetooth Architecture4.6.2. Bluetooth Applications4.6.3. The Bluetooth Protocol Stack4.6.4. The Bluetooth Radio Layer4.6.5. The Bluetooth Baseband Layer4.6.6. The Bluetooth L2CAP Layer4.6.7. The Bluetooth Frame Structure4.7. Data Link Layer Switching4.7.1. Bridges from 802.x to 802.y4.7.2. Local Internetworking4.7.3. Spanning Tree Bridges4.7.4. Remote Bridges4.7.5. Repeaters, Hubs, Bridges, Switches, Routers, and Gateways4.7.6. Virtual LANsThe IEEE 802.1Q Standard4.8. SummaryProblems
5.1. Network Layer Design Issues5.1.1. Store-and-Forward Packet Switching5.1.2. Services Provided to the Transport Layer5.1.3. Implementation of Connectionless Service5.1.4. Implementation of Connection-Oriented Service5.1.5. Comparison of Virtual-Circuit and Datagram Subnets5.2. Routing Algorithms5.2.1. The Optimality Principle5.2.2. Shortest Path Routing5.2.3. Flooding5.2.4. Distance Vector RoutingThe Count-to-Infinity Problem5.2.5. Link State RoutingLearning about the NeighborsMeasuring Line CostBuilding Link State PacketsDistributing the Link State PacketsComputing the New Routes5.2.6. Hierarchical Routing5.2.7. Broadcast Routing5.2.8. Multicast Routing5.2.9. Routing for Mobile Hosts5.2.10. Routing in Ad Hoc NetworksRoute DiscoveryRoute Maintenance5.2.11. Node Lookup in Peer-to-Peer Networks5.3. Congestion Control Algorithms5.3.1. General Principles of Congestion Control5.3.2. Congestion Prevention Policies5.3.3. Congestion Control in Virtual-Circuit Subnets5.3.4. Congestion Control in Datagram SubnetsThe Warning BitChoke PacketsHop-by-Hop Choke Packets5.3.5. Load SheddingRandom Early Detection5.3.6. Jitter Control5.4. Quality of Service5.4.1. Requirements5.4.2. Techniques for Achieving Good Quality of ServiceOverprovisioningBufferingTraffic ShapingThe Leaky Bucket AlgorithmThe Token Bucket AlgorithmResource ReservationAdmission ControlProportional RoutingPacket Scheduling5.4.3. Integrated ServicesRSVP—The Resource reSerVation Protocol5.4.4. Differentiated ServicesExpedited ForwardingAssured Forwarding5.4.5. Label Switching and MPLS5.5. Internetworking5.5.1. How Networks Differ5.5.2. How Networks Can Be Connected5.5.3. Concatenated Virtual Circuits5.5.4. Connectionless Internetworking5.5.5. Tunneling5.5.6. Internetwork Routing5.5.7. Fragmentation5.6. The Network Layer in the Internet5.6.1. The IP Protocol5.6.2. IP AddressesSubnetsCIDR—Classless InterDomain RoutingNAT—Network Address Translation5.6.3. Internet Control ProtocolsThe Internet Control Message ProtocolARP—The Address Resolution ProtocolRARP, BOOTP, and DHCP5.6.4. OSPF—The Interior Gateway Routing Protocol5.6.5. BGP—The Exterior Gateway Routing Protocol5.6.6. Internet Multicasting5.6.7. Mobile IP5.6.8. IPv6The Main IPv6 HeaderExtension HeadersControversies5.7. SummaryProblems
6.1. The Transport Service6.1.1. Services Provided to the Upper Layers6.1.2. Transport Service Primitives6.1.3. Berkeley Sockets6.1.4. An Example of Socket Programming: An Internet File Server6.2. Elements of Transport Protocols6.2.1. Addressing6.2.2. Connection Establishment6.2.3. Connection Release6.2.4. Flow Control and Buffering6.2.5. Multiplexing6.2.6. Crash Recovery6.3. A Simple Transport Protocol6.3.1. The Example Service Primitives6.3.2. The Example Transport Entity6.3.3. The Example as a Finite State Machine6.4. The Internet Transport Protocols: UDP6.4.1. Introduction to UDP6.4.2. Remote Procedure Call6.4.3. The Real-Time Transport Protocol6.5. The Internet Transport Protocols: TCP6.5.1. Introduction to TCP6.5.2. The TCP Service Model6.5.3. The TCP Protocol6.5.4. The TCP Segment Header6.5.5. TCP Connection Establishment6.5.6. TCP Connection Release6.5.7. TCP Connection Management Modeling6.5.8. TCP Transmission Policy6.5.9. TCP Congestion Control6.5.10. TCP Timer Management6.5.11. Wireless TCP and UDP6.5.12. Transactional TCP6.6. Performance Issues6.6.1. Performance Problems in Computer Networks6.6.2. Network Performance MeasurementMake Sure That the Sample Size Is Large EnoughMake Sure That the Samples Are RepresentativeBe Careful When Using a Coarse-Grained ClockBe Sure That Nothing Unexpected Is Going On during Your TestsCaching Can Wreak Havoc with MeasurementsUnderstand What You Are MeasuringBe Careful about Extrapolating the Results6.6.3. System Design for Better PerformanceRule #1: CPU Speed Is More Important Than Network SpeedRule #2: Reduce Packet Count to Reduce Software OverheadRule #3: Minimize Context SwitchesRule #4: Minimize CopyingRule #5: You Can Buy More Bandwidth but Not Lower DelayRule #6: Avoiding Congestion Is Better Than Recovering from ItRule #7: Avoid Timeouts6.6.4. Fast TPDU Processing6.6.5. Protocols for Gigabit Networks6.7. SummaryProblems

7.1. DNS—The Domain Name System7.1.1. The DNS Name Space7.1.2. Resource Records7.1.3. Name Servers7.2. Electronic Mail7.2.1. Architecture and Services7.2.2. The User AgentSending E-mailReading E-mail7.2.3. Message FormatsRFC 822MIME—The Multipurpose Internet Mail Extensions7.2.4. Message TransferSMTP—The Simple Mail Transfer Protocol7.2.5. Final DeliveryPOP3IMAPDelivery FeaturesWebmail7.3. The World Wide Web7.3.1. Architectural OverviewThe Client SideThe Server SideURLs—Uniform Resource LocatorsStatelessness and Cookies7.3.2. Static Web DocumentsHTML—The HyperText Markup LanguageFormsXML and XSLXHTML—The eXtended HyperText Markup Language7.3.3. Dynamic Web DocumentsServer-Side Dynamic Web Page GenerationClient-Side Dynamic Web Page Generation7.3.4. HTTP—The HyperText Transfer ProtocolConnectionsMethodsMessage HeadersExample HTTP Usage7.3.5. Performance EnhancementsCachingServer ReplicationContent Delivery Networks7.3.6. The Wireless WebWAP—The Wireless Application ProtocolI-ModeSecond-Generation Wireless Web7.4. Multimedia7.4.1. Introduction to Digital Audio7.4.2. Audio Compression7.4.3. Streaming Audio7.4.4. Internet Radio7.4.5. Voice over IPH.323SIP—The Session Initiation ProtocolComparison of H.323 and SIP7.4.6. Introduction to VideoAnalog SystemsDigital Systems7.4.7. Video CompressionThe JPEG StandardThe MPEG Standard7.4.8. Video on DemandVideo ServersThe Distribution Network7.4.9. The MBone—The Multicast Backbone7.5. SummaryProblems
8.1. Cryptography8.1.1. Introduction to Cryptography8.1.2. Substitution Ciphers8.1.3. Transposition Ciphers8.1.4. One-Time PadsQuantum Cryptography8.1.5. Two Fundamental Cryptographic PrinciplesRedundancyFreshness8.2. Symmetric-Key Algorithms8.2.1. DES—The Data Encryption StandardTriple DES8.2.2. AES—The Advanced Encryption StandardRijndael8.2.3. Cipher ModesElectronic Code Book ModeCipher Block Chaining ModeCipher Feedback ModeStream Cipher ModeCounter Mode8.2.4. Other Ciphers8.2.5. Cryptanalysis8.3. Public-Key Algorithms8.3.1. RSA8.3.2. Other Public-Key Algorithms8.4. Digital Signatures8.4.1. Symmetric-Key Signatures8.4.2. Public-Key Signatures8.4.3. Message DigestsMD5SHA-18.4.4. The Birthday Attack8.5. Management of Public Keys8.5.1. Certificates8.5.2. X.5098.5.3. Public Key InfrastructuresDirectoriesRevocation8.6. Communication Security8.6.1. IPsec8.6.2. Firewalls8.6.3. Virtual Private Networks8.6.4. Wireless Security802.11 SecurityBluetooth SecurityWAP 2.0 Security8.7. Authentication Protocols8.7.1. Authentication Based on a Shared Secret Key8.7.2. Establishing a Shared Key: The Diffie-Hellman Key Exchange8.7.3. Authentication Using a Key Distribution Center8.7.4. Authentication Using Kerberos8.7.5. Authentication Using Public-Key Cryptography8.8. E-Mail Security8.8.1. PGP—Pretty Good Privacy8.8.2. PEM—Privacy Enhanced Mail8.8.3. S/MIME8.9. Web Security8.9.1. Threats8.9.2. Secure NamingDNS SpoofingSecure DNSSelf-Certifying Names8.9.3. SSL—The Secure Sockets Layer8.9.4. Mobile Code SecurityJava Applet SecurityActiveXJavaScriptViruses8.10. Social Issues8.10.1. PrivacyAnonymous Remailers8.10.2. Freedom of SpeechSteganography8.10.3. Copyright8.11. SummaryProblems
9.1. Suggestions for Further Reading9.1.1. Introduction and General Works9.1.2. The Physical Layer9.1.3. The Data Link Layer9.1.4. The Medium Access Control Sublayer9.1.5. The Network Layer9.1.6. The Transport Layer9.1.7. The Application Layer9.1.8. Network Security9.2. Alphabetical Bibliography

Content preview from Computer Networks, Fourth Edition

About the Author

Andrew S. Tanenbaum has an S.B. degree from M.I.T. and a Ph.D. from the University of California at Berkeley. He is currently a Professor of Computer Science at the Vrije Universiteit in Amsterdam, The Netherlands, where he heads the Computer Systems Group. He is also Dean of the Advanced School for Computing and Imaging, an interuniversity graduate school doing research on advanced parallel, distributed, and imaging systems. Nevertheless, he is trying very hard to avoid turning into a bureaucrat.

In the past, he has done research on compilers, operating systems, networking, and local-area distributed systems. His current research focuses primarily on the design and implementation of wide-area distributed systems that scales to ...