1535
Comment:
|
1852
|
Deletions are marked like this. | Additions are marked like this. |
Line 4: | Line 4: |
* AverageNo * ["Bijection"] * BooleanAlgebra * BooleanTerm |
|
Line 6: | Line 10: |
* CpuTime | |
Line 9: | Line 14: |
* DelayBandwidthProduct | |
Line 11: | Line 17: |
* ExecutionTime | |
Line 15: | Line 22: |
* FreeBooleanAlgebra | |
Line 25: | Line 33: |
* ["Latency"] | |
Line 30: | Line 39: |
* MultiProtocolLabelSwitching (MPLS) | |
Line 34: | Line 42: |
* ["Performance"] | |
Line 37: | Line 46: |
* QueuingTheory | |
Line 39: | Line 49: |
* ResponseTime | |
Line 47: | Line 58: |
* SpatialExtent * SpeedUp |
|
Line 48: | Line 61: |
* TcpFastRetransmit * TcpFastRecovery * ThroughPut |
|
Line 53: | 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