Tag

replication

33 articles

Oct 23, 2026 Quorum Intersection: Why R + W > N Is Necessary but Not Sufficient What the quorum inequalities actually prove about read-write overlap, why they say nothing about the newest value, and where per-key quorums break down across a cluster. databases
Oct 2, 2026 Bootstrapping a Replica from a Snapshot and a Log Tail Why a running replica cannot simply be copied file by file, how a consistent cut is captured while writes continue, and how the log position inside the snapshot stitches it to the stream. distributed systems
Sep 29, 2026 Failure Domains and the Arithmetic Behind Replication Factor How a copy count becomes a durability estimate, why that estimate collapses when failures correlate, and what placement must do to keep the arithmetic honest. filesystems
Sep 14, 2026 Zone Transfers and Secondary Replication: AXFR, IXFR, and the SOA Timers How a secondary server detects that a zone changed, what a full transfer costs against an incremental one, and how serial number arithmetic makes wrap-around safe. internet protocols
Jul 29, 2026 Leader Leases and Fencing Tokens in Failover Why a demoted leader can still issue writes, how time-based leases bound that window, and why fencing tokens rather than timeouts are what actually protects shared storage. distributed systems
May 11, 2026 Version Vectors and Conflict Detection in Multi-Writer Replication How per-replica counters encode causal history, why vector comparison identifies concurrency that timestamps hide, and what the vectors cost in metadata and pruning. distributed systems
Mar 6, 2026 Log Shipping and the Recovery Point Objective How the commit acknowledgement ladder sets the true data-loss window, why a WAL archive lags by a whole segment, and how to measure the gap rather than assume it. devops
Feb 27, 2026 Merkle Tree Anti-Entropy: Finding Divergence Without Comparing Everything How hash trees over key ranges reduce replica comparison from a full data exchange to a walk over the subtrees that actually differ, and what write churn does to that saving. distributed systems
Feb 22, 2026 Statement Versus Row-Based Logs: Determinism and the Cost of Replay How statement replication breaks on nondeterministic SQL, what row images cost in bytes, and which failures each format survives. databases
Feb 10, 2026 Why Majority Quorums Intersect and What the Intersection Buys The arithmetic of quorum overlap, why read and write sets must share a node, and what asymmetric quorum sizes cost in latency, durability, and fault tolerance. distributed systems
Jan 28, 2026 Read-Your-Writes Across Replicated Session Stores Which consistency guarantees a session actually needs, why a replica read can undo a rotation, and how version tokens and home-region ownership keep a user from seeing their own past. backend systems
Nov 29, 2025 Replication Lag as the Real Recovery Point Bound Why asynchronous cross-region replication sets an RPO that varies with write rate and network conditions, and how to measure the lag that actually matters for data loss. cloud infrastructure
Nov 25, 2025 Replication Topologies and What Each One Tolerates How single-leader, multi-leader, and leaderless replication differ in where writes are accepted, which node losses they survive, and what conflict handling each one forces. distributed systems
Nov 21, 2025 Cross-Region Replication and the Window Between Two Copies Replication is asynchronous by default, so the second region lags the first. What the lag does to failover, to deletes, and to any read that crosses the boundary. cloud infrastructure
Oct 9, 2025 Where the Commit Returns: Synchronous and Asynchronous Replication Boundaries What a commit acknowledgement actually guarantees at each replication mode, how quorum commits move the durability boundary, and why a synchronous replica becomes a latency dependency. databases
Sep 5, 2025 Chain Replication: Why the Head Writes and the Tail Reads How ordering replicas into a chain turns replication into a single ordered path, why reads are served at the tail, and what the head and tail failures require of the membership protocol. filesystems
Jul 24, 2025 Merkle Trees, Range Digests, and Finding Divergence Without Reading Everything How a tree of hashes narrows a comparison between two replicas to the differing leaves, what it costs to maintain under writes, and why the leaves must align. filesystems
Jun 2, 2025 Anti-Entropy Repair: Merkle Trees, Read Repair, and the Cost of Finding Divergence How replicas that missed writes discover what they missed, why a Merkle tree narrows comparison to a logarithmic path, and what repair cannot fix. databases
Apr 15, 2025 Failure-Domain Placement: Keeping Replicas Out of the Same Blast Radius How rack, host, and power topology constrain where the third replica goes, why capacity-weighted placement and CRUSH avoid a central allocator, and how correlated loss is measured. distributed systems
Mar 31, 2025 What a Successful Write Guarantees: Durability and Read-After-Write Consistency A 200 response means the bytes survive disk failure, not that every reader sees them yet. How replication, quorums, and listing indexes set the visibility rules. cloud infrastructure
Mar 26, 2025 Why Byzantine Fault Tolerance Costs a Third of the Cluster The 3f+1 bound, where it comes from, and how quorum sizes must change when a faulty node can lie rather than merely stop. distributed systems
Mar 25, 2025 Quorum Intersection and Why R + W Must Exceed N The arithmetic that guarantees a read sees the latest write, how sloppy quorums break it, and what read repair has to do to restore the guarantee. filesystems
Jan 27, 2025 Quorum Placement and the Latency of the Second-Fastest Replica How the geometry of replica placement decides commit latency for majority quorums, and why adding a distant replica to a three-node group can be free or fatal. cloud infrastructure
Jan 26, 2025 Producer Batching, Compression, and Acknowledgment Pipelining A produce request has a fixed cost per round trip and per replica, and batching, compression, and in-flight limits each trade latency for a different part of that cost. backend systems
Jan 23, 2025 Optimistic Concurrency and the Conflict Check That Arrives Too Late How version-token conflict detection works in a replicated store, why it cannot prevent a conflicting write, and what the abandoned Bayou and Coda designs revealed about the cost of checking after the fact. computing history
Dec 18, 2024 Space-Based Architecture and the In-Memory Data Grid Removing the shared database removes the contention and makes memory the capacity limit. Replication windows, eviction, and write-behind persistence decide how much data loss the style concedes. software architecture
Nov 15, 2024 Read Repair and Hinted Handoff on the Write Path How leaderless stores bring lagging replicas forward without a full scan, why hinted handoff is a temporary buffer rather than a repair, and where each mechanism fails under sustained failure. distributed systems
May 6, 2024 Session Guarantees: Read-Your-Writes and Monotonic Reads How four per-session guarantees are implemented with version tracking, why they are cheaper than global consistency, and where client redirection breaks them. distributed systems
Apr 12, 2024 Shard Routing and Replica Consistency in Distributed Search How a search index is split across many machines, how a query fans out to shards and merges their results, and how replicas stay consistent with their primary shards. information retrieval
Mar 4, 2024 Reed-Solomon Codes: The k-of-n Arithmetic and Its Repair Cost How a Reed-Solomon code turns k data fragments into n, why any k reconstruct the whole object, and what the encoding matrix demands of the arithmetic. filesystems
Dec 11, 2023 Quorum Intersection and the Arithmetic of Stale Reads Why R + W > N guarantees a read sees the latest acknowledged write, what that inequality does not guarantee, and how sloppy quorums and read-your-writes routing break it. distributed systems
Sep 27, 2023 Synchronous and Asynchronous Replication: Where the Commit Point Sits How the moment a write is acknowledged determines durability, latency, and the amount of data a failover can lose, and why semi-synchronous replication is the usual compromise. distributed systems
Jun 23, 2023 The Replication Log as the Ordering Unit in Single-Leader Replication Why single-leader replication ships a serialised change log rather than rows, how log positions act as a logical clock, and where the ordering guarantee stops. databases