{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T05:30:27Z","timestamp":1735709427093,"version":"3.32.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,3,1]],"date-time":"2005-03-01T00:00:00Z","timestamp":1109635200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Netw Syst Manage"],"published-print":{"date-parts":[[2005,3]]},"DOI":"10.1007\/s10922-005-1864-3","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T12:04:38Z","timestamp":1114689878000},"page":"99-118","source":"Crossref","is-referenced-by-count":9,"title":["Comparing Restoration Concepts Using Optimal Network Configurations with Integrated Hardware and Routing Decisions"],"prefix":"10.1007","volume":"13","author":[{"given":"Sebastian","family":"Orlowski","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roland","family":"Wess\u00e4ly","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"Y. Xiong, L. Mason, Restoration strategies and spare capacity requirements in selfhealing ATM networks, IEEE infocom\u201997, pp. 353\u2013360, 1997.","DOI":"10.1109\/INFCOM.1997.635157"},{"issue":"3","key":"CR2","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1109\/90.700896","volume":"6","author":"R. Iraschko","year":"1998","unstructured":"R. Iraschko, M. MacGregor, and W. D. Grover, Optimal capacity placement for path restoration in STM or ATM mesh survivable networks, IEEE\/ACM Transactions on Networking, Vol. 6, No. 3, pp. 325\u2013336, 1998.","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"CR3","volume-title":"Optimal spare capacity assignment for path restorable mesh networks: Cuts, decomposition, and an empirical analysis, Technical Report 98-CSE-1","author":"J. L. Kennington","year":"1998","unstructured":"J. L. Kennington, V. S. S. Nair, and G. Spride, Optimal spare capacity assignment for path restorable mesh networks: Cuts, decomposition, and an empirical analysis, Technical Report 98-CSE-1, Department of Computer Science and Engineering, Southern methodist University, Dallas, 1998."},{"key":"CR4","first-page":"77","volume-title":"Economic allocation of spare capacity in mesh-restorable networks: Models and algorithms, 6th International Conference on Telecommunications Systems","author":"F. Poppe","year":"March 1998","unstructured":"F. Poppe and P. Demeester, Economic allocation of spare capacity in mesh-restorable networks: Models and algorithms, 6th International Conference on Telecommunications Systems, Modelling and Analysis, Nashville, pp. 77\u201386, March 1998."},{"key":"CR5","unstructured":"J. Doucette and W. D. Grover, Comparision of mesh protection and restoration schemes and the dependency on graph connectivity. 3rd International Workshop on Design of Reliable Communication networks (DRCN 2001), pp. 121\u2013128, October 2001."},{"issue":"3","key":"CR6","first-page":"129","volume":"13","author":"M. Iri","year":"1971","unstructured":"M. Iri, On and extension of the maximum-flow minimum-cut theorem to multicommodity flows, Journal of the Operations Research Society of Japan, Vol. 13, No. 3, pp. 129\u2013135, 1971.","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"CR7","unstructured":"K. Murakami, Survivable network management for high-speed ATM networks, PhD thesis, Carnegie-Mellon University, 1995."},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"B. Van Caenegem, N. Wauters, and P. Demeester, Spare capacity assignment for different restoration strategies in mesh survivable networks, IEEE International Conference on Communication 1997, pp. 288\u2013292, 1997.","DOI":"10.1109\/ICC.1997.605255"},{"key":"CR9","unstructured":"DISCNET, Network planning and configuration engine. Atesio GmbH, http:\/\/www.atesio.de, 2000\u20132004."},{"issue":"1","key":"CR10","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/s002110050054","volume":"68","author":"G. Dahl","year":"1994","unstructured":"G. Dahl and M. Stoer, A polyhedral approach to multicommodity survivable network design, Numerische Mathematik, Vol. 68, No. 1, pp. 149\u2013167, 1994.","journal-title":"Numerische Mathematik"},{"key":"CR11","unstructured":"J. Doucett and W. D. Grover, Increasing the efficiency of span-restorable mesh networks on low-connectivity graphs, 3rd International workshop on Design of Reliable Communication Networks (DRCN 2001), Budapest, pp. 99\u2013106, 2001."},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"M. Minoux, Optimum synthesis of a network with non-simultaneous MCF requirements, Studies on Graphs and Discrete Programming, P. Hansen (ed.), pp. 269\u2013277. North Holland Publishing Company, 1981.","DOI":"10.1016\/S0304-0208(08)73470-4"},{"key":"CR13","unstructured":"R. Wess\u00e4ly, Dimensioning Survivable Capacitated Networks, PhD thesis, TU Berlin, 2000."},{"issue":"1","key":"CR14","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J. Benders","year":"1962","unstructured":"J. Benders, Partioning procedures for solving mixed-variables programming problems, Numerische Mathematik, Vol. 4, No. 1, pp. 238\u2013252, 1962.","journal-title":"Numerische Mathematik"},{"key":"CR15","doi-asserted-by":"crossref","unstructured":"M. Padberg and G. Rinaldi, A branch and cut algorithm for the resolution of large-scale symmetric travelling salesman problems, SIAM Review, No. 33, pp. 60\u2013100, 1991.","DOI":"10.1137\/1033004"},{"key":"CR16","doi-asserted-by":"crossref","unstructured":"L. A. Wolsey, Valid inequality for 0\/1 knapsacks and MIPs with generalised upper bound constraints, Discrete Applied Mathematics, No. 29, pp. 251\u2013261, 1990.","DOI":"10.1016\/0166-218X(90)90148-6"},{"key":"CR17","unstructured":"S. Orlowski, Local and global restoration of node and link failures in telecommunication networks, Diploma thesis, TU Berlin, 2003."},{"key":"CR18","unstructured":"ILOG CPLEX 8.0, Retrieved from http:\/\/www.ilog.com\/products\/cplex."},{"key":"CR19","unstructured":"S. Orlowski and R. Wess\u00e4ly, The effect of hop limits on optimal cost in survivable network design, Telecommunications Network Design and Economics and Management, G. Anandalingam and S. Raghavan (eds.), 2004, to appear. Preprint version available at ftp:\/\/ftp.zib.de\/pub\/zip-publications\/reports\/ZR-04-23.pdf."}],"container-title":["Journal of Network and Systems Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10922-005-1864-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10922-005-1864-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10922-005-1864-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T23:34:54Z","timestamp":1735688094000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10922-005-1864-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,3]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,3]]}},"alternative-id":["1864"],"URL":"https:\/\/doi.org\/10.1007\/s10922-005-1864-3","relation":{},"ISSN":["1064-7570","1573-7705"],"issn-type":[{"type":"print","value":"1064-7570"},{"type":"electronic","value":"1573-7705"}],"subject":[],"published":{"date-parts":[[2005,3]]}}}