Simulation Analysis of Routing Strategies in Multicasting Multiservice Loss Networks
1997 (English)In: Simulation (San Diego, Calif.), ISSN 0037-5497, E-ISSN 1741-3133, Vol. 68, no 1, 34-43 p.Article in journal (Refereed) Published
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.
Place, publisher, year, edition, pages
SCS , 1997. Vol. 68, no 1, 34-43 p.
Engineering and Technology
IdentifiersURN: urn:nbn:se:kth:diva-203000OAI: oai:DiVA.org:kth-203000DiVA: diva2:1082174
UT: A1997XF00500004; ScopusID: 0030650624. QCR 201703212017-03-152017-03-152017-03-21Bibliographically approved