{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T21:17:43Z","timestamp":1763414263836,"version":"3.45.0"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032111265","type":"print"},{"value":"9783032111272","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T00:00:00Z","timestamp":1763424000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T00:00:00Z","timestamp":1763424000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-11127-2_20","type":"book-chapter","created":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T20:03:55Z","timestamp":1763409835000},"page":"239-252","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Invited Paper: Towards Demand-Aware Peer Selection with XOR-Based Routing"],"prefix":"10.1007","author":[{"given":"Qingyun","family":"Ji","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5614-8563","authenticated-orcid":false,"given":"Darya","family":"Melnyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9213-1512","authenticated-orcid":false,"given":"Arash","family":"Pourdamghani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7798-1711","authenticated-orcid":false,"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,18]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Addanki, V., Pacut, M., Pourdamghani, A., R\u00e9tv\u00e1ri, G., Schmid, S., Vanerio, J.: Self-adjusting partially ordered lists. In: INFOCOM, pp. 1\u201310. IEEE (2023)","DOI":"10.1109\/INFOCOM53939.2023.10228937"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Aggarwal, V., Feldmann, A., Scheideler, C.: Can ISPS and P2P users cooperate for improved performance? ACM SIGCOMM Comput. Commun. Rev. (2007)","DOI":"10.1145\/1273445.1273449"},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Androutsellis-Theotokis, S., Spinellis, D.: A survey of peer-to-peer content distribution technologies. ACM Comput. Surv. (2004)","DOI":"10.1145\/1041680.1041681"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Avin, C., Ghobadi, M., Griner, C., Schmid, S.: On the complexity of traffic traces and implications. Proc. ACM Meas. Anal. Comput. Syst. (2020)","DOI":"10.1145\/3379486"},{"issue":"3\u20134","key":"20_CR5","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s00446-019-00351-5","volume":"33","author":"C Avin","year":"2020","unstructured":"Avin, C., Mondal, K., Schmid, S.: Demand-aware network designs of bounded degree. Distrib. Comput. 33(3\u20134), 311\u2013325 (2020)","journal-title":"Distrib. Comput."},{"issue":"5","key":"20_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/3310165.3310170","volume":"48","author":"C Avin","year":"2018","unstructured":"Avin, C., Schmid, S.: Toward demand-aware networking: a theory for self-adjusting networks. Comput. Commun. Rev. 48(5), 31\u201340 (2018)","journal-title":"Comput. Commun. Rev."},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Babel, K., Baker, L.: Strategic peer selection using transaction value and latency. In: DeFi@CCS, pp. 9\u201314. ACM (2022)","DOI":"10.1145\/3560832.3563440"},{"key":"20_CR8","unstructured":"Bentert, M., Franke, M., Melnyk, D., Pourdamghani, A., Schmid, S.: Demand-aware multi-source IP-multicast: minimal congestion via link weight optimization. In: International Federation for Information Processing Networking Conference (IFIP Networking) (2025)"},{"key":"20_CR9","doi-asserted-by":"crossref","unstructured":"Breslau, L., Cao, P., Fan, L., Phillips, G., Shenker, S.: Web caching and zipf-like distributions: evidence and implications. In: IEEE INFOCOM (1999)","DOI":"10.1109\/INFCOM.1999.749260"},{"key":"20_CR10","unstructured":"Dallot, J., Caldeira, C., Pourdamghani, A., Goussevskaia, O., Schmid, S.: Laslin: a learning-augmented peer-to-peer network (2025). https:\/\/arxiv.org\/abs\/2509.11904"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"DeCandia, G., et al.: Dynamo: amazon\u2019s highly available key-value store. In: ACM SOSP (2007)","DOI":"10.1145\/1294261.1294281"},{"key":"20_CR12","unstructured":"Figiel, A., Korhonen, J.H., Olver, N., Schmid, S.: Efficient algorithms for demand-aware networks and a connection to virtual network embedding. In: OPODIS. LIPIcs, vol.\u00a0324, pp. 38:1\u201338:24. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2024)"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Figiel, A., Melnyk, D., Milentijevic, T., Schmid, S.: Distributed construction of demand-aware datacenter networks. In: IPDPS, pp. 162\u2013172. IEEE (2025)","DOI":"10.1109\/IPDPS64566.2025.00023"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Figiel, A., Melnyk, D., Nichterlein, A., Pourdamghani, A., Schmid, S.: Spiderdan: matching augmentation in demand-aware networks. In: SIAM Symposium on Algorithm Engineering and Experiments (ALENEX) (2025)","DOI":"10.1137\/1.9781611978339.10"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Hagberg, A.A., Schult, D.A., Swart, P.J.: Exploring network structure, dynamics, and function using networkx. In: Proceedings of the 7th Python in Science Conference (2008)","DOI":"10.25080\/TCWV9851"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Hanauer, K., Henzinger, M., Schmid, S., Trummer, J.: Fast and heavy disjoint weighted matchings for demand-aware datacenter topologies. In: INFOCOM, pp. 1649\u20131658. IEEE (2022)","DOI":"10.1109\/INFOCOM48880.2022.9796921"},{"key":"20_CR17","doi-asserted-by":"crossref","unstructured":"Hunter, J.D.: Matplotlib: a 2D graphics environment. Comput. Sci. Eng. (2007)","DOI":"10.1109\/MCSE.2007.55"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Kiffer, L., Salman, A., Levin, D., Mislove, A., Nita-Rotaru, C.: Under the hood of the ethereum gossip protocol. In: Borisov, N., Diaz, C. (eds.) FC (2021)","DOI":"10.1007\/978-3-662-64331-0_23"},{"key":"20_CR19","doi-asserted-by":"crossref","unstructured":"Lakshman, A., Malik, P.: Cassandra: a decentralized structured storage system. ACM SIGOPS Oper. Syst. Rev. (2010)","DOI":"10.1145\/1773912.1773922"},{"key":"20_CR20","unstructured":"Lua, E.K., Crowcroft, J., Pias, M., Sharma, R., Lim, S.: A survey and comparison of peer-to-peer overlay network schemes. IEEE Commun. Surv. Tutor. (2005)"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Malkhi, D., Naor, M., Ratajczak, D.: Viceroy: a scalable and dynamic emulation of the butterfly. In: ACM PODC (2002)","DOI":"10.1145\/571825.571857"},{"key":"20_CR22","doi-asserted-by":"crossref","unstructured":"Mao, Y., Deb, S., Venkatakrishnan, S.B., Kannan, S., Srinivasan, K.: Perigee: efficient peer-to-peer network design for blockchains. In: PODC, pp. 428\u2013437. ACM (2020)","DOI":"10.1145\/3382734.3405704"},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Maymounkov, P., Mazi\u00e8res, D.: Kademlia: a peer-to-peer information system based on the XOR metric. In: Druschel, P., Kaashoek, M.F., Rowstron, A.I.T. (eds.) IPTPS (2002)","DOI":"10.1007\/3-540-45748-8_5"},{"key":"20_CR24","doi-asserted-by":"crossref","unstructured":"Naor, M., Wieder, U.: Novel architectures for P2P applications: the continuous-discrete approach. In: SPAA. ACM (2003)","DOI":"10.1145\/777417.777421"},{"key":"20_CR25","doi-asserted-by":"crossref","unstructured":"Pourdamghani, A., Avin, C., Sama, R., Schmid, S.: Seedtree: a dynamically optimal and local self-adjusting tree. In: INFOCOM, pp. 1\u201310. IEEE (2023)","DOI":"10.1109\/INFOCOM53939.2023.10228999"},{"key":"20_CR26","unstructured":"Pourdamghani, A., Avin, C., Sama, R., Shiran, M., Schmid, S.: Hash & adjust: competitive demand-aware consistent hashing. In: OPODIS. LIPIcs, vol.\u00a0324, pp. 24:1\u201324:23. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2024)"},{"key":"20_CR27","doi-asserted-by":"crossref","unstructured":"Ratnasamy, S., Francis, P., Handley, M., Karp, R.M., Shenker, S.: A scalable content-addressable network. In: Cruz, R.L., Varghese, G. (eds.) ACM SIGCOMM. ACM (2001)","DOI":"10.1145\/383059.383072"},{"key":"20_CR28","doi-asserted-by":"crossref","unstructured":"Rowstron, A.I.T., Druschel, P.: Pastry: scalable, decentralized object location, and routing for large-scale peer-to-peer systems. In: Guerraoui, R. (ed.) IFIP\/ACM Middleware (2001)","DOI":"10.1007\/3-540-45518-3_18"},{"key":"20_CR29","doi-asserted-by":"crossref","unstructured":"Stoica, I., et al.: Chord: a scalable peer-to-peer lookup protocol for internet applications. IEEE\/ACM Trans. Netw. (2003)","DOI":"10.1109\/TNET.2002.808407"},{"key":"20_CR30","unstructured":"Wang, W., et al.: Topoopt: co-optimizing network topology and parallelization strategy for distributed training jobs. In: USENIX NSDI (2023)"},{"key":"20_CR31","doi-asserted-by":"crossref","unstructured":"Zhao, B.Y., Huang, L., Stribling, J., Rhea, S.C., Joseph, A.D., Kubiatowicz, J.: Tapestry: a resilient global-scale overlay for service deployment. IEEE J. Sel. Areas Commun. (2004)","DOI":"10.1109\/JSAC.2003.818784"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-11127-2_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T20:04:00Z","timestamp":1763409840000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-11127-2_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,18]]},"ISBN":["9783032111265","9783032111272"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-11127-2_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,18]]},"assertion":[{"value":"18 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kathmandu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nepal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}