At-least once semantics

Skip to end of metadata
Go to start of metadata
You are viewing an old version of this page. View the current version. Compare with Current  |   View Page History

Categories of Message Delivery Reliability

  • at-most-once delivery means that for each message handed to the mechanism, that message is delivered zero or one times; in more casual terms it means that messages may be lost.
  • at-least-once delivery means that for each message handed to the mechanism potentially multiple attempts are made at delivering it, such that at least one succeeds; again, in more casual terms this means that messages may be duplicated but not lost.
  • exactly-once delivery means that for each message handed to the mechanism exactly one delivery is made to the recipient; the message can neither be lost nor duplicated.

The first one is the cheapest—highest performance, least implementation overhead—because it can be done in a fire-and-forget fashion without keeping state at the sending end or in the transport mechanism. The second one requires retries to counter transport losses, which means keeping state at the sending end and having an acknowledgement mechanism at the receiving end. The third is most expensive—and has consequently worst performance—because in addition to the second it requires state to be kept at the receiving end in order to filter out duplicate deliveries.

Direct quote from Akka, Message Delivery Reliability. Other introductions: Kafka Message Delivery Semantics or Distributed systems – theory.

Why at-least once semantics is popular

  • Exactly-once semantics makes it easier for application developers, because they can ignore duplicates. The cost is poor scalability, because implementations often rely on transactional serializability across distributed systems, aka. distributed transactions.
Enter labels to add to this page:
Please wait 
Looking for a label? Just start typing.