{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T04:29:36Z","timestamp":1744172976370,"version":"3.40.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"5-6","license":[{"start":{"date-parts":[[2012,9,18]],"date-time":"2012-09-18T00:00:00Z","timestamp":1347926400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s00446-012-0181-9","type":"journal-article","created":{"date-parts":[[2012,9,17]],"date-time":"2012-09-17T08:42:47Z","timestamp":1347871367000},"page":"309-320","source":"Crossref","is-referenced-by-count":3,"title":["Compact policy routing"],"prefix":"10.1007","volume":"26","author":[{"given":"G\u00e1bor","family":"R\u00e9tv\u00e1ri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e1s","family":"Guly\u00e1s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zal\u00e1n","family":"Heszberger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M\u00e1rton","family":"Csernai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f3zsef J.","family":"B\u00edr\u00f3","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,9,18]]},"reference":[{"key":"181_CR1","doi-asserted-by":"crossref","unstructured":"R\u00e9tv\u00e1ri, G., Guly\u00e1s, A., Heszberger, Z., Csernai, M., B\u00edr\u00f3, J.J.: Compact policy routing. In: Proceedings of the 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, PODC \u201911, pp. 149\u2013158 (2011)","DOI":"10.1145\/1993806.1993828"},{"key":"181_CR2","unstructured":"Fraigniaud, P., Gavoille, C.: Memory requirement for universal routing schemes. In: Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, PODC \u201995, pp. 223\u2013230, (1995)"},{"key":"181_CR3","doi-asserted-by":"crossref","unstructured":"Gavoille, C., P\u00e9renn\u00e8s, S.: Memory requirement for routing in distributed networks. In: Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, PODC \u201996, pp. 125\u2013133 (1996)","DOI":"10.1145\/248052.248075"},{"key":"181_CR4","unstructured":"Cowen, L.: Compact routing with minimum stretch. In: ACM-SIAM SODA\u201999, pp. 255\u2013260 (1999)"},{"key":"181_CR5","doi-asserted-by":"crossref","unstructured":"Thorup, M., Zwick, U.: Compact routing schemes. In: ACM SPAA\u201901, pp. 1\u201310 (2001)","DOI":"10.1145\/378580.378581"},{"issue":"1","key":"181_CR6","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1145\/568438.568451","volume":"32","author":"C Gavoille","year":"2001","unstructured":"Gavoille, C.: Routing in distributed networks: overview and open problems. ACM SIGACT News 32(1), 52 (2001)","journal-title":"ACM SIGACT News"},{"issue":"3","key":"181_CR7","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1145\/1273445.1273450","volume":"37","author":"D Krioukov","year":"2007","unstructured":"Krioukov, D., Claffy, K.C., Fall, K., Brady, A.: On compact routing for the internet. ACM Comput. Commun. Rev. 37(3), 41\u201352 (2007)","journal-title":"ACM Comput. Commun. Rev."},{"key":"181_CR8","unstructured":"Gavoille, C.: An overview on compact routing. In: Workshop on Peer-to-Peer, Routing in Complex Graphs, and Network Coding (2007)"},{"issue":"1","key":"181_CR9","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/BF01762113","volume":"3","author":"GN Frederickson","year":"1988","unstructured":"Frederickson, G.N., Janardan, R.: Designing networks with compact routing tables. Algorithmica 3(1), 171\u2013190 (1988)","journal-title":"Algorithmica"},{"key":"181_CR10","doi-asserted-by":"crossref","unstructured":"Krioukov, D., Fall, K., Yang, X.: Compact routing on Internet-like graphs. In: INFOCOM 2004, the Twenty-Third Annual Joint Conference of the IEEE Computer and Communications Societies, vol. 1. (2004)","DOI":"10.1109\/INFCOM.2004.1354495"},{"key":"181_CR11","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Gavoille, C.: Routing in trees. In: ICALP \u201901, pp. 757\u2013772 (2001)","DOI":"10.1007\/3-540-48224-5_62"},{"key":"181_CR12","unstructured":"Younis, O., Fahmy, S.: Constraint-based routing in the internet: basic principles and recent research. Commun. Surv. Tutor. IEEE, 5(1), 2\u201313 (2003)"},{"key":"181_CR13","doi-asserted-by":"crossref","unstructured":"Wang, Z., Crowcroft, J.: Quality-of-service routing for supporting multimedia applications. IEEE J Sel. Areas Commun. 14(7), 1228\u20131234 (1996)","DOI":"10.1109\/49.536364"},{"key":"181_CR14","doi-asserted-by":"crossref","unstructured":"Apostolopoulos, G., Guerin, R., Kamat, S., Tripathi, S.K.: Quality of service based routing: a performance perspective. In: SIGCOMM, pp. 17\u201328 (1998)","DOI":"10.1145\/285243.285251"},{"key":"181_CR15","unstructured":"Ma, Q., Steenkiste, P.: On path selection for traffic with bandwidth guarantees. In: Proceedings of the 1997 International Conference on Network Protocols (ICNP \u201997), 191\u00a0pp, (1997)"},{"key":"181_CR16","unstructured":"Caesar, M., Rexford, J.: BGP routing policies in ISP networks. Technical Report UCB\/CSD-05-1377, EECS Department, University of California, Berkeley (2005)"},{"key":"181_CR17","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1109\/65.793691","volume":"13","author":"G Apostolopoulos","year":"1999","unstructured":"Apostolopoulos, G., Guerin, R., Kamat, S., Orda, A., Tripathi, S.K.: Intra-domain QoS routing in IP networks: a feasibility and cost\/benefit analysis. IEEE Netw. 13, 42\u201354 (1999)","journal-title":"IEEE Netw."},{"issue":"12","key":"181_CR18","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1109\/35.809383","volume":"37","author":"D Awduche","year":"1999","unstructured":"Awduche, D.: MPLS and traffic engineering in IP networks. IEEE Commun. Mag. 37(12), 42\u201347 (1999)","journal-title":"IEEE Commun. Mag."},{"issue":"4","key":"181_CR19","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1109\/65.397043","volume":"9","author":"W Lee","year":"1999","unstructured":"Lee, W., Hluchyi, M., Humblet, P.: Routing subject to quality of service constraints in integrated communication networks. IEEE Netw. Mag. 9(4), 46\u201355 (1999)","journal-title":"IEEE Netw. Mag."},{"key":"181_CR20","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1109\/TNET.2002.801397","volume":"10","author":"J Sobrinho","year":"2002","unstructured":"Sobrinho, J.: Algebra and algorithms for QoS path computation and hop-by-hop routing in the Internet. IEEE\/ACM Trans. Netw. 10, 541\u2013550 (2002)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"181_CR21","doi-asserted-by":"crossref","unstructured":"Sobrinho, J.: Network routing with path vector protocols: theory and applications. In: SIGCOMM \u201903, pp. 49\u201360 (2003)","DOI":"10.1145\/863955.863963"},{"key":"181_CR22","doi-asserted-by":"crossref","unstructured":"Griffin, T., Sobrinho, J.: Metarouting. In: SIGCOMM \u201905, pp. 1\u201312 (2005)","DOI":"10.1145\/1080091.1080094"},{"key":"181_CR23","doi-asserted-by":"crossref","unstructured":"Gurney, A., Griffin, T.: Lexicographic products in metarouting. In: IEEE International Conference on Network Protocols, pp. 113\u2013122 (2007)","DOI":"10.1109\/ICNP.2007.4375842"},{"key":"181_CR24","doi-asserted-by":"crossref","unstructured":"Chau, C.-K., Gibbens, R., Griffin, T.G.: Towards a unified theory of policy-based routing. In: INFOCOM 2006, the 25th IEEE International Conference on Computer Communications. Proceedings, pp. 1\u201312 (2006)","DOI":"10.1109\/INFOCOM.2006.125"},{"key":"181_CR25","unstructured":"Gondran, M., Minoux, M.: Graphs, Dioids and Semirings: New Models and Algorithms. Operations Research\/Computer Science Interfaces Series. 1st edn. Springer, New York (2008)"},{"key":"181_CR26","unstructured":"Awerbuch, B., Shavitt, Y.: Topology Aggregation for Directed Graphs. IEEE\/ACM Trans. Netw. 9, 82\u201390 (2001)"},{"key":"181_CR27","doi-asserted-by":"crossref","unstructured":"Clifford, A.H., Preston, G.B.: The Algebraic Theory of Semigroups, Vol. I. Number 7 in Mathematical Surveys. American Mathematical Society, 1961","DOI":"10.1090\/surv\/007.1"},{"key":"181_CR28","unstructured":"Huston, G.: Interconnection, peering, and settlements. In: Proceedings of the INET (1999)"},{"key":"181_CR29","doi-asserted-by":"crossref","unstructured":"Wang, F., Gao, L.: On inferring and characterizing internet routing policies. In: Proceedings of the 3rd ACM SIGCOMM Conference on Internet, Measurement, pp. 15\u201326 (2003)","DOI":"10.1145\/948206.948208"},{"key":"181_CR30","first-page":"733","volume":"9","author":"L Gao","year":"2000","unstructured":"Gao, L.: On inferring autonomous system relationships in the internet. IEEE\/ACM Trans. Netw. 9, 733\u2013745 (2000)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"181_CR31","doi-asserted-by":"crossref","unstructured":"Griffin, T., Shepherd, F., Wilfong, G.: Policy disputes in path-vector protocols. In: ICNP \u201999, 21\u00a0pp (1999)","DOI":"10.1109\/ICNP.1999.801912"},{"key":"181_CR32","doi-asserted-by":"crossref","unstructured":"Fraigniaud, P., Gavoille, C.: Local memory requirement of universal routing schemes. Technical Report 96\u201301, \u00c9cole Normale Sup\u00e9rieure de Lyon, 69364 Lyon Cedex 07 (1996)","DOI":"10.1145\/237502.237541"},{"key":"181_CR33","unstructured":"Seehra, A., Naous, J., Walfish, M., Mazi\u00e9res, D., Nicolosi, A., Shenker, S.: A policy framework for the future internet. In: Proceedings of the 8th ACM Workshop on Hot Topics in Networks. (HotNets-VIII), New York (2009)"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-012-0181-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-012-0181-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-012-0181-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T22:46:19Z","timestamp":1744152379000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-012-0181-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,18]]},"references-count":33,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["181"],"URL":"https:\/\/doi.org\/10.1007\/s00446-012-0181-9","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"type":"print","value":"0178-2770"},{"type":"electronic","value":"1432-0452"}],"subject":[],"published":{"date-parts":[[2012,9,18]]}}}