{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T13:38:50Z","timestamp":1773409130097,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540789123","type":"print"},{"value":"9783540789130","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78913-0_11","type":"book-chapter","created":{"date-parts":[[2008,4,11]],"date-time":"2008-04-11T12:13:06Z","timestamp":1207915986000},"page":"123-137","source":"Crossref","is-referenced-by-count":12,"title":["Increasing Bisemigroups and Algebraic Routing"],"prefix":"10.1007","author":[{"given":"Timothy G.","family":"Griffin","sequence":"first","affiliation":[]},{"given":"Alexander J. T.","family":"Gurney","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"Gondran, M., Minoux, M.: Graphes, dio\u00efdes et semi-anneaux: Nouveaux mod\u00e9les et algorithmes. Tec & Doc (2001)"},{"key":"11_CR2","volume-title":"Graphs and Algorithms","author":"M. Gondran","year":"1984","unstructured":"Gondran, M., Minoux, M.: Graphs and Algorithms. Wiley, Chichester (1984)"},{"key":"11_CR3","volume-title":"Graphs and Networks","author":"B. Carr\u00e9","year":"1979","unstructured":"Carr\u00e9, B.: Graphs and Networks. Oxford University Press, Oxford (1979)"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1093\/imamat\/15.2.161","volume":"15","author":"R. Backhouse","year":"1975","unstructured":"Backhouse, R., Carr, B.: Regular algebra applied to path-finding problems. J. Inst. Math. Appl.\u00a015, 161\u2013181 (1975)","journal-title":"J. Inst. Math. Appl."},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Rekhter, Y., Li, T.: A Border Gateway Protocol. RFC 1771 (BGP version 4) (March 1995)","DOI":"10.17487\/rfc1771"},{"key":"11_CR6","volume-title":"BGP4: Inter-Domain Routing in the Internet","author":"J.W. Stewart","year":"1999","unstructured":"Stewart, J.W.: BGP4: Inter-Domain Routing in the Internet. Addison-Wesley, Reading (1999)"},{"key":"11_CR7","unstructured":"Halabi, S., McPherson, D.: Internet Routing Architectures, 2nd edn. Cisco Press (2001)"},{"key":"11_CR8","unstructured":"Huston, G.: Interconnection, peering and settlements: Parts I and II. Internet Protocol Journal\u00a02(1 and 2) (March, June 1999)"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S1389-1286(99)00108-5","volume":"32","author":"K. Varadhan","year":"2000","unstructured":"Varadhan, K., Govindan, R., Estrin, D.: Persistent route oscillations in inter-domain routing. Computer Networks\u00a032, 1\u201316 (2000) (based on a 1996 technical report)","journal-title":"Computer Networks"},{"key":"11_CR10","unstructured":"Systems, C.: Endless BGP convergence problem in Cisco IOS software releases. Field Note, October 10 (2001), http:\/\/www.cisco.com\/warp\/public\/770\/fn12942.html"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Griffin, T.G., Huston, G.: RFC 4264: BGP Wedgies, IETF (November 2005)","DOI":"10.17487\/rfc4264"},{"issue":"5","key":"11_CR12","doi-asserted-by":"publisher","first-page":"1160","DOI":"10.1109\/TNET.2005.857111","volume":"13","author":"J.L. Sobrinho","year":"2005","unstructured":"Sobrinho, J.L.: An algebraic theory of dynamic network routing. IEEE\/ACM Transactions on Networking\u00a013(5), 1160\u20131173 (2005)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Griffin, T.G., Sobrinho, J.L.: Metarouting. In: Proc. ACM SIGCOMM (August 2005)","DOI":"10.1145\/1080091.1080094"},{"key":"11_CR14","unstructured":"Griffin, T.G., Gao, L., Rexford, J.: Inherently safe backup routing with BGP. In: Proc. IEEE INFOCOM (April 2001)"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Gurney, A., Griffin, T.G.: Lexicographic products in metarouting. In: Proc. Inter. Conf. on Network Protocols (October 2007)","DOI":"10.1109\/ICNP.2007.4375842"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Griffin, T.G., Shepherd, F.B., Wilfong, G.: Policy disputes in path-vector protocols. In: Proc. Inter. Conf. on Network Protocols (November 1999)","DOI":"10.1109\/ICNP.1999.801912"},{"issue":"2","key":"11_CR17","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1109\/90.993304","volume":"10","author":"T.G. Griffin","year":"2002","unstructured":"Griffin, T.G., Shepherd, F.B., Wilfong, G.: The stable paths problem and interdomain routing. IEEE\/ACM Transactions on Networking\u00a010(2), 232\u2013243 (2002)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Griffin, T.G., Wilfong, G.: On the correctness of IBGP configuration. In: Proc. ACM SIGCOMM (September 2002)","DOI":"10.1145\/633025.633028"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Griffin, T.G., Wilfong, G.: An analysis of the MED oscillation problem in BGP. In: Proc. Inter. Conf. on Network Protocols (2002)","DOI":"10.1109\/ICNP.2002.1181389"},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"Sobrinho, J.L.: Network routing with path vector protocols: Theory and applications. In: Proc. ACM SIGCOMM (September 2003)","DOI":"10.1145\/863955.863963"},{"issue":"4","key":"11_CR21","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1109\/TNET.2002.801397","volume":"10","author":"J.L. Sobrinho","year":"2002","unstructured":"Sobrinho, J.L.: Algebra and algorithms for QoS path computation and hop-by-hop. IEEE\/ACM Transactions on Networking\u00a010(4), 541\u2013550 (2002)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"11_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/BFb0028261","volume-title":"Algorithms and Data Structures","author":"T. Lengauer","year":"1991","unstructured":"Lengauer, T., Theune, D.: Unstructured path problems and the making of semirings. In: Dehne, F., Sack, J.-R., Santoro, N. (eds.) WADS 1991. LNCS, vol.\u00a0519, pp. 189\u2013200. Springer, Heidelberg (1991)"},{"key":"11_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1007\/3-540-54233-7_144","volume-title":"Automata, Languages and Programming","author":"T. Lengauer","year":"1991","unstructured":"Lengauer, T., Theune, D.: Efficient algorithms for path problems with general cost criteria. In: Leach Albert, J., Monien, B., Rodr\u00edguez-Artalejo, M. (eds.) ICALP 1991. LNCS, vol.\u00a0510, pp. 314\u2013326. Springer, Heidelberg (1991)"},{"key":"11_CR24","volume-title":"Partially Ordered Algebraic Systems","author":"L. Fuchs","year":"1963","unstructured":"Fuchs, L.: Partially Ordered Algebraic Systems. Addison-Wesley, Reading (1963)"},{"key":"11_CR25","volume-title":"Lattice Theory","author":"G. Birkhoff","year":"1967","unstructured":"Birkhoff, G.: Lattice Theory, 3rd edn. Amer. Math. Soc., Providence, RI (1967)","edition":"3"},{"issue":"3","key":"11_CR26","doi-asserted-by":"publisher","first-page":"697","DOI":"10.2307\/2035867","volume":"19","author":"R.E. Johnson","year":"1968","unstructured":"Johnson, R.E.: Free products of ordered semigroups. Proceedings of the American Mathematical Society\u00a019(3), 697\u2013700 (1968)","journal-title":"Proceedings of the American Mathematical Society"},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"Griffin, T., Wilfong, G.: A safe path vector protocol. In: Proc. IEEE INFOCOM (March 2000)","DOI":"10.1109\/INFCOM.2000.832222"},{"key":"11_CR28","doi-asserted-by":"crossref","unstructured":"Chau, C., Gibbens, R., Griffin, T.G.: Towards a unified theory of policy-based routing. In: Proc. IEEE INFOCOM (April 2006)","DOI":"10.1109\/INFOCOM.2006.125"},{"issue":"1","key":"11_CR29","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0012-365X(79)90061-X","volume":"26","author":"A. Wongseelashote","year":"1979","unstructured":"Wongseelashote, A.: Semirings and path spaces. Discrete Mathematics\u00a026(1), 55\u201378 (1979)","journal-title":"Discrete Mathematics"},{"key":"11_CR30","unstructured":"Karloff, H.: On the convergence time of a path-vector protocol. In: ACM-SIAM Symposium on Discrete Algorithms (SODA) (2004)"}],"container-title":["Lecture Notes in Computer Science","Relations and Kleene Algebra in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78913-0_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:03:34Z","timestamp":1619521414000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78913-0_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540789123","9783540789130"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78913-0_11","relation":{},"subject":[]}}