{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:55:14Z","timestamp":1725490514087},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744825"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74484-9_28","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T21:48:03Z","timestamp":1188337683000},"page":"319-329","source":"Crossref","is-referenced-by-count":0,"title":["Branch-and-Bound Algorithm for Anycast Flow Assignment in Connection-Oriented Networks"],"prefix":"10.1007","author":[{"given":"Krzysztof","family":"Walkowiak","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1153","DOI":"10.1007\/3-540-45061-0_88","volume-title":"Automata, Languages and Programming","author":"B. Awerbuch","year":"2003","unstructured":"Awerbuch, B., Brinkmann, A., Scheideler, C.: Anycasting in adversarial systems: routing and admission control. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 1153\u20131168. Springer, Heidelberg (2003)"},{"key":"28_CR2","doi-asserted-by":"crossref","unstructured":"Ballani, H., Francis, P.: Towards a Global IP Anycast Service. In: Proc. SIGCOMM\u201905, Philadelphia, pp. 301\u2013312 (2005)","DOI":"10.1145\/1080091.1080127"},{"key":"28_CR3","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1109\/MCOM.2004.1299362","volume":"5","author":"S. Doi","year":"2004","unstructured":"Doi, S., Ata, S., Kitamura, K., Murata, M.: IPv6 anycast for simple and effective service-oriented communications. IEEE Communication Magazine\u00a05, 163\u2013171 (2004)","journal-title":"IEEE Communication Magazine"},{"key":"28_CR4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1002\/net.3230030202","volume":"3","author":"L. Fratta","year":"1973","unstructured":"Fratta, L., Gerla, M., Kleinrock, L.: The Flow Deviation Method: An Approach to Store-and-Forward Communication Network Design. Networks\u00a03, 97\u2013133 (1973)","journal-title":"Networks"},{"key":"28_CR5","first-page":"48","volume":"6","author":"F. Hao","year":"2002","unstructured":"Hao, F., Zegura, E., Ammar, M.: QoS routing for anycast communications: motivation and an architecture for DiffServ networks. IEEE Communication Magazine\u00a06, 48\u201356 (2002)","journal-title":"IEEE Communication Magazine"},{"key":"28_CR6","first-page":"813","volume":"3","author":"Y.T. Hou","year":"2006","unstructured":"Hou, Y.T., Shi, Y., Sherali, H.D.: Optimal base station selection for anycast routing in wireless sensor networks. IEEE Transactions on Vehicular Technology\u00a03, 813\u2013821 (2006)","journal-title":"IEEE Transactions on Vehicular Technology"},{"key":"28_CR7","unstructured":"Kasprzak, A.: Designing of Wide Area Networks. Wroclaw Univ. of Tech. Press (2001)"},{"key":"28_CR8","unstructured":"Lin, C., Lo, J., Kuo, S.: Load-Balanced Anycast Routing. In: Proc, of the Parallel and Distributed Systems. In: Tenth international Conference on (Icpads\u201904), Washington (2004)"},{"key":"28_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"772","DOI":"10.1007\/11424925_81","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2005","author":"M. Markowski","year":"2005","unstructured":"Markowski, M., Kasprzak, A.: The web replica allocation and topology assignment problem in wide area networks: algorithms and computational results. In: Gervasi, O., Gavrilova, M., Kumar, V., Lagan\u00e0, A., Lee, H.P., Mun, Y., Taniar, D., Tan, C.J.K. (eds.) ICCSA 2005. LNCS, vol.\u00a03483, pp. 772\u2013781. Springer, Heidelberg (2005)"},{"key":"28_CR10","unstructured":"Peng, G.: CDN: Content Distribution Network. sunysb.edu\/tr\/rpe13.ps.gz (2003)"},{"key":"28_CR11","volume-title":"Routing, Flow, and Capacity Design in Communication and Computer Networks","author":"M. Pi\u00f3ro","year":"2004","unstructured":"Pi\u00f3ro, M., Medhi, D.: Routing, Flow, and Capacity Design in Communication and Computer Networks. Morgan Kaufman Publishers, Seattle, Washington (2004)"},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1023\/B:COAP.0000008650.91314.59","volume":"2","author":"K. Walkowiak","year":"2004","unstructured":"Walkowiak, K.: A Branch-and-bound Algorithm for Primary Routes Assignment in SurvivableConnection Oriented Networks. Computational Optimization and Applications\u00a02, 149\u2013171 (2004)","journal-title":"Computational Optimization and Applications"},{"key":"28_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1092","DOI":"10.1007\/11428862_180","volume-title":"Computational Science \u2013 ICCS 2005","author":"K. Walkowiak","year":"2005","unstructured":"Walkowiak, K.: Heuristic Algorithm for Anycast Flow Assignment in Connection-Oriented Networks. In: Sunderam, V.S., van Albada, G.D., Sloot, P.M.A., Dongarra, J.J. (eds.) ICCS 2005. LNCS, vol.\u00a03516, pp. 1092\u20131095. Springer, Heidelberg (2005)"},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/11569596_3","volume-title":"Computer and Information Sciences - ISCIS 2005","author":"K. Walkowiak","year":"2005","unstructured":"Walkowiak, K.: A Unified Approach to Survivability of Connection-Oriented Networks. In: Yolum, p., G\u00fcng\u00f6r, T., G\u00fcrgen, F., \u00d6zturan, C. (eds.) ISCIS 2005. LNCS, vol.\u00a03733, pp. 3\u201312. Springer, Heidelberg (2005)"},{"key":"28_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"618","DOI":"10.1007\/11758501_83","volume-title":"Computational Science \u2013 ICCS 2006","author":"K. Walkowiak","year":"2006","unstructured":"Walkowiak, K.: Lagrangean Heuristic for Anycast Flow Assignment in Connection-Oriented Networks. In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J.J. (eds.) ICCS 2006. LNCS, vol.\u00a03991, pp. 618\u2013625. Springer, Heidelberg (2006)"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Walkowiak, K.: Survivable Routing of Unicast and Anycast Flows in MPLS Networks. In: Proc. 3\n                    rd\n                   EURO-NGI Conference on Next Generation Internet Networks, pp. 72\u201379 (2007)","DOI":"10.1109\/NGI.2007.371200"}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74484-9_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:33:22Z","timestamp":1619519602000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74484-9_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744825"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74484-9_28","relation":{},"subject":[]}}