{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T21:40:09Z","timestamp":1739310009235,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642036996"},{"type":"electronic","value":"9783642037009"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-03700-9_3","type":"book-chapter","created":{"date-parts":[[2009,8,26]],"date-time":"2009-08-26T02:28:52Z","timestamp":1251253732000},"page":"21-30","source":"Crossref","is-referenced-by-count":5,"title":["A Distributed Exact Solution to Compute Inter-domain Multi-constrained Paths"],"prefix":"10.1007","author":[{"given":"Gilles","family":"Bertrand","sequence":"first","affiliation":[]},{"given":"Samer","family":"Lahoud","sequence":"additional","affiliation":[]},{"given":"G\u00e9raldine","family":"Texier","sequence":"additional","affiliation":[]},{"given":"Mikl\u00f3s","family":"Moln\u00e1r","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Vasseur, J., Zhang, R., Bitar, N., Roux, J.L.: A Backward-Recursive PCE-Based Computation (BRPC) Procedure to Compute Shortest Constrained Inter-Domain Traffic Engineering Label Switched Paths. RFC 5441, IETF (2009)"},{"key":"3_CR2","unstructured":"Vasseur, J., Roux, J.L.: Path Computation Element (PCE) Communication Protocol (PCEP). RFC 5440 (2009)"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Korkmaz, T., Krunz, M.: Multi-constrained optimal path selection. In: IEEE INFOCOM, vol.\u00a02, pp. 834\u2013843 (2001)","DOI":"10.1109\/INFCOM.2001.916274"},{"issue":"2","key":"3_CR4","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1109\/90.993305","volume":"10","author":"X. Yuan","year":"2002","unstructured":"Yuan, X.: Heuristic algorithms for multiconstrained quality-of-service routing. IEEE\/ACM Trans. Netw.\u00a010(2), 244\u2013256 (2002)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"5","key":"3_CR5","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1109\/TNET.2004.836112","volume":"12","author":"P. Mieghem Van","year":"2004","unstructured":"Van Mieghem, P., Kuipers, F.A.: Concepts of exact QoS routing algorithms. IEEE\/ACM Trans. Netw.\u00a012(5), 851\u2013864 (2004)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1109\/TNET.2006.890089","volume":"15","author":"G. Xue","year":"2007","unstructured":"Xue, G., Sen, A., Zhang, W., Tang, J., Thulasiraman, K.: Finding a path subject to many additive QoS constraints. IEEE\/ACM Trans. Netw.\u00a015, 201\u2013211 (2007)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Saad, T., Mouftah, H., Nouroozifar, A.: Constraint-based routing across multi-domain optical WDM networks. In: Canadian Conference on Electrical and Computer Engineering, vol.\u00a04, pp. 2065\u20132068 (2004)","DOI":"10.1109\/CCECE.2004.1347640"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Bradford, R., Vasseur, J.P., Farrel, A.: Preserving Topology Confidentiality in Inter-Domain Path Computation Using a Key-Based Mechanism. draft-ietf-pce-path-key-06, work in progress, IETF (2009)","DOI":"10.17487\/rfc5520"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"1228","DOI":"10.1109\/49.536364","volume":"14","author":"Z. Wang","year":"1996","unstructured":"Wang, Z., Crowcroft, J.: Quality-of-Service Routing for Supporting Multimedia Applications. IEEE J. Sel. Areas Commun.\u00a014, 1228\u20131234 (1996)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"3_CR10","volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Kuipers, F., Van Mieghem, P.: The impact of correlated link weights on QoS routing. In: IEEE INFOCOM, vol.\u00a02, pp. 1425\u20131434 (2003)","DOI":"10.1109\/INFCOM.2003.1208978"},{"key":"3_CR12","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R. Ahuja","year":"1993","unstructured":"Ahuja, R., Magnanti, T., Orlin, J.: Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Inc., New Jersey (1993)"},{"key":"3_CR13","unstructured":"Le Roux, J.L., Vasseur, J.P., Lee, Y.: Encoding of Objective Functions in the Path Computation Element Communication Protocol (PCEP). draft-ietf-pce-of, work in progress, IETF (2008)"},{"key":"3_CR14","unstructured":"Bertrand, G., Lahoud, S., Moln\u00e1r, M., Texier, G.: Inter-Domain Path Computation with Multiple Constraints. Technical Report 1902, IRISA (2008), http:\/\/hal.inria.fr"}],"container-title":["Lecture Notes in Computer Science","The Internet of the Future"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03700-9_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T21:23:51Z","timestamp":1739309031000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03700-9_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642036996","9783642037009"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03700-9_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}