{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T14:28:40Z","timestamp":1725632920456},"reference-count":10,"publisher":"IEEE","license":[{"start":{"date-parts":[[2009,4,1]],"date-time":"2009-04-01T00:00:00Z","timestamp":1238544000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2009,4,1]],"date-time":"2009-04-01T00:00:00Z","timestamp":1238544000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,4]]},"DOI":"10.1109\/infcom.2009.5062208","type":"proceedings-article","created":{"date-parts":[[2009,6,3]],"date-time":"2009-06-03T11:10:14Z","timestamp":1244027414000},"page":"2666-2670","source":"Crossref","is-referenced-by-count":2,"title":["A Queueing Model Framework of PCE-Based Inter-Area Path Computation"],"prefix":"10.1109","author":[{"given":"J.","family":"Yu","sequence":"first","affiliation":[{"name":"OpNeAR Lab., Univ. of Texas, Dallas, TX"}]},{"given":"Y.","family":"He","sequence":"additional","affiliation":[{"name":"OpNeAR Lab., Univ. of Texas, Dallas, TX"}]},{"given":"K.","family":"Wu","sequence":"additional","affiliation":[{"name":"OpNeAR Lab., Univ. of Texas, Dallas, TX"}]},{"given":"M.","family":"Tacca","sequence":"additional","affiliation":[{"name":"OpNeAR Lab., Univ. of Texas, Dallas, TX"}]},{"given":"A.","family":"Fumagalli","sequence":"additional","affiliation":[{"name":"OpNeAR Lab., Univ. of Texas, Dallas, TX"}]},{"given":"J.-P.","family":"Vasseur","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/ISCC.2006.109"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2007.386468"},{"journal-title":"Data Networks","year":"1992","author":"bertsekas","key":"10"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.17487\/rfc4655"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/ONDM.2008.4578399"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/OFC.2007.4348895"},{"year":"0","key":"5"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.212"},{"journal-title":"A Queueing Model Framework for PCE","year":"2008","author":"yu","key":"9"},{"key":"8","article-title":"a backward recursive pce-based computation (brpc) procedure to compute shortest constrained inter-domain traffic engineering label switched paths","author":"vasseur","year":"2008","journal-title":"IETF Draft"}],"event":{"name":"2009 Proceedings IEEE INFOCOM","start":{"date-parts":[[2009,4,19]]},"location":"Rio de Janeiro, Brazil","end":{"date-parts":[[2009,4,25]]}},"container-title":["IEEE INFOCOM 2009"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5061887\/5061888\/05062208.pdf?arnumber=5062208","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T13:22:53Z","timestamp":1677763373000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/5062208\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,4]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/infcom.2009.5062208","relation":{},"subject":[],"published":{"date-parts":[[2009,4]]}}}