{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T23:01:56Z","timestamp":1649026916815},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,2,13]],"date-time":"2010-02-13T00:00:00Z","timestamp":1266019200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Photon Netw Commun"],"published-print":{"date-parts":[[2010,8]]},"DOI":"10.1007\/s11107-010-0248-0","type":"journal-article","created":{"date-parts":[[2010,2,12]],"date-time":"2010-02-12T10:10:17Z","timestamp":1265969417000},"page":"83-93","source":"Crossref","is-referenced-by-count":0,"title":["A game equilibrated rapid dynamic restoration strategy in ASON"],"prefix":"10.1007","volume":"20","author":[{"given":"Na","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yumei","family":"Cai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fei","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,2,13]]},"reference":[{"issue":"2","key":"248_CR1","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1109\/90.664268","volume":"6","author":"A. Mokhtar","year":"1998","unstructured":"Mokhtar A., Azizoglu M.: Adaptive wavelength routing in all-optical networks. IEEE\/ACM Trans. Netw. 6(2), 197\u2013206 (1998)","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"6","key":"248_CR2","doi-asserted-by":"crossref","first-page":"1218","DOI":"10.1109\/50.511623","volume":"14","author":"K.C. Lee","year":"1996","unstructured":"Lee K.C., Li V.O.K.: A wavelength rerouting algorithm in wide-area all-optical networks. J. Lightwave Technol. 14(6), 1218\u20131229 (1996)","journal-title":"J. Lightwave Technol."},{"key":"248_CR3","doi-asserted-by":"crossref","unstructured":"Chien, C., Subrata, B.: A new model for optimal routing and wavelength assignment in wavelength division multiplexed optical networks. Proceedings IEEE INFCOM\u201996, pp. 164\u2013171 (1996)","DOI":"10.1109\/INFCOM.1996.497890"},{"issue":"2","key":"248_CR4","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s11107-005-6025-9","volume":"11","author":"Z. Na","year":"2006","unstructured":"Na Z., Haijin S., Naifu Z.: Ant colony optimization for dynamic RWA in WDM networks with partial wavelength. Photonic Netw. Commun. 11(2), 229\u2013236 (2006)","journal-title":"Photonic Netw. Commun."},{"issue":"2","key":"248_CR5","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s11107-007-0105-y","volume":"15","author":"Z. Na","year":"2008","unstructured":"Na Z., Yawei D.: Partheno genetic algorithm for dynamic multi-services restoration in WDM networks. Photonic Netw. Commun. 15(2), 183\u2013190 (2008)","journal-title":"Photonic Netw. Commun."},{"key":"248_CR6","doi-asserted-by":"crossref","unstructured":"Stentz, A.: Optimal and efficient path planning for partially-known environments. Proceedings of the IEEE International Conference on Robotics and Automation, San Diego, USA, pp. 3310\u20133317 (1994)","DOI":"10.1109\/ROBOT.1994.351061"},{"key":"248_CR7","unstructured":"Stentz, A.: The focused D* algorithm for real-time replanning. In: Proceedings of the International Joint Conference on Artificial Intelligence, Montreal, pp. 1231\u20131239 (1995)"},{"key":"248_CR8","first-page":"4","volume-title":"A Primer in Game Theory","author":"R. Gibbons","year":"1992","unstructured":"Gibbons R.: A Primer in Game Theory, pp. 4\u201337. FT Prentice Hall, Harlow (1992)"},{"key":"248_CR9","doi-asserted-by":"crossref","unstructured":"Nash J. Equilibrium points in n-person games. Proc. Natl Acad. Sci. 36, 48\u201349","DOI":"10.1073\/pnas.36.1.48"},{"key":"248_CR10","first-page":"28","volume":"37","author":"P. Hart","year":"1972","unstructured":"Hart P., Nilsson N., Raphael B.: Correction to a formal basis for the heuristic determination of minimum cost paths. SIGART Newslett. 37, 28\u201329 (1972)","journal-title":"SIGART Newslett."},{"key":"248_CR11","unstructured":"RFC3209-RSVP-TE: Extensions to RSVP for LSP Tunnels. Network Working Group, 2001"},{"key":"248_CR12","volume-title":"Data Structure (C Language)","author":"Y. Huimin","year":"2002","unstructured":"Huimin Y., Weimin W.: Data Structure (C Language). Tsinghua University Press, Beijing (2002)"}],"container-title":["Photonic Network Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11107-010-0248-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11107-010-0248-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11107-010-0248-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T07:04:14Z","timestamp":1559372654000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11107-010-0248-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,13]]},"references-count":12,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,8]]}},"alternative-id":["248"],"URL":"https:\/\/doi.org\/10.1007\/s11107-010-0248-0","relation":{},"ISSN":["1387-974X","1572-8188"],"issn-type":[{"value":"1387-974X","type":"print"},{"value":"1572-8188","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,13]]}}}