Wiley Global Education UK

Computer Networks: Principles, Technologies and Protocols for Network Design

In stock

No reviews

22.250 KD inc. VAT

License

perpetual 180 90 365 150

Table of contents

Front Matter1
PREFACE1
APPROCH1
THE INTENDED AUDIENCE OF THIS BOOK2
A SUPPORTING WEBSITE5
ACKNOWLEDGEMENTS6
PART I NETWORKING BASICS7
1 EVOLUTION OF COMPUTER NETWORKS9
1.1 INTRODUCTION10
1.2 ROOTS OF COMPUTER NETWORKS10
1.2.1 Computer Networks as a Result of the Computing and Communications Technologies Evolution10
Figure 1.111
1.2.2 Batch-Processing Systems11
Figure 1.212
1.2.3 Multiterminal Systems: Prototype of the Computer Network12
Figure 1.313
1.3 FIRST COMPUTER NETWORKS14
1.3.1 First Wide Area Networks (WANs)14
1.3.2 First Local Area Networks (LANs)16
Figure 1.417
Figure 1.517
Table 1.1 Chronology of the most significant events in the history of computer networks19
1.4 CONVERGENCE OF NETWORKS20
1.4.1 Convergence of LANs and WANs20
1.4.2 Convergence of Computer and Telecommunications Networks22
SUMMARY24
REVIEW QUESTIONS25
PROBLEMS25
2 GENERAL PRINCIPLES OF NETWORK DESIGN27
2.1 INTRODUCTION28
2.2 PROBLEMS OF SHARING COMPUTER RESOURCES29
2.2.1 Interaction between Computers and Peripheral Devices29
Figure 2.129
Figure 2.230
2.2.2 Simplest Interaction between Two Computers32
Figure 2.332
Figure 2.435
Figure 2.535
2.2.3 Network Applications36
2.3 PROBLEMS OF PHYSICAL DATA TRANSMISSION USING COMMUNICATIONS LINKS37
2.3.1 Encoding37
Figure 2.638
2.3.2 Characteristics of Physical Links39
2.4 PROBLEMS OF INTERACTION AMONG SEVERAL COMPUTERS41
2.4.1 Topology of Physical Links41
Figure 2.741
Figure 2.843
Figure 2.944
2.4.2 Addressing of Network Nodes45
Figure 2.1047
Figure 2.1147
2.4.3 Switching49
Figure 2.1249
2.5 GENERALIZED SWITCHING PROBLEM50
2.5.1 Flow Definition50
2.5.2 Routing52
Figure 2.1353
Table 2.1 A Fragment of the Switching Table54
2.5.3 Data Forwarding55
Figure 2.1455
Figure 2.1556
2.5.4 Multiplexing and Demultiplexing57
Figure 2.1657
Figure 2.1758
2.5.5 Shared Medium58
Figure 2.1859
2.5.6 Switching Types61
SUMMARY62
REVIEW QUESTIONS63
PROBLEMS64
3 PACKET AND CIRCUIT SWITCHING65
3.1 INTRODUCTION66
3.2 CIRCUIT SWITCHING66
Figure 3.167
Figure 3.267
3.2.1 Connection Setup68
3.2.2 Setup Request Blocking68
3.2.3 Guaranteed Bandwidth69
3.2.4 Multiplexing69
Figure 3.370
3.2.5 Inefficiency of Transmitting Bursty Traffic71
3.3 PACKET SWITCHING72
Figure 3.473
3.3.1 Buffers and Queues73
Figure 3.575
Figure 3.675
3.3.2 Packet-Forwarding Methods76
Figure 3.777
3.3.3 Datagram Transmission77
Figure 3.878
3.3.4 Logical Connection79
Figure 3.980
3.3.5 Virtual Circuit80
Figure 3.1082
3.3.6 Circuit-Switched Networks vs. Packet-Switched Networks82
Transport Analogy for Circuit-Switched and Packet-Switched Networks82
Quantitative Comparison of Delays83
Figure 3.1184
Figure 3.1285
Figure 3.1386
Figure 3.1489
Table 3.1 Properties of Circuit-Switched and Packet-Switched Networks90
3.4 PACKET SWITCHING IN SHARED MEDIUM NETWORKS91
3.4.1 Principles of Medium Sharing91
3.4.2 Reasons for LAN Structuring93
3.4.3 Physical Structuring of LANs93
Figure 3.1594
Figure 3.1695
Figure 3.1796
3.4.4 Logical Structuring of the Shared Medium Network96
Figure 3.1897
Figure 3.1998
Figure 3.2099
3.4.5 Ethernet as an Example of Standard Technology100
Figure 3.21100
SUMMARY102
REVIEW QUESTIONS103
PROBLEMS104
Figure 3.22104
4 NETWORK ARCHITECTURE AND STANDARDIZATION107
4.1 INTRODUCTION108
4.2 DECOMPOSITION OF NETWORK NODE INTERACTION108
Figure 4.1109
4.2.1 Multilayer Approach109
Figure 4.2110
Figure 4.3110
Figure 4.4112
4.2.2 Protocol and Protocol Stack112
Figure 4.5112
4.3 OSI MODEL113
4.3.1 General Characteristics of the OSI Model114
Figure 4.6115
Figure 4.7116
4.3.2 Physical Layer117
4.3.3 Data Link Layer117
4.3.4 Network Layer119
Figure 4.8120
Figure 4.9121
Figure 4.10122
4.3.5 Transport Layer123
4.3.6 Session Layer124
4.3.7 Presentation Layer124
4.3.8 Application Layer125
4.3.9 OSI Model and Circuit-Switched Networks125
4.4 NETWORK STANDARDIZATION126
4.4.1 Concept of an Open System126
4.4.2 Types of Standards128
4.4.3 Internet Standardization128
4.4.4 Standard Stacks of Communications Protocols129
OSI Stack129
Figure 4.11130
IPX/SPX Stack131
Figure 4.12131
NetBIOS/SMB Stack132
Figure 4.13132
TCP/IP Stack133
Figure 4.14134
Figure 4.15137
4.4.5 Correspondence between Popular Protocol Stacks and the OSI Model138
Figure 4.16138
4.5 INFORMATION AND TRANSPORT SERVICES139
4.5.1 Distribution of Protocols by Network Elements140
Figure 4.17141
4.5.2 Subsidiary Protocols of the Transport System142
Figure 4.18143
SUMMARY144
REVIEW QUESTIONS145
PROBLEMS147
5 EXAMPLES OF NETWORKS149
5.1 INTRODUCTION150
5.2 GENERALIZED STRUCTURE OF A TELECOMMUNICATIONS NETWORK150
Figure 5.1151
5.2.1 Access Networks151
5.2.2 Backbones152
5.2.3 Data Centers152
5.3 TELECOMMUNICATIONS CARRIER NETWORKS153
5.3.1 Services154
Figure 5.2154
5.3.2 Clients156
5.3.3 Infrastructure157
5.3.4 Coverage Territory158
5.3.5 Relationships among Different Types of Carriers159
Figure 5.3160
5.4 CORPORATE NETWORKS160
5.4.1 Department Networks161
Figure 5.4161
5.4.2 Building or Campus Networks162
Figure 5.5163
5.4.3 Enterprise-Wide Networks164
Figure 5.6165
5.5 INTERNET166
5.5.1 Internet Uniqueness167
5.5.2 Internet Structure168
Figure 5.7169
5.5.3 Internet Boundaries171
Figure 5.8172
SUMMARY174
REVIEW QUESTIONS175
PROBLEMS177
6 NETWORK CHARACTERISTICS179
6.1 INTRODUCTION180
6.2 TYPES OF CHARACTERISTICS180
6.2.1 Subjective Quality Characteristics180
6.2.2 Network Characteristics and Requirements181
6.2.3 Time Scale182
6.2.4 Service Level Agreement183
6.3 PERFORMANCE184
6.3.1 Ideal Network184
Figure 6.1185
Figure 6.2186
6.3.2 Characteristics of Packet Delays187
Figure 6.3188
Figure 6.4189
6.3.3 Characteristics of Information Rate190
6.4 RELIABILITY191
6.4.1 Packet Loss Characteristics192
6.4.2 Availability and Fault Tolerance192
6.4.3 Alternative Routes193
Figure 6.5194
6.4.4 Data Retransmission and the Sliding Window195
Figure 6.6196
6.5 SECURITY198
6.5.1 Computer and Network Security199
6.5.2 Data Confidentiality, Integrity, and Availability200
6.5.3 Network Security Services202
6.6 PROVIDER-ONLY CHARACTERISTICS203
6.6.1 Extensibility and Scalability203
6.6.2 Manageability204
6.6.3 Compatibility205
SUMMARY205
REVIEW QUESTIONS206
PROBLEMS207
Figure 6.7207
7 METHODS OF ENSURING QUALITY OF SERVICE209
7.1 INTRODUCTION210
7.2 APPLICATIONS AND QOS211
7.2.1 QoS Requirements of Different Types of Applications211
7.2.2 Predictability of the Information Rate211
Figure 7.1212
Figure 7.2212
7.2.3 Application Sensitivity to Packet Delays213
7.2.4 Application Sensitivity to Packet Losses214
7.2.5 Application Classes214
Table 7.1 Classes of Traffic215
7.3 QUEUE ANALYSIS216
Figure 7.3217
7.3.1 M/M/1 Model217
Figure 7.4218
Figure 7.5219
7.3.2 M/M/1 as a Packet-Processing Model219
Figure 7.6220
Figure 7.7222
7.4 QOS MECHANISMS222
7.4.1 Operation in Underloaded Mode222
7.4.2 Different Service Classes223
Figure 7.8223
7.5 QUEUE MANAGEMENT ALGORITHMS224
7.5.1 FIFO Algorithm225
7.5.2 Priority Queuing225
Figure 7.9226
7.5.3 Weighted Queuing228
Figure 7.10228
7.5.4 Hybrid Algorithms of Queuing230
7.6 FEEDBACK230
7.6.1 Purpose230
7.6.2 Feedback Participants231
Figure 7.11232
7.6.3 Feedback Information233
7.7 RESOURCE RESERVATION235
7.7.1 Resource Reservation and Packet Switching235
Figure 7.12236
7.7.2 Reservation-Based QoS System239
Figure 7.13239
7.8 TRAFFIC ENGINEERING242
7.8.1 Drawbacks of Traditional Routing Methods243
Figure 7.14243
7.8.2 Idea of Traffic Engineering244
Figure 7.15244
Figure 7.16245
Figure 7.17246
7.8.3 Traffic Engineering for Different Traffic Classes248
SUMMARY249
REVIEW QUESTIONS249
PROBLEMS250
PART II PHYSICAL LAYER TECHNOLOGIES253
8 TRANSMISSION LINKS255
8.1 INTRODUCTION256
8.2 TAXONOMY256
8.2.1 Transmission Networks, Circuits, and Links256
Figure 8.1257
8.2.2 Media258
Figure 8.2258
8.2.3 Transmission Equipment259
8.3 TRANSMISSION LINK CHARACTERISTICS261
8.3.1 Spectrum Analysis of the Signals in Communications Links261
Figure 8.3262
Figure 8.4262
Figure 8.5263
Figure 8.6263
8.3.2 Attenuation and Impedance264
Figure 8.7264
Figure 8.8265
Figure 8.9266
8.3.3 Noise Immunity and Transmission Reliability267
Figure 8.10268
Figure 8.11269
Figure 8.12269
8.3.4 Bandwidth and Capacity270
Figure 8.13270
Figure 8.14271
8.3.5 Bits and Bauds272
8.3.6 Dependence between Bandwidth and Capacity274
Figure 8.15274
8.4 CABLE TYPES275
8.4.1 Unshielded and Shielded Twisted Pair275
Figure 8.16276
8.4.2 Coaxial Cable277
8.4.3 Optical Cable278
Figure 8.17279
8.4.4 Structured Cabling System of Buildings280
Figure 8.18281
Figure 8.19281
SUMMARY282
REVIEW QUESTIONS283
PROBLEMS283
9 DATA ENCODING AND MULTIPLEXING285
9.1 INTRODUCTION286
9.2 MODULATION286
Figure 9.1287
9.2.1 Modulation When Transmitting Analog Signals287
9.2.2 Modulation When Transmitting Discrete Signals287
Figure 9.2288
Figure 9.3289
9.2.3 Combined Modulation Methods289
Figure 9.4290
Figure 9.5291
9.3 DIGITIZING ANALOG SIGNALS292
9.3.1 Pulse Code Modulation292
Figure 9.6292
9.3.2 Digitizing Voice293
9.4 ENCODING METHODS294
9.4.1 Choosing Encoding Methods295
Figure 9.7295
9.4.2 Potential Nonreturn to Zero Code296
Figure 9.8297
9.4.3 Bipolar Alternate Mark Inversion Encoding298
9.4.4 Nonreturn to Zero with Ones Inverted Code298
9.4.5 Bipolar Pulse Code299
9.4.6 Manchester Code299
9.4.7 2B1Q Potential Code300
9.4.8 Redundant Codes300
Table 9.1 Correspondence of the source and resulting codes of the 4B/5B code301
9.4.9 Scrambling301
Figure 9.9303
Figure 9.10304
9.4.10 Data Compression304
9.5 ERROR DETECTION AND CORRECTION306
9.5.1 Error Detection Technique306
9.5.2 Error Correction308
9.6 MULTIPLEXING AND SWITCHING309
9.6.1 Circuit Switching Based on FDM and WDM309
Figure 9.11310
9.6.2 Circuit Switching Based on TDM311
Figure 9.12312
9.6.3 Duplex Mode of Channel Operation314
SUMMARY315
REVIEW QUESTIONS316
PROBLEMS316
10 WIRELESS TRANSMISSION317
10.1 INTRODUCTION318
10.2 WIRELESS MEDIA318
10.2.1 Advantages of Wireless Communications318
Figure 10.1319
10.2.2 Wireless Link320
Figure 10.2320
10.2.3 Electromagnetic Spectrum321
Figure 10.3321
10.2.4 Propagation of Electromagnetic Waves322
Figure 10.4323
10.2.5 Licensing324
10.3 WIRELESS SYSTEMS326
10.3.1 Point-to-Point System326
Figure 10.5326
Figure 10.6327
10.3.2 Point-to-Multipoint System327
Figure 10.7328
Figure 10.8329
10.3.3 Multipoint-to-Multipoint System330
Figure 10.9330
10.3.4 Satellite Systems331
Figure 10.10331
Table 10.1 Frequency bands allocated by ITU for satellite communications332
Figure 10.11332
10.3.5 Geostationary Satellite333
10.3.6 Medium and Low Earth Orbit Satellites334
10.4 SPREAD SPECTRUM TECHNOLOGY336
10.4.1 Frequency-Hopping Spread Spectrum337
Figure 10.12337
Figure 10.13338
10.4.2 Direct Sequence Spread Spectrum339
10.4.3 Code Division Multiple Access340
SUMMARY343
REVIEW QUESTIONS344
PROBLEMS344
11 TRANSMISSION NETWORKS345
11.1 INTRODUCTION346
11.2 PDH NETWORKS346
11.2.1 Rate Hierarchy347
Table 11.1 Hierarchy of digital data rates348
11.2.2 Multiplexing Methods348
11.2.3 PDH Technology Limitations350
Figure 11.1350
11.3 SONET/SDH NETWORKS351
11.3.1 Rate Hierarchy and Multiplexing Methods352
Table 11.2 SONET/SDH speed hierarchy352
Figure 11.2354
11.3.2 Equipment Types354
Figure 11.3355
Figure 11.4355
11.3.3 Protocol Stack356
Figure 11.5357
Figure 11.6357
11.3.4 STM N Frames358
Table 11.3 Structure of regenerator and multiplex section headers358
11.3.5 Typical Topologies360
Figure 11.7360
11.3.6 Methods of Ensuring Network Survivability361
Figure 11.8362
Figure 11.9363
Figure 11.10364
Figure 11.11365
Figure 11.12366
11.4 DWDM NETWORKS367
11.4.1 Operating Principles368
Figure 11.13369
11.4.2 Fiber Amplifiers369
11.4.3 Typical Topologies371
Figure 11.14371
Figure 11.15372
Figure 11.16373
Figure 11.17373
11.4.4 Optical Add/Drop Multiplexers374
Figure 11.18374
11.4.5 Optical Cross-Connects375
Figure 11.19375
11.5 CASE STUDY376
Figure 11.20378
Figure 11.21378
SUMMARY379
REVIEW QUESTIONS380
Figure 11.22381
PROBLEMS382
PART III LOCAL AREA NETWORKS383
12 ETHERNET387
12.1 INTRODUCTION388
12.2 GENERAL CHARACTERISTIC OF LAN PROTOCOLS388
12.2.1 Standard Topology and Shared Media389
Figure 12.1390
Figure 12.2390
12.2.2 LAN Protocol Stack391
Figure 12.3391
MAC Layer392
LLC Layer394
Figure 12.4395
Figure 12.5395
12.2.3 Structure of IEEE 802.x Standards397
Figure 12.6398
12.3 CSMA/CD399
12.3.1 MAC Addresses399
12.3.2 Medium Access and Data Transmission401
Figure 12.7401
12.3.3 Collisions402
Figure 12.8403
12.3.4 Path Delay Value and Collision Detection404
Table 12.1 Ethernet MAC layer parameters406
12.4 ETHERNET FRAME FORMATS406
Figure 12.9407
12.4.1 802.3/LLC408
12.4.2 Raw 802.3/Novell 802.3 Frame408
12.4.3 Ethernet DIX/Ethernet II Frame409
12.4.4 Ethernet SNAP Frame409
12.4.5 Using Various Types of Ethernet Frames410
12.5 MAXIMUM PERFORMANCE OF THE ETHERNET NETWORK411
Figure 12.10412
12.6 ETHERNET PHYSICAL MEDIUM SPECIFICATIONS413
12.6.1 10Base-5414
Figure 12.11414
Figure 12.12415
12.6.2 10Base-2416
Figure 12.13417
12.6.3 10Base-T418
Figure 12.14418
Figure 12.15419
Figure 12.16420
12.6.4 Fiber-Optic Ethernet421
12.6.5 Collision Domain422
12.6.6 Common Characteristics of 10 Mbps Ethernet Standards422
Table 12.2 Common limitations for all Ethernet standards423
Table 12.3 Parameters of physical-layer Ethernet specifications423
12.7 CASE STUDY423
Figure 12.17424
Table 12.4 Data for calculating PDV426
Table 12.5 Reduction of the IPG by repeaters427
SUMMARY428
REVIEW QUESTIONS429
PROBLEMS431
Figure 12.18431
Figure 12.19432
Figure 12.20432
13 HIGH-SPEED ETHERNET435
13.1 INTRODUCTION436
13.2 FAST ETHERNET436
13.2.1 Historical Overview436
13.2.2 Fast Ethernet Physical Layer437
Figure 13.1438
Figure 13.2439
13.2.3 100Base-FX/TX/T4 Specifications440
Figure 13.3441
Figure 13.4443
13.2.4 Rules for Building Fast Ethernet Segments Using Repeaters443
Limitations on the Maximum Length of DTE-DTE Segments444
Table 13.1 Maximum DTE-DTE segment lengths444
Limitations on Fast Ethernet Networks Based on Repeaters444
Table 13.2 Parameters of Fast Ethernet networks using Class I repeaters445
Figure 13.5446
13.2.5 Specific Features of 100VG-AnyLAN446
Figure 13.6447
13.3 GIGABIT ETHERNET448
13.3.1 Historical Overview448
13.3.2 Problems449
13.3.3 Ensuring Network Diameter of 200 Meters450
13.3.4 802.3z Physical Medium Specifications451
13.3.5 Gigabit Ethernet Based on Category 5 Twisted Pair452
Figure 13.7452
SUMMARY453
REVIEW QUESTIONS454
PROBLEMS455
Table 13.3 Delays introduced by the cable456
Table 13.4 Delays introduced by network adapters456
14 SHARED MEDIA LANS457
14.1 INTRODUCTION458
14.2 TOKEN RING458
14.2.1 Token-Passing Access459
Figure 14.1460
14.2.2 Token Ring Physical Layer461
Figure 14.2462
14.3 FDDI463
14.3.1 Main FDDI Characteristics463
Figure 14.3464
Figure 14.4465
14.3.2 FDDI Fault Tolerance466
Figure 14.5466
Figure 14.6467
14.4 WIRELESS LANS468
14.4.1 Specific Features of Wireless LANs468
Figure 14.7469
Figure 14.8470
14.4.2 IEEE 802.11 Protocol Stack472
Figure 14.9472
14.4.3 Topologies of 802.11 LANs474
Figure 14.10474
Figure 14.11475
14.4.4 Access to the Shared Medium475
Distributed Coordination Function Access Mode476
Figure 14.12476
Figure 14.13478
Point Coordination Function Access Mode478
14.4.5 Security479
14.5 PAN AND BLUETOOTH480
14.5.1 Specific Features of PANs480
14.5.2 Bluetooth Architecture481
Figure 14.14482
14.5.3 Bluetooth Protocol Stack483
Figure 14.15484
14.5.4 Bluetooth Frames485
Figure 14.16486
14.5.5 How Bluetooth Operates486
Figure 14.17487
14.6 SHARED MEDIA LAN EQUIPMENT488
14.6.1 Main Functions of Network Adapters488
14.6.2 Main Functions of Concentrators490
Figure 14.18491
Figure 14.19492
14.6.3 Autopartitioning493
14.6.4 Support of Reserve Links493
Figure 14.20494
14.6.5 Protection against Unauthorized Access494
Figure 14.21495
Figure 14.22496
14.6.7 Multisegment Concentrators496
Figure 14.23496
14.6.8 Concentrator Design497
Figure 14.24498
Figure 14.25499
SUMMARY500
REVIEW QUESTIONS501
PROBLEMS503
15 SWITCHED LAN BASICS505
15.1 INTRODUCTION506
15.2 LOGICAL NETWORK STRUCTURING USING BRIDGES AND SWITCHES506
15.2.1 Advantages and Drawbacks of Shared Media LANs506
Figure 15.1507
15.2.2 Advantages of the Logical Network Structuring508
Figure 15.2509
Figure 15.3509
15.2.3 Transparent Bridge Algorithm of the IEEE 802.1D Standard511
Figure 15.4512
Figure 15.5515
Figure 15.6515
Figure 15.7516
15.2.4 TOPOLOGICAL LIMITATIONS OF SWITCHED LAN516
Figure 15.8517
15.3 SWITCHES518
15.3.1 Specific Features of Switches518
Figure 15.9520
Figure 15.10521
Figure 15.11522
Figure 15.12523
15.3.2 Nonblocking Switches524
15.3.3 Overcoming Congestion525
Figure 15.13526
15.3.4 Translation of the Data Link-Layer Protocols526
15.3.5 Traffic Filtering528
15.3.6 Switch Architecture and Design528
Figure 15.14529
Figure 15.15530
Figure 15.16531
Figure 15.17531
Combined Switches532
Figure 15.18532
15.3.7 Performance Characteristics of Switches533
Table 15.1 Functional capabilities of switching on the fly and with full buffering534
15.4 FULL-DUPLEX LAN PROTOCOLS536
15.4.1 Changes Introduced into the MAC Layer by Operation in Full-Duplex Mode536
Figure 15.19536
15.4.2 Problems of Congestion Control in Full-Duplex Mode537
Figure 15.20538
Figure 15.21539
Figure 15.22539
15.4.3 10G Ethernet540
Figure 15.23541
Figure 15.24541
SUMMARY542
REVIEW QUESTIONS543
PROBLEMS544
Figure 15.25545
16 ADVANCED FEATURES OF SWITCHED LANS547
16.1 INTRODUCTION548
16.2 SPANNING TREE ALGORITHM549
16.2.1 Required Definitions549
Figure 16.1550
16.2.2 Three-Stage Procedure of Building the Tree551
Figure 16.2552
16.2.3 STA Advantages and Drawbacks554
16.3 LINK AGGREGATION IN LANS555
16.3.1 Trunks and Logical Channels555
Figure 16.3556
16.3.2 Eliminating Frame Spawning557
Figure 16.4558
16.3.3 Port Selection559
Figure 16.5560
Figure 16.6562
16.4 VIRTUAL LANS562
Figure 16.7563
16.4.1 VLAN Goal564
Figure 16.8565
16.4.2 Creating VLANs Based on One Switch565
Figure 16.9566
16.4.3 Creating VLANs Based on Several Switches567
Figure 16.10567
Figure 16.11568
Figure 16.12569
Figure 16.13570
Figure 16.14570
16.5 QUALITY OF SERVICE IN LANS571
Table 16.1 LAN traffic classes572
Table 16.2 Traffic classes and number of queues572
16.6 LIMITATIONS OF BRIDGES AND SWITCHES573
16.7 CASE STUDY575
Figure 16.15575
SUMMARY576
REVIEW QUESTIONS577
PART IV TCP/IP INTERNET-WORKING579
17 ADDRESSING IN TCP/IP NETWORKS581
17.1 INTRODUCTION582
17.2 ADDRESS TYPES OF THE TCP/IP STACK582
17.2.1 Local Addresses583
17.2.2 IP Network Addresses584
Figure 17.1584
17.2.3 Domain Names585
17.3 IP ADDRESS FORMAT586
17.3.1 Classes of IP Addresses587
Table 17.1 Classes of IP addresses587
17.3.2 Special IP Addresses589
17.3.3 Using Masks in IP Addressing590
17.4 IP ADDRESS ASSIGNMENT ORDER592
17.4.1 Address Assignment in an Autonomous Network592
17.4.2 Centralized Address Assignment593
Figure 17.2594
17.4.3 Addressing and CIDR594
Figure 17.3595
17.5 MAPPING IP ADDRESSES TO LOCAL ADDRESSES596
17.5.1 ARP596
Figure 17.4598
Figure 17.5598
Table 17.2 Example of ARP request599
Table 17.3 Example of ARP reply599
Table 17.4 Example of ARP table600
17.5.2 Proxy-ARP601
Figure 17.6602
17.6 DNS603
17.6.1 Flat Symbolic Names603
17.6.2 Hierarchical Symbolic Names603
Figure 17.7604
17.6.3 DNS Operating Mode606
17.6.4 Reverse Lookup Zone608
17.7 DHCP609
17.7.1 DHCP Modes610
17.7.2 Algorithm of Dynamic Address Assignment611
Figure 17.8612
SUMMARY614
REVIEW QUESTIONS615
PROBLEMS616
18 INTERNET PROTOCOL617
18.1 INTRODUCTION618
18.2 IP PACKET FORMAT618
Figure 18.1619
18.3 IP ROUTING METHOD622
Figure 18.2622
18.3.1 Simplified Structure of the Routing Table623
Table 18.1 Routing table of router 4624
18.3.2 Routing Tables on End Nodes625
Table 18.2 Routing table of computer B626
Table 18.3 Routing table of end node A626
18.3.3 Searching Routing Tables That Do Not Contain Masks627
18.3.4 Examples of Routing Tables of Different Formats628
Figure 18.3628
Table 18.4 Simplified routing table of the Rl router629
Table 18.5 Routing table of the built-in Windows 2000 router629
Table 18.6 Routing table of a hardware router630
Table 18.7 Routing table of the UNIX router630
18.3.5 Sources and Types of Records in Routing Tables633
18.3.6 Example of IP Routing without Masks634
Figure 18.4634
Passing a DNS Request635
Figure 18.5635
Figure 18.6635
Figure 18.7636
Figure 18.8637
Passing a DNS Response637
Figure 18.9638
Passing the Packet from an FTP Client to an FTP Server638
18.4 ROUTING USING MASKS638
18.4.1 Structuring a Network with Masks of the Same Length639
Figure 18.10639
Figure 18.11640
Table 18.8 Routing table of the R2 router in the network with masks of the same length641
18.4.2 Algorithm of Table Lookup that Accounts for Masks642
18.4.3 Using Masks of Variable Length643
Figure 18.12644
Figure 18.13644
Table 18.9 Routing table of the R2 router in the network with masks of variable length645
Table 18.10 Fragment of the routing table of the Rl router646
18.4.4 Overlapping Address Spaces646
Figure 18.14647
Figure 18.15648
Figure 18.16649
Figure 18.17650
Table 18.11 Routing table of the R2 router650
18.4.5 Routing and CIDR651
Figure 18.18652
Table 18.12 Routing table of the RISP router652
18.5 FRAGMENTATION OF IP PACKETS653
18.5.1 MTU as a Technological Parameter654
Table 18.13 Typical MTU values654
18.5.2 Fragmentation Parameters654
18.5.3 Procedures of Fragmenting and Assembling Packets655
18.5.4 Example of Fragmentation657
Figure 18.19657
18.6 IPV6658
18.6.1 Directions of TCP/IP Stack Modernization659
18.6.2 Scalable Addressing System660
Figure 18.20662
Figure 18.21664
Figure 18.22665
Figure 18.23665
18.6.3 Flexible Header Format666
Figure 18.24666
Figure 18.25667
18.6.4 Reducing the Load on Routers668
SUMMARY669
REVIEW QUESTIONS670
Figure 18.26671
PROBLEMS671
19 CORE PROTOCOLS OF THE TCP/IP STACK673
19.1 INTRODUCTION674
19.2 TCP AND UDP TRANSPORT LAYER PROTOCOLS674
19.2.1 Ports675
Figure 19.1675
19.2.2 UDP677
Figure 19.2677
Figure 19.3678
19.2.3 TCP Segment Format679
Figure 19.4680
19.2.4 Logical Connections as a Basis of TCP Reliability681
Figure 19.5682
Figure 19.6682
Figure 19.7683
19.2.5 Sequence Number and Acknowledgment Number684
Figure 19.8685
Figure 19.9685
19.2.6 Receiver Window686
Figure 19.10686
Figure 19.11686
19.2.7 Cumulative Acknowledgment Principle687
Figure 19.12688
19.2.8 Acknowledgment Timeout688
19.2.9 Controlling the Receiver Window689
19.3 ROUTING PROTOCOLS690
19.3.1 Classification of Routing Protocols690
Routing without Tables691
Adaptive Routing692
Distance Vector Algorithms693
Link State Algorithms694
Using Several Routing Protocols694
Figure 19.13695
Exterior and Interior Gateway Protocols696
Figure 19.14696
19.3.2 Routing Information Protocol697
Building a Routing Table697
Figure 19.15698
Table 19.1 Minimal routing table of the R1 router699
Table 19.2 Minimal routing table of the R2 router699
Table 19.3 Adding records to the routing table of the R1 router700
Table 19.4 Updating the routing table of the R1 router701
Adapting RIP Routers to Network State Changes702
Table 19.5 Record in the routing table of the R2 router703
Table 19.6 Record in the routing table of the R1 router704
Methods of Eliminating Invalid Routes in RIP705
19.3.3 Open Shortest Path first706
Two Stages of Building the Routing Table706
HELLO Route Advertisements707
Metrics707
Figure 19.16708
Figure 19.17708
OSPF Stability709
19.3.4 Border Gateway Protocol710
Figure 19.18711
19.4 INTERNET CONTROL MESSAGE PROTOCOL713
19.4.1 Types of ICMP Messages714
Figure 19.19714
Table 19.7 Possible values of the Type field715
Table 19.8 Codes that detail the cause of the type 3 error — “destination unreachable”716
19.4.2 Format of the Echo Request/Reply Message: The Ping Utility716
Figure 19.20717
19.4.3 Error Message Format: The Traceroute Utility718
Figure 19.21718
SUMMARY720
REVIEW QUESTIONS723
PROBLEMS724
20 ADVANCED FEATURES OF IP ROUTERS725
20.1 INTRODUCTION726
20.2 FILTERING727
20.2.1 User Traffic Filtering727
20.2.2 Routing Announcements Filtering730
20.3 IP QOS731
20.3.1 QoS Models of IntServ and DiffServ731
20.3.2 Token Bucket Algorithm733
Figure 20.1733
20.3.3 Random Early Detection735
Figure 20.2735
20.3.4 Integrated Services Framework and RSVP736
Figure 20.3737
Table 20.1 RSVP messages738
20.3.5 Differentiated Services Framework740
Figure 20.4740
Figure 20.5741
Figure 20.6743
20.4 NETWORK ADDRESS TRANSLATION745
20.4.1 Reasons for Address Translation745
20.4.2 Traditional NAT745
Figure 20.7746
20.4.3 Basic NAT746
Figure 20.8747
20.4.4 Address and Port Translation748
Figure 20.9749
20.5 ROUTERS750
20.5.1 Router Functions750
Figure 20.10751
Interface Level751
Network Layer Protocol752
Layer of Routing Protocols753
20.5.2 Classification of Routers by Areas of Application753
Figure 20.11754
Figure 20.12757
SUMMARY758
REVIEW QUESTIONS760
PROBLEMS761
Figure 20.13761
PART V WIDE AREA NETWORKS763
21 VIRTUAL CIRCUIT WAN767
21.1 INTRODUCTION768
21.2 VIRTUAL CIRCUITS TECHNIQUE769
21.2.1 Switched Virtual Circuits769
Figure 21.1770
21.2.2 Permanent Virtual Circuits772
21.2.3 Comparison to the Datagram Technique773
21.3 X.25 NETWORKS775
21.3.1 Structure and Goals of X.25 Networks775
Figure 21.2776
21.3.2 Addressing in X.25 Networks776
21.3.3 Protocol Stack of X.25 Networks777
Figure 21.3777
21.4 FRAME RELAY NETWORKS779
21.4.1 Frame Relay Protocol Stack780
Figure 21.4781
Figure 21.5782
21.4.2 QoS Support783
Figure 21.6784
Figure 21.7785
21.5 ATM TECHNOLOGY787
21.5.1 Main Principles of ATM Operation788
Figure 21.8790
21.5.2 ATM Protocol Stack792
Figure 21.9793
Figure 21.10793
21.5.3 ATM Adaptation Layer793
21.5.4 ATM Protocol795
Figure 21.11796
21.5.5 Categories of ATM Protocol Services and Traffic Control799
SUMMARY803
REVIEW QUESTIONS804
PROBLEMS805
Figure 21.12806
Figure 21.13806
22 IP WANS807
22.1 INTRODUCTION808
22.2 PURE IP WANS808
22.2.1 IP WAN Structure809
Figure 22.1809
Figure 22.2811
22.2.2 Protocols of the HDLC Family812
Figure 22.3812
22.2.3 Point-to-Point Protocol815
22.2.4 Leased Lines Used by IP Routers816
Figure 22.4817
22.3 IP OVER ATM OR FRAME RELAY818
22.3.1 Communication between IP and ATM Layers818
Figure 22.5818
Figure 22.6819
22.3.2 Configuring the Router Interface819
22.4 MULTIPROTOCOL LABEL SWITCHING821
22.4.1 Combining Switching and Routing within the Same Device821
22.4.2 LSR and Data Forwarding Table822
Figure 22.7823
Figure 22.8823
Table 22.1 Example of an MPLS forwarding table823
22.4.3 Label Switching Paths824
Figure 22.9824
22.4.4 MPLS Header and Data Link Technologies825
Figure 22.10826
22.4.5 Label Stack827
Figure 22.11828
Figure 22.12829
Table 22.2 Fragment of the LER1 forwarding table830
Table 22.3 Fragment of the LSR1 forwarding table830
Table 22.4 Fragment of the LSR3 forwarding table831
Table 22.5 Fragment of the LER2 forwarding table831
22.4.6 MPLS Application Areas832
22.4.7 MPLS Interior Gateway Protocol832
Figure 22.13833
22.4.8 MPLS Traffic Engineering834
Figure 22.14835
Figure 22.15837
22.5 NETWORK MANAGEMENT839
22.5.1 Goal of Network Management Systems839
22.5.2 Functional Groups of Network Management Problems840
22.5.3 Architecture of Network Management Systems841
Figure 22.16841
Figure 22.17843
Figure 22.18843
Figure 22.19844
22.5.4 Management System Standards based on SNMP845
22.5.5 SNMP MIB Structure846
Figure 22.20847
Figure 22.21849
22.5.6 SNMP Message Format850
Figure 22.22851
22.5.7 RMON MIB Specification852
SUMMARY855
REVIEW QUESTIONS856
PROBLEMS857
23 REMOTE ACCESS859
23.1 INTRODUCTION860
23.2 METHODS OF REMOTE ACCESS861
23.2.1 Types of Clients and Terminal Equipment861
Figure 23.1862
23.2.2 Information Multiplexing at the Local Loop864
Figure 23.2865
23.2.3 Remote Node Mode866
Figure 23.3867
23.2.4 Remote Control Mode. Telnet868
23.3 DIAL-UP ANALOG ACCESS870
23.3.1 Principles of Telephone Network Operation870
Figure 23.4871
Table 23.1 Encoding digits and characters when using tone dialing872
23.3.2 Remote Access through a Telephone Network873
23.3.3 Modems874
Standards for Data Encoding Methods and Data Transmission Rates875
Error Correction876
Figure 23.5876
Data Compression877
23.4 DIAL-UP ACCESS USING ISDN877
23.4.1 Goals and Structure of ISDN878
Figure 23.6879
23.4.2 BRI and PRI Interfaces879
23.4.3 ISDN Protocol Stack881
Figure 23.7881
Figure 23.8883
23.4.4 Using ISDN for Data Transmission884
Figure 23.9884
Figure 23.10885
23.5 XDSL TECHNOLOGY886
Figure 23.11887
Figure 23.12888
23.6 ACCESS USING CABLE TV890
Figure 23.13890
23.7 WIRELESS ACCESS891
SUMMARY893
REVIEW QUESTIONS894
PROBLEMS895
24 SECURE TRANSPORT SERVICES897
24.1 INTRODUCTION898
24.2 IPSEC PROTECTED CHANNEL SERVICE899
24.2.1 Hierarchy of the Protected Channel Services899
Figure 24.1899
24.2.2 Distribution of Functions among IPSec Protocols900
Table 24.1 Distribution of functions among IPSec protocols901
24.2.3 Encryption in IPSec902
Figure 24.2902
Figure 24.3903
24.2.4 Security Association904
Figure 24.4904
24.2.5 Transport and Tunnel Modes905
Figure 24.5906
Figure 24.6906
Figure 24.7907
24.2.6 AH Protocol907
Figure 24.8908
Figure 24.9909
Figure 24.10909
24.2.7 ESP Protocol909
Figure 24.11910
Figure 24.12910
24.2.8 Security Databases911
Figure 24.13911
24.3 VIRTUAL PRIVATE NETWORK SERVICE913
24.3.1 VPN Definition913
24.3.2 VPN Evaluation and Comparison Criteria915
24.3.3 VPN on the Basis of Traffic Segregation917
Figure 24.14918
Figure 24.15919
24.3.4 IPSec VPN920
24.4 MPLS VPN921
24.4.1 Full Connectivity and Absolute Isolation922
Figure 24.16923
24.4.2 MPLS VPN Components923
Figure 24.17924
24.4.3 Segregation of the Routing Information925
Figure 24.18926
24.4.4 Using MP-BGP for Connecting Sites927
24.4.5 Independence of Address Spaces927
Figure 24.19929
Table 24.2 RD format930
24.4.6 Generation of MP-BGP Routing Advertisements930
24.4.7 Packet Forwarding over the MPLS VPN932
Figure 24.20933
24.4.8 Mechanism of Forming VPN Topology933
Figure 24.21934
24.4.9 Security Level935
SUMMARY936
REVIEW QUESTIONS937
PROBLEMS938
Back Matter939
CONCLUSION: LOOKING INTO THE FUTURE939
REFERENCES AND RECOMMENDED READING941
RECOMMENDED READING TO PART I942
RECOMMENDED READING TO PART II944
RECOMMENDED READING TO PART III945
REFERENCES TO PART IV946
RECOMMENDED READING TO PART IV947
REFERENCES TO PART V948
RECOMMENDED READING TO PART V948

Book details

Vendor Wiley Global Education UK
SKU 0-470-06407-2
ISBN-13 9780470064078

Do you have questions about this book?

Ask an expert!

This is a comprehensive guide covering both the theory of basic networking technologies as well as practical solutions to networking problems.

Networking concepts explained plainly with emphasis on how networks work together
Practical solutions backed up with examples and case studies
Balance of topics reflects modern environments
Instructor and Student book site support including motivational courseware

Instant delivery by email
Your access email arrives within minutes of checkout, with a sign-in link for each book — no shipping, no waiting.

Read on any device
Books open in VitalSource Bookshelf on your phone, tablet, or computer, online or offline. Your library is always available at aafaq.vitalsource.com — just log in with the email you used at checkout.

Lost the email?
Resend it to yourself in seconds from My eBook orders, or email cs@aafaqeducation.com and we'll help.