{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T03:39:51Z","timestamp":1649129991746},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"9-10","license":[{"start":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T00:00:00Z","timestamp":1218499200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann. Telecommun."],"published-print":{"date-parts":[[2008,10]]},"DOI":"10.1007\/s12243-008-0048-z","type":"journal-article","created":{"date-parts":[[2008,8,11]],"date-time":"2008-08-11T08:54:11Z","timestamp":1218444851000},"page":"511-522","source":"Crossref","is-referenced-by-count":0,"title":["Max\u2013min fair survivable networks"],"prefix":"10.1007","volume":"63","author":[{"given":"A.","family":"Bashllari","sequence":"first","affiliation":[]},{"given":"D.","family":"Nace","sequence":"additional","affiliation":[]},{"given":"E.","family":"Gourdin","sequence":"additional","affiliation":[]},{"given":"O.","family":"Klopfenstein","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,8,12]]},"reference":[{"key":"48_CR1","volume-title":"Mesh-based survivable networks","author":"WD Grover","year":"2003","unstructured":"Grover WD (2003) Mesh-based survivable networks. Prentice Hall, Englewood Cliffs"},{"key":"48_CR2","doi-asserted-by":"crossref","unstructured":"Gruber C, Wess\u00e4ly R, Orlowski S, Zymolka A, Koster AMCA (2005) A computational study for demand-wise shared protection. In: Proc. of international workshop on design of reliable communication networks (DRCN), Naples, October 2005, pp 421\u2013428","DOI":"10.1109\/DRCN.2005.1563902"},{"key":"48_CR3","doi-asserted-by":"crossref","unstructured":"Kleinberg J, Rabani Y, Tardos E (1999) Fairness in routing and load balancing. In: Proc. of 35th annual symposium on foundations of computer science, 17\u201319 October 1999, New York","DOI":"10.1109\/SFFCS.1999.814631"},{"key":"48_CR4","unstructured":"Bashllari A, Nace D, Gourdin E, Klopfenstein O (2007) A simple robust routing scheme. In: DRCN\u20192007, 7\u201310 October 2007, La Rochelle"},{"issue":"6","key":"48_CR5","doi-asserted-by":"crossref","first-page":"1272","DOI":"10.1109\/TNET.2006.886331","volume":"14","author":"D Nace","year":"2006","unstructured":"Nace D, Doan LN, Gourdin E, Liau B (2006) Computing optimal max-min fair resource allocation for TCP flows. IEEE Trans Netw 14(6):1272\u20131281 (December)","journal-title":"IEEE Trans Netw"},{"issue":"2","key":"48_CR6","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1016\/j.cor.2006.03.020","volume":"35","author":"D Nace","year":"2008","unstructured":"Nace D, Doan LN, Klopfenstein O, Bashllari A (2008) Max\u2013min fairness in multi-commodity flows. Comput Oper Res 35(2):557\u2013573 (February)","journal-title":"Comput Oper Res"},{"key":"48_CR7","unstructured":"Nilsson P, Pioro M, Dziong Z (2003) Link protection within an existing backbone network. In: Proc. of INOC 2003, Evry-Paris, October 2003, pp 435\u2013441"},{"key":"48_CR8","volume-title":"Routing, flow and capacity design in communication and computer networks","author":"M Pioro","year":"2007","unstructured":"Pioro M, Medhi D (2007) Routing, flow and capacity design in communication and computer networks. Morgan Kaufmann, San Mateo"},{"issue":"5","key":"48_CR9","doi-asserted-by":"crossref","first-page":"1073","DOI":"10.1109\/TNET.2007.896231","volume":"15","author":"B Radunovic","year":"2007","unstructured":"Radunovic B, Le Boudec J-Y (2007) A unified framework for max-min and min-max fairness with applications. IEEE\/ACM Trans Netw 15(5):1073\u20131083 (October)","journal-title":"IEEE\/ACM Trans Netw"},{"key":"48_CR10","volume-title":"Network recovery","author":"M Pickavet","year":"2005","unstructured":"Pickavet M, Demeester P, Vasseur JPh (2005) Network recovery. Morgan Kaufmann, San Mateo"},{"key":"48_CR11","unstructured":"Wess\u00e4ly R, Orlowski S, Zymolka A, Koster AMCA, Gruber C (2005) Demand-wise shared protection revisited: a new model for survivable network design. In: Proc. of international network optimization conference (INOC), Lisbon, March 2005, pp 100\u2013105"},{"issue":"1","key":"48_CR12","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s10922-005-1855-4","volume":"13","author":"AMCA Koster","year":"2005","unstructured":"Koster AMCA, Zymolka A, J\u00e4ger M, H\u00fclsermann R, Gerlach C (2005) Demand-wise shared protection for meshed optical networks. J Netw Syst Manag 13(1):35\u201355","journal-title":"J Netw Syst Manag"}],"container-title":["annals of telecommunications - annales des t\u00e9l\u00e9communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12243-008-0048-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12243-008-0048-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12243-008-0048-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T06:37:59Z","timestamp":1559457479000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12243-008-0048-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8,12]]},"references-count":12,"journal-issue":{"issue":"9-10","published-print":{"date-parts":[[2008,10]]}},"alternative-id":["48"],"URL":"https:\/\/doi.org\/10.1007\/s12243-008-0048-z","relation":{},"ISSN":["0003-4347","1958-9395"],"issn-type":[{"value":"0003-4347","type":"print"},{"value":"1958-9395","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,8,12]]}}}