1269
Comment:
|
1985
|
Deletions are marked like this. | Additions are marked like this. |
Line 1: | Line 1: |
* AdvertisedWindow | * AmdahlsLaw |
Line 5: | Line 5: |
* AverageNormalizedExecutionTime * ["Bijection"] * BooleanAlgebra * BooleanTerm |
|
Line 7: | Line 11: |
* CpuTime * ["Decidable"] and SemiDecidable |
|
Line 9: | Line 15: |
* DelayBandwidthProduct | |
Line 11: | Line 18: |
* ExecutionTime | |
Line 13: | Line 21: |
* FixedPoint | |
Line 14: | Line 23: |
* FrameBuffer * FreeBooleanAlgebra * GeometricMean * GroundClause * GroundBooleanTerm * HammingCode |
|
Line 20: | Line 35: |
* InstructionSetArchitecture (ISA) | |
Line 22: | Line 38: |
* ["Latency"] | |
Line 27: | Line 44: |
* MultiProtocolLabelSwitching (MPLS) | * MonotoneBooleanTerm |
Line 30: | Line 47: |
* ["Performance"] | |
Line 33: | Line 51: |
* QueuingTheory * RecursivelyEnumerableSets * RelationallyComplete * ResponseTime |
|
Line 38: | Line 60: |
* SemiDecidable and ["Decidable"] | |
Line 39: | Line 62: |
* SlidingWindowProtocol * SpatialExtent * SpeedUp |
|
Line 40: | Line 66: |
* TcpFastRetransmit * TcpFastRecovery * ThroughPut * TransmissionControlProtocol (TCP) |
|
Line 44: | Line 74: |
* 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