CONTENTS
Preface = xiii
Chapter 1 Introduction = 1
1-1 Networks-A Perspective = 3
1-2 Objectives of Networks = 11
1-3 Network Components = 13
User Subnetwork = 13
Communication Subnetwork = 14
1-4 Message Transport Technologies : Circuit-Switched, Message-Switched, and Packet-Switched Networks = 16
Comparison of Network Classes = 17
Problems = 19
References = 19
Chapter 2 Transmission Links and Procedures = 21
2-1 Transmission Links = 23
Terrestrial Links = 23
Switched and Leased Connections 23
Dataphone Digital Service = 25
Satellite Links = 26
Propagation Delay = 28
The Collision Problem on Satellite Channels = 29
Pure ALOHA = 30
Time-Division Multiple Access = 32
Other Multiple-Access Protocols = 33
Radio Links = 35
Carrier-Sense Multiple-Access Method = 37
Optical Fiber = 38
2-2 Transmission Modes = 40
Simultaneous Transmissions: Half Duplex and Full Duplex = 40
Point-to-Point and Multipoint Link Control: Polling = 45
Polling and Hub Polling = 45
Poll Time Analysis = 49
2-3 Transmission Protocols = 52
Asynchronous Serial Transmission = 52
Synchronous Serial Transmission = 53
Binary Synchronous Communications = 53
Synchronous Data Link Control = 55
CCITT Recommendation X.21 = 60
X.21 Bis = 64
Summary = 64
Problems = 64
References = 65
Chapter 3 Design and Analysis of Network Nodes = 69
3-1 Node Design = 71
Source / Destination Functions = 72
End-to-End Frotocols = 73
Network Interface = 73
Segmenting and Reassembly = 74
Sequence Numbers = 75
Creation and Deletion of Headers = 79
Store-and-Forward Functions = 79
Routing = 80
Local Flow Control and Lockups = 82
Error Control = 83
Network-Wide Functions = 83
Network Flow Control = 83
Topological Awareness and Modification = 83
Network Performance Measurement and Monitoring = 84
3-2 Node Architecture and Analysis = 85
Software = 86
Interface Hardware = 87
Message Retransmission Caused by Overflow on Intermediate Buffers = 88
3-3 Node Processor = 94
Processor Capacity Estimation = 96
3-4 Node Memory = 100
Memory Size Estimation = 103
3-5 IBM 3705 Communications Controller = 108
Summary = 110
Problems = 112
References = 112
Chapter 4 Topological Design = 115
4-1 Selecting Terminal-Concentrator Locations = 119
4-2 Multipoint Connections between a Terminal Concentrator and Neighboring Terminals = 123
Minimum Spanning Tree = 124
Chandy-Russell A1gorithm = 126
Heuristic A1gorithms = 130
Esau-Williams A1gorithm = 131
Kruskal Algorithm = 133
Generalized Heuristic Algorithm = 134
4-3 Link and Link Capacity Assignment between Network Nodes = 135
Cut Saturation A1gorithm = 135
Capacity Assignment = 138
Discrete Link Capacity Assignment = 141
4-4 Disjoint Route Topology = 144
Summary = 145
Problems = 146
References = 148
Chapter 5 Network Protocols = 151
5-1 Concepts in Protocol Design = 153
Functions of Protocols = 158
5-2 Network Architectures and Protocols = 159
Protocols for ARPANET = 160
Reference Model for Open Systems Interconnection = 162
X.25 = 165
X.25 Procedures = 168
Systems Network Architecture = 171
Digital Network Architecture = 174
5-3 Protocol Description Techniques = 176
State Diagrams = 178
Petri Nets = 180
Backus Normal Form = 180
Format and Protocol Language = 182
RSPL = 182
5-4 Pretocol Validation Techniques = 183
Duologue Matrix Approach = 184
State Perturbation Approach = 186
Summary = 188
Problems = 189
References = 189
Chapter 6 Flow Control = 193
6-1 Network Congestion = 195
Flow Control = 196
6-2 Flow Control Techniques = 197
Centralized Flow Control = 197
Flow Control in TYMNET = 200
Flow Deviation Method = 201
Distributed Flow Control = 203
Ent-to-End Flow Control = 204
Window Size Selection = 205
Flow Control in SNA = 208
Isarithmic Flow Control = 211
Comparison of Flow Control Techniques = 212
6-3 Deadlocks = 213
Protocol Deadlocks = 213
Reassembly Lockup = 215
Buffer Deadlocks = 215
State Enumeration Approach = 217
Approach Using Network Flows = 222
Laveling Algorithm = 225
Deadlock-Free Buffer Allocation = 227
Summary = 229
Problems = 230
References = 231
Chapter 7 Routing = 233
7-l Introduction = 235
7-2 Deterministic Routing = 238
Shortest Path Algorithms = 238
Floyd's Algorithm = 239
Minimum Delay Algorithms = 240
7-3 Reliability in Deterministic Routing = 242
Disjoint Deterministic Routes = 242
7-4 Adaptive Routing Strategies = 246
Centralized Adaptive Routing = 246
Random Routing = 250
Adaptive Routing in ARPANET = 251
Other Adaptive Routing Schemes = 254
Hierarchical Adaptive Routing = 254
Summary = 255
Problems = 257
References = 258
Chapter 8 Performance Analysis = 261
8-1 Probability Concepts = 263
Probability Distributions = 267
8-2 Network Performance Estimates = 271
Summary = 278
Problems = 278
References = 279
Appendix A Networks and Network Services = 281
A-1 TYMNET = 283
Routing = 284
Centralized Control = 285
Flow Control = 286
A-2 DATAPAC = 286
Functional Layers = 289
A-3 TELENET = 291
A-4 Nordic Public Data Network = 291
A-5 TRAHSPAC = 292
References = 295
Index = 298
