{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:28:13Z","timestamp":1750307293405,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,11,30]],"date-time":"2010-11-30T00:00:00Z","timestamp":1291075200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003407","name":"Ministero dell'Istruzione, dell'Universit\u00e0 e della Ricerca","doi-asserted-by":"publisher","award":["RBIP06BZW8"],"award-info":[{"award-number":["RBIP06BZW8"]}],"id":[{"id":"10.13039\/501100003407","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,11,30]]},"DOI":"10.1145\/1921151.1921166","type":"proceedings-article","created":{"date-parts":[[2010,12,22]],"date-time":"2010-12-22T14:41:30Z","timestamp":1293028890000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Leveraging router programmability for traffic matrix computation"],"prefix":"10.1145","author":[{"given":"Giacomo","family":"Balestra","sequence":"first","affiliation":[{"name":"CASPUR, Rome, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Salvatore","family":"Luciano","sequence":"additional","affiliation":[{"name":"Roma Tre University, Rome, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maurizio","family":"Pizzonia","sequence":"additional","affiliation":[{"name":"Roma Tre University, Rome, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefano","family":"Vissicchio","sequence":"additional","affiliation":[{"name":"Roma Tre University, Rome, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,11,30]]},"reference":[{"volume-title":"Cisco Systems","author":"Cisco IOS","key":"e_1_3_2_1_1_1","unstructured":"Cisco IOS NetFlow Version 9 Flow-Record Format. Official Cisco Documentation , Cisco Systems , Inc . http:\/\/www.cisco.com. Cisco IOS NetFlow Version 9 Flow-Record Format. Official Cisco Documentation, Cisco Systems, Inc. http:\/\/www.cisco.com."},{"key":"e_1_3_2_1_2_1","first-page":"4456","author":"Bates T.","year":"2006","unstructured":"Bates , T. , Chen , E. , and Chandra , R. BGP Route Reflection : An Alternative to Full Mesh Internal BGP (IBGP). RFC 4456 , 2006 . Bates, T., Chen, E., and Chandra, R. BGP Route Reflection: An Alternative to Full Mesh Internal BGP (IBGP). RFC 4456, 2006.","journal-title":"RFC"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/505202.505209"},{"key":"e_1_3_2_1_4_1","first-page":"1157","author":"Case J. D.","year":"1990","unstructured":"Case , J. D. and Fedor , M. and Schoffstall , M. L. and Davin , J. Simple Network Management Protocol (SNMP). RFC 1157 , 1990 . Case, J. D. and Fedor, M. and Schoffstall, M. L. and Davin, J. Simple Network Management Protocol (SNMP). RFC 1157, 1990.","journal-title":"RFC"},{"volume-title":"Constructing Optimal IP Routing Tables. In In Proc. INFOCOM '99","author":"Draves R. P.","key":"e_1_3_2_1_5_1","unstructured":"Draves , R. P. , King , C. , Venkatachary , S. , and Zill , B. D . Constructing Optimal IP Routing Tables. In In Proc. INFOCOM '99 . Draves, R. P., King, C., Venkatachary, S., and Zill, B. D. Constructing Optimal IP Routing Tables. In In Proc. INFOCOM '99."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.929850"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633028"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592631.1592634"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851194"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/633025.633041"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1028788.1028808"},{"key":"e_1_3_2_1_12_1","first-page":"4271","author":"Rekhter Y.","year":"2006","unstructured":"Rekhter , Y. , Li , T. , and Hares , S. A Border Gateway Protocol 4 (BGP-4). RFC 4271 , 2006 . Rekhter, Y., Li, T., and Hares, S. A Border Gateway Protocol 4 (BGP-4). RFC 4271, 2006.","journal-title":"RFC"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/637201.637232"},{"volume-title":"Juniper Network","author":"Sardella A.","key":"e_1_3_2_1_14_1","unstructured":"Sardella , A. , Devarasetty , M. , Eccli , J. , and Kharitonov , D . Efficient Scaling for Multiservice Networks. White Paper , Juniper Network , Inc . http:\/\/www.juniper.net. Sardella, A., Devarasetty, M., Eccli, J., and Kharitonov, D. Efficient Scaling for Multiservice Networks. White Paper, Juniper Network, Inc. http:\/\/www.juniper.net."},{"volume-title":"Proc. PAM '10","author":"Tootoonchian A.","key":"e_1_3_2_1_15_1","unstructured":"Tootoonchian , A. , Ghobadi , M. , and Ganjali , Y . OpenTM: Traffic Matrix Estimator for OpenFlow Networks . In Proc. PAM '10 . Tootoonchian, A., Ghobadi, M., and Ganjali, Y. OpenTM: Traffic Matrix Estimator for OpenFlow Networks. In Proc. PAM '10."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111322.1111341"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/972374.972377"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/65.826369"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/885651.781053"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1140103.1140294"}],"event":{"name":"Co-NEXT '10: Conference on emerging Networking EXperiments and Technologies","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"],"location":"Philadelphia Pennsylvania","acronym":"Co-NEXT '10"},"container-title":["Proceedings of the Workshop on Programmable Routers for Extensible Services of Tomorrow"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1921151.1921166","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1921151.1921166","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:59:44Z","timestamp":1750244384000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1921151.1921166"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,30]]},"references-count":20,"alternative-id":["10.1145\/1921151.1921166","10.1145\/1921151"],"URL":"https:\/\/doi.org\/10.1145\/1921151.1921166","relation":{},"subject":[],"published":{"date-parts":[[2010,11,30]]},"assertion":[{"value":"2010-11-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}