جميع الكتب

مهني

1 Markets I: The Ecosystem and Exchange-Traded Marketsالأسواق عبر الإنترنت 2 Markets II: Rates, FX and Creditالأسواق عبر الإنترنت 3 Markets III: Commodities, Energy and Cryptoالأسواق عبر الإنترنت 4 Quantitative Methodsالأساليب عبر الإنترنت 5 Derivatives and Volatilityالمشتقات عبر الإنترنت 6 Rates, Credit, XVA and Riskالفائدة والائتمان والمخاطر عبر الإنترنت 7 Research Craft: Predictors, Backtests, Measurement, Portfoliosالبحث عبر الإنترنت 8 Strategies I: Equities and Futuresالاستراتيجيات عبر الإنترنت 9 Strategies II: Volatility, Relative Value, Macro and the Bank Desksالاستراتيجيات عبر الإنترنت 10 Microstructure and Executionالتنفيذ عبر الإنترنت 11 Market Making and High-Frequency Tradingصناعة السوق عبر الإنترنت 12 Machine Learning for Marketsتعلم الآلة عبر الإنترنت 13 Low-Latency Softwareالتكنولوجيا عبر الإنترنت 14 Networks, Hardware and Trading Infrastructureالتكنولوجيا عبر الإنترنت 15 Research, Data and Risk Platformsالتكنولوجيا عبر الإنترنت 16 The Desk and the Firmالشركة عبر الإنترنت 17 The Industry: Firms, Roles and Careersالمسارات المهنية عبر الإنترنت 18 The Interview Bookالمسارات المهنية عبر الإنترنت
التطبيقات حول المدرب تسجيل الدخول ابدأ القراءة

Quantitative Finance · المسرد

ما معنى Route racing, idempotency key؟

يُعرف أيضًا باسم: route racing · idempotency key

Definition 19.3 Networks, Hardware and Trading Infrastructure · الفصل 19 — Cross-Region Crypto Networks

Route racing sends the same message on several routes at once and uses the first copy to arrive. An idempotency key is an identifier the sender attaches to every copy of one message (for orders, the client order identifier) so that the receiver can recognise the copies and act on only one.

Simulation: the 99th-percentile one-way latency saved by racing, Tokyo to Singapore, against the best single route, as the routes’ correlation rises. At = 0 two routes save 1.6 and three 2.1\, m s; at = 0.9 both save about 50\, µ s. Data: fig_race.py, nw_race.race_rows().
Figure 19.2. Simulation: the 99th-percentile one-way latency saved by racing, Tokyo to Singapore, against the best single route, as the routes’ correlation rises. At ρ=0\rho = 0 two routes save 1.6 and three 2.1 ms2.1\,\mathrm{m}\mathrm{s}; at ρ=0.9\rho = 0.9 both save about 50 µs50\,\text{µ}\mathrm{s}. Data: fig_race.py, nw_race.race_rows().
Route racing, schematically: three copies of one order with one idempotency key; the venue keeps the first and must recognise the others. Under an open-only rule it rejects them while the order is open and accepts them as new orders once it has filled.
Figure 19.4. Route racing, schematically: three copies of one order with one idempotency key; the venue keeps the first and must recognise the others. Under an open-only rule it rejects them while the order is open and accepts them as new orders once it has filled.
اقرأ في الفصل →