{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:56:45Z","timestamp":1743087405600,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031327322"},{"type":"electronic","value":"9783031327339"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-32733-9_7","type":"book-chapter","created":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T23:04:40Z","timestamp":1684969480000},"page":"132-148","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Self-adjusting Linear Networks with\u00a0Ladder Demand Graph"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9134-5490","authenticated-orcid":false,"given":"Vitaly","family":"Aksenov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anton","family":"Paramonov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2810-2781","authenticated-orcid":false,"given":"Iosif","family":"Salem","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":[[2023,5,25]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Avin, C., Bienkowski, M., Salem, I., Sama, R., Schmid, S., Schmidt, P.: Deterministic self-adjusting tree networks using rotor walks. In: 2022 IEEE 42nd International Conference on Distributed Computing Systems (ICDCS), pp. 67\u201377. IEEE (2022)","DOI":"10.1109\/ICDCS54860.2022.00016"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-030-34992-9_29","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"C Avin","year":"2019","unstructured":"Avin, C., van Duijn, I., Schmid, S.: Self-adjusting linear networks. In: Ghaffari, M., Nesterenko, M., Tixeuil, S., Tucci, S., Yamauchi, Y. (eds.) SSS 2019. LNCS, vol. 11914, pp. 368\u2013382. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34992-9_29"},{"issue":"1","key":"7_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3379486","volume":"4","author":"C Avin","year":"2020","unstructured":"Avin, C., Ghobadi, M., Griner, C., Schmid, S.: On the complexity of traffic traces and implications. Proc. ACM Measur. Anal. Comput. Syst. 4(1), 1\u201329 (2020)","journal-title":"Proc. ACM Measur. Anal. Comput. Syst."},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-662-53426-7_18","volume-title":"Distributed Computing","author":"C Avin","year":"2016","unstructured":"Avin, C., Loukas, A., Pacut, M., Schmid, S.: Online balanced repartitioning. In: Gavoille, C., Ilcinkas, D. (eds.) DISC 2016. LNCS, vol. 9888, pp. 243\u2013256. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53426-7_18"},{"issue":"4","key":"7_CR5","doi-asserted-by":"publisher","first-page":"1838","DOI":"10.1109\/TNET.2022.3153586","volume":"30","author":"C Avin","year":"2022","unstructured":"Avin, C., Mondal, K., Schmid, S.: Demand-aware network design with minimal congestion and route lengths. IEEE\/ACM Trans. Netw. 30(4), 1838\u20131848 (2022)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"6","key":"7_CR6","doi-asserted-by":"publisher","first-page":"2419","DOI":"10.1109\/TNET.2022.3174118","volume":"30","author":"C Avin","year":"2022","unstructured":"Avin, C., Mondal, K., Schmid, S.: Push-down trees: optimal self-adjusting complete trees. IEEE\/ACM Trans. Netw. 30(6), 2419\u20132432 (2022)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"5","key":"7_CR7","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/3310165.3310170","volume":"48","author":"C Avin","year":"2019","unstructured":"Avin, C., Schmid, S.: Toward demand-aware networking: a theory for self-adjusting networks. ACM SIGCOMM Comput. Commun. Rev. 48(5), 31\u201340 (2019)","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"key":"7_CR8","doi-asserted-by":"crossref","unstructured":"Batista, D.M., da Fonseca, N.L.S., Granelli, F., Kliazovich, D.: Self-adjusting grid networks. In: 2007 IEEE International Conference on Communications, pp. 344\u2013349. IEEE (2007)","DOI":"10.1109\/ICC.2007.64"},{"issue":"3","key":"7_CR9","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1145\/568522.568523","volume":"34","author":"J D\u00edaz","year":"2002","unstructured":"D\u00edaz, J., Petit, J., Serna, M.: A survey of graph layout problems. ACM Comput. Surv. (CSUR) 34(3), 313\u2013356 (2002)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Hansen, M.D.: Approximation algorithms for geometric embeddings in the plane with applications to parallel processing problems. In: 30th Annual Symposium on Foundations of Computer Science, pp. 604\u2013609. IEEE Computer Society (1989)","DOI":"10.1109\/SFCS.1989.63542"},{"key":"7_CR11","unstructured":"Newman, I., Rabinovich, Y.: Online embedding of metrics. arXiv preprint arXiv:2303.15945 (2023)"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-030-04693-4_19","volume-title":"Approximation and Online Algorithms","author":"N Olver","year":"2018","unstructured":"Olver, N., Pruhs, K., Schewior, K., Sitters, R., Stougie, L.: The itinerant list update problem. In: Epstein, L., Erlebach, T. (eds.) WAOA 2018. LNCS, vol. 11312, pp. 310\u2013326. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-04693-4_19"},{"key":"7_CR13","unstructured":"Paramonov, A., Salem, I., Schmid, S., Aksenov, V.: Self-adjusting linear networks with ladder demand graph. arXiv preprint arXiv:2207.03948 (2022)"},{"issue":"3","key":"7_CR14","doi-asserted-by":"publisher","first-page":"1421","DOI":"10.1109\/TNET.2015.2410313","volume":"24","author":"S Schmid","year":"2016","unstructured":"Schmid, S., Avin, C., Scheideler, C., Borokhovich, M., Haeupler, B., Lotker, Z.: Splaynet: towards locally self-adjusting networks. IEEE\/ACM Trans. Netw. 24(3), 1421\u20131433 (2016)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"2","key":"7_CR15","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"DD Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28(2), 202\u2013208 (1985)","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-32733-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,24]],"date-time":"2023-05-24T23:05:37Z","timestamp":1684969537000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-32733-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031327322","9783031327339"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-32733-9_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"25 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SIROCCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Structural Information and Communication Complexity","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Alcal\u00e1 de Henares","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sirocco2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sirocco2023.networks.imdea.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"48","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"54% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}