{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:45:58Z","timestamp":1725565558350},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540219590"},{"type":"electronic","value":"9783540246930"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24693-0_17","type":"book-chapter","created":{"date-parts":[[2010,9,11]],"date-time":"2010-09-11T02:02:45Z","timestamp":1284170565000},"page":"200-210","source":"Crossref","is-referenced-by-count":6,"title":["On Core Selection Algorithm for Reducing Delay Variation of Many-to-Many Multicasts with Delay-Bounds"],"prefix":"10.1007","author":[{"given":"Moonseong","family":"Kim","sequence":"first","affiliation":[]},{"given":"Young-Cheol","family":"Bang","sequence":"additional","affiliation":[]},{"given":"Hyunseung","family":"Choo","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1109\/TCOM.1983.1095818","volume":"3","author":"K Bharath-Kumar","year":"1983","unstructured":"K. Bharath-Kumar and J. M. Jaffe, \u201cRouting to multiple destinations in computer networks,\u201d IEEE Trans. Commun., vol. COMM-31, no. 3, pp. 343\u2013351, March 1983.","journal-title":"IEEE Trans. Commun., vol. COMM-31"},{"issue":"4","key":"17_CR2","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1145\/167954.166246","volume":"23","author":"T Ballardie","year":"1993","unstructured":"T. Ballardie, P. Francis, and J. Crowcroft, \u201cCore based trees (CBT): An architecture for scalable inter-domain multicast routing,\u201d. Computer Commun Rev., vol. 23, no. 4, pp. 85\u201395, 1993.","journal-title":"Computer Commun Rev"},{"key":"17_CR3","volume-title":"Core Based Trees (CBT Version 3) Multicast Routing","author":"A Ballardie","year":"1998","unstructured":"A. Ballardie, B. Cain, and Z. Zhang, \u201cCore Based Trees (CBT Version 3) Multicast Routing,\u201d Internet draft, 1998."},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"736","DOI":"10.1007\/3-540-45706-2_102","volume":"2400","author":"Y-C Bang","year":"2002","unstructured":"Y.-C. Bang and H. Choo, \u201cOn multicasting with minimum costs for the Internet topology,\u201d Springer-Verlag Lecture Notes in Computer Science, vol. 2400, pp. 736\u2013744, August 2002.","journal-title":"Springer-Verlag Lecture Notes in Computer Science"},{"key":"17_CR5","volume-title":"Protocol Independent Multicast-Sparse Mode (PIM-SM): Motivation and Architecture","author":"S Deering","year":"1998","unstructured":"S. Deering et al., \u201cProtocol Independent Multicast-Sparse Mode (PIM-SM): Motivation and Architecture,\u201d Internet draft, 1998."},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"EW Dijkstra","year":"1959","unstructured":"E. W. Dijkstra, \u201cA note on two problems in connexion with graphs,\u201d Numerische Mathematik, vol. 1, pp. 269\u2013271, 1959.","journal-title":"Numerische Mathematik"},{"key":"17_CR7","volume-title":"Protocol Independent Multicast (PIM) Sparse Mode\/Dense Mode","author":"D Estrin","year":"1996","unstructured":"D. Estrin et al., \u201cProtocol Independent Multicast (PIM) Sparse Mode\/Dense Mode,\u201d Internet draft, 1996."},{"issue":"4","key":"17_CR8","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1137\/0132072","volume":"32","author":"MR Garey","year":"1977","unstructured":"M. R. Garey, R. L. Graham, and D. S. Johnson, \u201cThe complexity of computing steiner minimal trees,\u201d SIAM J. Appl. Math., vol. 32, no. 4, pp. 835\u2013859, June 1977.","journal-title":"SIAM J. Appl. Math."},{"key":"17_CR9","series-title":"SIAM J. Appl. Math","volume-title":"Steiner minimal tree","author":"EN Gilbert","year":"1968","unstructured":"E. N. Gilbert and H. O. Pollak, \u201cSteiner minimal tree,\u201d SIAM J. Appl. Math., vol. 16, 1968."},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1002\/net.3230010203","volume":"1","author":"SL Hakimi","year":"1971","unstructured":"S. L. Hakimi, \u201cSteiner\u2019s problem in graphs and its implication,\u201d Networks, vol. 1, pp. 113\u2013133, 1971.","journal-title":"Networks"},{"issue":"3","key":"17_CR11","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1109\/90.234851","volume":"1","author":"VP Kompella","year":"1993","unstructured":"V. P. Kompella, J. C. Pasquale, and G. C. Polyzos, \u201cMulticast routing for multimedia communication,\u201d IEEE\/ACM Trans. Networking, vol. 1, no. 3, pp. 286\u2013292, June 1993.","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF00288961","volume":"15","author":"L Kou","year":"1981","unstructured":"L. Kou, G. Markowsky, and L. Berman, \u201cA fast algorithm for steiner trees,\u201d Acta Informatica, vol. 15, pp. 141\u2013145, 1981.","journal-title":"Acta Informatica"},{"key":"17_CR13","volume-title":"Multicast Extension to OSPF","author":"J Moy","year":"1998","unstructured":"J. Moy, \u201cMulticast Extension to OSPF,\u201d Internet draft, 1998."},{"key":"17_CR14","volume-title":"Distance Vector Routing Protocol","author":"T Pusateri","year":"1998","unstructured":"T. Pusateri, \u201cDistance Vector Routing Protocol\u201d, draft-ietf-idmr-dvmrp-v3\u201307, 1998."},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1007\/3-540-44862-4_95","volume":"2658","author":"AS Rodionov","year":"2003","unstructured":"A.S. Rodionov and H. Choo, \u201cOn generating random network structures: Trees,\u201d Springer-Verlag Lecture Notes in Computer Science, vol. 2658, pp. 879\u2013887, June 2003.","journal-title":"Springer-Verlag Lecture Notes in Computer Science"},{"key":"17_CR16","first-page":"1145","volume-title":"On generating random network structures: Connected Graphs","author":"AS Rodionov","year":"2003","unstructured":"A.S. Rodionov and H. Choo, \u201cOn generating random network structures: Connected Graphs,\u201d International Conference on Information Networking 2004, Proc. ICOIN-18, pp. 1145\u20131152, February 2003."},{"issue":"3","key":"17_CR17","first-page":"346","volume":"15","author":"GN Rouskas","year":"1997","unstructured":"G. N. Rouskas and I. Baldine, \u201cMulticast routing with end-to-end delay and delay variation constraints,\u201d IEEE JSAC, vol. 15, no. 3, pp. 346\u2013356, April 1997.","journal-title":"IEEE JSAC"},{"key":"17_CR18","series-title":"Information Networking, Proc. ICOIN-15","first-page":"611","volume-title":"A fast and efficient heuristic algorithm for the delay-and delay variation bound multicast tree problem","author":"P-R Sheu","year":"2001","unstructured":"P.-R. Sheu and S.-T. Chen, \u201cA fast and efficient heuristic algorithm for the delay-and delay variation bound multicast tree problem,\u201d Information Networking, Proc. ICOIN-15, pp. 611\u2013618, January 2001."},{"issue":"6","key":"17_CR19","first-page":"573","volume":"24","author":"H Takahashi","year":"1980","unstructured":"H. Takahashi and A. Matsuyame, \u201cAn approximate solution for the steiner problem in graphs,\u201d Mathematica Japonica, vol. 24, no. 6, pp. 573\u2013577, 1980.","journal-title":"Mathematica Japonica"},{"key":"17_CR20","volume-title":"Multicast Routing and its QoS Extension: Problems, Algorithms, and Protocols","author":"B Wang","year":"2000","unstructured":"B. Wang and J. C. Hou, \u201cMulticast Routing and its QoS Extension: Problems, Algorithms, and Protocols,\u201d IEEE Networks, Jan.\/Feb, 2000."},{"issue":"9","key":"17_CR21","first-page":"1617","volume":"6","author":"BW Waxman","year":"1988","unstructured":"B. W. Waxman, \u201cRouting of multipoint connections,\u201d IEEE JSAC, vol. 6, no. 9, pp. 1617\u20131622, December 1988","journal-title":"IEEE JSAC"},{"key":"17_CR22","series-title":"Proc. IEEE INFOCOM\u201995","first-page":"377","volume-title":"A source-based algorithm for near-optimum delay-constrained multicasting","author":"Q Zhu","year":"1995","unstructured":"Q. Zhu, M. Parsa, and J. J. Garcia-Luna-Aceves, \u201cA source-based algorithm for near-optimum delay-constrained multicasting,\u201d Proc. IEEE INFOCOM\u201995, pp. 377\u2013385, March 1995."}],"container-title":["Lecture Notes in Computer Science","NETWORKING 2004. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24693-0_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:03:36Z","timestamp":1620011016000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24693-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540219590","9783540246930"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24693-0_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}