Index
Note: Page numbers followed by “f” refer to figures.
A
Ack’d Sequence Number (ASN),
11,
11
stability analysis of TCP with,
75–88
Active Queue Management (AQM) algorithm,
212,
243
selection of, using software defined networks,
249–250
minimization of Flow Completion Time (FCT),
249
throughput maximization,
249
Buffer Based Rate Selection (BBRS) algorithm,
192–193
threshold based buffer algorithm,
191–192
interaction between TCP and,
199–201
smoothed throughput-based,
190
TCP throughput-based,
188
Adaptive Load Balancing (ALB),
228
Adaptive Random Early Detection (ARED),
125–127,
251
Adaptive streaming techniques,
177f
scalable encoding solutions,
177
stream switching solutions,
177
transcoding-based solutions,
176
AIMD-based algorithm,
189
Additive increase/multiplicative decrease (AIMD) congestion control
Adobe HTTP Dynamic Streaming (HDS),
181
Advanced Peer to Peer Network (APPN),
10
Aggregation routers (ARs),
207
Aggregation switches (ASs),
207
Analytic modeling of congestion control,
25
derivation of Q=min(1,3/E(W)),
60–62
differentiating buffer overflows from link errors,
51–52
general procedure for computing average throughput,
48–49
throughput for general additive increase/multiplicative decrease congestion control,
49–51
multiple parallel TCP connections,
55–60
heterogeneous case,
57–60
square-root formula,
53–54
TCP throughput analysis,
28–45
throughput as a function of buffer size,
32–38
throughput as a function of link error rate,
38–45
throughput as a function of window size,
28–31
Apple HTTP Live Streaming (HLS),
181
Application Specific IP Address (AA),
209
Artificial intelligence (AI) algorithms,
243
Asynchronous Transfer Mode (ATM),
9–10,
10
Autoregressive integrated moving average (ARIMA),
195–196
Autoregressive moving average (ARMA),
195–196
Available bandwidth estimates (ABEs),
109
Available Bit Rate (ABR) traffic management scheme,
9–10
B
Bandwidth sharing between TCP with HTTP Adaptive Streaming,
200–201
Binary Increase Congestion control (BIC),
142,
143–149
binary search increase,
144
Broadband wireless networks, congestion control in,
101
algorithms to improve performance over lossy links,
109–116
available bandwidth estimation and TCP Westwood,
110–113
Loss Discrimination Algorithm (LDA),
113–114
TCP with Available Bandwidth Estimates,
115–116
TCP with Loss Discrimination Algorithms,
115–116
Zero Receive Window (ZRW) ACKs,
114–115
cellular wireless systems, bufferbloat problem in,
123–131
Active Queue Management (AQM) techniques,
125–129
Adaptive Random Early Detection (ARED),
125–127
end-to-end approaches against bufferbloat,
129–131
link-level error correction and recovery,
116–123
TCP performance with link-level Automatic Retransmissions,
118–123
TCP performance with link-level Forward Error Correction,
116–118
wireless access architecture and issues,
104–106
Buffer Based Rate Selection algorithm (BBRS),
192–193
Buffer occupancy value,
170
-based Adaptive Bit Rate algorithms,
191
throughput as a function of,
32–38
Bufferbloat problem, in cellular wireless systems,
123–131
Active Queue Management techniques,
125–129
C
CBR video transmission over TCP,
178–180
Cellular wireless systems
Active Queue Management techniques,
125–129
Adaptive Random Early Detection,
125–127
Congestion avoidance algorithm, ,
13–14
Congestion collapse, , ,
3f,
Control Point (CP) algorithm,
233
Control theory–based Adaptive Bit Rate algorithms,
193–196
Controlled Delay (CoDel) algorithm,
127–129
Convergence,
Convex optimization theory,
98–99
D
Data center architecture and traffic patterns,
207–212
configuration complexity,
208
tree-type interconnection architecture,
207,
207f
Data Center Bridging (DCB),
231
Data Center Congestion Control Protocol (DCTCP),
20,
171
Data center job computation,
212
data center architecture and traffic patterns,
207–212
traffic generation model and implications,
210–212
data center transmission control protocol (DCTCP),
212–218
deadline-aware congestion control algorithms,
218–222
Deadline Aware Datacenter TCP (D
2TCP),
218–220
load balancing over multiple path TCP,
222–227
delay-based protocols,
212
Deadline Aware Data Center TCP (D
2TCP),
206,
218–220
Deadline-aware congestion control algorithms,
218–222
Delay-based congestion control,
20–21
Delay-based protocols,
212
Directory System (DS),
209
Discrete Cosine Transform (DCT),
175
Dual-Homed Fat Tree (DHFT),
227
Dynamic Adaptive Streaming over HTTP (DASH),
174
E
Efficiency criterion,
Efficiency line,
5f, , , ,
6–7
End-to-end congestion control,
10
End-to-end rate-based flow control (EERC) algorithm,
9–10
Equal Cost Multi-Path (ECMP),
208,
232
Quantum Congestion Notification (QCN) algorithm
switched Ethernet and Internet Protocol networks, differences between,
232
Explicit Congestion Notification (ECN),
11,
19,
20
F
Fast transmission control protocol (FAST TCP),
163–164
Feedback control system,
95,
95f
Fiber Channel over Ethernet (FCoE) standard,
231
Flow Completion Time (FCT)
for congestion control,
45–52
computing average throughput, general procedure for,
48–49
differentiating buffer overflows from link errors,
51–52
throughput for general additive increase/multiplicative decrease congestion control,
49–51
Forward Error Correction (FEC),
104,
105
G
Gain crossover point,
96,
96
Gateway GPRS Support Node (GGSN),
104–105
Generalized additive increase/multiplicative decrease (GAIMD) algorithms,
51,
73–74,
74
Generalized TCP-friendly algorithms,
73–75
receiver side rate computation,
253–255
arrival time model and filter,
253–254
sender side rate computation,
252–253
H
compound transmission control protocol (CTCP),
155–163
high-speed transmission control protocol (HSTCP),
140–142
Rate Control Protocol (RCP),
169–170
TCP binary increase congestion (TCP BIC),
142,
143–149
binary search increase,
144
High-speed transmission control protocol (HSTCP),
140–142,
217
AIMD increase–decrease parameters for,
141
Response Function vs Packet Drop Rate,
140
Hop-by-hop congestion control,
10
HTTP requests and bit rate adaptation in,
182f
HTTP/TCP for video delivery,
180
HULL (High bandwidth Ultra Low Latency) algorithm,
217–218
Hybrid Automatic Retransmissions (HARQ),
116
Hyper-Active Increase (HAI),
236
I
IEEE 802.1Qau QCN algorithm,
20,
92
Implications for congestion control algorithms,
92
Implicit vs explicit indication of network congestion,
11
Inter-connection Network,
207
Internet Protocol (IP) networks,
205,
231
J
K
Karush-Kuhn-Tucker theorem,
98–99
L
Lagrangian multiplier,
65
Lagrangian optimization theory,
65
Laplace transform space,
168
throughput as a function of,
38–45
Link errors
recovered by duplicate ACKs,
39–42
recovered by duplicate ACKs and timeouts,
42–45
Link-level error correction and recovery,
116–123
TCP performance
with link-level Automatic Retransmissions and Forward Error Correction,
118–123
with link-level Forward Error Correction,
116–118
Live-video streaming,
173
Location Specific IP Address (LA),
209
M
Machine Learning (ML) and congestion control,
244–247
network state observations,
245
Mean value analysis (MVA),
39
Medium Access Control (MAC),
103
Microsoft HTTP Smooth Streaming (HSS),
181
Moving Picture Experts Group (MPEG) standard,
175
Multiple parallel TCP connections,
55–60
heterogeneous case,
57–60
Multiplicative increase/additive decrease (MIAD), ,
6–7
Multiplicative increase/multiplicative decrease (MIMD) controls,
6–7
N
Network feedback techniques,
18–20
active queue management,
18–20
passive queue management,
18
Network Operating System (NOS),
248–249
Next Sequence Number (NSN),
11,
12,
15
Nonlinear increase–decrease algorithms,
Nyquist criterion, ,
22,
168
O
Optimal operating point, ,
5f, ,
6–7
Optimization theory,
66–73
utility function for TCP Reno,
71–73
Orthogonal frequency-division multiplexing (OFDMA),
104–105
P
Packet Data Serving Node (PDSN),
104–105
Packet networks, video delivery and,
175–180
CBR video transmission over TCP,
178–180
Partially observable Markov decision processes (POMDPs),
244
Passive queue management,
18
pFabric congestion control algorithm,
206,
229
Phase crossover point,
96
Potential delay fairness,
73
Preemptive Distributed Quick Flow (PDQ) algorithm,
206,
221,
221,
222
Primal optimal solution,
68
Problem of congestion control,
3–4
Processor Sharing (PS),
229
Progressive Download (PD),
174
Progressive Download with Byte Ranges (PD-BR),
174
Proportional controllers,
71,
84–85
comparison with RED controllers,
85,
85f
Proportional fairness,
73
comparison with RED controllers,
87,
87f
Q
Quality of service (QoS),
173
Quantum Congestion Notification (QCN) algorithm,
231,
231–232
Control Point (CP) algorithm,
233
Reaction Point (RP) algorithm,
234–236
R
Random Early Detection (RED),
125
comparison with proportional controllers,
85,
85f
transfer function for,
96–98
Random Early Detection routers,
136
Rate Adaptive Protocol (RAP),
177–178
Rate-based congestion control,
9–10
Reaction Point (RP) algorithm,
234–236
Active Increase (AI) phase,
235
Fast Recovery (FR) phase,
235
Real Time Protocol (RTP),
173
Real Time Streaming Protocol (RTSP),
173
Remy Congestion Control (RemyCC),
244–247
network state observations,
245
Retransmission timeout (RTO),
12,
12
Round trip time (RTT),
12
RTCP Receiver Report (RR),
252,
252
S
Scalable encoding solutions,
177
Self-clocking property,
8–9,
8f
Smoothed throughput based algorithm,
190
to adapt Random Early Detection parameters,
250–251
and selection of AQM algorithms,
249–250
Stability of congestion control system,
75–88
proportional controllers,
84–85
proportional-integral controllers,
86–88
random early detection controllers,
80–84
Static random-access memory (SRAM),
205
Stochastic model for congestion control,
52–53
Storage Area Networks (SANs), ,
10,
23,
231
Stream switching solutions,
177
Strong duality theorem,
99
Switched Ethernet and IP networks, differences between,
232
T
Tail-drop feedback,
18,
18
Throughput
-based Adaptive Bit Rate algorithms,
188
as a function of buffer size,
32–38
as a function of link error rate,
38–45
as a function of window size,
28–31
Time Sliding Window (TSW) estimator,
112
Timer operation and timeouts,
12–13
Transcoding-based solutions,
176
and Adaptive Bit Rate, interaction between,
199–201
with Available Bandwidth Estimates and Loss Discrimination Algorithms,
115–116
buffers, requirement of,
205
HTTP Adaptive Streaming and, bandwidth sharing between,
200–201
link-level error correction and recovery,
116–123
Response Function vs Packet Drop Rate,
138,
140
stability analysis of, with AQM,
75–88
binary search increase,
144
TCP Friendly Rate Control (TFRC) algorithm,
9–10,
252,
252
TCP Tahoe algorithm, ,
3–4
throughput as a function of buffer size,
32–38
throughput as a function of link error rate,
38–45
link errors recovered by duplicate ACKs,
39–42
link errors recovered by duplicate ACKs and timeouts,
42–45
throughput as a function of window size,
28–31
throughput-based algorithm,
188
throughput measurements, problems with,
197–198
window growth function for,
151f
utility function for,
71–73
window size decrements
Fast Retransmit and Fast Recovery,
15
timer operation and timeouts,
12–13
window size increments,
13–14
congestion avoidance,
13–14
Transmit Sequence Number (TSN),
11
Transmit window operation,
8f
U
V
Valiant Load Balancing (VLB),
209
Video applications, flow control for,
173
Adaptive Bit Rate (ABR) algorithm,
181–187
TCP and ABR, interaction between,
199–201
TCP throughput measurements, problem with,
197–198
video delivery over packet networks,
175–180
CBR video transmission over TCP,
178–180
Video on demand (VoD),
173
Virtual Local Area Networks (VLANs),
207,
208
Virtual Machines (VMs),
229
W
Web Real-Time Communication (WebRTC),
243–244
Weighted minimal potential delay fair,
99
Weighted proportionally fair,
99
Window size
rate of change in,
72,
72
variation of, in steady state for TCP Reno,
32f
Window-based congestion control,
7–9,
10
Wireless access architecture and issues,
104–106
X
Y
Z
Zero Receive Window (ZRW),
104