{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:23:22Z","timestamp":1755221002096,"version":"3.43.0"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[1999,3,1]],"date-time":"1999-03-01T00:00:00Z","timestamp":920246400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,3,1]],"date-time":"1999-03-01T00:00:00Z","timestamp":920246400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Telecommunication Systems"],"published-print":{"date-parts":[[1999,3]]},"DOI":"10.1023\/a:1019180830926","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T18:30:27Z","timestamp":1045679427000},"page":"47-58","source":"Crossref","is-referenced-by-count":3,"title":["A distributed delay-constrained dynamic multicast routing algorithm"],"prefix":"10.1007","volume":"11","author":[{"given":"Quan","family":"Sun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Horst","family":"Langend\u0151rfer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"329727_CR1","unstructured":"F. Bauer and A. Varma, ARIES: a rearrangeable inexpensive edge-based on-line Steiner algorithm, in: Proc.IEEE GLOBECOM '95(1995)."},{"key":"329727_CR2","doi-asserted-by":"crossref","unstructured":"E. Biersack and J. Nonnenmacher, WAVE: a new multicast routing algorithm for static and dynamic multicast groups, in: Proc.5th Workshop on Network and Operating System Support for Digital Audio and Video(1995).","DOI":"10.1007\/BFb0019274"},{"issue":"2","key":"329727_CR3","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1145\/78952.78953","volume":"8","author":"S.E. Deering","year":"1990","unstructured":"S.E. Deering and D.A. Cheriton, Multicast routing in datagram internetworks and extended LANs, ACM Transactions on Computer Systems 8(2) (1990) 85\u2013110.","journal-title":"ACM Transactions on Computer Systems"},{"key":"329727_CR4","doi-asserted-by":"crossref","unstructured":"M. Doar and I. Leslie, How bad is naive multicast routing, in: Proc.IEEE INFOCOM '93(1993) pp. 82\u201389.","DOI":"10.1109\/INFCOM.1993.253246"},{"key":"329727_CR5","unstructured":"W. Effelsberg and E. Mueller-Menrad, Dynamic join and leave for real-time multicast, Tenet Report TR\u201393\u2013056, Computer Science Division, University of California at Berkeley (1993)."},{"key":"329727_CR6","doi-asserted-by":"crossref","unstructured":"C. Hedrick, Routing Information Protocol, Internet RFC 1058 (June 1988).","DOI":"10.17487\/rfc1058"},{"issue":"3","key":"329727_CR7","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1137\/0404033","volume":"4","author":"M. Imase","year":"1991","unstructured":"M. Imase and B. Waxman, Dynamic Steiner tree problem, SIAM J. Disc. Math. 4(3) (1991) 369\u2013384.","journal-title":"SIAM J. Disc. Math."},{"key":"329727_CR8","doi-asserted-by":"crossref","unstructured":"J. Kadirire and G. Knight, Comparison of dynamic multicast routing algorithms for wide-area packet switched (asynchronous transfer mode) networks, in: Proc.IEEE INFOCOMM '95(1995) pp. 212\u2013219.","DOI":"10.1109\/INFCOM.1995.515879"},{"issue":"3","key":"329727_CR9","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1109\/90.234851","volume":"1","author":"V.P. Kompella","year":"1993","unstructured":"V.P. Kompella, J.C. Pasquale and G.C. Polyzos, Multicast routing for multimedia communication, IEEE\/ACM Transactions on Networking 1(3) (1993) 286\u2013292.","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"6","key":"329727_CR10","doi-asserted-by":"crossref","first-page":"1128","DOI":"10.1109\/49.400667","volume":"13","author":"S. Plotkin","year":"1995","unstructured":"S. Plotkin, Competitive routing of virtual circuits in ATM networks, IEEE Journal of Selected Areas in Communications 13(6) (1995) 1128\u20131136.","journal-title":"IEEE Journal of Selected Areas in Communications"},{"key":"329727_CR11","doi-asserted-by":"crossref","unstructured":"H.F. Salama, D.S. Reeves and Y. Viniotis, Evaluation of multicast routing algorithms for real-time communication on high-speed networks, in: High Performance Networking VI, IFIP 6th International Conference on High Performance Networking(1995) pp. 27\u201342 (the multicast simulator MCRSIM can be downloaded from ftp:\/\/ftp.csc.ncsu.edu\/pub\/rtcomm\/).","DOI":"10.1007\/978-0-387-34949-7_3"},{"issue":"6","key":"329727_CR12","doi-asserted-by":"crossref","first-page":"572","DOI":"10.1016\/S0140-3664(98)00127-3","volume":"21","author":"Q. Sun","year":"1998","unstructured":"Q. Sun and H. Langend\u0151rfer, A new distributed routing algorithm for supporting delay-sensitive applications, Computer Communications 21(6) (1998) 572\u2013578.","journal-title":"Computer Communications"},{"issue":"9","key":"329727_CR13","doi-asserted-by":"crossref","first-page":"1617","DOI":"10.1109\/49.12889","volume":"6","author":"B.M. Waxman","year":"1988","unstructured":"B.M. Waxman, Routing of multipoint connections, IEEE Journal on Selected Areas in Communications 6(9) (1988) 1617\u20131622.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"329727_CR14","unstructured":"S. Wi and Y. Choi, A delay constrained distributed multicast routing algorithm, in: Proc.12th International Conference on Computer Communication, ICCC '95(1995) pp. 833\u2013838."},{"key":"329727_CR15","unstructured":"R. Widyono, The design and evaluation of routing algorithms for real-time channels, Technical Report TR\u201394\u2013024, Tenet Group, Department of EECS, University of California at Berkeley (1994)."},{"key":"329727_CR16","unstructured":"Q. Zhu, M. Parsa and J.J. Garcia-Luna-Aceves, A source-based algorithm for near-optimum delayconstrained multicasting, in: Proc.IEEE INFOCOM '95(1995) pp. 377\u2013385."}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019180830926.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1019180830926\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019180830926.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T06:36:23Z","timestamp":1754634983000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1019180830926"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,3]]},"references-count":16,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,3]]}},"alternative-id":["329727"],"URL":"https:\/\/doi.org\/10.1023\/a:1019180830926","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"type":"print","value":"1018-4864"},{"type":"electronic","value":"1572-9451"}],"subject":[],"published":{"date-parts":[[1999,3]]}}}