{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T07:10:24Z","timestamp":1743232224144,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642305061"},{"type":"electronic","value":"9783642305078"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30507-8_37","type":"book-chapter","created":{"date-parts":[[2012,6,2]],"date-time":"2012-06-02T02:29:57Z","timestamp":1338604197000},"page":"429-443","source":"Crossref","is-referenced-by-count":6,"title":["VND-CS: A Variable Neighborhood Descent Algorithm for Core Selection Problem in Multicast Routing Protocol"],"prefix":"10.1007","author":[{"given":"Youssef","family":"Baddi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed Dafir Ech-Cherif","family":"El Kettani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"37_CR1","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1145\/78952.78953","volume":"8","author":"S.E. Deering","year":"1990","unstructured":"Deering, S.E., Cheriton, D.R.: Multicast routing in datagram internetworks and extended lans. ACM Transactions on Computer Systems\u00a08, 85\u2013110 (1990)","journal-title":"ACM Transactions on Computer Systems"},{"issue":"3-4","key":"37_CR2","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1023\/A:1013854808626","volume":"19","author":"D. Zappala","year":"2002","unstructured":"Zappala, D., Fabbri, A., Lo, V.M.: An evaluation of shared multicast trees with multiple cores. Telecommunication Systems\u00a019(3-4), 461\u2013479 (2002)","journal-title":"Telecommunication Systems"},{"key":"37_CR3","doi-asserted-by":"crossref","unstructured":"Fenner, B., Handley, M., Holbrook, H., Kouvelas, I.: Protocol Independent Multicast-Sparse Mode (PIM-SM): Protocol Specification (Revised). RFC 4601 (2006)","DOI":"10.17487\/rfc4601"},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"Ballardie, A.: Core based trees (CBT version 2) multicast routing \u2013 protocol specification. RFC 2189 (1997)","DOI":"10.17487\/rfc2189"},{"issue":"1","key":"37_CR5","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1109\/COMST.2000.5340719","volume":"3","author":"M. Ramalho","year":"2000","unstructured":"Ramalho, M.: Intra- and inter-domain multicast routing protocols: A survey and taxonomy. IEEE Communications Surveys and Tutorials\u00a03(1), 2\u201325 (2000)","journal-title":"IEEE Communications Surveys and Tutorials"},{"key":"37_CR6","unstructured":"Wall, D.W.: Mechanisms for Broadcast and Selective Broadcast. Ph.D. thesis, Stanford, CA, USA (1980)"},{"issue":"8","key":"37_CR7","doi-asserted-by":"publisher","first-page":"998","DOI":"10.1016\/j.comcom.2005.06.003","volume":"29","author":"A. Karaman","year":"2006","unstructured":"Karaman, A., Hassanein, H.: Core-selection algorithms in multicast routing - comparative and complexity analysis. Comput. Commun.\u00a029(8), 998\u20131014 (2006)","journal-title":"Comput. Commun."},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"Calvert, K.L., Zegura, E.W., Donahoo, M.J.: Core selection methods for multicast routing, pp. 638\u2013642 (1995)","DOI":"10.1109\/ICCCN.1995.540184"},{"key":"37_CR9","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0020-0190(88)90066-X","volume":"27","author":"K. Mehlhorn","year":"1988","unstructured":"Mehlhorn, K.: A faster approximation algorithm for the steiner problem in graphs. Inf. Process. Lett.\u00a027, 125\u2013128 (1988)","journal-title":"Inf. Process. Lett."},{"key":"37_CR10","unstructured":"Wei, L., Estrin, D.: The trade-offs of multicast trees and algorithms (1994)"},{"key":"37_CR11","doi-asserted-by":"crossref","unstructured":"Tagmouti, M., Gendreau, M., Potvin, J.Y.: A variable neighborhood descent heuristic for arc routing problems with time-dependent service costs. Comput. Ind. Eng.\u00a059 (2010)","DOI":"10.1016\/j.cie.2010.09.006"},{"key":"37_CR12","unstructured":"Moy, J.: MOSPF: Analysis and Experience. RFC 1585 (Informational), Internet Engineering Task Force IETF (1994), http:\/\/www.ietf.org\/rfc\/rfc1585.txt"},{"key":"37_CR13","unstructured":"Farinacci, D., Li, T., Hanks, S., Meyer, D., Traina, P.: Protocol independent multicast - dense mode (pim-dm): Protocol specification (revised). RFC 3973 (2005)"},{"key":"37_CR14","doi-asserted-by":"crossref","unstructured":"Waitzman, D., Partridge, C., Deering, S.E.: RFC 1075: Distance vector multicast routing protocol (1988)","DOI":"10.17487\/rfc1075"},{"key":"37_CR15","unstructured":"Shukla, S.B., Boyer, E.B., Klinker, J.E.: Multicast Tree Construction in Network Topologies with Asymmetric Link Loads. Ph.D. thesis (1994)"},{"key":"37_CR16","doi-asserted-by":"crossref","unstructured":"Bhaskar, N., Gall, A., Lingard, J., Venaas, S.: Bootstrap Router (BSR) Mechanism for Protocol Independent Multicast (PIM). RFC 5059 (Proposed Standard) (2008)","DOI":"10.17487\/rfc5059"},{"key":"37_CR17","unstructured":"Carrabs, F., Laporte, G., Cordeau, J.: Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading. Centre for Research on Transportation, Montr\u00e9al, Qu\u00e9bec (2005)"},{"issue":"2","key":"37_CR18","doi-asserted-by":"publisher","first-page":"34","DOI":"10.4304\/jsw.1.2.34-39","volume":"1","author":"M. Sevkli","year":"2006","unstructured":"Sevkli, M., Aydin, M.E.: Variable neighbourhood search for job shop scheduling problems. JSW\u00a01(2), 34\u201339 (2006)","journal-title":"JSW"},{"key":"37_CR19","first-page":"153","volume-title":"Variable neighborhood search for nurse rostering problems","author":"E. Burke","year":"2004","unstructured":"Burke, E., De Causmaecker, P., Petrovic, S., Berghe, G.V.: Variable neighborhood search for nurse rostering problems, pp. 153\u2013172. Kluwer Academic Publishers, MA (2004)"},{"issue":"3","key":"37_CR20","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P. Hansen","year":"2001","unstructured":"Hansen, P., Mladenovic, N.: Variable neighborhood search: Principles and applications. European Journal of Operational Research\u00a0130(3), 449\u2013467 (2001)","journal-title":"European Journal of Operational Research"},{"key":"37_CR21","first-page":"884","volume-title":"Proceedings of the INFOCOM 1997. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution","author":"C. Shields","year":"1997","unstructured":"Shields, C., Garcia-Luna-Aceves, J.J.: The ordered core based tree protocol. In: Proceedings of the INFOCOM 1997. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution, p. 884. IEEE Computer Society, Washington, DC (1997)"},{"issue":"1","key":"37_CR22","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.comcom.2009.07.015","volume":"33","author":"W. Hua","year":"2010","unstructured":"Hua, W., Xiangxu, M., Min, Z., Yanlong, L., et al.: Tabu search algorithm for RP selection in pim-sm multicast routing. Comput. Commun.\u00a033(1), 35\u201342 (2010)","journal-title":"Comput. Commun."},{"issue":"1","key":"37_CR23","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"Glover, F.: Tabu Search - Part II. INFORMS Journal on Computing\u00a02(1), 4\u201332 (1990)","journal-title":"INFORMS Journal on Computing"},{"key":"37_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-540-24693-0_17","volume-title":"NETWORKING 2004. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications","author":"M. Kim","year":"2004","unstructured":"Kim, M., Bang, Y.-C., Choo, H.: On Core Selection Algorithm for Reducing Delay Variation of Many-to-Many Multicasts with Delay-Bounds. In: Mitrou, N.M., Kontovasilis, K., Rouskas, G.N., Iliadis, I., Merakos, L. (eds.) NETWORKING 2004. LNCS, vol.\u00a03042, pp. 200\u2013210. Springer, Heidelberg (2004)"},{"key":"37_CR25","unstructured":"Hansen, P., Mladenovi, N.: Variable neighborhood search: Methods and recent applications. In: Proceedings of MIC 1999. pp. 275\u2013280 (1999)"},{"issue":"9","key":"37_CR26","doi-asserted-by":"publisher","first-page":"1617","DOI":"10.1109\/49.12889","volume":"6","author":"B.M. Waxman","year":"2002","unstructured":"Waxman, B.M.: Routing of multipoint connections. IEEE Journal on Selected Areas in Communications\u00a06(9), 1617\u20131622 (2002), http:\/\/dx.doi.org\/10.1109\/49.12889","journal-title":"IEEE Journal on Selected Areas in Communications"}],"container-title":["Communications in Computer and Information Science","Networked Digital Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30507-8_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T06:39:51Z","timestamp":1743230391000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30507-8_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642305061","9783642305078"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30507-8_37","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2012]]}}}