EUVIMEDEUVIMED entdecken
Crossref

ORDER: Optimal Routing with Path Indexing in Exchange Graph [Data-Intensive & Data Science Application]

Bingqiao Luo, Yuhang Chen, Yuheng Cong, Ziyu He, Jiaxin Jiang, Shixuan Sun, Bingsheng He, Wee Howe Ang

Proceedings of the ACM on Management of Data · 18.05.2026 · 4 (3) · 1-27

DOI: 10.1145/3802097 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Proceedings of the ACM on Management of Data, online erschienen am 18.05.2026. Verfasst von Bingqiao Luo und 7 weiteren Autor:innen. Die Arbeit nennt 61 Literaturangaben. Gefördert von: National Natural Science Foundation of China, National Research Foundation, Singapore and Infocomm Media Development Authority under its Trust Tech Funding Initiative.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We study the problem of optimal routing on financial exchange graphs. Given a directed graph G = ( V , E ) where vertices represent assets and edges encode tradable pairs with effective exchange rates and capacities, the goal is to find a sequence of routes from a source asset to a target asset that maximizes the delivered output. This problem is data-intensive and time-critical, requiring real-time decisions under fragmented liquidity, size-dependent prices, heterogeneous fees, and tight capacity limits. To address the challenges, we present ORDER: O ptimal R outing with path in D exing in E xchange g R aphs, a high-efficiency routing solution for fast, iterative execution in financial exchange graphs. ORDER introduces a hierarchical bucket path index that localizes maintenance to impacted candidates and eliminates expensive global rescans. It further incorporates lazy computation and an adaptive controller for active-bucket sizing to stabilize update cost under discrete tier shifts and heterogeneous market depths. On real-world DeFi datasets, ORDER achieves up to 114× speedup over state-of-the-art routers while preserving execution quality.We also demonstrate robustness across market regimes and token pairs, enabling timely, high-quality routing.

Förderung

  • National Natural Science Foundation of China
  • National Research Foundation, Singapore and Infocomm Media Development Authority under its Trust Tech Funding Initiative

Zitieren

APA

Luo, B., Chen, Y., Cong, Y., He, Z., Jiang, J., Sun, S., He, B., & Ang, W. H. (2026). ORDER: Optimal Routing with Path Indexing in Exchange Graph [Data-Intensive & Data Science Application]. Proceedings of the ACM on Management of Data, 4(3), 1-27. https://doi.org/10.1145/3802097

Vancouver

Luo B, Chen Y, Cong Y, He Z, Jiang J, Sun S, et al. ORDER: Optimal Routing with Path Indexing in Exchange Graph [Data-Intensive & Data Science Application]. Proceedings of the ACM on Management of Data. 2026;4(3):1-27. doi:10.1145/3802097

BibTeX
@article{Luo2026,
  author = {Luo, Bingqiao and Chen, Yuhang and Cong, Yuheng and He, Ziyu and Jiang, Jiaxin and Sun, Shixuan and He, Bingsheng and Ang, Wee Howe},
  title = {ORDER: Optimal Routing with Path Indexing in Exchange Graph [Data-Intensive & Data Science Application]},
  journal = {Proceedings of the ACM on Management of Data},
  year = {2026},
  volume = {4},
  number = {3},
  pages = {1--27},
  doi = {10.1145/3802097}
}
Kostenlos starten →