1553
Comment:
|
1873
|
Deletions are marked like this. | Additions are marked like this. |
Line 4: | Line 4: |
* AverageNormalizedExecutionTime * ["Bijection"] * BooleanAlgebra |
|
Line 7: | Line 10: |
* CpuTime | |
Line 10: | Line 14: |
* DelayBandwidthProduct | |
Line 12: | Line 17: |
* ExecutionTime | |
Line 16: | Line 22: |
* FreeBooleanAlgebra | |
Line 26: | Line 33: |
* ["Latency"] | |
Line 31: | Line 39: |
* MultiProtocolLabelSwitching (MPLS) | |
Line 35: | Line 42: |
* ["Performance"] | |
Line 38: | Line 46: |
* QueuingTheory | |
Line 40: | Line 49: |
* ResponseTime | |
Line 48: | Line 58: |
* SpatialExtent * SpeedUp |
|
Line 49: | Line 61: |
* TcpFastRetransmit * TcpFastRecovery * ThroughPut |
|
Line 54: | Line 69: |
* 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