TCP/IP网络互连技术 卷Ⅰ--第3版--英文

出版时间：1998-07  出版社：清华大学出版社  作者：科默(美)  页数：613  
Tag标签：无  

内容概要

本书是Douglas Comer教授所著网络互连技术系列的第1卷。详尽地讲解了因特网的原理、网络体系结构、TCP/IP协议簇。本书包括了TCP/IP，因特网各个组成部分的设计及其工作，以每个协议如ARP，PARP，IP，TCP，UDP，RIP，OSPF等等都有详细阐述。

书籍目录

Contents
Foreword
Preface
Chapter 1 Introduction And Overview
1.1 The Motivation For Internetworking
1.2 The TCPIIP Internet
1.3 Internet Services
1.4 History And Scope OfThe Internet
1.5 The fnternet Architecture Board
1.6 The lAB Reorganization
1.7 The Inlernet Society
1.8 lnternet Request For Comments
1.9 Internet Protocols And Standar dization
1.10 Future Growth And Technology
1.11 Organization Of The Text
1.12 Summary
Chapter 2 Review Of Underlying Network Technologies
2.1 Introduction
2.2 Two Approaches To Network Communication
2.3 Wide Area And Local Area Networks
2.4 Ethernet Technology
2.5 Fiber Distributed Data Interconnect (FDDl)
2.6 Asynchronous Transfer Mode
2.7 ARPANET Technology
2.8 National Science Foundation Networking
2.9 ANSNET
2.10 A Planned Wide Area Backbone
2.11 Other Technologies Over Which TCPIIP Has Been Used
2.12 Summary And Conclusion
Chapter 3 Internetworking Concept And Architectural Model
3.1 Introduction
3.2 Application-Level Interconnection
3.3 Network-Level Interconnection
3.4 Properties OfThe Internet
3.5 Internet Architecture
3.6 Interconnection Through IP Routers
3.7 The User's View
3.8 All Networks Are Equal
3.9 The Unanswered Questions
3.10 Summary
Chapter 4 Internet Addresses
4.1 Introduction
4.2 Universal Identifiers
4.3 Three Primary Classes Of IP Addresses
4.4 Addresses Specify Network Connections
4.5 Network And Broadcast Addresses
4.6 Limited Broadcast
4.7 Interpreting Zero To Mean "This"
4.8 Weaknesses In Internet Addressing
4.9 Dotted Decimal Notalion
4.10 Loopback Address
4.11 Summary Of Special Address Conventions
4.12 Internet Addressing Authority
4.13 An Example
4.14 Network Byte Order
4.15 Summary
Chapter 5 Mapping Internet Addresses To Physical Addresses (ARP)
5.7 Introduction
5.2 The Address Resolution Problem
5.3 Two Types OfPhysical Addresses
5.4 Resolution Through Direct Mapping
5.5 Resolution Through Dynamic Bindmg
5.6 The Address Resolution Cache
5.7 ARP Refinements
5.8 Relalionship OfARP To Other Protocols
5.9 ARP Implementatwn
5.10 ARP Encapsulation And Identification
5.11 ARP Protocol Format
5.12 Summary
Chapter 6 Determining An Internet Address At Startup (RARP)
6.7 Introduction
6.2 Reverse Address Resolution Protocol (RARP)
6.3 Timing RARP Transactions
6.4 Primary And Backup RARP Servers
6.5 Summary
Chapter 7 Internet Protocol: Connectionless Datagram Delivery
7.1 Introduction
7.2 A Virtual Network
7.3 Internet Architecture And Philosophy
7.4 The Concept Of Unreliable Delivery
7.5 Connectionless Delivery System
7.6 Purpose Of The Internet Protocol
7.7 The Internet Datagram
7.8 Internet Datagram Options
7.9 Summary
Chapter 8 Internet Protocol: Routing IP Datagrams
8.1 Introduction
8.2 Routing In An Internet
8.3 Direct And Indirect Delivery
8.4 Table-Driven IP Routing
8.5 Next-Hop Routing
8.6 Default Routes
8.7 Host-Specific Routes
8.8 The IP Routing Algorithm
8.9 Routing With IP Addresses
8.10 Handling Incoming Datagrams
8.11 Estahlishing Routing Tables
8.12 Summary
Chapter 9 Internet Protocol: Error And Control Messages (ICMP)
9.7 Introduction
9.2 The Internet Control Message Protocol
9.3 Error Reporting vs. Error Correction
9.4 ICMP Message Delivery
9.5 ICMP Message Format
9.6 Testing Destination Reachability And Status (Ping)
9.7 Echo Request And Reply Message Format
9.8 Reports Of Unreachahle Destinations
9.9 Congestion And Datagram Flow Control
9.10 Source Quench Format
9.11 Roure Change Requests From Routers
9.12 Detecting Circular Or Excessively Long Routes
9.13 Reporting Other Prohlems
9.14 Clock Synchronization And Transit Time Estimation
9.15 Information Request And Reply Messages
9.16 Obtaining A Subnet Mask
9.17 Summarv
Chapter 10 Subnet And Supernet Address Extensions
10.1 Introduction
10.2 Review Of Relevant Facts
10.3 Minimizing Network Numhers
10.4 Transparenl Routers
10.5 Proxy ARP
10.6 Suhnet Addressing
10.7 Flexihility In Suhnet Address Assignment
10.8 Implementation Of Subnets With Masks
10.9 Suhnet Mask Representation
10.10 Routing In The Presence Of Suhnets
10.11 The Subnet Routing Algorithm
10.12 A Unified Routing Algorithm
10.13 Maintenance Of Suhnet Masks
10.14 Broadcasting To Subnets
10.15 Supernet Addressing
10.16 The Effect Of Supernetting On Routing
10.17 Summary
Chapter 11 Protocol Layering
11.1 Introduction
11.2 The Need For Multiple Protocols
11.3 The Conceptual Layers Of Protocol Software
11.4 Functionality Of The Layers
11.5 X.25 And Its Relation To The ISO Model
11.6 Differences Between X.25 And Internet Layering
11.7 The Protocol Layering Principle
11.8 Layering In The Presence OfNetwork Substructure
11.9 Two Imporlant Boundaries In The TCPIIP Model
11.10 The Disadvantage Of Layering
11.11 The Basic Idea Behind Multiplexing And Demultiplexing
11.12 Summary
Chapter 12 User Datagram Protocol (UDP)
12.1 Introduction
12.2 Identifying The Ultimate Destination
12.3 The User Datagram Protocol
12.4 Format Of UDP Messages
12.5 UDP Pseudo-Header
12.6 UDP Encapsulation And Protocol Layering
12.7 Layering And The VDP Checksum Computation
12.8 UDP Multiplexing, Demultiplexing, And Ports
12.9 Reserved And Available UDP Port Numbers
12.10 Summary
Chapter 13 Reliable Stream Transport Service (TCP)
13.1 Introduction
13.2 The Need For Stream Delivery
13.3 Properties OfThe Reliable Delivery Service
13.4 Providing Reliability
13.5 The Idea Behind Sliding Windows
13.6 The Transmission Control Protocol
13.7 Ports, Connections, And Endpoints
13.8 Passive And Active Opens
13.9 Segments, Streams, And Sequence Numbers
13.10 Variable Window Size And Flow Control
13.11 TCP Segment Format
13.12 Out OfBand Data
13.13 Maximum Segment Size Option
13.14 TCP Checksum Computation
13.15 Acknowledgements And Retransmission
13.16 Timeout And Retransmisswn
13.17 Accurate Measurement OfRound Trip Samples
13.18 Karn' s Algorithm And Timer Backoff
13.19 Responding To High Variance In Delay
13.20 Response To Congestion
13.21 Eslablishing A TCP Connection
13.22 Initial Sequence Numbers
13.23 Closing a TCP Connection
13.24 TCP Connection Reset
13.25 TCP State Machine
13.26 Forcing Data Delivery
13.27 Reserved TCP Port Numhers
13.28 TCP Performance
13.29 Silly Window Syndrome And Small Packets
13.30 Avoiding Silly Window Syndrome Summary
Chapter 14 Routing: Cores, Peers, And Algorithms (GGP)
14.1 Introduction
14.2 The Origin OfRouting Tables
14.3 Routing With Partial Information
14.4 Original Internet Architecture And Cores
14.5 Core Routers
14.6 Beyond The Core Architecture To Pee Backbones
14.7 Automatic Route Propagation
14.8 Vector Distance (Bellman-Ford) Routing
14.9 Gateway-To-Gateway Protocol (GGP)
14.10 GGP Message Formats
14.11 Link-State (SPF) Routing
14.12 SPF Protocols
14.13 Summary
15.4 Autonomous System Concept
15.5 Exterior Gateway Protocol (EGP) 254
75.6 EGP Message Header
15.7 EGP Neighbor Acquisition Messages
15.8 EGP Neighbor Reachability Messages
15.9 EGP Poll Request Messages
15.10 EGP Routing Update Messages
15.11 Measuring From The Receiver's Perspective
15.12 The Key Restriction Of EGP
15.13 Technical Problems
15.14 Decentralization Of Internet Archilecture
15.15 Beyond Autonomous Systems
15.16 Summary
Chapter 16 Routing: In An Autonomous System (RIP, OSPF, HELLO)
16.1 Introduction
16.2 Static Vs. Dynamic Interior Routes
16.3 Rouling Information Protocol (RIP)
16.4 The Hello Protocol
16.5 Combining RIP, Hello, And EGP
16.6 The Open SPF Protocol (OSPF)
16.7 Roulting With Partial Information
16.8 Summary
Chapter 17 Internet Multicasting (IGMP)
17.1 Introduction
17.2 Hardware Broadcast
17.3 Hardware Multicast
17.4 IP Multicast
17.5 IP Multicast Addresses
17.6 Mapping IP Multicast To Ethernet Multicast
17.7 Extending IP To Handle Multicasting
17.8 Internet Group Management Protocol
17.9 IGMP Implementation
17.10 Group Membership State Transitions
17.11 IGMP Message Format
17.12 Multicast Address Assignment
17.13 Propagating Routing Information
17.14 The Mrouted Program
17.15 Summary
Chapterl8 TCPy'IP Over ATM Networks
18.1 Introduction
18.2 ATM Hardware
18.3 Large ATM Networks
18.4 The Logical View Of An ATM Network
18.5 The Two ATM Connection Paradigms
18.6 Paths. Circuits. And Identifiers
18.7 ATM Cell Transport
18.8 ATM Adaplation Layers
18.9 AAL5 Convergence, Segmentation, And Reassembiy
18.10 Datagram Encapsulation And IP MTU Size
18.11 Packet Type And Multiplexing
18.12 IP Address Binding In An ATM Network
18.13 Loggical IP Subnet Concepl
18.14 Connection Management
18.15 Address Binding; Within An LIS
18.16 ATMARP Packet Format
18.17 Using ATMARP Packets To Determine An Addres.
18.18 Obtaining Entries For A Server Datahase
18.19 Timing Oul ATMARP Information In A Server
18.20 Timing Out ATMARP Information In A Host Or Route
18.21 Summarv
Chapter 19 Client-Server Model Of Interaction
19.1 Introduction
19.2 The Client-Server Model
19.3 A Simple Example: UDP Echo Server
19.4 Time And Date Service
19.5 The Complexity of Servers
19.6 RARP Server
19.7 Allernatives To The Client-Server Model
19.8 Summarv
Chapter 20 The Socket Interface
20.1 Introduction
20.2 The UNIX 110 Paradigm And Network 11O
20.3 AddinG Network 1/0 to UNIX
20.4 The Socket Abstraction
20.5 Creating A Socket
20.6 Socket Inheritance And Termination
20.7 Specifying A Local Address
20.8 Connecting Sockets To Destination Addresse.
20.9 Sending Data Through A Socket
20.10 Receiving Data Through A Socket
20.11 Obtaining Local And Remote Socket Addresses
20.12 Obtaining And Setting Socket Options
20.13 Specifying A Queue Length For A Server
20.14 How A Server Accepts Connections
20.15 Servers That Handle Multiple Services
20.16 Obtaining And Setting Host Names
20.17 Ohtaining And Setting The Internal Host Domain
20.18 BSDUNIX Network Library Calls
20.19 Network Byte Order Conversion Routines
20.20 IPAddress Manipulation Routines
20.21 Accessing The Domain Name System
20.22 Ohtaining Information About Hosts
20.23 Obtaining Information About Networks
20.24 Obtaining Information About Protocols
20.25 Obtaining Information About Network Services
20.26 An Example Client
20.27 An Example Server
Summary
Chapter 21 Bootstrap And Autoconfiguration (BOOTP, DHCP)
21.l Introduction
21.2 The Need For An Alternative To RARP
21.3 Using IP To Determine An IP Address
21.4 The BOOTP Retransmission Policy
21.5 The BOOTP Message Format
21.6 The Two-Slep Boolstrap Procedure
21.7 Vendor-Specific Field
21.8 The Need For Dynamic Configuration
21.9 Dynamic Host Configuration
21.10 Dynamic IP Address Assignment
21.11 Obtaining Mulliple Addresses
21.12 Address A cquisition States
21.13 Early Lease Termination
21.14 Lease Renewal States
21.15 DHCP Message Format
21.16 DHCP Options And Message Type
29.6 Features Of IPv6
29.7 General Form OfAn IPv6 Datagram
29.8 IPv6 Base Header Format
29.9 IPv6 Exlension Headers
29.10 Parsing An IPv6 Dalagram
29.11 IPv6 Fragmentation And Reassembly
29.12 The Consequence Of End-To-End Fragmentatwn
29.13 IPv6 Source Routing
29.14 IPv6 Options
29.15 Size OfThe IPvd Address Space
29.16 lPv6 Colon Hexadecimal Notation
29.17 Three Basic IPv6 Address Types
29.18 The Duality OfBroadcast And Multkast
29.19 An Engineering Choice And Simulated Broadcast
29.20 Proposed IPv6 Address Space Assignment
29.21 IPv4 Address Encoding And Transition
29.22 Providers, Subscribers, And Address Hierarchy
29.23 Additional Hierarchy
29.24 Summary
Appendix-l AGuideToRFCs
Appendix－2 Glossary Of Internetworking Terms And Abbreviatlons
Bibliography