This is a specific form of weak consistency where the storage system guarantees that eventually all accesses will return the last updated value when writes quiesce. In the absence of failures occurring, the maximum amount of the inconsistency window can be computed (looking at things such as network delays and the load).

One example of this type of system is Domain Name System (DNS). Updates to a name are distributed according to a set pattern, thus not all nodes will have the latest information during the initial update phase. A few nodes host caches with time-to-live (TTL) and they will get the latest update after the caches expire.

For eventual consistency, there are a whole slew of models to consider when figuring out guarantees during the inconsistency window. These are described in the next section.