The Software Engineer position at QTS sits at the intersection of enterprise software development, data center infrastructure, and mission-critical automation. You will design, build, and maintain robust software solutions that support hyperscale data center operations, building management systems, and internal enterprise platforms. Your work directly enables reliable facility monitoring, scalable network operations, and seamless data management across national data center footprints. This role carries substantial business impact because data center uptime depends on the reliability, speed, and accuracy of internal tooling and automation software. Whether you are developing platform features, integrating facility management systems, or scaling enterprise workflows, your code ensures that operations teams maintain real-time visibility and control. The technical landscape spans modern development frameworks, cloud infrastructure, enterprise IT services, and specialized data center tools such as DCIM and BMS infrastructure. Expect a fast-paced environment where software craftsmanship meets physical infrastructure constraints. You will collaborate closely with infrastructure teams, network engineers, project managers, and senior leadership to deliver high-impact solutions.
Initial Screening
reportedThe first stage where candidates are screened to assess their basic qualifications.
What to demonstrate
- The first stage where candidates are screened to assess their basic qualifications
- Depth in Data Center Infrastructure Management (DCIM)
How to prepare
- Be able to walk your CV end to end in two minutes, and say why this company specifically.
- Have your salary expectations, notice period and location constraints ready, and ask for the rest of the loop in writing.
Technical Interview
reportedCandidates participate in interviews focusing on their technical capabilities.
What to demonstrate
- Candidates participate in interviews focusing on their technical capabilities
- Depth in Data Center Infrastructure Management (DCIM)
How to prepare
- Answer aloud and timed: 1–2 sentences introducing the category and what it tests.
- Answer aloud and timed: Bullet list of realistic example questions: Explain the OSI model and how routing protocols, switching, STP, and DNS interact in a network topology. STS and ATS, UPS, and integrated system testing: how do you monitor and validate these components programmatically? If two generators are running parallel and are supposed to be equally sharing load, but you see that one is carrying more than the other, what would you check first? How do you handle virtual machine disk expansions and memory upgrades without causing downtime?
Behavioral Interview
reportedInterviews aimed at evaluating the candidate's fit within the QTS culture.
What to demonstrate
- Interviews aimed at evaluating the candidate's fit within the QTS culture
- Depth in Data Center Infrastructure Management (DCIM)
How to prepare
- Prepare three examples from your own work, each with a decision you made and an outcome you can quantify.
- Re-read the description of the behavioral interview above and write down what you would ask to confirm before it.
PracHub editorial advice for the preparation topics above.
Embrace operational context
Show interviewers you understand that software at QTS interacts with physical infrastructure, power systems, and facility management tools.
Structure your behavioral stories
Use the STAR method to clearly articulate the situation, task, action, and result when discussing past project mistakes or successes.
Ask insightful questions
Demonstrate your engagement by asking interviewers about team culture, technical debt, and how software directly supports data center uptime.
Be transparent about compensation
Know your salary expectations early, as recruiters will discuss compensation ranges during initial screening calls.
Follow up professionally
Send timely thank-you notes to your interviewers and maintain clear communication with your recruiting contact throughout the process.
Choose a category, try a prompt, then open its approach, worked solution or follow-up when you need it.
Track a rolling failure rate per destination for circuit decisions
The egress service delivers about 1,500 webhooks per second across roughly 40,000 destinations, each call bounded by a 10 second timeout. Maintain, per destination, the failure rate over the trailing 60 seconds so a caller can ask before dispatch whether the circuit should open. Attempts arrive as (destination_id, finished_at_ms, outcome). Requirement: amortised O(1) per attempt, with total memory bounded by the destination count rather than by traffic. Give the structure, its exact memory, and the rule that stops a destination with three attempts from opening a circuit.
Approach
- Name the exact-deque version and then reject it as the default. Holding timestamps and advancing a tail pointer past anything older than now minus 60 seconds is a correct two-pointer window at amortised O(1) per attempt, but its memory tracks in-window traffic, so one destination in a retry storm holds hundreds of thousands of entries while thousands of quiet destinations hold none.
- Use a ring of 60 one-second buckets per destination, each bucket a pair of counters for attempts and failures. On an attempt, advance the ring by the elapsed whole seconds, zeroing at most min(elapsed, 60) buckets, then increment the head. That is amortised O(1) with a fixed footprint per destination.
- State the footprint: 60 buckets times two 4-byte counters is 480 bytes of payload per destination, so 40,000 destinations is roughly 20 to 25 MB with per-entry overhead, bounded by the catalogue rather than by the rate. The cost is granularity, since the oldest bucket ages out in whole seconds, which is far tighter than the decision needs.
- Require a minimum sample before the circuit may open. A destination with three attempts and three failures reads as 100 percent and is not evidence; a floor of roughly 20 attempts in the window makes the ratio meaningful, and below that floor use a run of consecutive failures as the trigger instead.
Follow-up
- The fleet is 30 instances and each sees roughly a thirtieth of a destination's traffic. Where does the rate actually live, and what does a per-instance answer get wrong?
- A destination answers in 9.5 seconds and succeeds. It is not failing but it is consuming your per-destination concurrency. What signal should open the circuit here?
Merge partitioned event streams into one ordered feed with bounded lateness
The read-model service consumes 64 log partitions carrying about 4,000 events per second in total. Each partition is ordered within itself, but partitions drift by up to 30 seconds, and the activity feed must present a tenant's events in occurred_at order. Produce the merge. State its complexity, the buffer it requires in events and in bytes, what happens when one partition is idle, and what you do with an event that arrives after you have already emitted its position. Payloads average 1 KB.
Approach
- Merge with a min-heap over the 64 partition heads keyed on (occurred_at, event_id): O(log P) per event and O(n log P) overall. The tie-break on event_id is what makes the output deterministic when two partitions carry the same millisecond, which matters because the feed is paginated and a non-deterministic order reorders pages under the reader.
- Emitting the heap head is only correct once every partition has produced everything up to that timestamp, so the emit condition is a watermark: the minimum across partitions of the highest occurred_at seen, less the allowed lateness. Events are held until the watermark passes them, which is what turns individually ordered streams into a jointly ordered one.
- Size the buffer from the lateness rather than guessing: 4,000 events per second times 30 seconds is 120,000 buffered events, and at 1 KB each about 120 MB of heap. That number is the real price of the ordering guarantee and belongs in front of whoever asked for it.
- Handle the idle partition explicitly, because it fails the feed rather than corrupting it: a partition with no traffic never advances its own maximum, so the watermark freezes and output stops entirely. Either every partition emits a periodic idle marker carrying the broker's current time, or the watermark falls back to wall clock for a partition silent beyond a threshold.
Follow-up
- The lateness budget is raised to five minutes. What is the new buffer, and what besides memory changes?
- The consumer restarts. Where does it resume from, and what does the feed look like for the first 30 seconds?
Canonicalise a request body into a stable idempotency fingerprint
idempotency_key.request_fingerprint is a SHA-256 over the method, path and canonicalised body, and a retry whose fingerprint differs must be rejected with 422 rather than served the stored response. Write the canonicaliser. Bodies are JSON up to 256 KB nested at most 32 levels; clients vary key order, whitespace and unicode escaping, and some send 64-bit ids as JSON numbers. Produce a deterministic byte string such that semantically identical bodies match and any semantic difference does not. State your complexity and name two normalisations you refuse to perform.
Approach
- Parse once into a tree, then re-serialise under fixed rules: object keys sorted, array order preserved, one escaping convention, no insignificant whitespace. Parsing is O(n) and sorting keys is O(k log k) per object, so O(n log n) overall with O(depth) stack, and the 32-level cap is enforced during parsing because hostile nesting is how a canonicaliser becomes a stack overflow.
- Sort keys by their UTF-8 bytes and say why the obvious implementation is wrong in some runtimes: a default string comparison that orders by UTF-16 code units places surrogate pairs, meaning code points from U+10000 up, below U+E000 to U+FFFF, which is not UTF-8 byte order, so two services written in different languages disagree on the same document.
- Do not re-encode numbers through a double. IEEE-754 binary64 represents integers exactly only up to 2^53, so normalising a 19-digit id through a float changes it, and 1 against 1.0 cannot be reconciled without deciding whether they are the same value. Preserve the literal token, and require ids as strings at the API boundary if you want them comparable.
- Reject duplicate keys rather than picking one. JSON permits them and parsers disagree, most keeping the last, so any choice you make ties the fingerprint to a parser detail that the code handling the request does not necessarily share.
Follow-up
- A client sends the same logical request with an extra field your API ignores. Same key, different fingerprint, so you return 422. Is that the right answer?
- Where does the fingerprint get computed relative to request decompression and the body-size limit?
Find version gaps and relay lag with window functions
outbox_event holds event_id, aggregate_type, aggregate_id, aggregate_version, event_type, payload, status ('pending','published','dead'), attempts, created_at, published_at. A projection is missing rows and you must decide whether the relay skipped events or the consumer dropped them. Write three queries over the last seven days: one listing every aggregate_id whose published aggregate_version sequence has a hole, one giving per-day counts with a running total, and one returning the newest published event per aggregate. For each, say where the window function is evaluated relative to WHERE and LIMIT. PostgreSQL 16.
Approach
- Gaps: compute lead(aggregate_version) OVER (PARTITION BY aggregate_id ORDER BY aggregate_version) in a subquery, then filter next_version <> aggregate_version + 1 in the outer query. Window functions are evaluated after WHERE, GROUP BY and HAVING and before the outer ORDER BY and LIMIT, so the predicate cannot sit in the same WHERE clause and PostgreSQL 16 has no QUALIFY.
- Say what the seven-day filter does to the answer: it truncates every partition, so the first row per aggregate has no predecessor inside the window and a hole spanning the boundary is invisible. Widen the window, or join to resource.version as the authority for the true maximum.
- Running total: SELECT date_trunc('day', created_at) AS d, count() AS n, sum(count()) OVER (ORDER BY date_trunc('day', created_at) ROWS UNBOUNDED PRECEDING). An aggregate inside a window call is legal because grouping runs before windowing. The grouping key is unique per row here so ROWS and RANGE agree, but write the frame anyway — over ungrouped rows with tied timestamps the default RANGE frame pulls in every peer row and the total jumps.
- Newest per aggregate: DISTINCT ON (aggregate_id) ... ORDER BY aggregate_id, aggregate_version DESC is the cheap PostgreSQL-only form when an index matches that order; row_number() OVER (PARTITION BY aggregate_id ORDER BY aggregate_version DESC) = 1 is the portable form and needs a subquery for the same evaluation-order reason as the gap query.
Follow-up
- Relay failover redelivers events. Does a duplicate break the gap query, and how would you detect one from this table alone?
- Turn the gap check into a continuous monitor rather than a query someone runs after an incident. What does it watch?
Denormalise tenant onto revisions and backfill it live
resource_revision (revision_id, resource_id, version, actor_user_id, change_kind, patch, request_id, created_at) has 400M rows and no tenant column; tenant_id lives only on resource. Two reads need it: a tenant-scoped audit feed ordered by created_at DESC, and an offboarding purge. Both join back to resource today. Justify adding tenant_id to resource_revision against those two reads, name the anomaly the copy introduces and the constraint that prevents it, then give the ordered migration for a live table taking 1.2k writes/second — the lock each step takes, how the backfill is batched, and where each step stops being reversible. PostgreSQL 16.
Approach
- Justify from the access path rather than from taste. Without the column, the audit feed either scans resource_revision by created_at and discards other tenants' rows, or resolves the tenant's resource_ids first and probes with them — both proportional to the tenant's whole history rather than to one page. With (tenant_id, created_at DESC, revision_id DESC) it is a seek that stops at 50 rows, and the purge becomes a ranged delete instead of a join.
- Name the cost exactly: a second copy of a fact can disagree with the first. Make the disagreement unwritable rather than documented — add UNIQUE (resource_id, tenant_id) on resource so it can serve as a foreign-key target, then FOREIGN KEY (resource_id, tenant_id) REFERENCES resource (resource_id, tenant_id) on the revision table. A revision can then only ever carry its parent's tenant.
- Step one, expand: ALTER TABLE resource_revision ADD COLUMN tenant_id BIGINT NULL, with no default, so it is a catalogue change and no rewrite. It still needs ACCESS EXCLUSIVE for an instant, and that instant queues behind the longest open transaction on the table while every later query queues behind it — set lock_timeout to 2s and retry rather than wait.
- Step two, dual-write: deploy the writer that populates tenant_id on every new revision while reads still use the join. Reversible by redeploying the previous build, because nothing reads the column yet.
Follow-up
- The backfill is half finished and a rollback is required. What state is the table in, and what does the previous build do with a half-populated column?
- How do you verify the backfill actually finished, given rows are still being inserted while it runs?
1–2 sentences introducing the category and what it tests.
1–2 sentences introducing the category and what it tests.
Approach
- Say who the caller is and what they do when the call fails halfway.
- Define the identity of a request so a retry cannot double-apply it.
- Separate accepted, pending, failed and confirmed; they are different facts.
- Design the error taxonomy before the success shape; callers branch on it.
Follow-up
- What happens if the caller retries after a timeout?
- How does a client discover it is on an old version of this contract?
1–2 sentences introducing the category and what it tests.
1–2 sentences introducing the category and what it tests.
Approach
- Fix the scope first: who calls this, how often, and what they do when it fails.
- Name the read and write paths separately; they rarely have the same bottleneck.
- Choose a partition key and say what query it makes expensive.
- State the consistency you need, and where you are willing to be stale.
Follow-up
- What breaks first when traffic grows ten times?
- How does this behave when that dependency is down for an hour?
p99 jumped on one listing filter while p50 stayed flat
After a release that added an owner_user_id filter to the resource listing, p99 rose from 90 ms to 1.9 s while p50 stayed at 40 ms. Traffic and row counts are unchanged. resource carries the index (tenant_id, status, updated_at DESC, resource_id DESC). The new query filters tenant_id and owner_user_id, orders by updated_at DESC, resource_id DESC, and takes 20 rows. On PostgreSQL, explain the shape of the regression, prove it from a query plan, and give the index you would add.
Approach
- Start from the shape. A flat p50 with a moved p99 means a subset of requests changed cost, not all of them, so the first job is naming the subset. Bucket the endpoint's latency by the tenant's row count; the natural hypothesis is that large tenants are a small share of requests and all of the tail.
- Get the plan for the new query on a large tenant with EXPLAIN (ANALYZE, BUFFERS). Expect an index scan over the tenant's range, a filter discarding most of it, then a Sort feeding the Limit, possibly reporting Sort Method: external merge Disk. Read actual rows on the scan node, not estimated.
- Explain why the existing index cannot serve it. A composite B-tree is seekable only as a left prefix, and with no equality predicate on status the scan cannot treat updated_at as an ordering, because rows in the tenant's range are ordered by status first. Everything matching must be read and sorted before LIMIT 20 can apply, so a tenant with 400,000 rows pays 400,000 rows to return 20.
- Add (tenant_id, owner_user_id, updated_at DESC, resource_id DESC). Equality on the first two columns leaves the index ordered by updated_at within that pair, so the plan becomes an index scan that stops after 20 rows with no Sort node. PostgreSQL can scan a B-tree backwards, so the DESC markers matter only if the two sort columns ever disagree in direction; keeping them explicit documents the order the keyset cursor depends on.
Follow-up
- The endpoint paginates with OFFSET. What does page 500 cost with your index, and what does the keyset version cost?
- How would you have caught this before release, given that a 10,000-row seed database produces the same plan shape at an unnoticeable cost?
Built from the rounds and topics QTS candidates report.
Prepare, practise & reflect
One practical outcome each day. Spend longer where you need it.
0 / 7 done01Map the QTS loop
- Write out the reported sequence: Initial Screening, Technical Interview, Behavioral Interview.
- For each round, write one sentence on what it is judging, from the description above, and mark the one you are least ready for.
Deliverable: A one-page map of the 3 reported rounds, with the weakest marked.
02Work Data Center Infrastructure Management (DCIM)
- Spend the session on Data Center Infrastructure Management (DCIM), which QTS candidates report being tested on.
- Write one worked example in Data Center Infrastructure Management (DCIM) and time yourself on it.
Deliverable: One timed worked example in Data Center Infrastructure Management (DCIM).
03Work Integrated System Testing (IST)
- Spend the session on Integrated System Testing (IST), which QTS candidates report being tested on.
- Write one worked example in Integrated System Testing (IST) and time yourself on it.
Deliverable: One timed worked example in Integrated System Testing (IST).
04Work Active Directory (AD)
- Spend the session on Active Directory (AD), which QTS candidates report being tested on.
- Write one worked example in Active Directory (AD) and time yourself on it.
Deliverable: One timed worked example in Active Directory (AD).
05Answer out loud: Technical and Infrastructure Integration
- Answer aloud, timed: 1–2 sentences introducing the category and what it tests.
- Answer aloud, timed: Bullet list of realistic example questions: What is your experience with BMS infrastructure? What purpose do As-Builts serve and why do you believe they are important? Please explain a chiller plant operation and what role software plays in monitoring it. How do you approach standard coding tasks and debug unexpected software failures? What do you know about Active Directory, Group Policy, and enterprise IT support environments?
Deliverable: Spoken answers to 2 reported Technical and Infrastructure Integration question(s), under time.
06Answer out loud: System Architecture and Networking
- Answer aloud, timed: 1–2 sentences introducing the category and what it tests.
- Answer aloud, timed: Bullet list of realistic example questions: Explain the OSI model and how routing protocols, switching, STP, and DNS interact in a network topology. STS and ATS, UPS, and integrated system testing: how do you monitor and validate these components programmatically? If two generators are running parallel and are supposed to be equally sharing load, but you see that one is carrying more than the other, what would you check first? How do you handle virtual machine disk expansions and memory upgrades without causing downtime?
Deliverable: Spoken answers to 2 reported System Architecture and Networking question(s), under time.
07Answer out loud: Behavioral and Scenario-Based
- Answer aloud, timed: 1–2 sentences introducing the category and what it tests.
- Answer aloud, timed: Bullet list of realistic example questions: Why do you want to work for QTS? Describe a time when you realized you and or your team made a mistake that had a large impact to the project. What was the solution and timeline to take corrective action? Have you ever been pressured to sign off a project prematurely, and how did you handle it? How do you handle working in a team environment and dealing with negative co-workers?
Deliverable: Spoken answers to 2 reported Behavioral and Scenario-Based question(s), under time.
Expand any day for tasks and deliverables. Your progress is saved on this device.
Behavioural rounds judge the decision you made and what it cost.
Bullet list of realistic example questions: What is your experience with BMS infrastructure? What purpose do A
Bullet list of realistic example questions: What is your experience with BMS infrastructure? What purpose do As-Builts serve and why do you believe they are important? Please explain a chiller plant operation and what role software plays in monitoring it. How do you approach standard coding tasks and debug unexpected software failures? What do you know about Active Directory, Group Policy, and enterprise IT support environments?
Approach
- Pick a story where you made the decision, not one where you watched it.
- State the situation in two sentences and spend the rest on the reasoning.
- Give the blast radius: what could have broken, and what you measured.
- Name the disagreement and how you resolved it with evidence.
Follow-up
- What would you do differently if you ran that again?
- How did you know your change caused the improvement?
Bullet list of realistic example questions: Explain the OSI model and how routing protocols, switching, STP, a
Bullet list of realistic example questions: Explain the OSI model and how routing protocols, switching, STP, and DNS interact in a network topology. STS and ATS, UPS, and integrated system testing: how do you monitor and validate these components programmatically? If two generators are running parallel and are supposed to be equally sharing load, but you see that one is carrying more than the other, what would you check first? How do you handle virtual machine disk expansions and memory upgrades without causing downtime?
Approach
- Pick a story where you made the decision, not one where you watched it.
- State the situation in two sentences and spend the rest on the reasoning.
- Give the blast radius: what could have broken, and what you measured.
- Name the disagreement and how you resolved it with evidence.
Follow-up
- What would you do differently if you ran that again?
- How did you know your change caused the improvement?
1–2 sentences introducing the category and what it tests.
1–2 sentences introducing the category and what it tests.
Approach
- Pick a story where you made the decision, not one where you watched it.
- State the situation in two sentences and spend the rest on the reasoning.
- Give the blast radius: what could have broken, and what you measured.
- Name the disagreement and how you resolved it with evidence.
Follow-up
- What would you do differently if you ran that again?
- How did you know your change caused the improvement?
Bullet list of realistic example questions: Why do you want to work for QTS? Describe a time when you realized
Bullet list of realistic example questions: Why do you want to work for QTS? Describe a time when you realized you and or your team made a mistake that had a large impact to the project. What was the solution and timeline to take corrective action? Have you ever been pressured to sign off a project prematurely, and how did you handle it? How do you handle working in a team environment and dealing with negative co-workers?
Approach
- Pick a story where you made the decision, not one where you watched it.
- State the situation in two sentences and spend the rest on the reasoning.
- Give the blast radius: what could have broken, and what you measured.
- Name the disagreement and how you resolved it with evidence.
Follow-up
- What would you do differently if you ran that again?
- How did you know your change caused the improvement?
- 01
Bullet list of realistic example questions: What is your experience with BMS infrastructure? What purpose do As-Builts serve and why do you believe they are important? Please explain a chiller plant operation and what role software plays in monitoring it. How do you approach standard coding tasks and debug unexpected software failures? What do you know about Active Directory, Group Policy, and enterprise IT support environments?
- 02
Bullet list of realistic example questions: Explain the OSI model and how routing protocols, switching, STP, and DNS interact in a network topology. STS and ATS, UPS, and integrated system testing: how do you monitor and validate these components programmatically? If two generators are running parallel and are supposed to be equally sharing load, but you see that one is carrying more than the other, what would you check first? How do you handle virtual machine disk expansions and memory upgrades without causing downtime?
- 03
1–2 sentences introducing the category and what it tests.
- 04
Bullet list of realistic example questions: Why do you want to work for QTS? Describe a time when you realized you and or your team made a mistake that had a large impact to the project. What was the solution and timeline to take corrective action? Have you ever been pressured to sign off a project prematurely, and how did you handle it? How do you handle working in a team environment and dealing with negative co-workers?
How difficult is the interview process for a Software Engineer at QTS?
The interview process is generally rated as average in terms of difficulty, focusing heavily on practical problem-solving, behavioral alignment, and relevant technical foundations rather than obscure algorithmic puzzles.
QTS Software Engineer candidate reports ↗What is the typical timeline from the initial recruiter screen to a final offer?
The process typically moves efficiently, taking anywhere from two to four weeks from the initial screening call through the panel and manager interviews, though some specialized searches may take longer.
QTS Software Engineer candidate reports ↗What differentiates successful candidates from other applicants?
Successful candidates combine solid coding fundamentals with a genuine curiosity about data center operations, infrastructure technology, and how software impacts physical systems.
QTS Software Engineer candidate reports ↗Are remote work and hybrid options available for this role?
Work arrangements depend heavily on the specific team and location, with many engineering and infrastructure roles requiring onsite presence or hybrid schedules near major data center hubs.
QTS Software Engineer candidate reports ↗How should I prepare for the behavioral portions of the interview?
Prepare structured examples using the STAR method, focusing specifically on how you handled project challenges, collaborated with difficult team members, and took accountability for mistakes.
QTS Software Engineer candidate reports ↗What topics does QTS test in interviews?
QTS interviews most often cover Stakeholder Communication, Analytical Problem Solving, Stakeholder Management, Requirements Gathering, and Program Management. The exact emphasis depends on the specific role you apply for.
QTS Software Engineer candidate reports ↗Sources & methodology 3 sources ↗
No official company page is cited. Rounds and questions come from candidate reports and PracHub editorial material; each source shows the date it was read.
- 01QTS Software Engineer candidate reports ↗
Company-reported rounds, questions and FAQ.
Candidate reports · Accessed 2026-09-22 - 02PracHub Software Engineer practice ↗
PracHub practice material, not company-reported.
PracHub page · Accessed 2026-09-22 - 03PracHub preparation framework ↗
PracHub preparation guidance.
PracHub page · Accessed 2026-09-22
Explore related engineering environments and compare the preparation focus.
Vercel Software Engineer Interview Guide
Debugging practice for Vercel software engineer prep built on a reproduction you trust, narrowing to the smallest failing input, and changing one variable per run so the result stays attributable.
Together Ai Software Engineer Interview Guide
Failure-handling practice for Together Ai software engineer candidates: requests whose outcome a timeout leaves unknown, where a retry is safe, and deduplicating at the receiver instead of assuming exactly-once delivery.
Lambda Software Engineer Interview Guide
Failure-handling practice for Lambda software engineer candidates: requests whose outcome a timeout leaves unknown, where a retry is safe, and deduplicating at the receiver instead of assuming exactly-once delivery.
CoreWeave Software Engineer Interview Guide
Failure-handling practice for CoreWeave software engineer candidates: requests whose outcome a timeout leaves unknown, where a retry is safe, and deduplicating at the receiver instead of assuming exactly-once delivery.