1640
Comment:
|
1910
|
Deletions are marked like this. | Additions are marked like this. |
Line 1: | Line 1: |
* AmdahlsLaw | |
Line 4: | Line 5: |
* ["Bijections"] | * AverageNormalizedExecutionTime * ["Bijection"] |
Line 9: | Line 11: |
* CpuTime | |
Line 12: | Line 15: |
* DelayBandwidthProduct | |
Line 14: | Line 18: |
* ExecutionTime | |
Line 19: | Line 24: |
* GeometricMean | |
Line 29: | Line 35: |
* ["Latency"] | |
Line 34: | Line 41: |
* MultiProtocolLabelSwitching (MPLS) | |
Line 38: | Line 44: |
* ["Performance"] | |
Line 41: | Line 48: |
* QueuingTheory | |
Line 43: | Line 51: |
* ResponseTime | |
Line 52: | Line 61: |
* SpeedUp | |
Line 53: | Line 63: |
* TcpFastRetransmit * TcpFastRecovery * ThroughPut |
|
Line 58: | Line 71: |
* 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