{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T04:10:00Z","timestamp":1761970200218,"version":"build-2065373602"},"reference-count":37,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,3]]},"DOI":"10.1109\/infcom.2012.6195650","type":"proceedings-article","created":{"date-parts":[[2012,5,24]],"date-time":"2012-05-24T22:26:40Z","timestamp":1337898400000},"page":"2546-2550","source":"Crossref","is-referenced-by-count":57,"title":["TECC: Towards collaborative in-network caching guided by traffic engineering"],"prefix":"10.1109","author":[{"given":"Haiyong","family":"Xie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Guangyu Shi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Pengwei Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/3-540-36389-0_2","article-title":"Cooperative caching in ad hoc networks","volume":"2574","author":"sailhan","year":"2003","journal-title":"Lecture Notes in Computer Science"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.822655"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/90.851975"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.749260"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2005.1453429"},{"journal-title":"Internet2 IP IGP Metrics","year":"0","key":"33"},{"key":"15","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/978-3-642-20757-0_7","article-title":"Modelling and evaluation of ccn-caching trees","volume":"6640","author":"psaras","year":"2011","journal-title":"Lecture Notes in Computer Science"},{"journal-title":"Geant Topology","year":"0","key":"34"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1145\/319151.319153"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1145\/1555349.1555377"},{"key":"14","first-page":"111","article-title":"Modeling data transfer in content-centric networking","author":"carofiglio","year":"0","journal-title":"ITC '11 San Francisco CA 2011"},{"key":"37","doi-asserted-by":"publisher","DOI":"10.1109\/WiMob.2009.23"},{"key":"11","article-title":"On the interaction between overlay routing and traffic engineering","author":"liu","year":"0","journal-title":"IEEE INFOCOM 2005 Miami FL Mar 2005"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5061960"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2002.1036038"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5461964"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402999"},{"year":"0","key":"23"},{"year":"0","key":"24"},{"year":"0","key":"25"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832225"},{"key":"27","article-title":"Walking the tightrope: Responsive yet stable traffic engineering","author":"kandula","year":"0","journal-title":"Proc ACM SIGCOMM '05 Philadelphia PA USA Aug 2005"},{"key":"28","article-title":"Optimal routing with multiple traffic matrices tradeoff between average and worst case performance","author":"zhang","year":"0","journal-title":"Proc IEEE ICNP '05 Nov 2005"},{"key":"29","article-title":"Cope: Traffic engineering in dynamic networks","author":"wang","year":"0","journal-title":"Proc ACM SIG-COMM 2006 Pisa Italy Aug 2006"},{"journal-title":"Named Data Networking (Ndn) Project","year":"2010","author":"zhang","key":"3"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/1658939.1658941"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.880179"},{"key":"1","article-title":"NetInf: An information-centric design for the future internet","author":"dannewitz","year":"0","journal-title":"Proc 3rd GI\/ITG KuVS Workshop on the Future Internet May 2009"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863991"},{"year":"0","key":"7"},{"year":"0","key":"6"},{"key":"32","doi-asserted-by":"publisher","DOI":"10.1145\/1921168.1921174"},{"journal-title":"Content Connect A Blueprint for the Future of Content","year":"0","key":"5"},{"journal-title":"Potential function methods for approximately solving linear programming problems Theory and Practice","year":"2002","author":"bienstock","key":"31"},{"journal-title":"DECoupled Application Data Enroute (DECADE) Problem Statement","year":"2011","author":"song","key":"4"},{"journal-title":"AT&T Content Acceleration Service","year":"2011","key":"9"},{"year":"0","key":"8"}],"event":{"name":"IEEE INFOCOM 2012 - IEEE Conference on Computer Communications","start":{"date-parts":[[2012,3,25]]},"location":"Orlando, FL, USA","end":{"date-parts":[[2012,3,30]]}},"container-title":["2012 Proceedings IEEE INFOCOM"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6189419\/6195452\/06195650.pdf?arnumber=6195650","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T19:14:31Z","timestamp":1497986071000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6195650\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/infcom.2012.6195650","relation":{},"subject":[],"published":{"date-parts":[[2012,3]]}}}