用TCP/IP进行网际互连 第2卷 设计、实现与内核 ANSI C版 英文版PDF|Epub|txt|kindle电子书版本网盘下载

用TCP/IP进行网际互连 第2卷 设计、实现与内核 ANSI C版 英文版PDF格式电子书版下载

注意：本站所有压缩包均有解压码： 点击下载压缩包解压工具

Chapter 1 Introduction And Overview1

1.1 TCP/IP Protocols1

1.2 The Need To Understand Details1

1.3 Complexity Of Interactions Among Protocols2

1.4 The Approach In This Text2

1.5 The Importance Of Studying Code3

1.6 The Xinu Operating System3

1.7 Organization Of The Remainder Of The Book4

1.8 Summary4

Chapter 2 The Structure Of TCP/IP Software In An Operating System7

2.1 Introduction7

2.2 The Process Concept8

2.3 Process Priority9

2.4 Process Synchronization9

2.5 Interprocess Communication12

2.6 Device Drivers,Input,And Output14

2.7 Network Input and Interrupts14

2.8 Passing Packets To Higher Level Protocols16

2.9 Passing Datagrams From IP To Transport Protocols16

2.10 Delivery To Application Programs18

2.11 Information Flow On Output19

2.12 From TCP Through IP To Network Output20

2.13 UDP Output21

2.14 Summary21

Chapter 3 Network Interface Layer27

3.1 Introduction27

3.2 The Network Interface Abstraction28

3.3 Ethernet Definitions30

3.4 Logical State Of An Interface34

3.5 Local Host Interface35

3.6 Buffer Management36

3.7 Demultiplexing Incoming Packets38

3.8 Summary40

Chapter 4 Address Discovery And Binding(ARP)41

4.1 Introduction41

4.2 Conceptual Organization Of ARP Software42

4.3 Example ARP Design42

4.4 Data Structures For The ARP Cache43

4.5 ARP Output Processing46

4.6 ARP Input Processing51

4.7 ARP Cache Management56

4.8 ARP Initialization60

4.9 ARP Configuration Parameters61

4.10 Summary61

Chapter 5 IP:Global Software Organization63

5.1 Introduction63

5.2 The Central Switch63

5.3 IP Software Design64

5.4 IP Software Organization And Datagram Flow65

5.5 Byte-Ordering In The IP Header78

5.6 SendingA Datagram To IP80

5.7 Table Maintenance83

5.8 Summary84

Chapter 6 IP:Routing Table And Routing Algorithm87

6.1 Introduction87

6.2 Route Maintenance And Lookup87

6.3 Routing Table Organization88

6.4 Routing Table Data Structures89

6.5 Origin Of Routes And Persistence91

6.6 Routing A Datagram91

6.7 Periodic Routing Table Maintenance98

6.8 IP Options Processing106

6.9 Summary107

Chapter 7 IP:Fragmentation And Reassembly109

7.1 Introduction109

7.2 Fragmenting Datagrams109

7.3 Implementation Of Fragmentation110

7.4 Datagram Reassembly115

7.5 Maintenance Of Fragment Lists124

7.6 Initialization126

7.7 Summary126

Chapter 8 IP:Error Processing(ICMP)129

8.1 Introduction129

8.2 ICMP Message Formats129

8.3 Implementation Of ICMP Messages129

8.4 Handling Incoming ICMP Messages132

8.5 Handling An ICMP Redirect Message134

8.6 Setting A Subnet Mask135

8.7 Choosing A Source Address For An ICMP Packet137

8.8 Generating ICMP Error Messages138

8.9 Avoiding Errors About Errors141

8.10 Allocating A Buffer For ICMP142

8.11 The Data Portion Of An ICMPMessage144

8.12 Generating An 1CMP Redirect Message146

8.13 Summary147

Chapter 9 IP:Multicast Processing(IGMP)149

9.1 Introduction149

9.2 Maintaining Multicast Group Membership Information149

9.3 A Host Group Table150

9.4 Searching For A Host Group152

9.5 Adding A Host Group Entry To The Table153

9.6 Configuring The Network Interface For A Multicast Address155

9.7 Translation Between IP and Hardware Multicast Addresses157

9.8 Removing A Multicast Address From The Host Group Table159

9.9 Joining A Host Group160

9.10 Maintaining Contact With A Multicast Router161

9.11 Implementing IGMP Membership Reports163

9.12 Computing A Random Delay165

9.13 A Process To Send IGMP Reports166

9.14 Handling Incoming IGMP Messages167

9.15 Leaving A Host Group169

9.16 Initialization Of IGMP Data Structures170

9.17 Summary171

Chapter 10 UDP:User Datagrams173

10.1 Introduction173

10.2 UDP Ports And Demultiplexing173

10.3 UDP Input Processing177

10.4 UDP Output Processing187

10.5 Summary190

Chapter 11 TCP:Data Structures And Input Processing193

11.1 Introduction193

11.2 Overview Of TCP Software194

11.3 Transmission Control Blocks194

11.4 TCP Segment Format199

11.5 Sequence Space Comparison200

11.6 TCP Finite State Machine202

11.7 Example State Transition204

11.8 Declaration Of The Finite State Machine204

11.9 TCB Allocation And Initialization206

11.10 Implementation Of The Finite State Machine208

11.11 Handling An Input Segment209

11.12 Summary218

Chapter 12 TCP:Finite State Machine Implementation221

12.1 Introduction221

12.2 CLOSED State Processing221

12.3 Graceful Shutdown222

12.4 Timed Delay After Closing222

12.5 TIME-WAIT State Processing223

12.6 CLOSING State Processing225

12.7 FIN-WAIT-2 State Processing226

12.8 FIN-WAIT-1 State Processing227

12.9 CLOSE-WAIT State Processing229

12.10 LAST-ACK State Processing231

12.11 ESTABLISHED State Processing232

12.12 Processing Urgent Data In A Segment233

12.13 Processing Other Data In A Segment235

12.14 Keeping Track Of Received Octets237

12.15 Aborting A TCP Connection240

12.16 Establishing A TCP Connection241

12.17 Initializing A TCB241

12.18 SYN-SENT State Processing243

12.19 SYN-RECEIVED State Processing244

12.20 LISTEN State Processing247

12.21 Initializing Window Variables For A New TCB248

12.22 Summary250

Chapter 13 TCP:Output Processing251

13.1 Introduction251

13.2 Controlling TCP Output Complexity251

13.3 The Four TCP Output States252

13.4 TCP Output As A Process252

13.5 TCP Output Messages253

13.6 Encoding Output States And TCB Numbers254

13.7 Implementation Of The TCP Output Process254

13.8 Mutual Exclusion255

13.9 Implementation Of The IDLE State256

13.10 Implementation Of The PERSIST State256

13.11 Implementation Of The TRANSMIT State257

13.12 Implementation Of The RETRANSMIT State259

13.13 Sending A Segment259

13.14 Computing The TCP Data Length263

13.15 Computing Sequence Counts264

13.16 Other TCP Procedures265

13.17 Summary271

Chapter 14 TCP:Timer Management273

14.1 Introduction273

14.2 A General Data Structure For Timed Events273

14.3 A Data Structure For TCP Events274

14.4 Timers,Events,And Messages275

14.5 The TCP Timer Process276

14.6 Deleting A TCP Timer Event278

14.7 Deleting All Events For A TCB280

14.8 Determining The Time Remaining For An Event281

14.9 Inserting A TCP Timer Event282

14.10 Starting TCP Output Without Delay283

14.11 Summary285

Chapter 15 TCP:Flow Control And Adaptive Retransmission287

15.1 Introduction287

15.2 The Difficulties With Adaptive Retransmission288

15.3 Tuning Adaptive Retransmission288

15.4 Retransmission Timer And Backoff288

15.5 Window-Based Flow Control291

15.6 Maximum Segment Size Computation295

15.7 Congestion Avoidance And Control299

15.8 Slow-Start And Congestion Avoidance300

15.9 Round Trip Estimation And Timeout303

15.10 A Miscellaneous Note309

15.11 Summary310

Chapter 16 TCP:Urgent Data Processing And The Push Function313

16.1 Introduction313

16.2 Out-Of-Band Signaling313

16.3 Urgent Data314

16.4 Interpreting The Standard314

16.5 Configuration For Berkeley Urgent Pointer Interpretation317

16.6 Informing An Application317

16.7 Reading Data From TCP318

16.8 Sending Urgent Data320

16.9 TCP Push Function321

16.10 Interpreting Push With Out-Of-Order Delivery322

16.11 Implementation Of Push On Input323

16.12 Summary324

Chapter 17 Socket-Level Interface327

17.1 Introduction327

17.2 Interfacing Through A Device327

17.3 TCP Connections As Devices329

17.4 An Example TCP Client Program330

17.5 An Example TCP Server Program331

17.6 Implementation Of The TCP Master Device333

17.7 Implementation Of A TCP Slave Device341

17.8 Initialization Of A Slave Device355

17.9 Summary356

Chapter 18 RIP:Active Route Propagation And Passive Acquisition359

18.1 Introduction359

18.2 Active And Passive Mode Participants360

18.3 Basic RIP Algorithm And Cost Metric360

18.4 Instabilities And Solutions361

18.5 Message Types364

18.6 Protocol Characterization365

18.7 Implementation Of RIP366

18.8 The Principle RIP Process369

18.9 Responding To An Incoming Request375

18.10 Generating Update Messages377

18.11 Initializing Copies Of An Update Message379

18.12 Generating Periodic RIP Output384

18.13 Limitations Of RIP385

18.14 Summary385

Chapter 19 OSPF:Route Propagation With An SPF Algorithm387

19.1 Introduction387

19.2 OSPF Configuration And Options388

19.3 OSPF's Graph-Theoretic Model388

19.4 OSPF Declarations392

19.5 Adjacency And Link State Propagation398

19.6 Discovering Neighboring Gateways With Hello399

19.7 Sending Hello Packets401

19.8 Designated Router Concept407

19.9 Electing A Designated Router407

19.10 Reforming Adjacencies After A Change411

19.11 Handling Arriving Hello Packets414

19.12 Adding A Gateway To The Neighbor List416

19.13 Neighbor State Transitions418

19.14 OSPF Timer Events And Retransmissions420

19.15 Determining Whether Adjacency Is Permitted422

19.16 Handling OSPF input423

19.17 Declarations And Procedures For Link State Processing426

19.18 Generating Database Description Packets429

19.19 Creating A Template430

19.20 Transmitting A Database Description Packet431

19.21 Handling An Arriving Database Description Packet433

19.22 Handling Link State Request Packets440

19.23 Building A Link State Summary442

19.24 OSPF Utility Procedures443

19.25 Summary446

Chapter 20 SNMP:MIB Variables,Representations,And Bindings449

20.1 Introduction449

20.2 Server Organization And Name Mapping450

20.3 MIB Variables451

20.4 MIB Variable Names452

20.5 Lexicographic Ordering Among Names453

20.6 Prefix Removal453

20.7 Operations Applied To MIB Variables454

20.8 Names For Tables454

20.9 Conceptual Threading Of The Name Hierarchy455

20.10 Data Structure For MIB Variables456

20.11 A Data Structure For Fast Lookup459

20.12 Implementation Of The Hash Table460

20.13 Specification Of MIB Bindings460

20.14 Internal Variables Used In Bindings467

20.15 Hash Table Lookup469

20.16 SNMP Structures And Constants471

20.17 ASN.1 Representation Manipulation477

20.18 Summary488

Chapter 21 SNMP:Client And Server491

21.1 Introduction491

21.2 Data Representation In The Server491

21.3 Server Implementation492

21.4 ParsingAn SNMP Message495

21.5 Converting ASN.1 Names In The Binding List500

21.6 Resolving A Query501

21.7 Interpreting The Get-Next Operation504

21.8 Indirect Application Of Operations504

21.9 Indirection For Tables507

21.10 Generating A Reply Message Backward509

21.11 Converting From Internal Form to ASN.1512

21.12 Utility Functions Used By The Server514

21.13 Implementation Of An SNMP Client515

21.14 Initialization Of Variables517

21.15 Summary519

Chapter 22 SNMP:Table Access Functions521

22.1 Introduction521

22.2 Table Access522

22.3 Object Identifiers For Tables522

22.4 Address Entry Table Functions522

22.5 Net-To-Media Table Functions530

22.6 Network Interface Table Functions541

22.7 Routing Table Functions550

22.8 TCP Connection Table Functions560

22.9 UDP Listener Table569

22.10 Utility Routines To Convert IP Addresses576

22.11 Summary578

Chapter 23 Implementation In Retrospect579

23.1 Introduction579

23.2 Statistical Anatysis Of The Code579

23.3 Lines Of Code For Each Protocol580

23.4 Functions And Procedures For Each Protocol582

23.5 Summary583

Appendix 1 Cross Reference Of Procedure Calls585

Appendix 2 Cross Reference Of C Structures Used In The Code607

Appendix 3 Xinu Functions And Constants Used In The Code613

Bibliography631

Index639