{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T07:52:14Z","timestamp":1725954734440},"publisher-location":"New York, NY, USA","reference-count":62,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,8,17]],"date-time":"2015-08-17T00:00:00Z","timestamp":1439769600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Communaut\u00e9 fran\u00e7aise de Belgique","award":["ARC grant 13\/18-054"]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,8,17]]},"DOI":"10.1145\/2785956.2787495","type":"proceedings-article","created":{"date-parts":[[2015,8,24]],"date-time":"2015-08-24T14:09:20Z","timestamp":1440425360000},"update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":73,"title":["A Declarative and Expressive Approach to Control Forwarding Paths in Carrier-Grade Networks"],"prefix":"10.1145","author":[{"given":"Renaud","family":"Hartert","sequence":"first","affiliation":[{"name":"Universit\u00e9 catholique de Louvain, Louvain-la-Neuve, Belgium"}]},{"given":"Stefano","family":"Vissicchio","sequence":"additional","affiliation":[{"name":"Universit\u00e9 catholique de Louvain, Louvain-la-Neuve, Belgium"}]},{"given":"Pierre","family":"Schaus","sequence":"additional","affiliation":[{"name":"Universit\u00e9 catholique de Louvain, Louvain-la-Neuve, Belgium"}]},{"given":"Olivier","family":"Bonaventure","sequence":"additional","affiliation":[{"name":"Universit\u00e9 catholique de Louvain, Louvain-la-Neuve, Belgium"}]},{"given":"Clarence","family":"Filsfils","sequence":"additional","affiliation":[{"name":"Cisco Systems, Brussels, Belgium"}]},{"given":"Thomas","family":"Telkamp","sequence":"additional","affiliation":[{"name":"Cisco Systems, Brussels, Belgium"}]},{"given":"Pierre","family":"Francois","sequence":"additional","affiliation":[{"name":"IMDEA Networks Institute, Madrid, Spain"}]}],"member":"320","published-online":{"date-parts":[[2015,8,17]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2014.2371999"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1355734.1355746"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"crossref","unstructured":"C. Filsfils phet al. \"Segment Routing Architecture \" Internet draft 2014. C. Filsfils phet al. \"Segment Routing Architecture \" Internet draft 2014.","DOI":"10.1109\/GLOCOM.2014.7417124"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2009.2026415"},{"key":"e_1_3_2_2_5_1","volume-title":"Al-Fares phet al., \"Hedera: Dynamic Flow Scheduling for Data Center Networks,\" in phNSDI","author":"M.","year":"2010","unstructured":"M. Al-Fares phet al., \"Hedera: Dynamic Flow Scheduling for Data Center Networks,\" in phNSDI , 2010 . M. Al-Fares phet al., \"Hedera: Dynamic Flow Scheduling for Data Center Networks,\" in phNSDI, 2010."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2534169.2486019"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626336"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486012"},{"key":"e_1_3_2_2_9_1","volume-title":"Service function chaining problem statement,\" Internet draft","author":"Quinn P.","year":"2014","unstructured":"P. Quinn and T. Nadeau , \" Service function chaining problem statement,\" Internet draft , 2014 . P. Quinn and T. Nadeau, \"Service function chaining problem statement,\" Internet draft, 2014."},{"key":"e_1_3_2_2_10_1","first-page":"6571","author":"C. Filsfils","year":"2012","unstructured":"C. Filsfils phet al., \" Loop-Free Alternate (LFA) Applicability in Service Provider (SP) Networks ,\" RFC 6571 , 2012 . C. Filsfils phet al., \"Loop-Free Alternate (LFA) Applicability in Service Provider (SP) Networks,\" RFC 6571, 2012.","journal-title":"RFC"},{"key":"e_1_3_2_2_11_1","unstructured":"R. Krishnan phet al. \"Mechanisms for Optimizing LAG\/ECMP Component Link Utilization in Networks \" Internet Draft 2014. R. Krishnan phet al. \"Mechanisms for Optimizing LAG\/ECMP Component Link Utilization in Networks \" Internet Draft 2014."},{"key":"e_1_3_2_2_12_1","volume-title":"IGP-as-a-Backup for Robust SDN Networks,\" in phCNSM","author":"Tilmans O.","year":"2014","unstructured":"O. Tilmans and S. Vissicchio , \" IGP-as-a-Backup for Robust SDN Networks,\" in phCNSM , 2014 . O. Tilmans and S. Vissicchio, \"IGP-as-a-Backup for Robust SDN Networks,\" in phCNSM, 2014."},{"key":"e_1_3_2_2_13_1","volume-title":"Internet traffic engineering by optimizing OSPF weights,\" in phINFOCOM","author":"Fortz B.","year":"2000","unstructured":"B. Fortz and M. Thorup , \" Internet traffic engineering by optimizing OSPF weights,\" in phINFOCOM , 2000 . B. Fortz and M. Thorup, \"Internet traffic engineering by optimizing OSPF weights,\" in phINFOCOM, 2000."},{"key":"e_1_3_2_2_14_1","volume-title":"phHandbook of constraint programming.\\hskip 1em plus 0.5em minus 0.4em\\relax Elsevier","author":"Rossi F.","year":"2006","unstructured":"F. Rossi , P. Van Beek , and T. Walsh , phHandbook of constraint programming.\\hskip 1em plus 0.5em minus 0.4em\\relax Elsevier , 2006 . F. Rossi, P. Van Beek, and T. Walsh, phHandbook of constraint programming.\\hskip 1em plus 0.5em minus 0.4em\\relax Elsevier, 2006."},{"key":"e_1_3_2_2_15_1","volume-title":"Mpls adaptive traffic engineering,\" in phINFOCOM","author":"A. Elwalid","year":"2001","unstructured":"A. Elwalid phet al., \"Mate : Mpls adaptive traffic engineering,\" in phINFOCOM , 2001 . A. Elwalid phet al., \"Mate: Mpls adaptive traffic engineering,\" in phINFOCOM, 2001."},{"key":"e_1_3_2_2_16_1","volume-title":"phDSLs in action.\\hskip 1em plus 0.5em minus 0.4em\\relax Manning Publications","author":"Ghosh D.","year":"2010","unstructured":"D. Ghosh , phDSLs in action.\\hskip 1em plus 0.5em minus 0.4em\\relax Manning Publications , 2010 . D. Ghosh, phDSLs in action.\\hskip 1em plus 0.5em minus 0.4em\\relax Manning Publications, 2010."},{"key":"e_1_3_2_2_17_1","volume-title":"Multi-objective large neighborhood search,\" in phCP","author":"Schaus P.","year":"2013","unstructured":"P. Schaus and R. Hartert , \" Multi-objective large neighborhood search,\" in phCP , 2013 . P. Schaus and R. Hartert, \"Multi-objective large neighborhood search,\" in phCP, 2013."},{"key":"e_1_3_2_2_18_1","volume-title":"Pathlet routing,\" in phHotNets","author":"Godfrey P. B.","year":"2008","unstructured":"P. B. Godfrey , S. Shenker , and I. Stoica , \" Pathlet routing,\" in phHotNets , 2008 . P. B. Godfrey, S. Shenker, and I. Stoica, \"Pathlet routing,\" in phHotNets, 2008."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1594977.1592583"},{"key":"e_1_3_2_2_20_1","unstructured":"R. Hartert \"DEFO Web Site \" sites.uclouvain.be\/defo. R. Hartert \"DEFO Web Site \" sites.uclouvain.be\/defo."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2006.09.010"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"crossref","unstructured":"P. Shaw \"Using constraint programming and local search methods to solve vehicle routing problems \" in phCP 1998. P. Shaw \"Using constraint programming and local search methods to solve vehicle routing problems \" in phCP 1998.","DOI":"10.1007\/3-540-49481-2_30"},{"key":"e_1_3_2_2_23_1","volume-title":"Self-adapting large neighborhood search: Application to single-mode scheduling problems,\" in phMISTA","author":"Laborie P.","year":"2007","unstructured":"P. Laborie and D. Godard , \" Self-adapting large neighborhood search: Application to single-mode scheduling problems,\" in phMISTA , 2007 . P. Laborie and D. Godard, \"Self-adapting large neighborhood search: Application to single-mode scheduling problems,\" in phMISTA, 2007."},{"key":"e_1_3_2_2_24_1","first-page":"497","author":"Land A. H.","year":"1960","unstructured":"A. H. Land and A. G. Doig , \"An automatic method of solving discrete programming problems,\" phEconometrica: Journal of the Econometric Society , pp. 497 -- 520 , 1960 . A. H. Land and A. G. Doig, \"An automatic method of solving discrete programming problems,\" phEconometrica: Journal of the Econometric Society, pp. 497--520, 1960.","journal-title":"\"An automatic method of solving discrete programming problems,\" phEconometrica: Journal of the Econometric Society"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1070873.1070877"},{"key":"e_1_3_2_2_26_1","unstructured":"C. Filsfils phet al. \"Segment Routing with MPLS data plane \" Internet draft 2014. C. Filsfils phet al. \"Segment Routing with MPLS data plane \" Internet draft 2014."},{"key":"e_1_3_2_2_27_1","unstructured":"S. Previdi phet al. \"IPv6 Segment Routing Header (SRH) \" Internet draft 2014. S. Previdi phet al. \"IPv6 Segment Routing Header (SRH) \" Internet draft 2014."},{"key":"e_1_3_2_2_28_1","volume-title":"Scala in OR","author":"Team R","year":"2012","unstructured":"Osca R Team , \"OscaR : Scala in OR ,\" 2012 , texttthttps:\/\/bitbucket.org\/oscarlib\/oscar. OscaR Team, \"OscaR: Scala in OR,\" 2012, texttthttps:\/\/bitbucket.org\/oscarlib\/oscar."},{"key":"e_1_3_2_2_29_1","volume-title":"OSPF Monitoring: Architecture, Design and Deployment Experience,\" in phNSDI","author":"Shaikh A.","year":"2004","unstructured":"A. Shaikh and A. Greenberg , \" OSPF Monitoring: Architecture, Design and Deployment Experience,\" in phNSDI , 2004 . A. Shaikh and A. Greenberg, \"OSPF Monitoring: Architecture, Design and Deployment Experience,\" in phNSDI, 2004."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787497"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2043164.2018516"},{"key":"e_1_3_2_2_32_1","first-page":"6241","author":"R. Enns","year":"2011","unstructured":"R. Enns phet al., \" Network Configuration Protocol (NETCONF),\" RFC 6241 , 2011 . R. Enns phet al., \"Network Configuration Protocol (NETCONF),\" RFC 6241, 2011.","journal-title":"RFC"},{"key":"e_1_3_2_2_33_1","first-page":"5575","author":"P. Marques","year":"2009","unstructured":"P. Marques phet al., \" Dissemination of Flow Specification Rules ,\" RFC 5575 , 2009 . P. Marques phet al., \"Dissemination of Flow Specification Rules,\" RFC 5575, 2009.","journal-title":"RFC"},{"key":"e_1_3_2_2_34_1","unstructured":"S. Sivabalan phet al. \"PCEP Extensions for Segment Routing \" Internet Draft 2014. S. Sivabalan phet al. \"PCEP Extensions for Segment Routing \" Internet Draft 2014."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.822655"},{"key":"e_1_3_2_2_36_1","volume-title":"Generation of router-level Internet topologies through network design heuristics,\" in phITC","author":"B. Quoitin","year":"2009","unstructured":"B. Quoitin phet al., \"IGen : Generation of router-level Internet topologies through network design heuristics,\" in phITC , 2009 . B. Quoitin phet al., \"IGen: Generation of router-level Internet topologies through network design heuristics,\" in phITC, 2009."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1096536.1096551"},{"key":"e_1_3_2_2_38_1","unstructured":"Cisco \"Planning and Designing Networks with the Cisco MATE Portfolio \" white paper 2013. Cisco \"Planning and Designing Networks with the Cisco MATE Portfolio \" white paper 2013."},{"key":"e_1_3_2_2_39_1","volume-title":"phIntroduction to Algorithms.\\hskip 1em plus 0.5em minus 0.4em\\relax McGraw-Hill","author":"T. Cormen","year":"2001","unstructured":"T. Cormen phet al. , phIntroduction to Algorithms.\\hskip 1em plus 0.5em minus 0.4em\\relax McGraw-Hill , 2001 . T. Cormen phet al., phIntroduction to Algorithms.\\hskip 1em plus 0.5em minus 0.4em\\relax McGraw-Hill, 2001."},{"key":"e_1_3_2_2_40_1","volume-title":"The impact of graceful IGP operations on BGP,\" in phINFOCOM","author":"L. Vanbever","year":"2013","unstructured":"L. Vanbever phet al., \" When the cure is worse than the disease : The impact of graceful IGP operations on BGP,\" in phINFOCOM , 2013 . L. Vanbever phet al., \"When the cure is worse than the disease: The impact of graceful IGP operations on BGP,\" in phINFOCOM, 2013."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1030194.1015493"},{"key":"e_1_3_2_2_42_1","volume-title":"Greater Traffic and Bandwidth Awareness for Easier Programmability,\" white paper","author":"Automation Engine Cisco WAN","year":"2015","unstructured":"Cisco, \" Cisco WAN Automation Engine : Greater Traffic and Bandwidth Awareness for Easier Programmability,\" white paper , 2015 . Cisco, \"Cisco WAN Automation Engine: Greater Traffic and Bandwidth Awareness for Easier Programmability,\" white paper, 2015."},{"key":"e_1_3_2_2_43_1","volume-title":"update and future evolution,\" MPLS\/SDN world congress","author":"Filsfils C.","year":"2014","unstructured":"C. Filsfils , \" Segment routing : update and future evolution,\" MPLS\/SDN world congress , 2014 . C. Filsfils, \"Segment routing: update and future evolution,\" MPLS\/SDN world congress, 2014."},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2008.4483669"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2014.06.002"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2002.1003042"},{"key":"e_1_3_2_2_47_1","unstructured":"Juniper \"WANDL IP\/MPLSView \" http:\/\/www.juniper.net\/assets\/us\/en\/local\/pdf\/datasheets\/1000500-en.pdf. Juniper \"WANDL IP\/MPLSView \" http:\/\/www.juniper.net\/assets\/us\/en\/local\/pdf\/datasheets\/1000500-en.pdf."},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2005.845549"},{"key":"e_1_3_2_2_49_1","volume-title":"Internet traffic engineering without full mesh overlaying,\" in phINFOCOM","author":"Wang Y.","year":"2001","unstructured":"Y. Wang , Z. Wang , and L. Zhang , \" Internet traffic engineering without full mesh overlaying,\" in phINFOCOM , 2001 . Y. Wang, Z. Wang, and L. Zhang, \"Internet traffic engineering without full mesh overlaying,\" in phINFOCOM, 2001."},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2134866"},{"key":"e_1_3_2_2_51_1","volume-title":"phMPLS-Enabled Applications.\\hskip 1em plus 0.5em minus 0.4em\\relax Wiley","author":"Minei I.","year":"2005","unstructured":"I. Minei and J. Luceck , phMPLS-Enabled Applications.\\hskip 1em plus 0.5em minus 0.4em\\relax Wiley , 2005 . I. Minei and J. Luceck, phMPLS-Enabled Applications.\\hskip 1em plus 0.5em minus 0.4em\\relax Wiley, 2005."},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2008.04.005"},{"key":"e_1_3_2_2_53_1","unstructured":"R. Steenbergen \"Mpls autobandwidth \" RIPE 64. R. Steenbergen \"Mpls autobandwidth \" RIPE 64."},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/2068816.2068859"},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2008.927257"},{"key":"e_1_3_2_2_56_1","doi-asserted-by":"publisher","DOI":"10.1145\/2670518.2673886"},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1145\/1151659.1159926"},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1145\/1090191.1080122"},{"key":"e_1_3_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402946.1402966"},{"key":"e_1_3_2_2_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486022"},{"key":"e_1_3_2_2_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/2602204.2602216"},{"key":"e_1_3_2_2_62_1","doi-asserted-by":"crossref","unstructured":"S. Agarwal phet al. \"Traffic Engineering in Software Defined Networks \" in phINFOCOM 2013. S. Agarwal phet al. \"Traffic Engineering in Software Defined Networks \" in phINFOCOM 2013.","DOI":"10.1109\/INFCOM.2013.6567024"}],"event":{"name":"SIGCOMM '15: ACM SIGCOMM 2015 Conference","location":"London United Kingdom","acronym":"SIGCOMM '15","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"]},"container-title":["Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2785956.2787495","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T21:51:19Z","timestamp":1693864279000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2785956.2787495"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,17]]},"references-count":62,"alternative-id":["10.1145\/2785956.2787495","10.1145\/2785956"],"URL":"https:\/\/doi.org\/10.1145\/2785956.2787495","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2829988.2787495","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2015,8,17]]},"assertion":[{"value":"2015-08-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}