{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:13:05Z","timestamp":1725459185615},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012,11]]},"DOI":"10.1109\/istel.2012.6483087","type":"proceedings-article","created":{"date-parts":[[2013,3,27]],"date-time":"2013-03-27T16:55:14Z","timestamp":1364403314000},"page":"760-765","source":"Crossref","is-referenced-by-count":0,"title":["Constraint-based path selection algorithms for minimizing blockage in multi domain networks"],"prefix":"10.1109","author":[{"given":"Fatemeh","family":"Banaie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad Hossein","family":"Yaghmaee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nazbanoo","family":"Farzaneh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"year":"2010","author":"herna?ndez-sola","journal-title":"Enhanced Domain Disjoint Backward Recursive TE Path Computation for PCE-based Multi-domain Networks","key":"13"},{"doi-asserted-by":"publisher","key":"14","DOI":"10.1016\/j.comcom.2005.12.007"},{"doi-asserted-by":"publisher","key":"11","DOI":"10.1109\/JSAC.2004.836010"},{"doi-asserted-by":"publisher","key":"12","DOI":"10.1016\/j.comnet.2006.05.011"},{"year":"2010","author":"shirazipour","journal-title":"End-to-end Path Computation Schemes for Traffic Engineering in Next Generation Multi-domain Networks","key":"3"},{"key":"2","article-title":"Efficient pce-based survivable path computation in multi-domain networks","author":"zhang","year":"2011","journal-title":"Workshop at IEEE Infocom"},{"key":"1","article-title":"A path computation element (pce)-based architecture'","author":"farrel","year":"2006","journal-title":"IETF RFC 4655"},{"key":"10","article-title":"A backward recursive pce-based computation (brpc) procedure to compute shortest constrained inter-domain traffic engineering label switched paths'","author":"vasseur","year":"2009","journal-title":"IETF RFC 5441"},{"doi-asserted-by":"publisher","key":"7","DOI":"10.1109\/MCOM.2006.1607872"},{"doi-asserted-by":"publisher","key":"6","DOI":"10.1109\/SURV.2009.090104"},{"key":"5","article-title":"Path computation element communication protocol (pcecp) specific requirements for inter-area mpls and gmpls traffic engineering","author":"leroux","year":"2007","journal-title":"IETF"},{"doi-asserted-by":"publisher","key":"4","DOI":"10.1109\/ICOIN.2012.6164428"},{"key":"9","article-title":"A per-domain path computation method for establishing inter-domain traffic engineering (te) label switched paths (lsps)","author":"vasseur","year":"2008","journal-title":"IETF RFC 5152"},{"doi-asserted-by":"publisher","key":"8","DOI":"10.1109\/GLOCOM.2001.965070"}],"event":{"name":"2012 Sixth International Symposium on Telecommunications (IST)","start":{"date-parts":[[2012,11,6]]},"location":"Tehran, Iran","end":{"date-parts":[[2012,11,8]]}},"container-title":["6th International Symposium on Telecommunications (IST)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6478875\/6482932\/06483087.pdf?arnumber=6483087","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T18:52:05Z","timestamp":1490208725000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6483087\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/istel.2012.6483087","relation":{},"subject":[],"published":{"date-parts":[[2012,11]]}}}