
| foreword preface chapter 1 introduction and overview 1.1 the motivation for internetworking 1.2 the tcp/ip internet 1.3 internet services 1.4 history and scope of the internet 1.5 the internet architecture board 1.6 the iab reorganization 1.7 the internet society 1.8 internet request or comments 1.9 internet protocols and standadization 1.10 future growth and technology 1.11 organization of the text 1.12 summary chapter 2 reviewof underlying network technoiongies 2.1 introduction 2.2 two approaches to network communication 2.3 wide area and local area network .2.4 ethernet technology 2.5 fiberdistibuted data interconnect(fddi) 2.6 asynchronous transfer mode 2.7 arpanet technology 2.8 national sceence foundation networking 2.9 ansnet 2.10 a planned wide area backbne 2.11 other technologies over which tcp/ip 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 prperties of the internet 3.5 inernet architecturre 3.6 interconnection through iprouters 3.7 the user's view 3.8 all networks are equal 3.9 the unanswerd questions 3.10 summary chapter 4 internet addresses 4.1 introduction 4.2 universal idetifiers 4.3 three primary classesof ip addresses 4.4 addressesspecify network connections 4.5 network and broadcast addresses 4.6 limited broadcast 4.7 interpreting zer to mean "this " 4.8 weaknesses in internet 4.9 dotted decimal notation 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.1 introduction 5.2 the address resolution problem 5.3 two types of physical addresses 5.4 resolution through diect mapping 5.5 resolution through dynaic binding 5.6 the address resolution cache 5.7 arp refinements 5.8 relationship of arp to other protocols 5.9 arp implmentain 5.10 arp encapsulation and identification 5.11 arp protocol format 5.12 summary chapter 6 determining an internet address at startup(rarp) 6.1 introduction 6.2 reverse address resolutioon protocol 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 net work 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 directand 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 establishing routing tables 8.12 summary chapter 9 internet protocol:error and control messages 9.1 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 staus 9.7 echo request andreply message format 9.8 reports of unreachable destinations 9.9 congestion and datagram flow control 9.10 source quench format 9.11 route change requests from routers 9.12 detecting circular or excessively long routes 9.13 reporting other problems 9.14 clock synchronization and transit time estimation 9.15 information request and reply messages 9.16 obtaining a subnet msak 9.17 summary chapter 10 subnet and spernet address extensions 10.1 introduction 10.2 review of relevant facts 10.3 minimizing network numbers 10.4 transparent routers 10.5 proxy arp 10.6 subnet addressing 10.7 flexibility in subnet address assignment 10.8 implementation of subnets with masks 10.9 subnet mask represntation 10.10 routing in the presnce of subnets 10.11 the subnet routing alogrithm 10.12 a unified routing algorihm 10.13 maintenance of subnet masks 10.14 broadcasting to subnets 10.15 supernet addressing 10.16 the effect of supernetting on routing 10.17 summary chapter 11 introduction the need for multiple protocols 11.1 introduction 11.2 the need for multiple protocols 11.3 the conceptual layers of protocol software 11.4 funcionality of the layers 11.5 x.25 and its relation to the iso model 11.6 differencesbetween x.25 and internet layering 11.7 the protocol layering principle 11.8 layering in the presence of network substructure 11.9 two important boundaries in the tcp/ipmodel 11.10 the disadvantage of layering 11.11 the basic idea behind multip lexing and demultiplexing 11.12 summary chapter 12 user datagram protocol 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 andthe udp checksum computation 12.8 udp multipexing,demultiplexing,and ports 12.9 reserved and available udp por numbvers 12.10 summay chapter 13 reliable stream transport service(tcp) 13.1 introduction 13.2 tht need for stream delivery 13.3 properties of the 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 of band data 13.13 maximum segment size option 13.14 tcp checksum computation 13.15 acknowledgements and retransission 13.16 timeou and retramsmission 13.17 accurate measuremint of round trip samples 13.18 karn's algorithm and timer backoff 13.19 responding to high variancd in delay 13.20 response to congestion 13.21 establishing 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 numbers 13.28 tcp performance 13.29 silly window syndrome and small packets 13.30 avoiding silly window syndrome 13.31 summary chapter 14 routing:cores,peers,and algorithms 14.1 introduction 14.2 the origin of routing 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 peer backbones 14.7 automatic route propagation 14.8 vector distance(bellman-ford)routng 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 chapter 15 routing:autonomous systems(egp) 15.1 introduction 15.2 adding complexity to the architectural model 15.3 a fundamental idea:extra hops 15.4 autonomous sys tem concept exterior gateway protocol 15.5 exterior gatewqy protocol(egp) 15.6 egp message header 15.7 egp neighor acquisition messages 15.8 egp neighbor reachability messages 15.9 egp poll request messages 15.10 egp routing update messages 15.11 measring up date messages 15.12 the key restriction of egp 15.13 technical problems 15.14 decentralization of internet architecture 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 routing information protocol(rip) 16.4 the hello protocol 16.5 combining rip,hello,and egp 16.6 the open spf protocol(ospf) 16.7 routing with partial information 16.8 summary chapter 17 internet multicasting 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 ehernet multicast 17.7 extending ip to handle multicasting 17.8 internet group management protocol 17.9 igmp mplementaioin 17.10 group membership stae transitions 17.11 igmp message format multicast address assingnment 17.12 multicast address assignment 17.13 propagating routing information 17.14 the mrouted program 17.15 summary chapter 18 tcp/ip over atm networks 18.1 introduction 18.2 atm hardware 18.3 large atm network 18.4 the logical vies of an atm networ 18.5 the two atm connection paradigms 18.6 pahs,circuits,and identifiers 18.7 atm cell transport 18.8 atm adaptation layers 18.9 aal5 convergence,segmentation ,and reassemblym 18.10 datagram encapsulaton and ip mtu size 18.11 packey type and multiplexing 18.12 ip address binding in an atm network 18.13 logical ip subnet concept 18.14 connection management 18.15 address binding within an lis 18.16 atmarp packet format 18.17 using atmarp packets to determingan address 18.18 obtaining entries for a server database 18.19 timing out atmarp information in a server 18.20 timing out atmarp information in a host or router 18.21 summary 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 alternatives to the client-server model 19.8 summary chapter 20 the sockey interface 20.1 introduction 20.2 the unix i?o paradigm and network i?o 20.3 adding network i/o to unix 20.4 the socket 20.5 abstraction creating a socket 20.6 socket inheritance and termination 20.7 specifying a local address 20.8 connecting sockets to destination addresses 20.9 sending data through a socket 20.10 receiving data through a socket 20.11 obtaing local and remote socket addresse 20.12 obtaining and setting socket options 20.13 specifying a queue length for a server 20.14 how a server acdepts connections 20.15 servers that handle multiple services 20.16 obtaining and setting host names 20.17 obtaining and setting the internal host domain 20.18 bsd unix networi library calls 20.19 network byte order conversion routines 20.20 ip address manipulation routines 20.21 accesssing the domain name system 20.22 obtaining inforation about hosts 20.23 obtaining inforation about networks 20.24 obtaining inforation about protocols 20.25 obtaining inforation about network services 20.26 an example client 20.27 an example server 20.28 summary chapter 21 bootstrap and autoconfiguration 21.1 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 bootm message fromat 21.6 the two-step bootstrap procedure 21.7 vendor-specific field 21.8 the need for dynnamic configuration 21.9 dynamic host configuration 21.10 dynamic ip address assignment 21.11 obtaining mutltiple addresses 21.12 addressacquisition states 21.13 early lease termination 21.14 lease renewalstates 21.15 dhcp message format 21.16 dhcp options and message type 21.17 option overload 21.18 dhcp and domain names 21.19 summary chapter 22 the domain name system 22.1 introduction 22.2 names for machines 22.3 flat namespace 22.4 hierarchical names 22.5 delegation of authority for names 22.6 subset authority 22.7 tcp/ip internet domain names 22.8 official and unofficialinternet domain names 22.9 items named and synax of names 22.10 mapping domain names to addresses 22.11 domain name resolution 22.12 efficient translation 22.13 caching:the key to efficiecy 22.14 domain server messageformat 22.15 compressed name format 22.16 abbreviation of domain names 22.17 inverse mappings 22.18 pointer queries 22.19 object types and resource record contents 22.20 obtaining authority for a subdomain 22.21 summary chapter 23 applications:remote login 23.1 introduction 23.2 remote interactive computing 23.3 telnet protocol 23.4 accommodating heterogeneity 23.5 passing commands that control the remots side 23.6 forcing the server to read a control function 23.7 telnet options 23.8 telnet option negotiation 23.9 rlogin(bsd unix) 23.10 summary chapter 24 applications:file transfer and access(ftp,tftp,nfs) 24.1 introduction 24.2 file acess and transfer 24.3 on-line shared access 24.4 sharing by file transfer 24.5 ftp:the major tcp/ip file transfer protocol 24.6 ftp:features 24.7 ftpprocess model 24.8 tcp port number assignment 24.9 the user's view of ftp 24.10 an example anonymous ftp session 24.11 tftp 24.12 nfs 24.13 nfs implementation 24.14 remote procedure call 24.15 summary chapter 25 applications:electronic mail 25.1 introduction 25.2 electronic mail 25.3 mailbox names and aliases 25.4 alias expansion and mail forwarding 25.5 the relationship of internetworking and mail 25.6 tcp/ip standards for electronic mail service 25.7 elecctronic mail addresses 25.8 pseudo domain addresses 25.9 simain mail transfer protocol 25.10 the mime extension for non-ascii data 25.11 mime multipartmessages 25.12 summary chapter26 applications:internet management 26.1 introduction 26.2 the level of management protocols 26.3 architectural model 26.4 protocolarchitecture 26.5 examples of mib variables 26.6 the structure of management information 26.7 formal definitions using asn.i 26.8 structure and representaion of mib object names 26.9 simlpe network management protocol 26.10 snmp message format 26.11 exampleencodedsnmp message 26.12 summary chapter27 summary of protocol dependencies 27.1 introduction 27.2 protocoldependencies 27.3 application program access 27.4 summary chapter 28internet security and firewall design 28.1 introduction 28.2 protecting resources 28.3 the need for an information policy 28.4 communication,coopration,and mutual mistrust 28.5 mechanisms for internet security 28.6 firewalls and internet access 28.7 multiple connections and weakest links 28.8 firewall implementation and high-speed hardware 28.9 packet-levelfilters 28.10 security and packet felter specification 28.11 the consequence of restricted access for clients 28.12 accessing services through a firewall 28.13 the details of firewall architecture 28.14 stub network 28.15 an alternative firewall implementation 28.16 monitoring and logging 28.17 summary chapter29 the future of tcp/ip(ipng,ipv6) 29.1 introduction 29.2 why change tcp/ip and the internet? 29.3 motivation for changing ipv 29.4 the road to a new version of ip 29.5 the name of the next ip 29.6 features of ipv6 29.7 generat form of an ipv6 datagram 29.8 ipv6 base header format 29.9 ipv6 extension headers 29.10 parsing an ipv6 datagram 29.11 ipv6 fragmentation and reassembly 29.12 the consequence of end-to-end fragmentation 29.13 ipv6 source routing 29.14 ipv6 options 29.15 size of the ipv6 address space 29.16 ipv6 colon hexadecimal notation 29.17 three basic ipv6 address space 29.18 the duality of brooadcast and multicast 29.19 an engineerignchoice and simulated broadcsat 29.20 proposed ipv6 address space assingment 29.21 ipv4 address encoding and transition 29.22 providers,subscribers,and address hierarchy 29.23 additional hierarchy 29.24 summary appendix 1 a guide to rfcs appendix 2 glossary of internetworking terms and abbreviations bibliography index |
商品评论(0条)