Computer Networks¶
Tanenbaum, A. S., & Wetherall, D. J. (2011). Computer Networks. Prentice Hall.
Cited by¶
14 citations across 14 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Cadence
- In communications and control it is the polling rate, the sampling rate, the heartbeat interval of a keep-alive protocol, and the refresh rate — the tempo at which a system checks, samples, or updates.
This sourceStandard text covering polling, sampling, heartbeat, and keep-alive intervals in communication and control.
- In communications and control it is the polling rate, the sampling rate, the heartbeat interval of a keep-alive protocol, and the refresh rate — the tempo at which a system checks, samples, or updates.
- Carrying Capacity
- And it predicts the necessity and the shape of load-shedding: a system operating near capacity must shed incoming load before reaching the overshoot regime, because once in that regime the substrate itself is being consumed.
This sourceTreats admission control, congestion avoidance, and load shedding as the structural response to operating a network near saturation.
- And it predicts the necessity and the shape of load-shedding: a system operating near capacity must shed incoming load before reaching the overshoot regime, because once in that regime the substrate itself is being consumed.
- Channel
- Marketing and logistics: a marketing channel is the funnel from brand to consumer with bandwidth (audience), noise (competing messages), and codebook (admissible formats); a logistics channel (port to rail to truck to store) has throughput, latency, breakage probability, and admissible cargo types. Diplomacy and intelligence: backchannels, public channels, and deniable channels differ in capacity, signal-to-noise, and authenticity, and the choice of channel is part of the message. Software systems: pipes, sockets, message queues, and RPC channels are explicit named channels with documented backpressure, ordering, durability, and delivery semantics, and choosing one is an architectural commitment.
This sourceStandard text covering sockets, message queues, RPC channels, ordering, durability, and delivery semantics in software systems.
- Marketing and logistics: a marketing channel is the funnel from brand to consumer with bandwidth (audience), noise (competing messages), and codebook (admissible formats); a logistics channel (port to rail to truck to store) has throughput, latency, breakage probability, and admissible cargo types. Diplomacy and intelligence: backchannels, public channels, and deniable channels differ in capacity, signal-to-noise, and authenticity, and the choice of channel is part of the message. Software systems: pipes, sockets, message queues, and RPC channels are explicit named channels with documented backpressure, ordering, durability, and delivery semantics, and choosing one is an architectural commitment.
- Communication Repair
- and in its protocol form equally short — retransmit-on-NAK, retransmit-on-timeout, renegotiate-on-version-fail, abort-and-restart on unrecoverable divergence.
This sourceData-link and transport chapters enumerate the protocol-form repair catalogue — automatic repeat request (ARQ): retransmit-on-NAK, retransmit-on-timeout, version/handshake renegotiation, and abort/reset on unrecoverable error — the data-communications analogue of conversational repair.
- and in its protocol form equally short — retransmit-on-NAK, retransmit-on-timeout, renegotiate-on-version-fail, abort-and-restart on unrecoverable divergence.
- Environmental Coupling Strength
- A cloud-native, stateless service exhibits high environmental coupling to network conditions (it must respond to traffic immediately); a batch-processing system with local storage exhibits low environmental coupling to the network (it can process data autonomously and sync periodically).
This sourceCanonical networking textbook developing bandwidth, latency, and the layered (OSI/TCP-IP) dependency structure. SUPPORTS marker 190 (layered dependency structure determining a host's coupling to network conditions).
- A cloud-native, stateless service exhibits high environmental coupling to network conditions (it must respond to traffic immediately); a batch-processing system with local storage exhibits low environmental coupling to the network (it can process data autonomously and sync periodically).
- Feedforward Inhibition
- It travels two coupled ways at the moment of arrival: a direct excitatory path that dispatches the request down the fast service path, and a parallel inhibitory path that simultaneously increments a token-bucket or budget counter which throttles subsequent requests.
This sourceDescribes the token-bucket and leaky-bucket algorithms in which serving a packet/request simultaneously spends a token from a finite bucket, throttling subsequent traffic — the brake coupled to the activation event itself.
- It travels two coupled ways at the moment of arrival: a direct excitatory path that dispatches the request down the fast service path, and a parallel inhibitory path that simultaneously increments a token-bucket or budget counter which throttles subsequent requests.
- Hierarchical Decomposability
- The OSI/internet stack is the canonical engineered hierarchical decomposition, a structural commitment Tanenbaum and Wetherall (2011) document as the organizing principle of computer-network design.
This sourceStandard networking textbook: develops the OSI seven-layer and TCP/IP layered architectures as the organizing principle of network design, with each layer presenting a narrow interface contract to its neighbors so that designers at one layer can work without coordinating across layers.
- The OSI/internet stack is the canonical engineered hierarchical decomposition, a structural commitment Tanenbaum and Wetherall (2011) document as the organizing principle of computer-network design.
- Latency
- Confusing the two leads designers to "fix" a slow-feeling system by adding capacity that does nothing for the delay.
This sourceStandard networking textbook: develops the OSI seven-layer and TCP/IP layered architectures as the organizing principle of network design, with each layer presenting a narrow interface contract to its neighbors so that designers at one layer can work without coordinating across layers.
- Confusing the two leads designers to "fix" a slow-feeling system by adding capacity that does nothing for the delay.
- Message Passing
- Packet-switched-network designs and exchange-based order-matching share the same fault-tolerance reasoning.
This sourceDevelops packet-switched networking and the fault-tolerance reasoning (loss, duplication, reordering, acknowledgement, ordering guarantees) shared across message-routing substrates.
- Packet-switched-network designs and exchange-based order-matching share the same fault-tolerance reasoning.
- Multiplexing
- The concept emerged from nineteenth- and twentieth-century telegraphy and telephony, where the cost of physical lines made packing many conversations onto one wire economically decisive, and it generalizes across operating-system schedulers, neural coding, molecular biology, and shared physical infrastructure.
This sourceStandard networking textbook: develops the OSI seven-layer and TCP/IP layered architectures as the organizing principle of network design, with each layer presenting a narrow interface contract to its neighbors so that designers at one layer can work without coordinating across layers.
- The concept emerged from nineteenth- and twentieth-century telegraphy and telephony, where the cost of physical lines made packing many conversations onto one wire economically decisive, and it generalizes across operating-system schedulers, neural coding, molecular biology, and shared physical infrastructure.
- Path
- In computing and networking routing protocols compute and maintain paths through the internet, call stacks are paths through the function-call graph, execution traces are paths through the control-flow graph, and query plans are paths through the join graph.
This sourceStandard reference for routing protocols (shortest-path, distance-vector, link-state) computing and maintaining paths, and routing tables as per-destination next-hop choices defining implicit path families.
- In computing and networking routing protocols compute and maintain paths through the internet, call stacks are paths through the function-call graph, execution traces are paths through the control-flow graph, and query plans are paths through the join graph.
- Site
- In software architecture, ports, file descriptors, memory addresses, plugin slots, and mount points are occupiable positions a program addresses without knowing the current occupant.
This sourceDescribes ports, addresses, and sockets as addressable transport-layer positions a program binds to independently of any occupant.
- In software architecture, ports, file descriptors, memory addresses, plugin slots, and mount points are occupiable positions a program addresses without knowing the current occupant.
- Rate Limiting
- In computing it is API rate limits, login-attempt throttles, packet shaping (token bucket, leaky bucket), and consumer rate caps, a mature and standardised family of algorithms.
This sourceStandard reference for the token-bucket and leaky-bucket traffic-shaping algorithms: a budget of tokens refilling at rate r, capacity B admitting bursts, and the burst-tolerant-versus-burst-suppressing distinction.
- In computing it is API rate limits, login-attempt throttles, packet shaping (token bucket, leaky bucket), and consumer rate caps, a mature and standardised family of algorithms.
Domain-specific¶
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Links previously used in the corpus¶
Before the registry existed this work was also linked 2 other ways.
- https://www.pearson.com/en-us/subject-catalog/p/computer-networks/P200000003188 ×3
- https://search.worldcat.org/title/671705803 ×1
Registry ID ref:d9050c421bc5 · see in the full table