{"_id":"14736","conference":{"end_date":"2023-05-05","location":"Bol, Brac, Croatia","name":"FC: Financial Cryptography and Data Security","start_date":"2023-05-01"},"status":"public","doi":"10.1007/978-3-031-47754-6_18","department":[{"_id":"KrCh"},{"_id":"KrPi"}],"oa_version":"None","project":[{"call_identifier":"H2020","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2024-01-08T09:36:36Z","type":"conference","acknowledgement":"Supported by the German Federal Ministry of Education and Research (BMBF), grant 16KISK020K (6G-RIC), 2021–2025, and ERC CoG 863818 (ForM-SMArt).","ec_funded":1,"publication":"27th International Conference on Financial Cryptography and Data Security","publisher":"Springer Nature","date_created":"2024-01-08T09:30:22Z","month":"12","publication_status":"published","alternative_title":["LNCS"],"quality_controlled":"1","date_published":"2023-12-01T00:00:00Z","volume":13950,"article_processing_charge":"No","citation":{"ieee":"M. Bastankhah, K. Chatterjee, M. A. Maddah-Ali, S. Schmid, J. Svoboda, and M. X. Yeo, “R2: Boosting liquidity in payment channel networks with online admission control,” in <i>27th International Conference on Financial Cryptography and Data Security</i>, Bol, Brac, Croatia, 2023, vol. 13950, pp. 309–325.","short":"M. Bastankhah, K. Chatterjee, M.A. Maddah-Ali, S. Schmid, J. Svoboda, M.X. Yeo, in:, 27th International Conference on Financial Cryptography and Data Security, Springer Nature, 2023, pp. 309–325.","apa":"Bastankhah, M., Chatterjee, K., Maddah-Ali, M. A., Schmid, S., Svoboda, J., &#38; Yeo, M. X. (2023). R2: Boosting liquidity in payment channel networks with online admission control. In <i>27th International Conference on Financial Cryptography and Data Security</i> (Vol. 13950, pp. 309–325). Bol, Brac, Croatia: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-47754-6_18\">https://doi.org/10.1007/978-3-031-47754-6_18</a>","ama":"Bastankhah M, Chatterjee K, Maddah-Ali MA, Schmid S, Svoboda J, Yeo MX. R2: Boosting liquidity in payment channel networks with online admission control. In: <i>27th International Conference on Financial Cryptography and Data Security</i>. Vol 13950. Springer Nature; 2023:309-325. doi:<a href=\"https://doi.org/10.1007/978-3-031-47754-6_18\">10.1007/978-3-031-47754-6_18</a>","chicago":"Bastankhah, Mahsa, Krishnendu Chatterjee, Mohammad Ali Maddah-Ali, Stefan Schmid, Jakub Svoboda, and Michelle X Yeo. “R2: Boosting Liquidity in Payment Channel Networks with Online Admission Control.” In <i>27th International Conference on Financial Cryptography and Data Security</i>, 13950:309–25. Springer Nature, 2023. <a href=\"https://doi.org/10.1007/978-3-031-47754-6_18\">https://doi.org/10.1007/978-3-031-47754-6_18</a>.","mla":"Bastankhah, Mahsa, et al. “R2: Boosting Liquidity in Payment Channel Networks with Online Admission Control.” <i>27th International Conference on Financial Cryptography and Data Security</i>, vol. 13950, Springer Nature, 2023, pp. 309–25, doi:<a href=\"https://doi.org/10.1007/978-3-031-47754-6_18\">10.1007/978-3-031-47754-6_18</a>.","ista":"Bastankhah M, Chatterjee K, Maddah-Ali MA, Schmid S, Svoboda J, Yeo MX. 2023. R2: Boosting liquidity in payment channel networks with online admission control. 27th International Conference on Financial Cryptography and Data Security. FC: Financial Cryptography and Data Security, LNCS, vol. 13950, 309–325."},"intvolume":"     13950","title":"R2: Boosting liquidity in payment channel networks with online admission control","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783031477539"],"eisbn":["9783031477546"],"issn":["0302-9743"]},"page":"309-325","day":"01","language":[{"iso":"eng"}],"author":[{"full_name":"Bastankhah, Mahsa","first_name":"Mahsa","last_name":"Bastankhah"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"first_name":"Mohammad Ali","last_name":"Maddah-Ali","full_name":"Maddah-Ali, Mohammad Ali"},{"full_name":"Schmid, Stefan","last_name":"Schmid","first_name":"Stefan"},{"last_name":"Svoboda","orcid":"0000-0002-1419-3267","first_name":"Jakub","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","full_name":"Svoboda, Jakub"},{"first_name":"Michelle X","last_name":"Yeo","full_name":"Yeo, Michelle X","id":"2D82B818-F248-11E8-B48F-1D18A9856A87"}],"abstract":[{"lang":"eng","text":"Payment channel networks (PCNs) are a promising technology to improve the scalability of cryptocurrencies. PCNs, however, face the challenge that the frequent usage of certain routes may deplete channels in one direction, and hence prevent further transactions. In order to reap the full potential of PCNs, recharging and rebalancing mechanisms are required to provision channels, as well as an admission control logic to decide which transactions to reject in case capacity is insufficient. This paper presents a formal model of this optimisation problem. In particular, we consider an online algorithms perspective, where transactions arrive over time in an unpredictable manner. Our main contributions are competitive online algorithms which come with provable guarantees over time. We empirically evaluate our algorithms on randomly generated transactions to compare the average performance of our algorithms to our theoretical bounds. We also show how this model and approach differs from related problems in classic communication networks."}],"year":"2023"}