Principles of Data Transfer Through Communications Networks, the Internet, and Autonomous Mobiles E-Book
Izhak Rubin
125,99 €
Mehr erfahren.
- Herausgeber: John Wiley & Sons
- Kategorie: Wissenschaft und neue Technologien
- Sprache: Englisch
Understand the principles and practical basis of global telecommunications and data communications networks with this essential text
Our increasingly connected world is more reliant than ever on data transport and the communication networking technologies of the moment. Ever-expanding wireless communications and the Internet of Things have brought connectivity into more areas of our lives than ever before. Virtually every workplace and industry is now reliant at some level on data transfer.
Principles of Data Transfer through Communications Networks, the Internet, and Autonomous Mobiles offers a comprehensive yet accessible overview of the principles and methods of computer communications and mobile wireless network systems. It’s designed to equip a vast range of students and professionals with the necessary toolkit to manage data flows between and across network systems at various scales. Drawing upon decades of teaching and practical experience, it’s a must-own resource for anyone looking to understand the core mechanics that power our world of mass communications.
Readers will also find:
- Coverage of cutting-edge technologies such as autonomous vehicular highways that draw upon novel communications technologies
- Detailed discussion of design and performance behavior for major communication networking technologies
- Treatment designed for readers with no prior knowledge of computer science or programming
Principles of Data Transfer through Communications Networks, the Internet, and Autonomous Mobiles is ideal for students in data communications, telecommunications and wireless networking technology courses, as well as professionals working in data communications industries or those who make use of data transfer communications networks as part of their work.
Sie lesen das E-Book in den Legimi-Apps auf:
Seitenzahl: 1873
Veröffentlichungsjahr: 2024
Ähnliche
Table of Contents
Cover
Table of Contents
Title Page
Copyright
Dedication
List of Figures
About the Author
Preface
1 Introduction: Networking in a Nutshell
1.1 Purpose
1.2 Networking Terms and Network Elements
1.3 Network Transport Processes
1.4 An Illustrative Transport Process: Sending Packages Across a Shipping Network
1.5 A Layered Communications Networking Architecture
1.6 Communications Network Architecture: User, Control, and Management Planes
1.7 Illustrative Network Systems
Problems
2 Information Sources, Communications Signals, and Multimedia Flows
2.1 End Users
2.2 Message Flows
2.3 Service Classes
2.4 Analog and Digital Signals
2.5 Frequency Spectrum and Bandwidth
2.6 Audio Streaming
2.7 Video Flows and Streams
2.8 Data Flows
Problems
3 Transmissions over Communications Channels
3.1 Communications Media
3.2 Wireline Communications Media
3.3 Wireless Communications Media
3.4 Message Transmission Over a Communications Channel
3.5 Noisy Communications Channels
3.6 Illustrative Calculation of Signal-to-Noise-plus-Interference Ratio (SINR)
3.7 Channel Capacity
3.8 Modulation/Coding Schemes (MCSs)
Problems
4 Traffic Processes
4.1 A Multilevel Traffic Model
4.2 Message Traffic Processes
4.3 Modeling a Traffic Flow as a Stochastic Point Process
4.4 Renewal Point Processes and the Poisson Process
4.5 Discrete-Time Renewal Point Processes and the Geometric Point Process
4.6 Traffic Rates and Service Demand Loads
4.7 Traffic Matrix: Who Communicates with Whom
Problems
5 Performance Metrics
5.1 Quality of Service (QoS) and Quality of Experience (QoE) Metrics
5.2 Quality of Service (QoS) Metrics for Communications Networking
5.3 Quality of Experience (QoE)
Problems
6 Multiplexing: Local Resource Sharing and Scheduling
6.1 Sharing Resources Through Multiplexing
6.2 Fixed Multiplexing Methods
6.3 Statistical Multiplexing Methods
6.4 Scheduling Algorithms and Protocols
6.5 Statistical Multiplexing Over One-to-Many Media
Problems
7 Queueing Systems
7.1 A Basic Queueing System Model
7.2 Queueing Processes and Performance Metrics
7.3 Queueing Systems: Properties
7.4 Markovian Queueing Systems
7.5 Performance Behavior of Markovian Queueing Systems
7.6 A Queueing System with General Service Times
7.7 Priority Queueing
7.8 Queueing Networks
7.9 Simulation of Communications Networks
Problems
8 Multiple Access: Sharing from Afar
8.1 Multiple Access: Sharing from Afar
8.2 Fixed Multiple Access Schemes
8.3 Demand-Assigned Multiple Access (DAMA) Schemes
8.4 Random Access: Try and Try Again
Problems
9 Switching, Relaying, and Local Networking
9.1 Switching
9.2 Extending the Coverage Span: Repeaters and Relays
9.3 Local Networking Across a Switching Fabric: Bridging of MAC Frames
Problems
10 Circuit Switching
10.1 Circuit Switching: The Method
10.2 The Circuit Switching Network System Architecture
10.3 The Switching Fabric
10.4 The Signaling System
10.5 Performance Characteristics of a Circuit Switching Network
10.6 Cross-Connect Switching and Wavelength Switched Optical Networks
Problems
11 Connection-Oriented Packet Switching
11.1 Connection-Oriented Packet Switching: The Method
11.2 The Virtual Circuit Switching and Networking Processes
11.3 Technologies That Use a Connection-Oriented Packet-Switching Method
11.4 Performance Characteristics of a Virtual Circuit Switching Network
Problems
12 Datagram Networking: Connectionless Packet Switching
12.1 Connectionless Packet Switching: The Method
12.2 Packet Flows and the Packet Router
12.3 Performance Characteristics
Problems
13 Error Control: Please Send It Again
13.1 Error Control Methods
13.2 Error Control Using Forward Error Correction (FEC)
13.3 Automatic Repeat Request (ARQ)
13.4 Hybrid ARQ (HARQ) Error Control
Problems
14 Flow and Congestion Control: Avoiding Overuse of User and Network Resources
14.1 Flow and Congestion Controls: Objectives and Configurations
14.2 Feedback-Based Closed-Loop Flow Control
14.3 Open-Loop Input-Rate Flow and Congestion Controls
14.4 Congestion Control: Relieving Bottlenecks
Problems
15 Routing: Quo Vadis?
15.1 Routing: Selecting a Preferred Path
15.2 Route Metrics
15.3 Routing Domains and Autonomous Systems
15.4 Route Selection Methods
15.5 Shortest Path Tree (SPT): Mapping the Best Path to Each Node
15.6 Distance Vector Routing: Consult Your Neighbors
15.7 Link-State Routing: Obtain the Full Domain Graph
Problems
16 The Internet
16.1 The Internet Networking Architecture
16.2 HTTP: Facilitating Client–Server Interaction Over the Internet
16.3 Internet Protocol (IP) Addresses
16.4 Internet Protocol (IP) Packets
16.5 Transport Layer Protocols
16.6 Routing Over the Internet
Problems
17 Local and Personal Area Wireless Networks
17.1 Illustrative Personal Area and Local Area Wireless Networks
17.2 WiFi: A Wireless Local Area Network (WLAN)
17.3 Personal Area Networks (PANs) for Short-Range Wireless Communications
Problems
18 Mobile Cellular Wireless Networks
18.1 Configurations of Mobile Wireless Networks
18.2 Architectural Elements of a Cellular Wireless Network
18.3 Cellular Network Communications: The Process
18.4 The 4G-LTE Protocol Architecture
18.5 Next-Generation 5G, 6G, and Millimeter-Wave Cellular Networks
Problems
19 Mobile Ad Hoc Wireless Networks
19.1 The Mobile Ad Hoc Wireless Networking Concept
19.2 Ad Hoc On-Demand Distance Vector (AODV) Routing
19.3 Dynamic Source Routing (DSR)
19.4 Optimized Link State Routing (OLSR): A Proactive Routing Algorithm
19.5 Mobile Backbone Networks (MBNs): Hierarchical Routing for Wireless Ad Hoc Networks
Problems
20 Next-Generation Networks: Enhancing Flexibility, Performance, and Scalability
20.1 Network Virtualization
20.2 Software-Defined Networking (SDN)
20.3 Network Functions Virtualization (NFV)
20.4 Network Slicing
20.5 Edge Computing, Open Interfaces, Technology Convergence, Autonomous Operations
Problems
21 Communications and Traffic Management for the Autonomous Highway
21.1 Data Communications Services for Vehicular Wireless Networks
21.2 Configurations of Vehicular Data Communication Networks
21.3 Vehicular Wireless Networking Methods
Problems
22 Networking Security
22.1 Network Security Architecture and Cybersecurity Frameworks
22.2 Message Confidentiality: Symmetric Encryption
22.3 Public Key Encryption (PKE)
22.4 Digital Signature
22.5 Secure Exchange of Cryptographic Keys
22.6 Secure Client–Server Message Transport Over the Network
Problems
References
Index
End User License Agreement
List of Tables
Preface
Table 1 Part I: Network Users, Architectures, and Protocols in a Nutshell.
Table 2 Part II: Networking Schemes, and Algorithms.
Table 3 Part III: Network Systems.
List of Illustrations
Preface
Figure 1 Coverage of Topics as Divided into Parts I–III.
Chapter 1
Figure 1.1 Illustrative Communications Network.
Figure 1.2 Message Fields and Wrapping Headers.
Figure 1.3 Vertical and Horizontal Message Communications Between Protocol L...
Figure 1.4 Services Provided by Open Systems Interconnection (OSI) Layers.
Figure 1.5 The Open Systems Interconnection (OSI) Layered Reference Model.
Figure 1.6 The TCP/IP Internet Model.
Figure 1.7 Vehicles on a Highway.
Figure 1.8 Three Level Hierarchical Network.
Figure 1.9 Hierarchical Organization of Conducting Links in a Leaf.
Figure 1.10 Multilane Highway.
Figure 1.11 Inter-regional Road System in California (Truncated).
Figure 1.12 Union Pacific Railroad System.
Figure 1.13 Enterprise Computer Communications Network.
Figure 1.14 ARPANET 1980 Network Layout.
Figure 1.15 A Cellular Network.
Figure 1.16 LTE Cellular Network Radio Access System Architecture.
Figure 1.17 Wi-Fi-Aided Network.
Figure 1.18 Satellite Communications.
Figure 1.19 Vehicular Network.
Figure 1.20 IoT Architecture.
Chapter 2
Figure 2.1 Realtime and Store-and-Forward Message Flows. (a) Realtime Transm...
Figure 2.2 Analog Signal.
Figure 2.3 Digital Signal.
Figure 2.4 Digitized Signal.
Figure 2.5 Sine Signals: (a) a Sine Signal; (b) A Two-Tone Composite Signal;...
Figure 2.6 Signal Representation via Fourier Series.
Figure 2.7 (a) A Rectangular Pulse of Width ; (b) Spectrum of a Rectangular...
Figure 2.8 Build-up and Replay of a Data Stream.
Figure 2.9 A Bursty Flow Alternating Between Spurt (Active) and Pause (Inact...
Figure 2.10 The Voice over IP (VoIP) Streaming Process.
Figure 2.11 (a) RTP Header; (b) Voice over IP (VoIP) Packet.
Figure 2.12 Illustrative Packet Replay Scenario.
Figure 2.13 Illustrative Array of Image Pixels.
Chapter 3
Figure 3.1 Message Transport across a Digital Communications System.
Figure 3.2 Signal Perturbed by Noise.
Figure 3.3 Analog Signal Modulation Techniques.
Figure 3.4 Illustrative Spectral Spans of Modulated Signals.
Figure 3.5 Illustrative Digital Signal Modulations.
Figure 3.6 Modulation/Coding Schemes Used by IEEE 802.11n Wi-Fi.
Figure 3.7 CQI, MCS, and Spectral Efficiency for LTE.
Chapter 4
Figure 4.1 Traffic of Vehicles Moving Along a Highway.
Figure 4.2 Multilevel Traffic Model.
Figure 4.3 Realizations of (a) Continuous-Time and (b) Discrete-Time Arrival...
Figure 4.4 A Realization of a Counting Process Associated with the Displayed...
Figure 4.5 Flows Across a Network Graph.
Chapter 5
Figure 5.1 Offered, Carried, and Throughput Traffic (Load) Rates.
Figure 5.2 Output Flow Rate vs. Input Flow Rate.
Figure 5.3 Average Message Delay vs. Normalized Throughput.
Figure 5.4 QoS Class Identifier (QCI)-Based Measures as Specified by 3GPP St...
Figure 5.5 QoE Factors.
Figure 5.6 Illustrative Message Delay Requirements for Applications That Are...
Figure 5.7 Minimum Transport Layer QoE Performance Requirements for IP-HDTV....
Chapter 6
Figure 6.1 Vehicle Merging Demonstrating on Ramp Multiplexing.
Figure 6.2 Input and Output Service Modules in a Packet Router.
Figure 6.3 Multiplexer—DeMultiplexer System Arrangement.
Figure 6.4 Sharing a Downlink Wireless Communications Channel on a TDM Basis...
Figure 6.5 (a) Joint Time–Frequency Plane, (b) TDM Schemes, and (c) FDM Sche...
Figure 6.6 A TDM Circuit Consisting of a Single Time Slot per Frame in Frequ...
Figure 6.7 Resource Allocation and Scheduling at a Multiplexing Node.
Figure 6.8 Scheduling Parameters.
Chapter 7
Figure 7.1 A Basic Queueing System Model.
Figure 7.2 Realization of a System Size Process.
Figure 7.3 Equality of Areas Used to Derive Little’s Formula.
Figure 7.4 The Single Server Queueing System.
Figure 7.5 Mean System Size vs. Traffic Intensity for the Queueing System....
Figure 7.6 Statistical Multiplexing Gain: (a) Each Flow Assigned a Dedicated...
Figure 7.7 Blocking Probability vs. Message Capacity for the System.
Figure 7.8 The Multi-server Queueing System.
Figure 7.9 A Service System That Contains No Queueing facility.
Figure 7.10 A Jackson-Type Queueing Network.
Figure 7.11 Illustrative Queueing Network.
Figure 7.12 Illustrative Tandem Queueing Network
Figure 7.13 Illustrative Discrete Event Simulation of a Queueing System: Pro...
Figure 7.14 Global Parameters of the Simulation Program.
Figure 7.15 Initialization of the Simulation Program.
Figure 7.16 The Main Program Routine.
Figure 7.17 The Simulation’s Timing( ) Routine.
Figure 7.18 Simulation Performance Updating.
Figure 7.19 The Simulation’s Arrive( ) Routine.
Figure 7.20 The Simulation’s Departure( ) Routine.
Figure 7.21 The Simulation’s Report( ) Routine.
Chapter 8
Figure 8.1 A Multiple Access Network.
Figure 8.2 An Illustrative Time Division Multiple Access (TDMA) Network Wher...
Figure 8.3 An Illustrative Frequency Division Multiple Access (FDMA) Network...
Figure 8.4 A 3-Color Cellular Space Division Multiple Access Network.
Figure 8.5 Directional Communications: (a) Peer-to-Peer Directional Communic...
Figure 8.6 Illustrative Baseband (Non-spread) Spectrum and Spread Signal Spe...
Figure 8.7 Illustrative Message and Chip Symbols in a CDMA System.
Figure 8.8 Uplink and Downlink Signaling and Traffic Channels in a DAMA Syst...
Figure 8.9 (a) Hub Polling in a Ring Network; (b) Hub Polling in a Multi-dro...
Figure 8.10 (a) Token-Passing Ring with Early Token Release; (b) Dual Counte...
Figure 8.11 (a) Wireless Net Whose Subscriber Stations Communicate with Thei...
Figure 8.12 Illustrative Packet Transmission Dynamics Across (a) an Unslotte...
Figure 8.13 Throughput () vs. Channel Load () Performance Curves Under Slo...
Figure 8.14 Throughput (S) Performance Dynamics Under the Slotted ALOHA Sche...
Figure 8.15 Average Number of Packet Transmissions vs. Throughput (S) Under ...
Figure 8.16 Average Packet Delay (D [slots]) vs. Throughput (S) Under the Sl...
Figure 8.17 Performance Behavior of a CSMA Scheme: (a) Throughput Performanc...
Figure 8.18 Ethernet Local Area Network (LAN) Single Broadcast Domain Segmen...
Figure 8.19 Switched Ethernet Local Area Network (LAN).
Figure 8.20 A Station Hears Two AP’s and Associates with a Selected One.
Figure 8.21 Illustrative Frame Transmission Process Under the Contention-Bas...
Figure 8.22 Alternating Point Coordination Function (PCF) Contention Free (C...
Figure 8.23 Illustrative Hidden Terminal Scenario and the RTS/CTS Dialog: St...
Figure 8.24 Illustrative RTS/CTS and Data/ACK Transmission Dialog in a Wi-Fi...
Figure 8.25 Default Access Parameters Under 802.11e per Access Class(AC): Ba...
Figure 8.26 LANs in Close Proximity.
Chapter 9
Figure 9.1 Switching Highways at an Intersection.
Figure 9.2 A Fully Connected Network Requiring the Use of No Switches.
Figure 9.3 An Illustrative Switch Module.
Figure 9.4 An Illustrative Switching Network.
Figure 9.5 A Radio Relay Node Placed on a Hill to Enable Communications.
Figure 9.6 Dissemination of Data Messages by Relay Nodes Across a Vehicle Hi...
Figure 9.7 Format of Ethernet II Frame (a) Without a VLAN Tag and (b) With a...
Figure 9.8 Bridges B1 and B2 Are Used for Internetting Frames Between LAN1, ...
Figure 9.9 (a) Topological Layout of a Network of LANs Interconnected by Bri...
Figure 9.10 (a) A Network of Interconnected Layer-2 Switches; (b) A Spanning...
Figure 9.11 A Multicast Flow in a SPB Network Using VSN I-SID Involving Grou...
Figure 9.12 Illustrative Layout of a Shortest Path Bridging (SPB) Network.
Figure 9.13 Illustrative Shortest Path Trees in a SPB Network: (a) Network L...
Figure 9.14 Forwarding Table/Forwarding Data Base (FDB) at Node 4 Based on M...
Chapter 10
Figure 10.1 Architectural Depiction of a Circuit-Switched Network System.
Figure 10.2 Illustrative Circuit Capacity Allocation in a Circuit Switched N...
Figure 10.3 Illustrative Circuit-Switching Table.
Figure 10.4 Time–Space–Time (TST) Circuit-Switching Module.
Figure 10.5 A Network System Using Cross-Connect Modules.
Figure 10.6 All-Optical Cross-Connect Networks Using WDM Lines: (a) Ring Net...
Figure 10.7 A Highway Transportation Path Analogous to an All-Optical Cross-...
Chapter 11
Figure 11.1 Message Flows in an Illustrative Connection-Oriented Packet-Swit...
Figure 11.2 An Illustrative VCS Switching Table at Node N3.
Figure 11.3 Formats of Asynchronous Transfer Mode (ATM) Cells: (a) Across th...
Figure 11.4 Functional Modules in a VCS-Switching Node.
Chapter 12
Figure 12.1 Packet Flows in a Datagram Packet-Switching Network.
Figure 12.2 Functional Modules of a Packet Router.
Figure 12.3 Network Layer Pipelining in a Store-and-Forward Communication Ne...
Chapter 13
Figure 13.1 Encoding and Decoding Error Control Blocks Transported Across a ...
Figure 13.2 Information and Code Fields in a Systematic Error Control Block ...
Figure 13.3 Communications in a Classroom.
Figure 13.4 Illustrative Exchange of Error-Control Blocks and ACK Messages B...
Figure 13.5 Message and ACK Flows Across a Half-Duplex Channel Connection Un...
Figure 13.6 Block and ACK Flows Under a Go-Back-N ARQ Scheme: (a) Timeout Tr...
Figure 13.7 Block and ACK Flows Under a Selective-Repeat ARQ Scheme: (a) Tim...
Figure 13.8 ARQ Configuration Consisting of Eight Parallel Stop-and-Wait ARQ...
Chapter 14
Figure 14.1 Flow and Congestion Control Methods: (a) Closed-Loop Feedback Ba...
Figure 14.2 Regulated Access.
Figure 14.3 Traffic Shaping Using a Token Bucket Algorithm.
Figure 14.4 Impact of Traffic Shaping by Using a Token Bucket Algorithm. (a)...
Figure 14.5 Illustration of a Leaky Bucket Algorithm.
Figure 14.6 TCP Congestion Control.
Chapter 15
Figure 15.1 Network Layout and Routes.
Figure 15.2 Driving Map to Las Vegas.
Figure 15.3 Routing Across Multiple Domains: Intra-domain Routing Schemes Em...
Figure 15.4 Shortest Paths for an Illustrative Network Using Distance Vector...
Figure 15.5 Distance Vector Routing.
Figure 15.6 A Tandem Path That Connects Routers A, B, and C.
Figure 15.7 Calculation of the Shortest Path Tree (SPT) by Using a Link Stat...
Figure 15.8 Dijkstra’s Algorithm for Calculating the Shortest Path Tree (SPT...
Chapter 16
Figure 16.1 The Internet’s Protocol Architecture and Commonly Employed Proto...
Figure 16.2 Illustrative Configuration of an IP Internetwork System.
Figure 16.3 Hierarchical Organization of Internet Service and Backbone Netwo...
Figure 16.4 Illustrative Internet Access and Backbone Networks.
Figure 16.5 Application, Transport and Network Layer Protocol Services for H...
Figure 16.6 Illustrative Internet Protocol Version 4 (IPv4) Address Represen...
Figure 16.7 IPv4 Public and Private Address Ranges.
Figure 16.8 Illustrative Source Network Address Translation (S-NAT) Under IP...
Figure 16.9 IP Network Configuration and Illustrative IPv4 Addresses.
Figure 16.10 Home Network Configuration Showing DNS and Web Servers.
Figure 16.11 IP Version 6 (IPv6) Address Fields.
Figure 16.12 IP Version 4 (IPv4) Address Fields.
Figure 16.13 IP Version 6 (IPv6) Packet’s Fixed Header Fields.
Figure 16.14 IP Version 6 (IPv6) Packet’s Hop-by-Hop Options Extension Heade...
Figure 16.15 IP Version 6 (IPv6) Packet’s Routing Extension Header.
Figure 16.16 A Transmission Control Protocol (TCP) Message.
Figure 16.17 User Datagram Protocol (UDP) Datagram Header.
Figure 16.18 Handshake Transactions under TCP and QUIC: (a) TCP and TLS; (b)...
Figure 16.19 OSPF Routing Areas and Router Types.
Figure 16.20 A Multi-AS Network Layout.
Figure 16.21 Contents of a BGP Update Message.
Figure 16.22 Route Update at a BGP Border Router.
Chapter 17
Figure 17.1 Comparison of Power Consumption and Complexity vs. Data Rate for...
Figure 17.2 Illustrative Network Configuration Involving a Wireless Personal...
Figure 17.3 Format of a WiFi MAC Frame.
Figure 17.4 Attributes of WiFi Versions.
Figure 17.5 Bluetooth Net Configurations: (a) A Piconet Consisting of a Mast...
Figure 17.6 Bluetooth-Layered Protocol Stacks: (a) Bluetooth BR/EDR Classic;...
Figure 17.7 Zigbee Net Layouts: (a) Star Topology. (b) Tree Topology. (c) Me...
Figure 17.8 Protocol Layer Stack for a Zigbee System.
Chapter 18
Figure 18.1 An Infrastructure-Based Wireless Network.
Figure 18.2 An Ad Hoc Wireless Network Employing Multi-hop Peer-to-Peer Comm...
Figure 18.3 A Hybrid Infrastructure of a Wireless Network.
Figure 18.4 Spatial Reuse in a Cellular Network.
Figure 18.5 High-Level LTE Network Architecture.
Figure 18.6 The LTE Radio Access Network Architecture.
Figure 18.7 The LTE Evolved Packet Core (EPC).
Figure 18.8 The LTE Protocol Architecture: (a) The User Plane; and (b) The C...
Figure 18.9 LTE Bearers.
Figure 18.10 The LTE Protocol Stack.
Figure 18.11 A Data Flow Across Radio Access Network (RAN) Layers.
Figure 18.12 A Resource Block.
Chapter 19
Figure 19.1 Illustrative AODV Protocol Messaging: (a) Topological Layout of ...
Figure 19.2 Illustrative DSR Protocol Packet Flows and Nodal Route Caches.
Figure 19.3 Illustrative Selection of Multi-Port Routers (MPRs) Under Optimi...
Figure 19.4 Illustrative Network Layout of a Mobile Backbone Network (MBN) U...
Figure 19.5 Instances of Mobile Backbone Network (MBN) Layouts.
Figure 19.6 Two Instances of Unmanned Ground Vehicle (UGV) Aided Mobile Back...
Figure 19.7 Unmanned Aerial Vehicle (UAV) Aided Mobile Backbone Network (UAV...
Figure 19.8 Comparative Performance Behavior of the MBNR, MBNR-FC and AODV a...
Figure 19.9 Connectivity Graphs for Multi-Radio MBN System: (a) when employi...
Chapter 20
Figure 20.1 High-Level SDN Architecture.
Figure 20.2 High-Level NFV Framework.
Figure 20.3 NFV-Based Network Service Represented as an NF Graph.
Chapter 21
Figure 21.1 Safety-Oriented Key Services and Message Types for Vehicular-Net...
Figure 21.2 Non-safety-Oriented Key Services and Message Types for Vehicular...
Figure 21.3 V2X Performance Requirements for Wireless Communications Systems...
Figure 21.4 Vehicular Networking Configurations: (a) Vehicular Ad Hoc Networ...
Figure 21.5 US Wireless Access in Vehicular Environments (WAVE) Protocol Sta...
Figure 21.6 Vehicular Configurations and Relay Selections: (a) a Platoon of ...
Figure 21.7 GeoNetworking (GN) Protocol Layers.
Figure 21.8 Structure of a GeoNetworking (GN) Packet.
Figure 21.9 Cross-Layer Distributed Congestion Control (DCC).
Figure 21.10 Architecture of a Vehicular Backbone Network (VBN).
Figure 21.11 A Vehicular Backbone Network (VBN) Configuration in Support of ...
Figure 21.12 Performance Behavior of a Backbone Network Synthesized for a Ve...
Figure 21.13 A VBN-Based V2V Network That Is Aided by the Use of an Infrastr...
Figure 21.14 Infrastructure-Aided Vehicular Network Using Platoon Formations...
Figure 21.15 Cellular V2X Configurations: (a) Uplink, Downlink, and Sidelink...
Figure 21.16 Vehicular Network System That Employs V2V, V2I and C-V2X Commun...
Figure 21.17 Flow of Vehicle Platoons Across a Highway Link.
Figure 21.18 Platoon-Oriented Parameters.
Figure 21.19 Illustrative Performance Curves for Vehicular Platoon Traffic M...
Figure 21.20 Illustrative Performance Curves for Vehicular Platoon Traffic M...
Figure 21.21 A Link Span of a Highway.
Figure 21.22 Delay Constrained Performance of Platoon Flows Along a Lane: (a...
Figure 21.23 Single-Link Multiple Lane Configuration.
Figure 21.24 Illustrative Transportation Network.
Chapter 22
Figure 22.1 National Institute of Standards and Technology (NIST) Cybersecur...
Figure 22.2 Symmetric Key Encryption.
Figure 22.3 An Illustrative Message Transfer Under Public Key Cryptography....
Figure 22.4 A Digital Signature Scheme Employing Public Key Cryptography.
Figure 22.5 The Diffie–Hellman (DH) Secure Key Exchange Algorithm.
Guide
Cover
Table of Contents
Title Page
Copyright
Dedication
List of Figures
About the Author
Preface
Begin Reading
References
Index
End User License Agreement
Pages
ii
iii
iv
v
xv
xvi
xvii
xviii
xix
xx
xxi
xxii
xxiii
xxiv
xxv
xxvi
xxvii
xxviii
xxix
xxx
xxxi
xxxii
xxxiii
xxxiv
xxxv
xxxvi
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
689
690
691
692
693
694
IEEE Press445 Hoes LanePiscataway, NJ 08854
IEEE Press Editorial BoardSarah Spurgeon, Editor-in-Chief
Moeness Amin
Jón Atli Benediktsson
Adam Drobot
James Duncan
Ekram Hossain
Brian Johnson
Hai Li
James Lyke
Joydeep Mitra
Desineni Subbaram Naidu
Tony Q. S. Quek
Behzad Razavi
Thomas Robertazzi
Diomidis Spinellis
Principles of Data Transfer Through Communications Networks, the Internet, and Autonomous Mobiles
Izhak Rubin
Distinguished Professor Emeritus
Electrical and Computer Engineering Department
University of California, Los Angeles (UCLA)
Los Angeles,
CA, USA
Copyright © 2025 by The Institute of Electrical and Electronics Engineers, Inc. All rights reserved.
Published by John Wiley & Sons, Inc., Hoboken, New Jersey.Published simultaneously in Canada.
No part of this publication may be reproduced, stored in a retrieval system, or transmitted in any form or by any means, electronic, mechanical, photocopying, recording, scanning, or otherwise, except as permitted under Section 107 or 108 of the 1976 United States Copyright Act, without either the prior written permission of the Publisher, or authorization through payment of the appropriate per-copy fee to the Copyright Clearance Center, Inc., 222 Rosewood Drive, Danvers, MA 01923, (978) 750-8400, fax (978) 750-4470, or on the web at www.copyright.com. Requests to the Publisher for permission should be addressed to the Permissions Department, John Wiley & Sons, Inc., 111 River Street, Hoboken, NJ 07030, (201) 748-6011, fax (201) 748-6008, or online at http://www.wiley.com/go/permission.
Trademarks: Wiley and the Wiley logo are trademarks or registered trademarks of John Wiley & Sons, Inc. and/or its affiliates in the United States and other countries and may not be used without written permission. All other trademarks are the property of their respective owners. John Wiley & Sons, Inc. is not associated with any product or vendor mentioned in this book.
Limit of Liability/Disclaimer of Warranty: While the publisher and author have used their best efforts in preparing this book, they make no representations or warranties with respect to the accuracy or completeness of the contents of this book and specifically disclaim any implied warranties of merchantability or fitness for a particular purpose. No warranty may be created or extended by sales representatives or written sales materials. The advice and strategies contained herein may not be suitable for your situation. You should consult with a professional where appropriate. Neither the publisher nor author shall be liable for any loss of profit or any other commercial damages, including but not limited to special, incidental, consequential, or other damages. Further, readers should be aware that websites listed in this work may have changed or disappeared between when this work was written and when it is read. Neither the publisher nor authors shall be liable for any loss of profit or any other commercial damages, including but not limited to special, incidental, consequential, or other damages.
For general information on our other products and services or for technical support, please contact our Customer Care Department within the United States at (800) 762-2974, outside the United States at (317) 572-3993 or fax (317) 572-4002.
Wiley also publishes its books in a variety of electronic formats. Some content that appears in print may not be available in electronic formats. For more information about Wiley products, visit our web site at www.wiley.com.
Library of Congress Cataloging-in-Publication Data applied for:
Hardback: 9781394267750
Cover Design: WileyCover Image: © chombosan/Alamy Stock Photo
To Nira
to our Children:Orly, Amir and Michael
and to our Grandchildren:Sophie, Tess, Chloe, Naomi, Ben, Jonathan, Samantha and Jacob
List of Figures
Figure 1 Coverage of Topics as Divided into Parts I–III.
Figure 1.1 Illustrative Communications Network
Figure 1.2 Message Fields and Wrapping Headers
Figure 1.3 Vertical and Horizontal Message Communications Between Protocol Layer Entities at Layer-( + 1) and Layer-
Figure 1.4 Services Provided by Open Systems Interconnection (OSI) Layers
Figure 1.5 The Open Systems Interconnection (OSI) Layered Reference Model
Figure 1.6 The TCP/IP Internet Model
Figure 1.7 Vehicles on a Highway
Figure 1.8 Three Level Hierarchical Network
Figure 1.9 Hierarchical Organization of Conducting Links in a Leaf
Figure 1.10 Multilane Highway
Figure 1.11 Inter-regional Road System in California (Truncated)
Figure 1.12 Union Pacific Railroad System
Figure 1.13 Enterprise Computer Communications Network
Figure 1.14 ARPANET 1980 Network Layout
Figure 1.15 A Cellular Network
Figure 1.16 LTE Cellular Network Radio Access System Architecture
Figure 1.17 Wi-Fi-Aided Network
Figure 1.18 Satellite Communications
Figure 1.19 Vehicular Network
Figure 1.20 IoT Architecture
Figure 2.1 Realtime and Store-and-Forward Message Flows. (a) Realtime Transmission of a Stream (b) Store & Forward Message Stream
Figure 2.2 Analog Signal
Figure 2.3 Digital Signal
Figure 2.4 Digitized Signal
Figure 2.5 Sine Signals: (a) a Sine Signal; (b) A Two-Tone Composite Signal; The spectrum of the Two-Tone Signal
Figure 2.6 Signal Representation via Fourier Series
Figure 2.7 (a) A Rectangular Pulse of Width ; (b) Spectrum of a Rectangular Pulse with Width
Figure 2.8 Build-up and Replay of a Data Stream
Figure 2.9 A Bursty Flow Alternating Between Spurt (Active) and Pause (Inactive) Periods
Figure 2.10 The Voice over IP (VoIP) Streaming Process
Figure 2.11 (a) RTP Header; (b) Voice over IP (VoIP) Packet
Figure 2.12 Illustrative Packet Replay Scenario
Figure 2.13 Illustrative Array of Image Pixels
Figure 3.1 Message Transport across a Digital Communications System
Figure 3.2 Signal Perturbed by Noise
Figure 3.3 Analog Signal Modulation Techniques
Figure 3.4 Illustrative Spectral Spans of Modulated Signals
Figure 3.5 Illustrative Digital Signal Modulations
Figure 3.6 Modulation/Coding Schemes Used by IEEE 802.11n Wi-Fi
Figure 3.7 CQI, MCS, and Spectral Efficiency for LTE
Figure 4.1 Traffic of Vehicles Moving Along a Highway
Figure 4.2 Multilevel Traffic Model
Figure 4.3 Realizations of (a) Continuous-Time and (b) Discrete-Time Arrival Point Processes
Figure 4.4 A Realization of a Counting Process Associated with the Displayed Point Process
Figure 4.5 Flows Across a Network Graph
Figure 5.1 Offered, Carried, and Throughput Traffic (Load) Rates
Figure 5.2 Output Flow Rate vs. Input Flow Rate
Figure 5.3 Average Message Delay vs. Normalized Throughput
Figure 5.4 QoS Class Identifier (QCI)-Based Measures as Specified by 3GPP Standard TS23.203/with Permission of 3GPP
Figure 5.5 QoE Factors
Figure 5.6 Illustrative Message Delay Requirements for Applications That Are: (a) Error Sensitive and (b) Error Tolerant
Figure 5.7 Minimum Transport Layer QoE Performance Requirements for IP-HDTV
Figure 6.1 Vehicle Merging Demonstrating on Ramp Multiplexing
Figure 6.2 Input and Output Service Modules in a Packet Router
Figure 6.3 Multiplexer—DeMultiplexer System Arrangement
Figure 6.4 Sharing a Downlink Wireless Communications Channel on a TDM Basis
Figure 6.5 (a) Joint Time–Frequency Plane, (b) TDM Schemes, and (c) FDM Scheme
Figure 6.6 A TDM Circuit Consisting of a Single Time Slot per Frame in Frequency Band F1
Figure 6.7 Resource Allocation and Scheduling at a Multiplexing Node
Figure 6.8 Scheduling Parameters
Figure 7.1 A Basic Queueing System Model
Figure 7.2 Realization of a System Size Process
Figure 7.3 Equality of Areas Used to Derive Little’s Formula
Figure 7.4 The Single Server Queueing System
Figure 7.5 Mean System Size vs. Traffic Intensity for the Queueing System
Figure 7.6 Statistical Multiplexing Gain: (a) Each Flow Assigned a Dedicated Channel; (b) Statistical Multiplexing of all Flows Across a Shared Channel
Figure 7.7 Blocking Probability vs. Message Capacity for the System
Figure 7.8 The Multi-server Queueing System
Figure 7.9 A Service System That Contains No Queueing facility
Figure 7.10 A Jackson-Type Queueing Network
Figure 7.11 Illustrative Queueing Network
Figure 7.12 Illustrative Tandem Queueing Network
Figure 7.13 Illustrative Discrete Event Simulation of a Queueing System: Program Routines
Figure 7.14 Global Parameters of the Simulation Program
Figure 7.15 Initialization of the Simulation Program
Figure 7.16 The Main Program Routine
Figure 7.17 The Simulation’s Timing( ) Routine
Figure 7.18 Simulation Performance Updating
Figure 7.19 The Simulation’s Arrive( ) Routine
Figure 7.20 The Simulation’s Departure( ) Routine
Figure 7.21 The Simulation’s Report( ) Routine
Figure 8.1 A Multiple Access Network
Figure 8.2 An Illustrative Time Division Multiple Access (TDMA) Network Whereby a Medium is Time-Shared by Two Stations
Figure 8.3 An Illustrative Frequency Division Multiple Access (FDMA) Network Whereby Each Station Is Dedicated a Frequency Band
Figure 8.4 A 3-Color Cellular Space Division Multiple Access Network
Figure 8.5 Directional Communications: (a) Peer-to-Peer Directional Communications; (b) Simultaneous Uplink Communications in Four Quadrants of a Cell
Figure 8.6 Illustrative Baseband (Non-spread) Spectrum and Spread Signal Spectrum in a CDMA System
Figure 8.7 Illustrative Message and Chip Symbols in a CDMA System
Figure 8.8 Uplink and Downlink Signaling and Traffic Channels in a DAMA System
Figure 8.9 (a) Hub Polling in a Ring Network; (b) Hub Polling in a Multi-dropped Tree Network
Figure 8.10 (a) Token-Passing Ring with Early Token Release; (b) Dual Counter Rotations Ring Network Layout (as for FDDI)
Figure 8.11 (a) Wireless Net Whose Subscriber Stations Communicate with Their Managing Access Point (AP) Station. (b) Wireless Net with Peer-to-Peer Communicating Stations
Figure 8.12 Illustrative Packet Transmission Dynamics Across (a) an Unslotted ALOHA Channel; (b) a Slotted ALOHA Channel
Figure 8.13 Throughput () vs. Channel Load () Performance Curves Under Slotted and Unslotted ALOHA Schemes
Figure 8.14 Throughput (S) Performance Dynamics Under the Slotted ALOHA Scheme: (a) Without the Use of Flow Admission Control; (b) When Flow Admission Control Is Applied
Figure 8.15 Average Number of Packet Transmissions vs. Throughput (S) Under the Slotted ALOHA Scheme
Figure 8.16 Average Packet Delay (D [slots]) vs. Throughput (S) Under the Slotted ALOHA Scheme: (a) Under Unrestricted Load; (b) Under Flow Control
Figure 8.17 Performance Behavior of a CSMA Scheme: (a) Throughput Performance Under Acquisition Factor = 0.2 (b) Throughput as Function of the Acquisition Factor (a): Throughput Capacity (Series 1) and Throughput Under = 1.3 (Series 2)
Figure 8.18 Ethernet Local Area Network (LAN) Single Broadcast Domain Segment Configurations: (a) Broadcast Bus Segment; (b) Repeater Hub Base Segment
Figure 8.19 Switched Ethernet Local Area Network (LAN)
Figure 8.20 A Station Hears Two AP’s and Associates with a Selected One
Figure 8.21 Illustrative Frame Transmission Process Under the Contention-Based Access Mode of the CSMA/CA DCF and EDCA Protocols
Figure 8.22 Alternating Point Coordination Function (PCF) Contention Free (CFP) and DCF Contention-Based Periods
Figure 8.23 Illustrative Hidden Terminal Scenario and the RTS/CTS Dialog: Stations A and B Do Not Hear Each Other but Each Can Hear the AP
Figure 8.24 Illustrative RTS/CTS and Data/ACK Transmission Dialog in a Wi-Fi WLAN
Figure 8.25 Default Access Parameters Under 802.11e per Access Class(AC): Backoff Window Ranges and Illustrative Access Parameter Settings
Figure 8.26 LANs in Close Proximity
Figure 9.1 Switching Highways at an Intersection
Figure 9.2 A Fully Connected Network Requiring the Use of No Switches
Figure 9.3 An Illustrative Switch Module
Figure 9.4 An Illustrative Switching Network
Figure 9.5 A Radio Relay Node Placed on a Hill to Enable Communications
Figure 9.6 Dissemination of Data Messages by Relay Nodes Across a Vehicle Highway
Figure 9.7 Format of Ethernet II Frame (a) Without a VLAN Tag and (b) With a VLAN Tag
Figure 9.8 Bridges B1 and B2 Are Used for Internetting Frames Between LAN1, LAN2, and LAN3
Figure 9.9 (a) Topological Layout of a Network of LANs Interconnected by Bridges; (b) an Embedded Spanning Tree Layout
Figure 9.10 (a) A Network of Interconnected Layer-2 Switches; (b) A Spanning Tree for the Network in (a); (c) A Shortest Path Tree (SPT) Rooted at Switch 8 Which May Be Employed by a Shortest Path Bridging (SPB) Protocol such as IEEE 802.1aq
Figure 9.11 A Multicast Flow in a SPB Network Using VSN I-SID Involving Group Members S1, S2, S3, S4
Figure 9.12 Illustrative Layout of a Shortest Path Bridging (SPB) Network
Figure 9.13 Illustrative Shortest Path Trees in a SPB Network: (a) Network Layout, (b) SPT1/B-VID=0300 Rooted at Node 1, (c) SPT2/B-VID=0100 Rooted at Node 1, (d) SPT1/B-VID-0300 Rooted at Node 2, (e) SPT1/B-VID-0300 Rooted at Node 3, and (f) SPT2/B-VID-0100 Rooted at Node 4
Figure 9.14 Forwarding Table/Forwarding Data Base (FDB) at Node 4 Based on Multicast Shortest Path Tree (MSPT) Rooted at Node 4 at Tier B-VID=0100
Figure 10.1 Architectural Depiction of a Circuit-Switched Network System
Figure 10.2 Illustrative Circuit Capacity Allocation in a Circuit Switched Network: (a) For a Circuit Connecting Edge Switches N1 and N5 Through Tandem Switch N3; (b) For a Circuit Connecting Edge Switches N1 and N4 Through Tandem Switch N3
Figure 10.3 Illustrative Circuit-Switching Table
Figure 10.4 Time–Space–Time (TST) Circuit-Switching Module
Figure 10.5 A Network System Using Cross-Connect Modules
Figure 10.6 All-Optical Cross-Connect Networks Using WDM Lines: (a) Ring Network Using Optical ADM (OADM) Nodes; (b) Optical Mesh Network Using Optical Cross-Connect (OXC) Nodes
Figure 10.7 A Highway Transportation Path Analogous to an All-Optical Cross-Connect WDM-Based Lightpath
Figure 11.1 Message Flows in an Illustrative Connection-Oriented Packet-Switching Network
Figure 11.2 An Illustrative VCS Switching Table at Node N3
Figure 11.3 Formats of Asynchronous Transfer Mode (ATM) Cells: (a) Across the UNI; (b) Across the NNI
Figure 11.4 Functional Modules in a VCS-Switching Node
Figure 12.1 Packet Flows in a Datagram Packet-Switching Network
Figure 12.2 Functional Modules of a Packet Router
Figure 12.3 Network Layer Pipelining in a Store-and-Forward Communication Network: (a) Message Switching Transport; (b) Packet Switching Transport Illustrating the Impact of Packet Pipelining Across the Network Layer
Figure 13.1 Encoding and Decoding Error Control Blocks Transported Across a Communications Channel
Figure 13.2 Information and Code Fields in a Systematic Error Control Block for: (a) Forward Error Control (FEC) Block; (b) ARQ Error Control Block
Figure 13.3 Communications in a Classroom
Figure 13.4 Illustrative Exchange of Error-Control Blocks and ACK Messages Between Two Stations Under Stop-and-Wait ARQ Scheme
Figure 13.5 Message and ACK Flows Across a Half-Duplex Channel Connection Under a Stop-and-Wait ARQ Scheme
Figure 13.6 Block and ACK Flows Under a Go-Back-N ARQ Scheme: (a) Timeout Triggered Retransmission of Block F2; (b) Time Delay Incurred in the Transport of Block 1 That Is Retransmitted Three Times
Figure 13.7 Block and ACK Flows Under a Selective-Repeat ARQ Scheme: (a) Timeout Triggered Selective Retransmission of Block F2; (b) channel Occupancy and Time Delay in the Transport of Block M1 That Is Retransmitted Two Times
Figure 13.8 ARQ Configuration Consisting of Eight Parallel Stop-and-Wait ARQ HARQ Processes
Figure 14.1 Flow and Congestion Control Methods: (a) Closed-Loop Feedback Based; (b) Open-Loop Input Rate Control
Figure 14.2 Regulated Access
Figure 14.3 Traffic Shaping Using a Token Bucket Algorithm
Figure 14.4 Impact of Traffic Shaping by Using a Token Bucket Algorithm. (a) Steady Flow, (b) Bursty Flow, and (c) Quasi-bursty Flow
Figure 14.5 Illustration of a Leaky Bucket Algorithm
Figure 14.6 TCP Congestion Control
Figure 15.1 Network Layout and Routes
Figure 15.2 Driving Map to Las Vegas
Figure 15.3 Routing Across Multiple Domains: Intra-domain Routing Schemes Employ Protocols such as RIP, OSPF, EIGRP. Inter-domain Routing schemes Employ Exterior Gateway Protocols (EGPs) such as BGP. Boundary Routers (BRs) Are Used to Interconnect Domains
Figure 15.4 Shortest Paths for an Illustrative Network Using Distance Vector Routing Algorithm: (a) The Weighted Network Graph Showing the Link Cost Values; (b) Routing Table Showing Shortest Paths That Are No Longer Than 1 Hop per Path; (c) Routing Table Showing Shortest Paths That Are No Longer Than 2 Hops per Path; (d) Routing Table Showing Shortest Paths That Are No Longer Than 3 Hops per Path; (e) Shortest Path Tree (SPT) Rooted at Router A; (e) SPT Rooted at Router E
Figure 15.5 Distance Vector Routing
Figure 15.6 A Tandem Path That Connects Routers A, B, and C
Figure 15.7 Calculation of the Shortest Path Tree (SPT) by Using a Link State Routing Algorithm: (a) The Weighted Graph Representing the Network’s Domain Layout; (b) Step-by-Step Calculation Performed at Source Node A by Using Dijkstra’s Algorithm; (c) The Resulting SPT Rooted at Router A
Figure 15.8 Dijkstra’s Algorithm for Calculating the Shortest Path Tree (SPT)
Figure 16.1 The Internet’s Protocol Architecture and Commonly Employed Protocols
Figure 16.2 Illustrative Configuration of an IP Internetwork System
Figure 16.3 Hierarchical Organization of Internet Service and Backbone Networking Providers
Figure 16.4 Illustrative Internet Access and Backbone Networks
Figure 16.5 Application, Transport and Network Layer Protocol Services for HTTP under (a) HTTP 1.1 and HTTP/2; (b) HTTP/3
Figure 16.6 Illustrative Internet Protocol Version 4 (IPv4) Address Representation in Binary and Dot-Decimal Formats
Figure 16.7 IPv4 Public and Private Address Ranges
Figure 16.8 Illustrative Source Network Address Translation (S-NAT) Under IPv4
Figure 16.9 IP Network Configuration and Illustrative IPv4 Addresses
Figure 16.10 Home Network Configuration Showing DNS and Web Servers
Figure 16.11 IP Version 6 (IPv6) Address Fields
Figure 16.12 IP Version 4 (IPv4) Address Fields
Figure 16.13 IP Version 6 (IPv6) Packet’s Fixed Header Fields
Figure 16.14 IP Version 6 (IPv6) Packet’s Hop-by-Hop Options Extension Header
Figure 16.15 IP Version 6 (IPv6) Packet’s Routing Extension Header
Figure 16.16 A Transmission Control Protocol (TCP) Message
Figure 16.17 User Datagram Protocol (UDP) Datagram Header
Figure 16.18 Handshake Transactions under TCP and QUIC: (a) TCP and TLS; (b) QUIC
Figure 16.19 OSPF Routing Areas and Router Types
Figure 16.20 A Multi-AS Network Layout
Figure 16.21 Contents of a BGP Update Message
Figure 16.22 Route Update at a BGP Border Router
Figure 17.1 Comparison of Power Consumption and Complexity vs. Data Rate for Versions of WiFi, Bluetooth, and Zigbee Systems
Figure 17.2 Illustrative Network Configuration Involving a Wireless Personal Area network (WPAN) and a Wireless Local Area Network (WLAN)
Figure 17.3 Format of a WiFi MAC Frame
Figure 17.4 Attributes of WiFi Versions
Figure 17.5 Bluetooth Net Configurations: (a) A Piconet Consisting of a Master (M) Device and a Slave (S) Device; (b) A single Master Device Communicating with Multiple Slave Devices; (c) A Scatternet Consisting of Several Interconnected Piconets
Figure 17.6 Bluetooth-Layered Protocol Stacks: (a) Bluetooth BR/EDR Classic; (b) Bluetooth Low Energy (BLE)
Figure 17.7 Zigbee Net Layouts: (a) Star Topology. (b) Tree Topology. (c) Mesh Topology
Figure 17.8 Protocol Layer Stack for a Zigbee System
Figure 18.1 An Infrastructure-Based Wireless Network
Figure 18.2 An Ad Hoc Wireless Network Employing Multi-hop Peer-to-Peer Communications
Figure 18.3 A Hybrid Infrastructure of a Wireless Network
Figure 18.4 Spatial Reuse in a Cellular Network
Figure 18.5 High-Level LTE Network Architecture
Figure 18.6 The LTE Radio Access Network Architecture
Figure 18.7 The LTE Evolved Packet Core (EPC)
Figure 18.8 The LTE Protocol Architecture: (a) The User Plane; and (b) The Control Plane
Figure 18.9 LTE Bearers
Figure 18.10 The LTE Protocol Stack
Figure 18.11 A Data Flow Across Radio Access Network (RAN) Layers
Figure 18.12 A Resource Block
Figure 19.1 Illustrative AODV Protocol Messaging: (a) Topological Layout of an Ad Hoc Network; (b) Selective Route Request (RREQ) Packets; (c) Route Reply (RREP) Control Packet Flows and Data Packet Flows Across Selected Path
Figure 19.2 Illustrative DSR Protocol Packet Flows and Nodal Route Caches
Figure 19.3 Illustrative Selection of Multi-Port Routers (MPRs) Under Optimized Link-State Routing (OLSR) Protocol in MANET: (a) 2-Hop Neighborhood of Node A and Its Selected MPR(A) Routers; (b) MPRs Selected by Node A and by Node D for the Underlying MANET Layout
Figure 19.4 Illustrative Network Layout of a Mobile Backbone Network (MBN) Under the MBNP Protocol
Figure 19.5 Instances of Mobile Backbone Network (MBN) Layouts
Figure 19.6 Two Instances of Unmanned Ground Vehicle (UGV) Aided Mobile Backbone Network (UGV-MBN) Synthesized by Using MBNP
Figure 19.7 Unmanned Aerial Vehicle (UAV) Aided Mobile Backbone Network (UAV-MBN) Synthesized by Using MBNP
Figure 19.8 Comparative Performance Behavior of the MBNR, MBNR-FC and AODV ad hoc routing schemes: (a) Throughput vs. Offered Flow Rates; (b) Average Delay vs. Throughput Rate Performance; (c) Delay Jitter vs. Offered Traffic Load Rate
Figure 19.9 Connectivity Graphs for Multi-Radio MBN System: (a) when employing Higher-Power Radio Modules for Bnet and Anet Communications; (b) when using Lower Power Radio Modules for Intra-Anet Communications
Figure 20.1 High-Level SDN Architecture
Figure 20.2 High-Level NFV Framework
Figure 20.3 NFV-Based Network Service Represented as an NF Graph
Figure 21.1 Safety-Oriented Key Services and Message Types for Vehicular-Networked Systems
Figure 21.2 Non-safety-Oriented Key Services and Message Types for Vehicular-Networked Systems
Figure 21.3 V2X Performance Requirements for Wireless Communications Systems Employed by Autonomous Vehicular Networked
Figure 21.4 Vehicular Networking Configurations: (a) Vehicular Ad Hoc Network (VANET) Communications Using Vehicle-to-Vehicle (V2V) and Vehicle-to-Infrastructure (V2I) Links; (b) Backbone-Aided Vehicular Network Using Vehicle-to-Network (V2N) Communications; (c) Hybrid VANET and Backbone-Aided Vehicular Communications Network
Figure 21.5 US Wireless Access in Vehicular Environments (WAVE) Protocol Stack and ETSI GeoNetworking layers
Figure 21.6 Vehicular Configurations and Relay Selections: (a) a Platoon of Vehicles Configured to follow each other at Fixed inter-vehicle distances; (b) Vehicles assuming randomly varying inter-vehicle distances
Figure 21.7 GeoNetworking (GN) Protocol Layers
Figure 21.8 Structure of a GeoNetworking (GN) Packet
Figure 21.9 Cross-Layer Distributed Congestion Control (DCC)
Figure 21.10 Architecture of a Vehicular Backbone Network (VBN)
Figure 21.11 A Vehicular Backbone Network (VBN) Configuration in Support of Broadcast of a Data Packet Flow Originating at RSU Node RN1
Figure 21.12 Performance Behavior of a Backbone Network Synthesized for a Vehicular Backbone Network (VBN): (a) Broadcast Throughput Capacity () and Transport Throughput Capacity () Performance Curves vs. the Inter-BN Distance (D) Under Several Reuse-M Levels; (b) Broadcast Throughput Capacity Curves vs. the Product of the Vehicular Traffic Density Rate and the Inter-BN Distance ()
Figure 21.13 A VBN-Based V2V Network That Is Aided by the Use of an Infrastructure Core Network
Figure 21.14 Infrastructure-Aided Vehicular Network Using Platoon Formations
Figure 21.15 Cellular V2X Configurations: (a) Uplink, Downlink, and Sidelink; (b) A CV2X Network Configuration Showing Infrastructure Access (Using the Uu Interface) I2N Links and Sidelink Based (Using the PC5 Interface) V2V, V2I, and V2P Links
Figure 21.16 Vehicular Network System That Employs V2V, V2I and C-V2X Communications Links Supplemented by the Use of UAVs and/or Satellites
Figure 21.17 Flow of Vehicle Platoons Across a Highway Link
Figure 21.18 Platoon-Oriented Parameters
Figure 21.19 Illustrative Performance Curves for Vehicular Platoon Traffic Moving Along an Autonomous Highway: (a) Flow vs. Speed and (b) Speed vs. Flow
Figure 21.20 Illustrative Performance Curves for Vehicular Platoon Traffic Moving Along an Autonomous Highway: (a) Flow vs. Density and (b) Speed vs. Density
Figure 21.21 A Link Span of a Highway
Figure 21.22 Delay Constrained Performance of Platoon Flows Along a Lane: (a) Optimal Speed vs. Link Length; (b) Optimal Vehicle Flow Rate vs. Link Length
Figure 21.23 Single-Link Multiple Lane Configuration
Figure 21.24 Illustrative Transportation Network
Figure 22.1 National Institute of Standards and Technology (NIST) Cybersecurity Framework
Figure 22.2 Symmetric Key Encryption
Figure 22.3 An Illustrative Message Transfer Under Public Key Cryptography
Figure 22.4 A Digital Signature Scheme Employing Public Key Cryptography
Figure 22.5 The Diffie–Hellman (DH) Secure Key Exchange Algorithm
About the Author
Izhak Rubin, PhD, is Distinguished Professor Emeritus of Electrical and Computer Engineering at UCLA, California, USA. He has decades of experience in research and development studies of the Internet, and has published very widely on networking methods, performance modeling, and analysis techniques. He has served as the editor of leading professional journals, and has been elected as an IEEE Life Member Fellow.
Preface
Communication networks have transformed our lives. From the first telegraph networks in the 1840s to today’s ubiquitous wireline, wireless, and satellite networks, our world has been connected in ways that would have been unimaginable a few decades ago. The Internet, cellphones, Wi-Fi, telemedicine, video conferencing videoconferencing, chat programs, social networking, company marketing and user support, remote education and training, and more have changed how we work, where we work, and how we communicate with friends, family, and service providers worldwide.
In addition to teaching the fundamentals of communications networks to our students, as I have doing for many years in the electrical and computer engineering department at UCLA, and to members of commercial and governmental organizations, I have been finding out that many other persons are highly interested in gaining a conceptual understanding of the methods used to transport messages across communications networks, including the Internet and wireless-based Wi-Fi, cellular, and satellite networks. There is also much recent interest in learning about connected self-driving vehicles and in understanding the principles of message communications between mobiles that use an autonomous highway system.
Interested persons have been noted to have educational and professional background and experience in diverse areas, including engineering, physical sciences, business, management, law, finance, political science, biological sciences, medical sciences, information technology (IT), education, law enforcement, public safety, defense, military, humanities, art, psychology, sports, accounting, artificial intelligence (AI), and other. There is wide interest in learning about the approaches and techniques used by communications networks to transfer messages among persons, websites, computers, embedded sensing systems, and intelligent devices. It is essential today for students and practitioners in diverse areas and disciplines to learn the principles of message transfer in communications networks, as taught in this book.
I have been teaching, carrying out research investigations, and engaged in network development projects since 1970. Serving as a UCLA distinguished professor in the electrical and computer engineering department, I have been leading studies and engineering teams in contributing to projects that relate to the development of wireline and wireless telecommunications and computer communications networked systems, such as the Internet, wireless cellular, Wi-Fi, and autonomous networked mobile wireless systems.
I have been teaching courses on computer communication networks and telecommunications systems, and related engineering subjects to BS, MS, and PhD students. I have also been lecturing at continuing education and engineering training programs and have received an excellence in teaching award from UCLA Engineering. My classes have been exposing students to the principles of wireline and wireless computer communications network systems. Course attendees include persons that work in diverse fields, engaging in jobs that involve industrial, commercial, governmental, academic, and research and development institutions in the United States and throughout the world.
I have been contributing to commercial, governmental, and military organizations in the design, analysis, implementation, and testing of communications network systems. I have been serving as a technical leader in contributing to network design and analysis projects. I have been innovating methods, algorithms, and protocols, aimed for the design and implementation of wireline and wireless communications networks. I have received an IEEE Life Fellow membership award for my contributions to education and research in the area of computer communication networks.
The networking material, systems, and methods presented in this book are derived in large part from my corresponding experience over more than 50 years in basic and applied research developments, in the teaching of fundamental and advanced concepts of communications networking to persons in academia and in commercial and governmental organizations, and in my practical experience in contributing to the design and evaluation of network systems. My continuing education and in-house courses have also included nonengineering students. In many situations, I have been called upon to explain concepts and methods used for the transfer of messages across network systems in a manner that would promote understanding by persons that have no expertise or background in the underlying disciplines.
My objectives in this book are to provide a reader with conceptual understanding of the principles of message transfer in computer communications networks. I explain and illustrate fundamental networking concepts, and describe the working of communications network systems, including the Internet and autonomous mobile systems, in a manner that is accessible to many readers. The book serves the educational needs of undergraduate and postgraduate students, as well as a valuable resource to persons at large, including researchers and practicing engineers, that are interested to learn the principles of data transfer through and operations of communications network systems. In my presentations in this book, the following subject matters are highlighted:
Architectures of networking systems and protocols.
Characteristics of video, audio, and data flows and streams.
Methods for transmission of signals across communications channels.
Techniques for sharing communications media and service entities among message flows. Scheduling schemes that provide for the effective allocation of shared communications resources, including multiplexing mechanisms that are used for sharing a communications link by local flows and multiple access algorithms that are employed for sharing communications media among geographically distributed information sources.
Switching methods; concepts of operation and service provided by circuit and packet switching networks.
Schemes and algorithms for performing error control, flow control, congestion control, and routing of message flows across a network.
Protocols, communications networking algorithms, and performance behavior features of specific classes of network system technologies, including the Internet, mobile wireless networks, Wi-Fi wireless local area networks, cellular wireless networks, satellite networks, personal area networks, and connected vehicle systems. The latter make use of data message dissemination among self-driving vehicles that use the autonomous highway.
Secure message transfer across computer communications networks.
To make the material accessible to students, including advanced (junior-senior level) undergraduate and graduate students, and to a wide community of readers, I have structured my presentations to feature the following ingredients:
My descriptions of basic concepts and methods assume no prior knowledge of the subject matter.
It is not my purpose to present the numerous details that are involved in the implementation of protocols, algorithms, systems, and management schemes that are used in the operation of specific networking technologies. My aim is to foster understanding of the fundamental concepts of networking architectures and schemes that are used for the transfer of message flows across a network.
I have included illustrative numerical examples that demonstrate the functioning and performance behavior of networking protocols and algorithms under various operational scenarios.
The description of networking algorithms, protocols, and processes is presented in a manner that promotes the reader’s understanding of the underlying principles without requiring prior knowledge of the subject matter and mostly without having to rely on the use of intricate mathematical tools.
