25:
112:
For example, if a file is transferred, the goodput that the user experiences corresponds to the file size in bits divided by the file transfer time. The goodput is always lower than the throughput (the gross bit rate that is transferred physically), which generally is lower than network access
188:
are further limited to 1448 bytes as they also carry a 12-byte time stamp). The data is transmitted over
Ethernet in a frame, which imposes a 26 byte overhead per packet. Given these overheads, the maximum
109:
bits as well as retransmitted data packets. This is related to the amount of time from the first bit of the first packet sent (or delivered) until the last bit of the last packet is delivered.
208:(a minimum of 96 bit times), or collisions (which have a variable impact, depending on the network load). TCP adds the overhead of acknowledgements (which along with the
228:
Inter-packet time gaps caused by packet generation processing time (a source that does not use the full network capacity), or by protocol timing (for example
131:: Typically, transport layer, network layer and sometimes datalink layer protocol overhead is included in the throughput, but is excluded from the goodput.
343:
216:). This example does not consider the overhead of the HTTP protocol itself, which becomes relevant when transferring small files.
224:
The goodput is a ratio between delivered amount of information, and the total delivery time. This delivery time includes:
155:
in congested switches and routers, is included in the datalink layer or network layer throughput but not in the goodput.
68:
46:
39:
229:
164:
Over
Ethernet files are broken down into individual chunks for transmission. These chunks are no larger than the
177:
372:
290:
105:
delivered by the network to a certain destination per unit of time. The amount of data considered excludes
258:
165:
270:
Packet retransmission time (in case of deleted packets in congested routers, or detected bit errors)
148:
33:
340:
317:
265:
213:
50:
209:
118:
274:
140:
318:"TCP Performance problems caused by interaction between Nagle's Algorithm and Delayed ACK"
8:
296:
198:
136:
353:
Energy-Efficient Power and Rate
Control with QoS Constraints: A Game-Theoretic Approach
236:
246:
173:
106:
98:
144:: For example, TCP slow start may cause a lower goodput than the maximum throughput.
278:
114:
204:
Note that this example doesn't consider additional
Ethernet overhead, such as the
347:
212:
and the TCP window size in effect rate-limit each individual TCP connection, see
152:
205:
366:
253:
86:
94:
352:
357:
101:
throughput of a communication; i.e. the number of useful information
90:
240:
124:
Examples of factors that cause lower goodput than throughput are:
180:
header information, leaving 1460 bytes per packet for file data (
147:
Retransmission of lost or corrupt packets due to transport layer
194:
185:
181:
358:
RFC 2647 — Benchmarking
Terminology for Firewall Performance
169:
102:
364:
197:which is 95.67 megabits per second or 11.959
249:(distance divided by wave propagation speed)
315:
273:Delayed acknowledge due to flow control,
69:Learn how and when to remove this message
32:This article includes a list of general
365:
219:
18:
176:header information and 20 bytes of
172:. Each packet requires 20 bytes of
13:
266:store-and-forward processing delay
38:it lacks sufficient corresponding
14:
384:
23:
151:(ARQ), caused by bit errors or
309:
1:
302:
168:of IP over Ethernet, or 1500
291:Measuring network throughput
16:Application level throughput
7:
284:
239:(amount of data divided by
10:
389:
334:
159:
166:maximum transmission unit
149:automatic repeat request
214:bandwidth-delay product
53:more precise citations.
113:connection speed (the
81:In computer networks,
210:round-trip delay time
275:congestion avoidance
199:megabytes per second
141:congestion avoidance
373:Network performance
341:Goodput calculation
297:spectral efficiency
230:collision avoidance
193:is 1460/1526 × 100
346:2010-08-18 at the
264:Intermediate node
237:transmission delay
235:Data and overhead
220:Data delivery time
316:Stuart Cheshire.
261:translation delay
247:Propagation delay
129:Protocol overhead
107:protocol overhead
99:application-level
79:
78:
71:
380:
328:
327:
325:
324:
313:
295:Link and system
279:processing delay
135:Transport layer
115:channel capacity
74:
67:
63:
60:
54:
49:this article by
40:inline citations
27:
26:
19:
388:
387:
383:
382:
381:
379:
378:
377:
363:
362:
348:Wayback Machine
337:
332:
331:
322:
320:
314:
310:
305:
287:
222:
162:
153:packet dropping
75:
64:
58:
55:
45:Please help to
44:
28:
24:
17:
12:
11:
5:
386:
376:
375:
361:
360:
355:
350:
336:
333:
330:
329:
307:
306:
304:
301:
300:
299:
293:
286:
283:
282:
281:
271:
268:
262:
256:
250:
244:
233:
221:
218:
206:interframe gap
161:
158:
157:
156:
145:
132:
77:
76:
31:
29:
22:
15:
9:
6:
4:
3:
2:
385:
374:
371:
370:
368:
359:
356:
354:
351:
349:
345:
342:
339:
338:
319:
312:
308:
298:
294:
292:
289:
288:
280:
276:
272:
269:
267:
263:
260:
257:
255:
254:queuing delay
251:
248:
245:
242:
238:
234:
231:
227:
226:
225:
217:
215:
211:
207:
202:
200:
196:
192:
187:
183:
179:
175:
171:
167:
154:
150:
146:
143:
142:
138:
133:
130:
127:
126:
125:
122:
120:
116:
110:
108:
104:
100:
96:
92:
88:
84:
73:
70:
62:
52:
48:
42:
41:
35:
30:
21:
20:
321:. Retrieved
311:
223:
203:
190:
163:
137:flow control
134:
128:
123:
111:
82:
80:
65:
56:
37:
87:portmanteau
51:introducing
323:2010-01-13
303:References
95:throughput
59:April 2016
34:references
119:bandwidth
97:) is the
367:Category
344:Archived
285:See also
241:bit rate
335:Sources
252:Packet
191:goodput
160:Example
83:goodput
47:improve
195:Mbit/s
36:, but
186:macOS
182:Linux
170:bytes
277:and
184:and
174:IPv4
139:and
103:bits
93:and
91:good
259:NAT
178:TCP
121:).
117:or
89:of
85:(a
369::
201:.
326:.
243:)
232:)
72:)
66:(
61:)
57:(
43:.
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.