{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:37:47Z","timestamp":1725565067829},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221142"},{"type":"electronic","value":"9783540246855"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24685-5_95","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T17:18:16Z","timestamp":1283966296000},"page":"582-585","source":"Crossref","is-referenced-by-count":2,"title":["Advanced Multicasting for DVBMT Solution"],"prefix":"10.1007","author":[{"given":"Moonseong","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Young-Cheol","family":"Bang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hyunseung","family":"Choo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"95_CR1","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1109\/90.234851","volume":"1","author":"V.P. Kompella","year":"1993","unstructured":"Kompella, V.P., Pasquale, J.C., Polyzos, G.C.: Multicast routing for multimedia communication. IEEE\/ACM Trans. Networking\u00a01(3), 286\u2013292 (1993)","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"95_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1007\/3-540-44862-4_95","volume-title":"Computational Science \u2013 ICCS 2003","author":"A.S. Rodionov","year":"2003","unstructured":"Rodionov, A.S., Choo, H.: On Generating Random Network Structures: Trees. In: Sloot, P.M.A., Abramson, D., Bogdanov, A.V., Gorbachev, Y.E., Dongarra, J., Zomaya, A.Y. (eds.) ICCS 2003. LNCS, vol.\u00a02658, pp. 879\u2013887. Springer, Heidelberg (2003)"},{"issue":"3","key":"95_CR3","first-page":"346","volume":"15","author":"G.N. Rouskas","year":"1997","unstructured":"Rouskas, G.N., Baldine, I.: Multicast routing with end-to-end delay and delay variation constraints. IEEE JSAC\u00a015(3), 346\u2013356 (1997)","journal-title":"IEEE JSAC"},{"key":"95_CR4","unstructured":"Sheu, P.-R., Chen, S.-T.: A fast and efficient heuristic algorithm for the delayand delay variation bound multicast tree problem. In: Information Networking, Proc. ICOIN-15, January 2001, pp. 611\u2013618 (2001)"},{"key":"95_CR5","unstructured":"Zhu, Q., Parsa, M., Garcia-Luna-Aceves, J.J.: A source-based algorithm for near-optimum delay-constrained multicasting. In: Proc. IEEE INFOCOM 1995, March 1995, pp. 377\u2013385 (1995)"}],"container-title":["Lecture Notes in Computer Science","Computational Science - ICCS 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24685-5_95","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T01:00:30Z","timestamp":1553043630000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24685-5_95"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221142","9783540246855"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24685-5_95","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}