1619
Comment:
|
1928
|
Deletions are marked like this. | Additions are marked like this. |
Line 1: | Line 1: |
* AmdahlsLaw | |
Line 4: | Line 5: |
* AverageNormalizedExecutionTime * ["Bijection"] |
|
Line 8: | Line 11: |
* CpuTime | |
Line 11: | Line 15: |
* DelayBandwidthProduct | |
Line 13: | Line 18: |
* ExecutionTime | |
Line 18: | Line 24: |
* GeometricMean | |
Line 20: | Line 27: |
* HammingCode | |
Line 28: | Line 36: |
* ["Latency"] | |
Line 33: | Line 42: |
* MultiProtocolLabelSwitching (MPLS) | |
Line 37: | Line 45: |
* ["Performance"] | |
Line 40: | Line 49: |
* QueuingTheory | |
Line 42: | Line 52: |
* ResponseTime | |
Line 51: | Line 62: |
* SpeedUp | |
Line 52: | Line 64: |
* TcpFastRetransmit * TcpFastRecovery * ThroughPut |
|
Line 57: | Line 72: |
* WallClockTime |
AutonomousSystem (AS)
- ["Bijection"]
CidrVsSubnetting (CIDR, Subnetting and Class A-E Definitions)
CompleteLogic What does it mean for a logic to be complete
["Decidable"] and SemiDecidable
- ["Dichotomy"]
InternetProtocolV4 (IPv4)
InternetProtocolV6 (IPv6)
LogicalImplication (|= symbol and also
- ["Latency"]
MaximumTransmissionUnit (MTU)
- ["Model"] of a logic formula
OsiModel (7 layer OSI network Model)
- ["Performance"]
["Proposition"] or PropositionalLogic
- ["Satisfiable"]
SemiDecidable and ["Decidable"]
- ["Tautology"]
- ["taxonomy"]
- ["Undecidable"]
- ["Valid"] Logic Formula