{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T13:37:38Z","timestamp":1777901858758,"version":"3.51.4"},"reference-count":20,"publisher":"SAGE Publications","issue":"1","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIMULATION"],"published-print":{"date-parts":[[1997,1]]},"abstract":"<jats:p>This paper begins with an overview of multicast algorithms, which are the most promising candidates to be in wide use in first generation Asynchronous Transfer Mode (ATM) based Broadband Integrated Services Digital Networks (B-ISDN). Since the Multiple Destination Routing (MDR) problem and the associated Steiner Tree problem are known to be NP-complete and therefore a number of heuristic algorithms have been proposed in the literature, we first need to establish which of these are the best candidates for the B-ISDN. We conclude that the weighted greedy -type algorithms are promising ones, and therefore we examine the behavior of these algorithms in terms of blocking probability and network utilization. In doing so, we use a B-ISDN call level simulation program, which proves to be an indispensable tool in the quest for efficient multicast algorithms. We find that shortest path routing with appropriate (adaptive) weight functions combined with the complete partitioning link allocation policy may give satisfactory blocking values and good network utilization in networks of different sizes.<\/jats:p>","DOI":"10.1177\/003754979706800108","type":"journal-article","created":{"date-parts":[[2017,7,3]],"date-time":"2017-07-03T15:00:11Z","timestamp":1499094011000},"page":"34-43","source":"Crossref","is-referenced-by-count":1,"title":["Simulation Analysis of Routing Strategies in Multicasting Multiservice Loss Networks"],"prefix":"10.1177","volume":"68","author":[{"given":"Krzysztof","family":"Szarkowicz","sequence":"first","affiliation":[{"name":"Department of Telecommunications and Telematics Technical University of Budapest Budapest, Hungary , ,"},{"name":"Department of Electrical and Computer Engineering Boston University Boston, Massachusetts"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e1bor","family":"Fodor","sequence":"additional","affiliation":[{"name":"Department of Telecommunications and Telematics Technical University of Budapest Budapest, Hungary , ,"},{"name":"Department of Electrical and Computer Engineering Boston University Boston, Massachusetts"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e1s","family":"Farag\u00f3","sequence":"additional","affiliation":[{"name":"Department of Telecommunications and Telematics Technical University of Budapest Budapest, Hungary , ,"},{"name":"Department of Electrical and Computer Engineering Boston University Boston, Massachusetts"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tam\u00e1s","family":"Henk","sequence":"additional","affiliation":[{"name":"Department of Telecommunications and Telematics Technical University of Budapest Budapest, Hungary , ,"},{"name":"Department of Electrical and Computer Engineering Boston University Boston, Massachusetts"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[1997,1,1]]},"reference":[{"key":"bibr1-003754979706800108","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1983.1095818"},{"key":"bibr2-003754979706800108","doi-asserted-by":"crossref","unstructured":"2 Chow C.H. 1991. \u201cOn multicast path finding algorithms.\u201d IEEE INFOCOM '91, pp. 1274\u20131283.","DOI":"10.1109\/INFCOM.1991.147651"},{"key":"bibr3-003754979706800108","doi-asserted-by":"publisher","DOI":"10.1007\/BF00288961"},{"key":"bibr4-003754979706800108","doi-asserted-by":"crossref","unstructured":"4 Kompella W.P., Pasquale J.C., Polyzos G.C. 1992. \u201cMulticasting for multimedia applications.\u201d IEEE INFOCOM '92, Florence, Italy, May, pp. 2078\u20132085.","DOI":"10.1109\/INFCOM.1992.263480"},{"key":"bibr5-003754979706800108","first-page":"1311","volume":"3","author":"Leung Y.-W.","year":"1991","journal-title":"International Conference on Communications"},{"issue":"5","key":"bibr6-003754979706800108","first-page":"544","volume":"76","author":"Tanaka Y.","year":"1993","journal-title":"IEICE Transactions on Communication"},{"key":"bibr7-003754979706800108","doi-asserted-by":"publisher","DOI":"10.1109\/49.12889"},{"key":"bibr8-003754979706800108","doi-asserted-by":"crossref","unstructured":"8 Waxman B.M. 1993. \u201cPerformance evaluation of multipoint routing algorithms.\u201d IEEE INFOCOM '93, San Francisco, CA, USA, pp. 980\u2013986.","DOI":"10.1109\/INFCOM.1993.253268"},{"key":"bibr9-003754979706800108","unstructured":"9 Kelly F.P. 1995. \u201cThe Clifford Paterson lecture.\u201d Proc. of Royal Soc., London."},{"key":"bibr10-003754979706800108","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-2126-8"},{"key":"bibr11-003754979706800108","unstructured":"11 Fodor G., et al. 1994. \u201cA flexible simulation platform for ATM networks.\u201d SCS European Simulation Symposium ESS '94, Istanbul, Turkey."},{"key":"bibr12-003754979706800108","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M.R.","year":"1979"},{"key":"bibr13-003754979706800108","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1957.tb01515.x"},{"key":"bibr14-003754979706800108","unstructured":"14 Fodor G., et al. 1995. \u201cOn the call and cell level resource allocation in ATM networks.\u201d SCS European Simulation Symposium, ESS '95, Erlangen, Germany."},{"key":"bibr15-003754979706800108","unstructured":"15 Fodor G., et al. 1996. \u201cSimulative analysis of end-to-end call blocking probability evaluation techniques in multirate loss networks.\u201d Proceedings of the SCS European Simulation Multiconference, ESM '96, Budapest, Hungary."},{"key":"bibr16-003754979706800108","unstructured":"16 Szarkowicz K. 1995. Multicasting in ATM Networks. Master's Thesis, Technical University of Budapest, Department of Telecommunications and Telematics, Hungary."},{"key":"bibr17-003754979706800108","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380220204"},{"key":"bibr18-003754979706800108","unstructured":"18 Doar M., Leslie I. 1993. \u201cHow bad is naive multicast routing?\u201d IEEE INFOCOM '93, San Francisco, CA, USA, pp. 82\u201389."},{"key":"bibr19-003754979706800108","unstructured":"19 Noronha C.A.Jr. 1994. Routing of Video\/Audio Streams in Packed-Switched Networks. Technical Report No. CSL-TR-94-653, Computer Systems Laboratory, Department of Electrical Engineering and Computer Science, Stanford University, Stanford, CA, USA, December."},{"key":"bibr20-003754979706800108","doi-asserted-by":"crossref","unstructured":"20 Szarkowicz K., Fodor G., Farag\u00f3 A., Henk T. 1997. \u201cSimulative analysis of optimal link allocation strategies in multicasting multiservice loss networks.\u201d In preparation.","DOI":"10.1177\/003754979706800108"}],"container-title":["SIMULATION"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/003754979706800108","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/003754979706800108","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T11:11:18Z","timestamp":1777633878000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/003754979706800108"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,1]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,1]]}},"alternative-id":["10.1177\/003754979706800108"],"URL":"https:\/\/doi.org\/10.1177\/003754979706800108","relation":{},"ISSN":["0037-5497","1741-3133"],"issn-type":[{"value":"0037-5497","type":"print"},{"value":"1741-3133","type":"electronic"}],"subject":[],"published":{"date-parts":[[1997,1]]}}}