{"paper_id":"2609.32848","title":"Packets, Transactions and Queues: Design Principles for HFT Systems from a Measurement Study of CME Market Data","authors":["Vincent Maciejewski"],"paper_date":"2026-09-26","paper_type":"empirical","paper_url":"https://arxiv.org/pdf/2609.32848","page_url":"https://thequant.space/flowcharts/packets-transactions-and-queues-design-principles-for-hft-systems-from-a/","scores":{"empirical_rigor":9,"math_complexity":7.5,"quadrant":"Holy Grail"},"proposes":{"status":"available","statement":"The paper proposes design principles for HFT receivers that depend on the relationship between packet arrival bursts and the publisher period, recommending a single thread when handling each packet within one publisher period and a two‑stage split when service times exceed that period.","quote":"This yields design principles for HFT systems. First, a receiver that handles each packet within one publisher period never queues on arrivals, however bursty the market; there one thread is best.","summary":"HFT systems are conventionally built as a single-threaded event loop, on the rule that every thread hop adds latency. We test that rule against a measurement study of more than a year of CME market data for the NQ front-month contract, following every packet and matching-engine transaction through…","strategy":null},"assumptions":{"status":"available","items":[{"assumption":"Every thread hop adds latency, motivating a single‑threaded event loop as the baseline design.","type":"execution","stated":"explicit","quote":"HFT systems are conventionally built as a single-threaded event loop, on the rule that every thread hop adds latency.","support":"full"},{"assumption":"Packet arrivals form near‑critical self‑exciting clusters that correspond to matching‑engine transactions.","type":"market","stated":"explicit","quote":"Packets arrive in near-critical self-exciting clusters that belong to the matching engine's transactions, not to how the exchange packs them.","support":"full"},{"assumption":"The matching engine can process consecutive transactions within a fraction of a microsecond, faster than the publisher’s ~7.5 µs packet period.","type":"market","stated":"explicit","quote":"The engine often processes consecutive transactions within a fraction of a microsecond, while the market-data publisher sends at most one packet per publisher period of about 7.5 microseconds, so a burst reaches the receiver as a train of packets one period apart.","support":"full"},{"assumption":"Service time per packet is the dominant factor for queueing; if a receiver processes a packet faster than the publisher period it never queues on arrivals.","type":"model","stated":"explicit","quote":"First, a receiver that handles each packet within one publisher period never queues on arrivals, however bursty the market; there one thread is best.","support":"full"},{"assumption":"When service time exceeds the publisher period, a queueing tail appears that is driven by transaction timing rather than packet rate or size.","type":"model","stated":"explicit","quote":"Second, above that period a queueing tail appears, driven by the timing of transactions, not by packet rate or size, and two threads can be better than one: splitting the servicing chain into two stages on separate threads removes most of the tail at the cost of one hop on the median.","support":"full"},{"assumption":"Only the slowest stage in a multi‑stage processing chain determines tail reduction; splitting stages only helps if it shortens that slowest stage.","type":"model","stated":"explicit","quote":"Third, only the slowest stage matters, so a split pays only if it shortens it.","support":"full"}]},"datasets":{"status":"available","items":[{"name":"CME market data for the NQ front‑month contract (one year of packets and matching‑engine t","provider":"CME","kind":"market-prices","access":"proprietary","period":"one year","universe":"NQ front‑month","quote":"We test that rule against a measurement study of more than a year of CME market data for the NQ front-month contract, following every packet and matching-engine transaction through the feed's two exchange timestamps, and checking the results against a live production receiver. 13 Conclusion This paper measured a real exchange feed, over a year of NQ packets and matching-engine transactions, from the matching engine","support":"full"}],"known":[],"sample":{"start":null,"end":null,"market":null,"asset_class":null,"frequency":null},"data_resolution":"unclear"},"transaction_costs":{"status":"not_applicable","modeled":"n/a","headline_net_of_costs":null,"detail":null,"quote":null,"source":"front_matter","rule":"R3","candidates":{"front_matter":"n/a","evidence_card":"n/a","evidence_card_quoted":false},"meaning":"the paper reports no trading or execution result"},"results":{"status":"available","evaluation_type":"none","findings":[{"finding":"A receiver that handles each packet within one publisher period never queues on arrivals, regardless of burstiness; a single thread is optimal in this regime.","kind":"theoretical","quote":"First, a receiver that handles each packet within one publisher period never queues on arrivals, however bursty the market; there one thread is best.","support":"full"},{"finding":"When service times exceed the publisher period, a queueing tail appears, and splitting the processing chain into two threads removes most of the tail at the cost of one hop on the median.","kind":"theoretical","quote":"Second, above that period a queueing tail appears, driven by the timing of transactions, not by packet rate or size, and two threads can be better than one: splitting the servicing chain into two stages on separate threads removes most of the tail at the cost of one hop on the median.","support":"full"},{"finding":"Only the slowest stage matters for tail reduction; a split only pays off if it shortens that stage.","kind":"theoretical","quote":"Third, only the slowest stage matters, so a split pays only if it shortens it.","support":"full"},{"finding":"For receivers already operating just under the publisher period, the remaining tail is caused by multi‑message packets and variable service times, not by thread count.","kind":"theoretical","quote":"Fourth, just under the period, where the production receiver runs, the remaining tail comes from multi-message packets and variable service times, and the levers are cost per message and spread of service, not thread count. The first is long packets.","support":"full"},{"finding":"The matching engine processes transactions sub‑microsecond apart, but the publisher can only emit packets at ~7.5 µs intervals, creating burst trains that drive the receiver’s tail.","kind":"other","quote":"The engine often processes consecutive transactions within a fraction of a microsecond, while the market-data publisher sends at most one packet per publisher period of about 7.5 microseconds, so a burst reaches the receiver as a train of packets one period apart. The matching engine often processes one transaction less than a microsecond after the previous one (Table 13).","support":"full"}],"reported_performance":null,"out_of_sample":{"method":"none","headline_out_of_sample":null}},"independent_evidence":{"status":"none_found","supports":[],"contradicts":[],"qualifies":[],"compared_with":14,"citations":{"cited_by_in_corpus":0,"by_independent_authors":0,"how_cited":{"used_as_baseline":0,"uses_method_or_data":0,"extends":0,"discusses_findings":0,"mentions":0,"unclassified":0},"independent_papers":[],"scope":"Citations between papers in this corpus only; citations from outside it are not counted."}},"implementation":{"status":"available","public":true,"code_url":"https://github.com/vincent212/kaspar-hft","note":null},"replication":{"status":"none_found","card":null,"note":"No replication of this paper has been run by thequant.space yet."},"extraction":{"text_source":"fulltext","model":"openai/gpt-oss-120b","version":2,"extracted_at":"2026-11-14T19:39:28Z"},"provenance":{"claims":"Everything here is what the authors state in the paper. Nothing was re-run or reproduced by the platform.","quotes":"Assumptions, datasets, cost detail and findings were extracted by a language model. Every quote is verbatim paper text. Where an item has `support`, \"full\" means every figure in it appears in the quoted sentences and \"partial\" means a figure is stated elsewhere in the paper; items with a figure found nowhere in the paper were discarded.","datasets_known":"datasets.known lists well-known vendors and public datasets by a stable id, found by a dictionary over the full text where the sentence says the data is used; it is independent of the model and covers only names in the dictionary.","flags":"transaction_costs.modeled, results.evaluation_type and results.out_of_sample.method are platform classifications (structured-decision models); see https://thequant.space/score-guide/#penalty-flags","comparisons":"supports / contradicts / qualifies are a language model's reading of two papers' quoted findings, restricted to closely related papers that share no author. They are pointers to read, not verified replications, and coverage is partial.","implementation":"code_url is a repository the paper itself presents as its own (rule-scored, ambiguous cases judged by a model), checked for liveness when it was recorded."},"docs":"https://thequant.space/agents/"}