通信网络基础 英文版·第2版PDF电子书下载

Preface xi 1

Chapter1 Introduxtion to Communication Networks 1

1．1 What Are Communication Networks? 1

1．2 Why Should YouLearn about Communication Networks? 3

1．3 What Should YouLearn about Communication Networks? 4

1．4 Evolution of Cimmunication networks 5

1．4．1 Telephone Network 5

1．4．2 Computer NetwokS 6

Summary 13

1．5 Organization of the Book 13

Chaper2 The Way Networks Work 15

2．1 Etherner 16

2．1．1 Shared Ethernet:Hubs and Collisions 16

2．1．2 Discovering Addresses:ARPand RARP 17

2．1．3 Interconnecting Ethernets:Switches and Routers 18

2．2 Internet 22

2．2．1 wn Exmple 23

2．2．2 Routing: OSPF and BGP 24

2．2．3 Transmission Control Protocol 25

2．2．4 Client/Srevre Applications 26

2．3 Asynchronous Transfer Mode 27

2．3．1 Main Features 27

2．3．2 Routing 27

2．3．3 Control of QoS: Leaky Buckers 28

2．4 Network Architecture 30

2．4．1 Layere architecture 30

2．4．2 End-to-End Services 34

2．4．3 Physical View 35

2．5．1 The Digital Revolution 37

2．5 Complement 1:Insights behind the InformationR 37

2．5．2 Sourvce and Channel Coding 39

2．5．3 Packet Switching 40

Summary 42

Problems 43

References 46

Chapter3 Internet 47

3．1 A Brief History 47

3．2 Architecture 51

3．2．1 LAN-Link Layer 51

3．2．3 Ttansport 52

3．2．2 Network Layer 52

3．2．4 Applications 53

3．3 Names and Addresses 56

3．3．1 Names 56

3．3．2 ADDresses 58

3．4 intermer Protocol 60

3．4．1 IP Datagrams and ICMP 61

3．4．2 OSPF 62

3．4．3 BGP 66

3．4．4 Plug and Play: DHCP 67

3．4．5 Mobile IP 68

3．5 End-to-End Transmission 68

3．5．1 Overiew 68

3．5．2 retransmission Protocol 69

3．5．3 TCP 70

3．5．4 UDP 72

3．6 Complement 1: Link Protocols 72

3．6．1 SLIP 72

3．7 Complement 2: Analysis of Dijkstra's Shortst Path Algorithm 73

3．7．1 Definition 73

3．6．2 PPP 73

3．7．2 Shortest Paths 74

3．8 Complement 3: Other Routing Algorithms 75

3．8．1 Bellman-Ford 75

3．8．2 Spanning Tree 79

3．9 Complement 4: IPv6 80

3．10．2 Spanning Tree Routing 81

3．10．3 Revese-Path Forwarding 81

3．10．1 Flooding 81

3．10 Complement 5: Multicast Routing 81

3．10．4 Cors-Based Trees 82

3．10．5 Mospf 82

3．10．6 PIM 82

Summary 83

Problems 84

References 87

Chapter4 Losal Area Networks 88

4．1 Architecture and Characteristics 89

4．1．1 Architeure 89

4．1．2 Gharacture of LANs 90

4．2．1 Layout 92

4．2 Ethermet and IEEE802.3 92

4．2．2 Physical 93

4．2．3 MAC 94

4．2．4 Cwitshed 10BASE-T 95

4．2．5 100BASE-t 96

4．2．6 Gigabit Etherner 97

4．3 Token Ring Networks 97

4．3．1 Layout 97

4．3．2 Physical Layer 97

4．3．3 MAC 98

4．3．4 Interconnecting Token Rings 99

4．4 FDDI 99

4．4．1 Layout 100

4．4．2 Physical Layer 100

4．4．3 MAC 101

4．4．4 Station Management 102

4．5 wireless LANs 103

4．5．1 Architecture 103

4．5．2 Physical Layer 104

4．5．3 Hiperlan 104

4．5．4 IEEE802.11 105

4．6 logical Link Control 106

4．7 Complement 1: Latency of LANs 107

4．8 Complement 2: Analysis of CSMA/CD Protocol 108

4．8．1 CSMA/CD Protocol 108

4．8．2 Efficiency of CSMA/CD 109

4．8．3 Analysis 109

4．8．4 Examples 111

4．8．5 Average Medium Access Time 112

4．8．6 Efficiency of IEEE802.3 112

4．9．2 Efficiency of Token Ring MAC Protocol 113

4．9 Complemt 3:Analysis of Token ring MAC Protocol 113

4．9．1 Token Ring MAC Protocol 113

4．9．3 Analysis 114

4．9．4 Maximum Medium Access Time 115

4．10 Complement 4: Analysis of FDDI MAC Protocol 115

4．10．1 FDDI Protocol 115

4．10．2 MMAT of FDDI Protocol 116

4．10．3 Analysis 116

4．10．4 Efficiency of FDDI Protocol 118

4．11．2 ALOHA Protocols 119

4．11 Complement 5: ALOHA 119

4．11．1 Description 119

4．11．3 Efficiency of FDDI Protocol 120

4．11．4 Analysis 120

4．11．5 Reservations 122

Summary 123

Problems 124

References 125

5．1 Architecture 127

5．1．1 Protoco Layers 127

Chapter5 Asynchrons Transfer Mode 127

5．1．2 Three Application Examples 128

5．1．3 Design Philosophy of ATM 129

5．1．4 Operating Principles 130

5．1．5 ATM Cell Format 131

5．1．6 AAL 131

5．1．7 Network Operatpions and Maintenance 133

5．2 Routing in ATM 135

5．2．1 Routing Tables 135

5．2．2 Network Node Interface 136

5．2．3 Switch Designs 138

5．3 End-to-End Services 140

5．3．1 Quality of Seevice Attributes 140

5．3．2 Traffic Descriptors 140

5．3．3 Service Classes 141

5．4 Internetworking with ATM 142

5．4．1 IP over ATM 142

5．4．2 LAN Emulation over ATM 143

5．5 Complement: Delay in Simple Switch 145

Summary 145

Problems 146

Referenses 147

Chapter6 Data Link Layer and Retransmission Protocols 148

6．1 Framing 149

6．1．1 Encapsulation 149

6．1．2 Error Control 153

6．2 Retransmission Protocols 157

6．2．1 Link or End-to-End Control 157

6．2．2 Retransmission Protocols: Preview and Summary 158

6．3 Stop-and-Wait Protocol(SWP) 159

6．3．1 Summary of Operations 159

6．3．2 correctness 160

6．3．3 Efficiency 163

6．4 Alternating Bit Protocol(ABP) 164

6．4．1 Summary of Operations 164

6．4．2 Correctness 164

6．4．3 Efficiness 165

6．5 GO BACK N(GBN) 166

6．5．1 summary of Operations 166

6．5．2 Efficiency 167

6．5．3 Concrete Wxamples: Choosing W 167

6．5．5 GO BACK N Summary 168

6．5．4 Adapting to Network Delays 168

6．6 Selective Repeat Protocol(SRP) 169

6．6．1 Summary of Operations 169

6．6．2 Efficiency 170

6．6．3 Corretness 170

6．6．4 Selective Repeat Protocol Summary 171

6．7 Examples 171

6．7．1 Data Link of SNA 171

6．7．4 Data Link Layer in Frame relay 172

6．7．3 Retransmission Protocol in Internet 172

6．7．2 Data Link Layer of Public Data Networks(X.25) 172

6．7．5 XMODEM 173

6．7．6 Kermit 173

6．8 Compleot 1: Error Control Codes 175

6．8．1 Complating the CRC 175

6．8．2 Bose-Chaudhuri-Hocquenghenm and Reed-solomon Codes 177

6．8．3 Convolutional Codes 181

6．8．4 Turbo Cides 184

6．9 Complement 2: Correctness of ABP 186

6．10．1 ABP 187

6．10 Complement 3: Correctness in a Non-FIFO Network 187

6．10．2 GBN 188

6．11 Complement 4: Congestion and Flow Control in Internet 189

6．11．1 Objectives and Meshanisms 190

6．11．2 Delay/Window Mechanism 190

6．11．3 Algorithm 191

6．11．4 Loss/Window Mechanisms(Tahoe,Reno) 191

6．11．5 Additive Increase——Multiplicase 193

6．11．6 Incompatibility of Reno and Vegas 194

6．11．7 Rate-Based Control: ABR in ATM 195

6．11．8 Detesting Late Acknowledgments 196

6．12 Complent 5: Efficiency of Protocols in the Presence of Errors 197

Summary 198

Problems 199

References 200

Chapter7 Physical Layer 202

7．1 Communication Links and Their Chatacteristics 202

7．1．1 Digital Link 202

7．1．2 Frequency and Propagation 204

7．1．3 Limitations 205

7．1．4 Converting between Bits and Signals 209

7．2 Optical Links 213

7．2．1 Overview 213

7．2．2 Propagation in Fibers 216

7．2．3 Light Sources 218

7．2．4 Light Detectors 219

7．2．5 Free-Space Infrared 219

7．3 Copper Lines 220

7．3．1 Overview 220

7．3．2 Modulation 221

7．3．3 CATV and Vibeo-on-Demand Systems 223

7．4．1 Overview 224

7．4 Radio Links 224

7．5 Complement 1: Shannon Capacity 225

8．5．1 Differential Pulse Code Modulation(DPCM) 225

7．4．3 Cellular Networks 225

7．4．2 Propagatin 225

7．6 Complement 2: Sampling and Quantization 226

7．7 Complement 3: SONET 226

7．7．1 SONET Architecture 229

7．7．2 Frames 230

7．8 Complement 4:Power Budget in Optical Link 231

7．9 Complement 5:RS-232-C 233

7．10 Complement 6:ADSL 234

Summary 235

Problems 236

References 237

Chapter8 Secrity and Compression 238

8．1 Threats and Protestions 238

8．1．1 Threats against Users 239

8．1．2 Threats against Dosuments 240

8．2．1 General Principles 241

8．2 Cryptography 241

8．2．2 Secret Key Crtptography 242

8．2．4 Hashing 243

8．3 Security Systems 244

8．3．1 Integrty 244

8．3．2 Key Management 245

8．3．3 Identifixation 246

8．3．4 Replisations and Deletions 247

8．3．5 Kerberos 248

8．3．6 Pretty Good Privacy 249

8．4 Foundations of Compression 250

8．4．1 Lossy and Lossless Compression 250

8．4．2 Batch,Stream,Progressive,Multilayer 250

8．4．3 Source Coding 251

8．4．4 Finding the Minjmum Number of Bits 252

8．4．5 huffman Encoding 252

8．4．6 Lempel-Ziv Compression 254

8．5 Audio Comperssion 255

8．5．2 Adaptive DPCM(ADPCM) 256

8．5．3 Suband Coding ADPCM 256

8．5．4 Code Excited LInear Prediction 257

8．6 Video Compression 258

8．6．1 Some Algorthms 258

8．6．2 Discrete Cosine Transform 259

8．6．3 Motion Compensation 260

8．6．4 MPEG 260

8．7 Complement 1: Secret Key Cryptography 261

8．7．1 Secret Codes 261

8．8 Cjomplement 2: Public Key Cryptography 262

8．8．1 RSA 263

8．9 Cjomplement 3: Proof of RSA Lemma 263

8．10 Cjomplement 4:Source Coding Theory 265

Problems 267

Reerences 268

Chapter9 Performance Evaluation and Monitoring 270

9．1 Monitoring,SNMP,CMOT,andRMON 270

9．2 Models and Analysis 272

9．2．1 A FIFO Queue 272

9．1．1 Monitoring Summary 272

9．2．2 M/M/I Queue 273

9．2．3 Application to Statistical Multiple 275

9．2．4 Networks of M/M/i Queues 276

9．2．5 M/G/I Queues 277

9．2．6 A Word of Caution 278

9．2．7 Queues with Vacations 279

9．2．8 Priority Systems 279

9．2．9 Cyclic-Servce Systems 280

9．2．10 Model Summary 281

9．3 Simulatiom 281

9．3．1 Time-Driven Smluation 281

9．3．2 Event-Driven Smluation 282

9．3．3 Regenerative Smluation 282

9．3．4 Simluation Packages 283

9．3．5 Simluation Sunnary 283

Problems 284

Summary 284

Referenses 286

AppendixA Prlbability 287

A．1 Probability and Random Variadles 287

A．2 Expestation 290

A．3 Independence 293

A．4 Regenerative Method 295

A．5 Complement 1: Channel Coding 298

Summary 301

Problems 301

Referenses 303

AppendixB Queues and Netwoks of Queues 304

B．1 Markov Chains and M/M/I Queues 304

B．2 Networks of M/M/I Queues 308

B．3 Average Delays 311

Summary 315

Problems 316

Referenses 317

AppendixC Communication Principles 318

C．1 Frequency Spectrum 318

C．2 Modulation and Demodulation 320

C．3 Phase-Locked Loop 322

Summary 323

Referenses 323

C．4 Nyquist's Sampling Theotem 323

AppendixD References 325

8．2．3 Public Key Crtptography 423