752:, handling 10 Ă— 100 Mbit/s Ethernet channels, must examine 16 bits of address to determine the destination port for each packet. This translates into 81913 packets per second (assuming maximum data payload per packet) with a table of 2^16 addresses this requires the router to be able to perform 5.368 billion lookup operations per second. In a worst-case scenario, where the payloads of each Ethernet packet are reduced to 100 bytes, this number of operations per second jumps to 520 billion. This router would require a multi-teraflop processing core to be able to handle such a load.
581:
definitions assume a noiseless channel. Otherwise, the throughput would not be only associated with the nature (efficiency) of the protocol, but also to retransmissions resultant from the quality of the channel. In a simplistic approach, channel efficiency can be equal to channel utilization assuming that acknowledge packets are zero-length and that the communications provider will not see any bandwidth relative to retransmissions or headers. Therefore, certain texts mark a difference between channel utilization and protocol efficiency.
466:), and measuring the network path throughput in the destination node. Traffic load between other sources may reduce this maximum network path throughput. Alternatively, a large number of sources and sinks may be modeled, with or without flow control, and the aggregate maximum network throughput measured (the sum of traffic reaching its destinations). In a network simulation model with infinite packet queues, the asymptotic throughput occurs when the
353:"which device will deliver the most data per unit cost?". Systems designers often select the most effective architecture or design constraints for a system, which drive its final performance. In most cases, the benchmark of what a system is capable of, or its "maximum performance" is what the user or designer is interested in. The term maximum throughput is frequently used when discussing end-user maximum throughput tests.
857:
throughput is not a well-defined metric when it comes to how to deal with protocol overhead. It is typically measured at a reference point below the network layer and above the physical layer. The simplest definition is the number of bits per second that are physically delivered. A typical example where this definition is practiced is an
Ethernet network. In this case, the maximum throughput is the
143:
47:
596:
maximum channel utilization of 1526 / (1526 + 12) Ă— 100% = 99.22%, or a maximum channel use of 99.22 Mbit/s inclusive of
Ethernet datalink layer protocol overhead in a 100 Mbit/s Ethernet connection. The maximum throughput or channel efficiency is then 1500 / (1526 + 12) = 97.5%, exclusive of the Ethernet protocol overhead.
624:, and analog limitations of this type can be understood as factors that affect either the analog bandwidth of a signal or as factors that affect the signal-to-noise ratio. The bandwidth of wired systems can be in fact surprisingly narrow, with the bandwidth of Ethernet wire limited to approximately 1 GHz, and PCB traces limited by a similar amount.
88:
856:
The maximum throughput is often an unreliable measurement of perceived bandwidth, for example the file transmission data rate in bits per seconds. As pointed out above, the achieved throughput is often lower than the maximum throughput. Also, the protocol overhead affects the perceived bandwidth. The
840:
In some communications systems, such as satellite networks, only a finite number of channels may be available to a given user at a given time. Channels are assigned either through preassignment or through Demand
Assigned Multiple Access (DAMA). In these cases, throughput is quantized per channel, and
497:
The above values are theoretical or calculated. Peak measured throughput is throughput measured by a real, implemented system, or a simulated system. The value is the throughput measured over a short period of time; mathematically, this is the limit taken with respect to throughput as time approaches
488:
computer systems, where system operation is highly dependent on communication overhead, as well as processor performance. In these applications, asymptotic throughput is used in Xu and Hwang model (more general than
Hockney's approach) which includes the number of processors, so that both the latency
385:
of the system, and is the maximum possible quantity of data that can be transmitted under ideal circumstances. In some cases this number is reported as equal to the channel capacity, though this can be deceptive, as only non-packetized systems (asynchronous) technologies can achieve this without data
965:
Throughput over analog channels is defined entirely by the modulation scheme, the signal-to-noise ratio, and the available bandwidth. Since throughput is normally defined in terms of quantified digital data, the term 'throughput' is not normally used; the term 'bandwidth' is more often used instead.
363:
Four different values are relevant in the context of "maximum throughput", used in comparing the 'upper limit' conceptual performance of multiple systems. They are 'maximum theoretical throughput', 'maximum achievable throughput', 'peak measured throughput', and 'maximum sustained throughput'. These
580:
Channel utilization is instead a term related to the use of the channel, disregarding the throughput. It counts not only with the data bits, but also with the overhead that makes use of the channel. The transmission overhead consists of preamble sequences, frame headers and acknowledge packets. The
368:
can significantly alter throughput calculations, including generating values exceeding 100% in some cases. If the communication is mediated by several links in series with different bit rates, the maximum throughput of the overall link is lower than or equal to the lowest bit rate. The lowest value
352:
Users of telecommunications devices, systems designers, and researchers into communication theory are often interested in knowing the expected performance of a system. From a user perspective, this is often phrased as either "which device will get my data there most effectively for my needs?", or
595:
For example, the maximum frame size in
Ethernet is 1526 bytes: up to 1500 bytes for the payload, eight bytes for the preamble, 14 bytes for the header, and 4 bytes for the trailer. An additional minimum interframe gap corresponding to 12 bytes is inserted after each frame. This corresponds to a
619:
Despite the conceptual simplicity of digital information, all electrical signals traveling over wires are analog. The analog limitations of wires or wireless systems inevitably provide an upper bound on the amount of information that can be sent. The dominant equation here is the
627:
Digital systems refer to the 'knee frequency', the amount of time for the digital voltage to rise from 10% of a nominal digital '0' to a nominal digital '1' or vice versa. The knee frequency is related to the required bandwidth of a channel, and can be related to the
576:
that goes to the actually achieved throughput. For example, if the throughput is 70 Mbit/s in a 100 Mbit/s
Ethernet connection, the channel efficiency is 70%. In this example, effectively 70 Mbit of data are transmitted every second.
514:
This value is the throughput averaged or integrated over a long time (sometimes considered infinity). For high duty cycle networks, this is likely to be the most accurate indicator of system performance. The maximum throughput is defined as the
390:
with best case assumptions. This number, like the closely related term 'maximum achievable throughput' below, is primarily used as a rough calculated value, such as for determining bounds on possible performance early in a system design phase.
364:
values represent different quantities, and care must be taken that the same definitions are used when comparing different 'maximum throughput' values. Each bit must carry the same amount of information if throughput values are to be compared.
707:: As frequency increases, electric charges migrate to the edges of wires or cable. This reduces the effective cross-sectional area available for carrying current, increasing resistance and reducing the signal-to-noise ratio. For
895:
protocol. Dropped packets or packet retransmissions, as well as protocol overhead, are excluded. Because of that, the "goodput" is lower than the throughput. Technical factors that affect the difference are presented in the
470:(the packet queuing time) goes to infinity, while if the packet queues are limited, or the network is a multi-drop network with many sources, and collisions may occur, the packet-dropping rate approaches 100%.
1223:
Li, Harnes, Holte, "Impact of Lossy Links on
Performance of Multihop Wireless Networks", IEEE, Proceedings of the 14th International Conference on Computer Communications and Networks, Oct 2005, 303 - 308
326:
The throughput of a communication system may be affected by various factors, including the limitations of the underlying analog physical medium, available processing power of the system components,
722:
with termination taken into account. Unless this is done, reflected signals will travel back and forth across the wire, positively or negatively interfering with the information-carrying signal.
957:
in bit/s/Hz/area unit, bit/s/Hz/site or bit/s/Hz/cell, is the maximum system throughput (aggregate throughput) divided by the analog bandwidth and some measure of the system coverage area.
793:
Ensuring that multiple users can harmoniously share a single communications link requires some kind of equitable sharing of the link. If a bottleneck communication link offering data rate
784:
controls the data rate. A so-called "slow start" occurs in the beginning of a file transfer, and after packet drops caused by router congestion or bit errors in for example wireless links.
687:
689:
Where Tr is the 10% to 90% rise time, and K is a constant of proportionality related to the pulse shape, equal to 0.35 for an exponential rise, and 0.338 for a
Gaussian rise.
715:
cable), the skin effect frequency becomes dominant over the inherent resistivity of the wire at 100 kHz. At 1 GHz the resistivity has increased to 0.1 ohm per inch.
829:
Scheduling algorithms in routers and switches. If fair queuing is not provided, users that send large packets will get higher bandwidth. Some users may be prioritized in a
777:
is larger than the TCP window, i.e., the buffer size. In that case, the sending computer must wait for acknowledgement of the data packets before it can send more packets.
887:" measurement definition may be used. For example, in file transmission, the "goodput" corresponds to the file size (in bits) divided by the file transmission time. The "
741:
Computational systems have finite processing power and can drive finite current. Limited current drive capability can limit the effective signal to noise ratio for high
763:"backoff" waiting time and frame retransmissions after detected collisions. This may occur in Ethernet bus networks and hub networks, as well as in wireless networks.
728:: For wireless systems, all of the effects associated with wireless transmission limit the SNR and bandwidth of the received signal, and therefore the maximum bit
748:
Large data loads that require processing impose data processing requirements on hardware (such as routers). For example, a gateway router supporting a populated
1284:
334:
into account, the useful rate of the data transfer can be significantly lower than the maximum achievable throughput; the useful part is usually referred to as
929:, which is 'seconds per message' or 'seconds per output', throughput can be used to relate a computational device performing a dedicated function such as an
1068:
by C.Y Chou et al. in
Advances in Grid and Pervasive Computing: First International Conference, GPC 2006 edited by Yeh-Ching Chung and José E. Moreira
543:
Throughput is sometimes normalized and measured in percentage, but normalization may cause confusion regarding what the percentage is related to.
531:) to become unstable and increase towards infinity. This value can also be used deceptively in relation to peak measured throughput to conceal
1109:
in Recent
Advances in Parallel Virtual Machine and Message Passing Interface, Lecture Notes in Computer Science, 1997, Volume 1332/1997, 25-32
106:
98:
481:
T(N) is modeled as a function of message length N as T(N) = (M + N)/A where A is the asymptotic bandwidth and M is the half-peak length.
160:
60:
588:
link, where only one terminal is transmitting, the maximum throughput is often equivalent to or very near the physical data rate (the
1277:
1257:
1239:
1218:
1199:
797:
is shared by "N" active users (with at least one data packet in queue), every user typically achieves a throughput of approximately
585:
244:
226:
124:
74:
565:
207:
179:
1126:
1093:
1073:
1044:
865:
164:
1323:
1313:
770:
463:
308:
186:
604:
The throughput of a communication system will be limited by a huge number of factors. Some of these are described below:
1432:
1270:
997:
474:
621:
527:
does not occur), the maximum throughput may be defined as the minimum load in bit/s that causes the delivery time (the
307:
is the sum of the data rates that are delivered to all terminals in a network. Throughput is essentially synonymous to
1442:
1318:
1002:
386:
compression. Maximum theoretical throughput is more accurately reported taking into account format and specification
917:
has a single input and a single output, and operate on discrete packets of information. Examples of such blocks are
193:
1210:
954:
357:
293:
153:
1308:
986:
1339:
1012:
175:
635:
1437:
1411:
1039:, Jens Zander, K-W Sung, and Ben Slimane, Fundamentals of Mobile Data Networks, Cambridge University Press,
1007:
873:
774:
66:
31:
592:), since the channel utilization can be almost 100% in such a network, except for a small inter-frame gap.
502:. This number is useful for systems that rely on burst data transmission; however, for systems with a high
1385:
1375:
1293:
918:
459:
484:
As well as its use in general network modeling, asymptotic throughput is used in modeling performance on
1380:
830:
698:
613:
573:
516:
408:
347:
277:
265:
35:
876:(PPP) and the circuit-switched modem connection. In this case, the maximum throughput is often called
557:
1349:
1344:
781:
370:
331:
749:
629:
1406:
1354:
868:(channel coding), the redundant error code is normally excluded from the throughput. An example in
819:. Packets may be dropped in switches and routers when the packet queues are full due to congestion.
766:
612:
The maximum achievable throughput (the channel capacity) is affected by the bandwidth in hertz and
545:
455:
280:. The data that these messages contain may be delivered over physical or logical links, or through
1204:
934:
834:
816:
551:
485:
447:
412:
200:
1253:
1235:
1214:
1195:
1122:
1089:
1069:
1040:
926:
922:
914:
892:
729:
725:
719:
387:
950:
946:
589:
382:
365:
528:
520:
478:
467:
432:
420:
312:
285:
872:
communication, where the throughput typically is measured in the interface between the
858:
532:
440:
428:
1426:
1231:
1191:
981:
451:
281:
718:
Termination and ringing: Wires longer than about 1/6 wavelengths must be modeled as
1036:
877:
802:
569:
289:
273:
1262:
1249:
812:
805:
742:
704:
694:
524:
142:
503:
450:
a very large message (sequence of data packets) through the network, using a
823:
319:), and the drop in packets per unit time is denoted as the departure rate (
891:" is the amount of useful information that is delivered per second to the
315:, where the load in packets per time unit is denoted as the arrival rate (
17:
1370:
1086:
Recent Advances in Parallel Virtual Machine and Message Passing Interface
489:
and the asymptotic throughput are functions of the number of processors.
424:
416:
327:
269:
1121:
edited by Angelo Mañas, Bernardo Tafalla and Rou Rey Jay Pallones 1998
897:
888:
884:
851:
760:
756:
335:
976:
925:. Because the units of throughput are the reciprocal of the unit for
712:
506:, this is less likely to be a useful measure of system performance.
883:
To determine the actual data rate of a network or connection, the "
697:
when measured with respect to ground. This leads to effects called
992:
869:
523:
systems where the load and the throughput always are equal (where
473:
A well-known application of asymptotic throughput is in modeling
264:, when in context) refers to the rate of message delivery over a
1017:
930:
436:
1266:
708:
693:
RC losses: Wires have an inherent resistance, and an inherent
136:
81:
40:
701:, causing all wires and cables to act as RC lowpass filters.
937:
to a communications channel, simplifying system analysis.
519:
when the load (the amount of incoming data) is large. In
446:
Asymptotic throughput is usually estimated by sending or
27:
Rate at which data is processed in communication networks
1088:
by Jack Dongarra, Emilio Luque and Tomas Margalef 1999
841:
unused capacity on partially utilized channels is lost.
443:
are used, meaning that 1 Mbit/s is 1000000 bit/s.
638:
288:(bit/s, sometimes abbreviated bps), and sometimes in
30:"Throughput" redirects here. Not to be confused with
1228:
High Speed Digital Design, a Handbook of Black Magic
415:
function, when the incoming network load approaches
1399:
1363:
1332:
1301:
311:; it can be determined numerically by applying the
167:. Unsourced material may be challenged and removed.
681:
1107:A comparison of MPI performance on different MPPs
1188:Wireless Communications, Principles and Practice
833:(WFQ) algorithm if differentiated or guaranteed
356:Maximum throughput is essentially synonymous to
773:(TCP) protocol, affects the throughput if the
1278:
8:
330:behavior, etc. When taking various protocol
292:per second (p/s or pps) or data packets per
431:, the asymptotic throughput is measured in
75:Learn how and when to remove these messages
1285:
1271:
1263:
439:per second (B/s), where 1 B/s is 8 bit/s.
423:, or the number of data sources. As other
1119:High-Performance Computing and Networking
673:
664:
646:
637:
369:link in the series is referred to as the
245:Learn how and when to remove this message
227:Learn how and when to remove this message
125:Learn how and when to remove this message
682:{\displaystyle \ F_{3dB}\approx K/T_{r}}
561:in percentage are less ambiguous terms.
1029:
711:24 wire (of the type commonly found in
564:The channel efficiency, also known as
381:This number is closely related to the
1208:Algebraic Codes for Data Transmission
7:
284:. Throughput is usually measured in
165:adding citations to reliable sources
498:zero. This term is synonymous with
539:Channel utilization and efficiency
97:tone or style may not reflect the
25:
1066:Modeling Message Passing Overhead
904:Other uses of throughput for data
864:However, in schemes that include
586:point-to-multipoint communication
56:This article has multiple issues.
566:bandwidth utilization efficiency
141:
107:guide to writing better articles
86:
45:
616:of the analog physical medium.
152:needs additional citations for
64:or discuss these issues on the
941:Wireless and cellular networks
866:forward error correction codes
377:Maximum theoretical throughput
1:
771:Transmission Control Protocol
632:of a system by the equation:
309:digital bandwidth consumption
998:Measuring network throughput
600:Factors affecting throughput
510:Maximum sustained throughput
475:point-to-point communication
1003:Network traffic measurement
568:, is the percentage of the
1459:
1211:Cambridge University Press
955:system spectral efficiency
849:
808:communication is assumed.
737:IC hardware considerations
477:where (following Hockney)
358:digital bandwidth capacity
345:
29:
987:High-throughput computing
789:Multi-user considerations
1246:Satellite Communications
1013:Traffic generation model
726:Wireless Channel Effects
572:(in bit/s) of a digital
500:instantaneous throughput
493:Peak measured throughput
1412:Truthful job scheduling
1364:Optimization objectives
1186:Rappaport, Theodore S.
1008:Performance engineering
874:Point-to-Point Protocol
775:bandwidth-delay product
622:Shannon–Hartley theorem
584:In a point-to-point or
101:used on Knowledge (XXG)
32:Throughput (disk drive)
1294:Optimal job scheduling
1174:Roddy, 2001, 370 - 371
1165:Johnson, 1993, 160-170
919:fast Fourier transform
683:
105:See Knowledge (XXG)'s
831:weighted fair queuing
769:, for example in the
699:parasitic capacitance
684:
614:signal-to-noise ratio
574:communication channel
517:asymptotic throughput
409:communication network
401:asymptotic throughput
395:Asymptotic throughput
348:Peak information rate
278:communication network
266:communication channel
36:Throughput (business)
961:Over analog channels
913:Often, a block in a
880:or useful bit rate.
846:Goodput and overhead
782:congestion avoidance
636:
435:(bit/s) or (rarely)
411:is the value of the
407:) for a packet-mode
405:asymptotic bandwidth
305:aggregate throughput
176:"Network throughput"
161:improve this article
1433:Network performance
1407:Interval scheduling
909:Integrated circuits
822:Packet loss due to
546:Channel utilization
1443:Information theory
1400:Other requirements
1324:Unrelated machines
1314:Identical machines
1205:Blahut, Richard E.
1156:Johnson, 1993, 154
1138:Johnson, 1993, 2-5
935:embedded processor
923:binary multipliers
837:(QoS) is provided.
835:quality of service
817:network congestion
720:transmission lines
679:
608:Analog limitations
552:channel efficiency
486:massively parallel
419:, either due to a
413:maximum throughput
342:Maximum throughput
258:Network throughput
1420:
1419:
1226:Johnson, Graham,
1056:Blahut, 2004, p.4
947:wireless networks
927:propagation delay
915:data flow diagram
893:application layer
861:or raw bit rate.
730:transmission rate
641:
458:mechanism (i.e.,
301:system throughput
255:
254:
247:
237:
236:
229:
211:
135:
134:
127:
99:encyclopedic tone
79:
16:(Redirected from
1450:
1333:Multi-stage jobs
1319:Uniform machines
1287:
1280:
1273:
1264:
1190:second edition,
1175:
1172:
1166:
1163:
1157:
1154:
1148:
1147:Johnson, 1993, 9
1145:
1139:
1136:
1130:
1116:
1110:
1105:M. Resch et al.
1103:
1097:
1083:
1077:
1063:
1057:
1054:
1048:
1034:
951:cellular systems
688:
686:
685:
680:
678:
677:
668:
657:
656:
639:
590:channel capacity
558:packet drop rate
441:Decimal prefixes
383:channel capacity
366:Data compression
322:
318:
250:
243:
232:
225:
221:
218:
212:
210:
169:
145:
137:
130:
123:
119:
116:
110:
109:for suggestions.
90:
89:
82:
71:
49:
48:
41:
21:
1458:
1457:
1453:
1452:
1451:
1449:
1448:
1447:
1423:
1422:
1421:
1416:
1395:
1359:
1328:
1297:
1291:
1248:third edition,
1244:Roddy, Dennis,
1183:
1181:Further reading
1178:
1173:
1169:
1164:
1160:
1155:
1151:
1146:
1142:
1137:
1133:
1117:
1113:
1104:
1100:
1084:
1080:
1064:
1060:
1055:
1051:
1035:
1031:
1027:
1022:
972:
963:
943:
911:
906:
854:
848:
791:
739:
669:
642:
634:
633:
610:
602:
541:
521:packet switched
512:
495:
479:message latency
433:bits per second
429:data bandwidths
397:
379:
350:
344:
320:
316:
313:queueing theory
286:bits per second
251:
240:
239:
238:
233:
222:
216:
213:
170:
168:
158:
146:
131:
120:
114:
111:
104:
95:This article's
91:
87:
50:
46:
39:
28:
23:
22:
15:
12:
11:
5:
1456:
1454:
1446:
1445:
1440:
1438:Temporal rates
1435:
1425:
1424:
1418:
1417:
1415:
1414:
1409:
1403:
1401:
1397:
1396:
1394:
1393:
1388:
1383:
1378:
1373:
1367:
1365:
1361:
1360:
1358:
1357:
1352:
1347:
1342:
1340:Parallel tasks
1336:
1334:
1330:
1329:
1327:
1326:
1321:
1316:
1311:
1309:Single machine
1305:
1303:
1302:One-stage jobs
1299:
1298:
1292:
1290:
1289:
1282:
1275:
1267:
1261:
1260:
1242:
1224:
1221:
1202:
1182:
1179:
1177:
1176:
1167:
1158:
1149:
1140:
1131:
1111:
1098:
1078:
1058:
1049:
1028:
1026:
1023:
1021:
1020:
1015:
1010:
1005:
1000:
995:
990:
984:
979:
973:
971:
968:
962:
959:
942:
939:
910:
907:
905:
902:
859:gross bit rate
850:Main article:
847:
844:
843:
842:
838:
827:
820:
790:
787:
786:
785:
778:
764:
750:class B subnet
738:
735:
734:
733:
723:
716:
702:
676:
672:
667:
663:
660:
655:
652:
649:
645:
630:3 db bandwidth
609:
606:
601:
598:
540:
537:
533:packet shaping
511:
508:
494:
491:
396:
393:
378:
375:
343:
340:
253:
252:
235:
234:
149:
147:
140:
133:
132:
94:
92:
85:
80:
54:
53:
51:
44:
26:
24:
14:
13:
10:
9:
6:
4:
3:
2:
1455:
1444:
1441:
1439:
1436:
1434:
1431:
1430:
1428:
1413:
1410:
1408:
1405:
1404:
1402:
1398:
1392:
1389:
1387:
1384:
1382:
1379:
1377:
1374:
1372:
1369:
1368:
1366:
1362:
1356:
1353:
1351:
1348:
1346:
1343:
1341:
1338:
1337:
1335:
1331:
1325:
1322:
1320:
1317:
1315:
1312:
1310:
1307:
1306:
1304:
1300:
1295:
1288:
1283:
1281:
1276:
1274:
1269:
1268:
1265:
1259:
1258:0-07-137176-1
1255:
1251:
1247:
1243:
1241:
1240:0-13-395724-1
1237:
1233:
1232:Prentice Hall
1229:
1225:
1222:
1220:
1219:0-521-55374-1
1216:
1212:
1209:
1206:
1203:
1201:
1200:0-13-042232-0
1197:
1193:
1192:Prentice Hall
1189:
1185:
1184:
1180:
1171:
1168:
1162:
1159:
1153:
1150:
1144:
1141:
1135:
1132:
1128:
1124:
1120:
1115:
1112:
1108:
1102:
1099:
1095:
1091:
1087:
1082:
1079:
1076:pages 299-307
1075:
1071:
1067:
1062:
1059:
1053:
1050:
1046:
1042:
1038:
1033:
1030:
1024:
1019:
1016:
1014:
1011:
1009:
1006:
1004:
1001:
999:
996:
994:
991:
988:
985:
983:
982:Greedy source
980:
978:
975:
974:
969:
967:
960:
958:
956:
952:
948:
940:
938:
936:
932:
928:
924:
920:
916:
908:
903:
901:
899:
894:
890:
886:
881:
879:
875:
871:
867:
862:
860:
853:
845:
839:
836:
832:
828:
825:
821:
818:
814:
811:
810:
809:
807:
804:
800:
796:
788:
783:
779:
776:
772:
768:
765:
762:
758:
755:
754:
753:
751:
746:
744:
736:
731:
727:
724:
721:
717:
714:
710:
706:
703:
700:
696:
692:
691:
690:
674:
670:
665:
661:
658:
653:
650:
647:
643:
631:
625:
623:
617:
615:
607:
605:
599:
597:
593:
591:
587:
582:
578:
575:
571:
567:
562:
560:
559:
554:
553:
548:
547:
538:
536:
534:
530:
526:
522:
518:
509:
507:
505:
501:
492:
490:
487:
482:
480:
476:
471:
469:
465:
461:
457:
453:
452:greedy source
449:
444:
442:
438:
434:
430:
426:
422:
418:
414:
410:
406:
403:(less formal
402:
394:
392:
389:
384:
376:
374:
372:
367:
361:
359:
354:
349:
341:
339:
337:
333:
329:
324:
314:
310:
306:
302:
297:
295:
291:
287:
283:
282:network nodes
279:
275:
271:
267:
263:
259:
249:
246:
231:
228:
220:
209:
206:
202:
199:
195:
192:
188:
185:
181:
178: –
177:
173:
172:Find sources:
166:
162:
156:
155:
150:This article
148:
144:
139:
138:
129:
126:
118:
108:
102:
100:
93:
84:
83:
78:
76:
69:
68:
63:
62:
57:
52:
43:
42:
37:
33:
19:
1390:
1245:
1227:
1207:
1187:
1170:
1161:
1152:
1143:
1134:
1118:
1114:
1106:
1101:
1085:
1081:
1065:
1061:
1052:
1037:Guowang Miao
1032:
964:
944:
912:
882:
878:net bit rate
863:
855:
803:fair queuing
798:
794:
792:
767:Flow control
747:
740:
626:
618:
611:
603:
594:
583:
579:
570:net bit rate
563:
556:
550:
544:
542:
513:
499:
496:
483:
472:
462:rather than
456:flow control
445:
421:message size
404:
400:
398:
380:
362:
355:
351:
325:
304:
300:
298:
290:data packets
274:packet radio
261:
257:
256:
241:
223:
214:
204:
197:
190:
183:
171:
159:Please help
154:verification
151:
121:
115:October 2017
112:
96:
72:
65:
59:
58:Please help
55:
1250:McGraw-Hill
921:modules or
900:" article.
813:Packet loss
806:best-effort
743:capacitance
705:Skin effect
695:capacitance
525:packet loss
1427:Categories
1391:Throughput
1127:3540644431
1094:3540665498
1074:3540338098
1045:1107143217
1025:References
824:bit errors
504:duty cycle
448:simulating
371:bottleneck
346:See also:
268:, such as
262:throughput
217:March 2009
187:newspapers
61:improve it
18:Throughput
1386:Tardiness
1376:Earliness
1350:Flow shop
1345:Open shop
659:≈
425:bit rates
332:overheads
294:time slot
260:(or just
67:talk page
1381:Lateness
1371:Makespan
1355:Job shop
1296:problems
1252:, 2001,
1234:, 1973,
1213:, 2004,
1194:, 2002,
1129:page 935
1096:page 134
970:See also
417:infinity
388:overhead
328:end-user
270:Ethernet
1047:, 2016.
898:goodput
889:goodput
885:goodput
852:Goodput
815:due to
761:CSMA/CA
757:CSMA/CD
745:links.
529:latency
468:latency
454:and no
336:goodput
276:, in a
201:scholar
1256:
1238:
1217:
1198:
1125:
1092:
1072:
1043:
977:BWPing
953:, the
713:Cat 5e
640:
203:
196:
189:
182:
174:
993:Iperf
989:(HTC)
870:modem
801:, if
437:bytes
208:JSTOR
194:books
1254:ISBN
1236:ISBN
1215:ISBN
1196:ISBN
1123:ISBN
1090:ISBN
1070:ISBN
1041:ISBN
1018:ttcp
931:ASIC
780:TCP
759:and
555:and
427:and
399:The
299:The
180:news
949:or
945:In
933:or
799:R/N
709:AWG
464:TCP
460:UDP
323:).
303:or
272:or
163:by
34:or
1429::
1230:,
549:,
535:.
373:.
360:.
338:.
296:.
70:.
1286:e
1279:t
1272:v
896:"
826:.
795:R
732:.
675:r
671:T
666:/
662:K
654:B
651:d
648:3
644:F
321:ÎĽ
317:λ
248:)
242:(
230:)
224:(
219:)
215:(
205:·
198:·
191:·
184:·
157:.
128:)
122:(
117:)
113:(
103:.
77:)
73:(
38:.
20:)
Text is available under the Creative Commons Attribution-ShareAlike License. Additional terms may apply.
