Internetworking With TCP IP - Vol 3 2000

经典之作 Internetworking With TCP IP - Vol 3 2000英文原版们nsChapter 5 The Socket API47S.I. Introduction 475.2 The History Of Sockets 475.3 Specifying A Protoco! Interface 484 The RaCket Abstraction 495.4.1 Socket Descriptors 495.42 Sysiem Dara Structurer For Sockets 505.4 Using Sockets 525.5 Specifying An Endpoint Address 515.6 A Generic Address Strucfure 525.7 Functions In The Socket API 535.7.1 The WSAStartup Function 535.7.2 The WSACleanup Function 545.7.3 The socker Function 545.7.4 The Connect Function 545.7.3 The Send Funcrio 54576he Recv Function 555.7.7 The Closesocker Function 555.7.8 The Bind Furction 555.9 The Listen fiHC【【?6.0 The Accept Function 565.7.1 SHramary Of Socker Culls Used Wih TCP 565.8 Utility Routines For Integer Conversion 565.9 sin Socke! Calls In A Program 585.10 Symbolic Constanis For Socker Call Parameters 595.17 Summary 59Chapter 6 Algorthms And Issues In Client Saftware Desit6. Introduction 616. 2 Learming Algorithms instead Of Details 613.3 Client Architecture 626.4 Identifying The Location Of A Server 62Parsing An Address Argument (4Lon讥ng即 p A Domain Name656.7 Looking Up A WalF-Known Port By Name 666.8 Por Numbers And Network Byte Order 666.9 Looking Up A Protocol By Name 676. 10 The tCP Client Aigorithrn 676. 17 LOcating A Sacket 686,12 Choosing A Local Protoco! Port Number 69netS6. 15 A Fundamental Problerm n Choosing A Local IP Address 696.14 Canecting A TCP Socket To A sener 706. i5 Communicating With The Senver Using TCP 706.16 Reading A Response From A TCP Connection 711.17 Closing A TCP Correction 726.7i The Need for partial close 26.17.2 A Parial Close Operation 726. 18 Programming A uDP Client 736.i9 Connected and unconnected tP sockets 736. 20 Using Connect With (DP 746. 2) Communicating With A Senver sing UDP 740.22 Closing A Socker Thar Uses (pp 744.23 Partial close for DP 750.24 A Warning About UDP Unredabliry 750. 25 Summary 75Chapter 7 Example Client SoftwareTi freroducrion 7 97. 2 Tte importance Of Smal Examples 197. 3 Hiding detaiLs 807.4 An Exumple Procedure Library For Clien Programs &07.5 Implementation Of ConTCP 8i7.6 Implementation Of ConUDP 827 4 procedure Thar forms connections 827.8 Using The Exumple Library 8579 The DAYTIME Service 8s7.10 Emplementation Of A TCP Clierr For DAYTIME 867.11 Reaping From A TCP Connection 8772了 e TIME Senice887. 13 Accessing The TIME Senice 887. 14 Accurale Times And Network Delays 897.15 A tDP CLient Far The TIME Senice 897.16 The ECHo Service 9]7.17 A CP Client For The ECHO Service 927.18 A uDP Client For The echo service 947.19 Summary 96Chapter 8 Algorithms And Issues In Server Software Design8.natreCor8.2 The Conceptual Server Agorithm yyCanters4.3 Concurrent Vs. Iterative Servers IC4.4 Connection-Oriented Vs Connectionless AccEss 1068.5 Connection-Oriemred Sewers IOE4.6 Connectionless Servers 10]8, Failure, Reliability, And Srarefessness 102&& Optimizing Stateless Servers 1038.9 Four Basic Types Of Serers 1058.10 Request Processing Time 106&i Iterative Server Aigorithms IC68.12 An iterative, Connection-Orientedf Server Algorithm 1078. 13 Binding To A Wedl-KRowR Address Using INADDR-ANY 1078. 14 Placing The Socket In Passive Mode 1038.15 Accepting Connections And Using Tiem 1088.16 An iterative, Connectionless Server Algorithm 108817 Forming A Reply Address In A Connectionless Server 1098.18 Concurrent Server Algorithns 1I0&9 Master and save Threads 1108.20 A Concurrent, Connectionless Server Algorithm IllR21 A Cocurrent, CaRRectinm-Orientedf Server Aigorithm 11I8.22 Using Separate Programs As Slaves 1128.23 Apparent Concurrency Using A Single Thread 1138.24 When To Use Each Server Type 1148.25 A Summary of Server Types 158.26 The Important Proble Of Server Deadlock 1168.27 AItemdrdive implementations 1168.28 Summary 1 17Chapter 9 Iterative, Connectionless Servers (UDP)9,1 ntroduction 1199.2 Creating A Passive Socker 199 Thread structure 1229.4 An Example TIME Server 1239. 5 SuMmARY 125Chapter 10 Iterative, Connection-Oriented Servers(TCP)12710.1 Intraduction 12710.2 Allocating A Passive ICP Socket 12710.3 A Server for The DAyTIME Service 2810.4 Thread Structure 12810.s An Example AyfME Server 129Contentsic. 6 Closing Connections 13210. Connection Termination And Server vulnerability 13210.8 Summary133Chapter 11 Concurrent, Connection-Oriented Servers(TCP)135iN. traduction 13512 Concurrent echo 13511.3 terative Vs Concurrent implementations 136l【4 Tread structure1361 5 An Example Concurrent ECHO Server 13715.6 Summa/ 140Chapter 12 Singly Threaded, Concurrent Servers TCP)E4312. nirodzection 4312.2 Daza-driven Processing ir A Server 14312.3 Data-Drivent Processing With A Single Thread 1412.4 Thread Structure of A SinglyThreaded server 14512.5 An Example Singty-Ttreaded Echo Server 146f2.6 Surmmary48Chapter 13 Multiprotocol Servers (TCP UaPy1513. Introduction si13.2 The Motivation Far Reducing The Number o Servers 15113.3 Multiprotocol Server Design 15213.4 Thread srructure 15213.5 An Example Mulriprolocod DAYTIME Server. 15313.6 The Concept Of Shared Code 15713.7 Concurrent Multiprotocol Servers 15713.8 Summmary 157Chapter 14 Multiservice Servers(TCP, UDP)159F4, introducfion ]5g14.2 Consolidating Servers 15y14.3 A Connectionless, Afulriservice Sener Design 16014.4 A Comnection-Crientedd, MuLtiservice Senver Design 16114.5 A Concurren, Connection - Oriented, Multiservice Server 162艹■■Contents24.6 A Singly-tireaded, Multiservice Server Implementation. 16214. 7 Invoking Separate Programs From A Multiservice ServEr 16314.8 Mriniservice, Multiprotocol Designs 16414.9 An Example Multiservice Server 16514.20 Static and Dynanic Server Configuration 171I4./I An Ercmiple Super Server, inetd 17214.12 Summar 174Chapter 15 Uniform, Efficient Managemant Of Sarver Concurrency 17715. Inrraducrion 17755.2 Choosing Between An Iterative And A Concurrent Design 17735, evet Of Concurrency 1785.4 Derand-Drven Concurrency 17915.5 The Cost Of Concurrency 179175.6 Overhead And Delay 17915.7 Small Delays Car Matter 18015.8 Tread Preallocation 81158. predliocdlion tech1825.8 2 Preallocation In A Connection -Oriented Server 182I5.8.3 Preallocation In A Conecriondess Server 18315.8.4 Preallocation, Bursty Trafic, And NFS 18415.8.5 Preallocation On A Multiprocessor 18515.9 Delayed Thread Alocarion 18515.10 The Uniform Basis For Both Techniques 186I5.iI Combining techniques 187IS12 Sunnary 187Chapter 16 Concurency In client196 introduction 14910.2 The Advantages Of Concurrency 18910.3 The MotivatioN For Exercising Comtrol 19016.4 Concwrrenr Cantaer Wizh Multiple Servers 19116.5 Implementing Concurrent Clients 19116.a Singly- Threaded implementations 19316. An Example Concurrent Client That Uses ECHO 19416.8 Execution Of The Concurrent Client 19&16.9 Managing A Timer 19916.10 Example Outpu 20016.17 Concurrency In The Example Cade 2016.22 Summan 201ContentsChapter 17 Tunneling At The Transport And Application Levels203J7.I Introductian 20317.2 Multiprotocol Environments 20317.3 Exing Network Technologies 205I7.4 Dynamic Circuit Allocation 20617.5 Encapsulation And Tunneling 20717.6 TRnmeling Through An iP internet 208P 7.7 Application-Levet Tunneling Between Clients And Servers 208I7& Tunneling, Encapsuation, And Dialup Phone Lines 20917.9 Summary 210Chapter 18 Appication Level Gateways21318. Introduction 2138. 2 Clients and servers n Constrained environments 21318.2.1 The Reality Of Mutiple Technologies 21318.2.2 Computers With Limited Functionality 21418.2.3 Connectivity Constrains That Arise From Security 214I8. Using Application Gateways 21514.4 Interoperability Through A Maif Gateway 216f8.5 Implemmeatalion Of A Mait Gateway 21718.6 A Comparison of Applicarion Gateways And Tunneling 21718.7 Application Gateways And Limtited Functionality Sysiets 21958.8 Application Gateways Used For Securiry 22018. 9 Applicution Gateways And The Extra Hop Proble 22118. G An Example Application Gateway 22318 II Details CfA Web-Based Application Gateway 22418.12 Invoking A CGI Program 22518.15 URLs For The RFC Application Gazeway 22618.14 A General-Purpose Applicarion Gaeway 22618.15 Operation OfSLIRP 22718.16 How slirp handles connections 22718.17 P Addressing And SLiRP 22&18& Samman 229Chapter 19 External Data RepresentatIon(XDRH23119i ntroduction 23 119. 2 Representations For Data In Computers 23119. The N-Squared Conversion Problem 232Contents9.4 Nerwork Standard Byte Order 23319.5 A De Facto Standard Extermal Daia Represenrarion 23459.6 XDR Data Types 23519 7 Implicit Types 23019.8 Sofware Support For Using XDR 23619.9 XDR LIbrary Routines 23619.10 BuiLding A Newage One Piece At A TinLe 23619.11 Conversion Rourines /n The XDR Library 23&I912 XDR Streams, o, and TCP 24019.13 Records, Recard Boundaries, Ard Datagram iO 24119.14 Summary 241Chapter 20.Remote Procedure Call Concept(RPC)24320.I truction 243201.2 Remote Procedure call odel 24320.3 Two Paradigns For Building Distributed Programs 24420. A Conceptua! Mode! For Corrverriond! Procedure Calls 24520.5 An Extension Of the Procedural Modet 24520.6 ExecHtion Of Conventional Procedure Call And Rerurn 24620.7 The Procedural Mfodet In disiributed Systems 24720.8 Amefogy Between Client-Server And RPC 24820.9 Distributed CompuTation As A Program 24920.10 Sun Microsystems'Remnote Procedure call Defirition 25020.I Remote Prograns And Procedures 25020.12 Reducing The Number Of Arguments 25120.13 Identifying Remote Programs And Procedures 23120. 4 Acceing Miltiple versionS Of A Remote Program 25220.15 Mutuat Exclusion For Procedures In A Remote Program 25320.16 Communication Semantics 25420.17 At Least Once Semantics 254208 PC Retransmission 25520.19 Mapping A Remote Program To A Protocol Part 25520 20 Dynamic Port Mapping 25620.21 RPC Pon Mapper Algorithm 25720, 22 RPC Message Format 25920.23 Marshaling Arguments For A Remote Procedure 26020.24 Authentication 26020.25 An Erample Of RPC Message Representation 26120.26 An Example Of An Authentication Field 26220.27 Summary 263的tnsChapter 21 Distributed Program Generation(Rpcgen Concept26G72 ntroduction 26721.2 Using Remote Procedure Calls 26821.3 Programming Mechanisms To Supper RPC 26921-4 Dividing A Program into Local And Remote Procedures 27d21.5 Addit Code For RPC 27121.6 4b Procedures 27121.7 Multiple Remole Procedures And Dispatching 27221.8 Naime of The Ctient-Side Stub Procedure 27321.9 Using Rpcgen To Generare Distributed Prograns 27421.10 Rpcgen Output And interface Procedures 27421: ,Rpcgen Input Ard Output 27521.12 Using Rpcgen To Build A Client And Server 27621.13 Summary 276Chapter 22 Distributed Program Generation(Rpcgen Example)22. truction 27922.2 A Example Ta Ilustrate Rpcgen 28022.3 Dicfianar Look tp 28U22.4 Eighr Szeps To A Distribyred Applicarion 2SI22.5 Step I: Build A Conventional Applicarion Program 28222.6 Step 2: Divide The Program Irto Twa Parts 28622.7 Step 3: Create Art Rpcgen Specification 29222. Siep 4: Run Rpcger 29422.9 The. h File PradHced By Rpcgen 29422 /0 The XDR Conversion File Produced By Rpcgen 29622.11 Tke Client Code Produced By Rpcgen 29722.12 The Server Code produced by rpcgert 29822 13 Step 5: Write Stub interface Procedures 30122.13.1 Client-Side inte]face Routines 30122.13.2 Server-Side interface routines 30422.14 Step 6 Compile And Linik The Client Progra 30522.15 Step 7: Compile And Link The Server Progrant 30922.16 Srep & Star The Server And Execute The Client 3112.7 Summary3】1