{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:35:24Z","timestamp":1743024924046,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030664701"},{"type":"electronic","value":"9783030664718"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-66471-8_14","type":"book-chapter","created":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T22:02:50Z","timestamp":1609538570000},"page":"161-175","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Algebraic Theory of Loop Free Routing"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9790-5871","authenticated-orcid":false,"given":"Hussein","family":"Khayou","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8214-4117","authenticated-orcid":false,"given":"Margarita A.","family":"Rudenkova","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6171-8559","authenticated-orcid":false,"given":"Leonid I.","family":"Abrosimov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,2]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.jnca.2017.09.006","volume":"98","author":"H Khayou","year":"2017","unstructured":"Khayou, H., Sarakbi, B.: A validation model for non-lexical routing protocols. J. Netw. Comput. Appl. 98, 58\u201364 (2017)","journal-title":"J. Netw. Comput. Appl."},{"issue":"5","key":"14_CR2","doi-asserted-by":"publisher","first-page":"1160","DOI":"10.1109\/TNET.2005.857111","volume":"13","author":"JL Sobrinho","year":"2005","unstructured":"Sobrinho, J.L.: An algebraic theory of dynamic network routing. IEEE\/ACM Trans. Netw. 13(5), 1160\u20131173 (2005)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"14_CR3","unstructured":"Albrightson, R., Garcia-Luna-Aceves, J.J., Boyle, J.: EIGRP- a fast routing protocol based on distance vectors. Proc. Networld\/Interop 94 (1994)"},{"issue":"4","key":"14_CR4","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/TNET.2002.801397","volume":"10","author":"JL Sobrinho","year":"2002","unstructured":"Sobrinho, J.L.: Algebra and algorithms for QoS path computation and hop-by-hop routing in the Internet. IEEE\/ACM Trans. Netw. 10(4), 541\u2013550 (2002)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Sobrinho, J.L.: Network routing with path vector protocols: theory and applications. In: Proceedings of the 2003 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (2003)","DOI":"10.1145\/863955.863963"},{"key":"14_CR6","unstructured":"Gurney, A.J.T.: Construction and verification of routing algebras. Diss. University of Cambridge (2010)"},{"key":"14_CR7","unstructured":"Sobrinho, J.L., Griffin, T.G.: Routing in equilibrium. Math. Theory Netw. Syst. (2010)"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Griffin, T.G., Sobrinho, J.L.: Metarouting. In: Proceedings of the 2005 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (2005)","DOI":"10.1145\/1080091.1080094"},{"key":"14_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-75450-5","volume-title":"Graphs, Dioids and Semirings: New Models and Algorithms","author":"M Gondran","year":"2008","unstructured":"Gondran, M., Minoux, M.: Graphs, Dioids and Semirings: New Models and Algorithms, vol. 41. Springer, New York (2008). https:\/\/doi.org\/10.1007\/978-0-387-75450-5"},{"issue":"1","key":"14_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2200\/S00245ED1V01Y201001CNT003","volume":"3","author":"JS Baras","year":"2010","unstructured":"Baras, J.S., Theodorakopoulos, G.: Path problems in networks. Synth. Lect. Commun. Netw. 3(1), 1\u201377 (2010)","journal-title":"Synth. Lect. Commun. Netw."},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-540-78913-0_11","volume-title":"Relations and Kleene Algebra in Computer Science","author":"TG Griffin","year":"2008","unstructured":"Griffin, T.G., Gurney, A.J.T.: Increasing bisemigroups and algebraic routing. In: Berghammer, R., M\u00f6ller, B., Struth, G. (eds.) RelMiCS 2008. LNCS, vol. 4988, pp. 123\u2013137. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78913-0_11"},{"issue":"1","key":"14_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0020-0190(80)90021-6","volume":"11","author":"EW Dijkstra","year":"1980","unstructured":"Dijkstra, E.W., Scholten, C.S.: Termination detection for diffusing computations. Inf. Process. Lett. 11(1), 1\u20134 (1980)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"14_CR13","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1145\/75247.75268","volume":"19","author":"JJ Garcia-Luna-Aceves","year":"1989","unstructured":"Garcia-Luna-Aceves, J.J.: A unified approach to loop-free routing using distance vectors or link states. ACM SIGCOMM Comput. Commun. Rev. 19(4), 212\u2013223 (1989)","journal-title":"ACM SIGCOMM Comput. Commun. Rev."},{"issue":"7","key":"14_CR14","doi-asserted-by":"publisher","first-page":"1758","DOI":"10.1109\/TCOM.1982.1095632","volume":"30","author":"J Jaffe","year":"1982","unstructured":"Jaffe, J., Moss, F.: A responsive distributed routing algorithm for computer networks. IEEE Trans. Commun. 30(7), 1758\u20131762 (1982)","journal-title":"IEEE Trans. Commun."},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Dynerowicz, S., Griffin, T.G.: On the forwarding paths produced by internet routing algorithms. In: 2013 21st IEEE International Conference on Network Protocols (ICNP). IEEE (2013)","DOI":"10.1109\/ICNP.2013.6733608"},{"issue":"3","key":"14_CR16","first-page":"321","volume":"7","author":"M Mohri","year":"2002","unstructured":"Mohri, M.: Semiring frameworks and algorithms for shortest-distance problems. J. Autom. Lang. Comb. 7(3), 321\u2013350 (2002)","journal-title":"J. Autom. Lang. Comb."},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Alim, M.A., Griffin, T.G.: On the interaction of multiple routing algorithms. In: Proceedings of the Seventh COnference on Emerging Networking EXperiments and Technologies (2011)","DOI":"10.1145\/2079296.2079303"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Malkin, G.: RFC 2453: RIP Version 2 (1998)","DOI":"10.17487\/rfc2453"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Rekhter, Y., Li, T., Hares, S.: RFC 4271: A Border Gateway Protocol 4 (BGP-4) (2006)","DOI":"10.17487\/rfc4271"},{"issue":"1","key":"14_CR20","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1109\/90.222913","volume":"1","author":"JJ Garcia-Lunes-Aceves","year":"1993","unstructured":"Garcia-Lunes-Aceves, J.J.: Loop-free routing using diffusing computations. IEEE\/ACM Trans. Netw. 1(1), 130\u2013141 (1993)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"14_CR21","unstructured":"Griffin, T.: An Algebraic approach to internet routing. University of Cambridge. Lecture Notes (2010)"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Savage, D., et al.: RFC 7868: Cisco\u2019s Enhanced Interior Gateway Routing Protocol (EIGRP) (2016)","DOI":"10.17487\/RFC7868"},{"issue":"4","key":"14_CR23","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1109\/TNET.2003.815294","volume":"11","author":"MG Gouda","year":"2003","unstructured":"Gouda, M.G., Schneider, M.: Maximizable routing metrics. IEEE\/ACM Trans. Netw. 11(4), 663\u2013675 (2003). https:\/\/doi.org\/10.1109\/TNET.2003.815294","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"1","key":"14_CR24","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1109\/TNET.2016.2567600","volume":"25","author":"JL Sobrinho","year":"2017","unstructured":"Sobrinho, J.L.: Correctness of routing vector protocols as a property of network cycles. IEEE\/ACM Trans. Netw. 25(1), 150\u2013163 (2017). https:\/\/doi.org\/10.1109\/TNET.2016.2567600","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"14_CR25","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.comnet.2018.08.015","volume":"145","author":"M Saad","year":"2018","unstructured":"Saad, M.: Non-isotonic routing metrics solvable to optimality via shortest path. J. Comput. Netw. 145, 89\u201395 (2018)","journal-title":"J. Comput. Netw."}],"container-title":["Lecture Notes in Computer Science","Distributed Computer and Communication Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-66471-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,1,9]],"date-time":"2021-01-09T03:41:02Z","timestamp":1610163662000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-66471-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030664701","9783030664718"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-66471-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"2 January 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DCCN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Distributed Computer and Communication Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Moscow","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dccn2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/dccn.ru\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"uConfy","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"167","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":"97","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":"1","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":"58% - 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":"7","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)"}}]}}