{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T23:05:35Z","timestamp":1725404735587},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1109\/icc.2012.6364621","type":"proceedings-article","created":{"date-parts":[[2012,12,4]],"date-time":"2012-12-04T00:17:44Z","timestamp":1354580264000},"page":"2966-2971","source":"Crossref","is-referenced-by-count":1,"title":["Path-Vector Contract Routing"],"prefix":"10.1109","author":[{"given":"Hasan T.","family":"Karaoglu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Murat","family":"Yuksel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5061934"},{"journal-title":"Packet Length Distributions CAIDA","year":"0","key":"15"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/DRCN.2009.5339988"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2004.10129096"},{"journal-title":"The CAIDA AS Relationships Dataset","year":"2010","key":"14"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2010.04.002"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/icc.2011.5962965"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/1151659.1159934"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.893888"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2005.850224"},{"key":"10","article-title":"A backward-recursive pce-based computation procedure to compute shortest constrained interdomain traffic engineering label switched paths","author":"vasseur","year":"2009","journal-title":"RFC 5441"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/781027.781069"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/1080091.1080095"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.4544624"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/963985.963988"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592583"},{"key":"8","article-title":"Negotiation-based routing between neighboring isps","author":"mahajan","year":"2005","journal-title":"Proc of USENIX NSDI"}],"event":{"name":"ICC 2012 - 2012 IEEE International Conference on Communications","start":{"date-parts":[[2012,6,10]]},"location":"Ottawa, ON, Canada","end":{"date-parts":[[2012,6,15]]}},"container-title":["2012 IEEE International Conference on Communications (ICC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6350935\/6363631\/06364621.pdf?arnumber=6364621","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T16:49:21Z","timestamp":1490114961000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6364621\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,6]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/icc.2012.6364621","relation":{},"subject":[],"published":{"date-parts":[[2012,6]]}}}