Kadirire, James; (1996) Dynamic multicast routing in the Asynchronous Transfer Mode environment. Doctoral thesis (Ph.D.), University College London (United Kingdom).

Preview

Text Dynamic_multicast_routing_in_t.pdf Download (19MB) | Preview

Abstract

In future multimedia or integrated services (voice, video, data and images) wide-area communications networks, like Asynchronous Transfer Mode (ATM) networks, the ability to multicast information will be useful for many new and existing services. An investigation of some of the main current dynamic multicast routing algorithms proposed in the literature for multicast (point-to-multipoint) communications is carried out. Dynamic in this thesis is used to mean that nodes which are already in the multicast group may leave or nodes which are not in the multicast group may join at any time during the lifetime of the multicast group. The thesis reveals the short-comings of these algorithms and hence justifies the need for more research into dynamic multicast routing algorithms. The problem of 'Geographic Spread' (GS) (defined in chapter 4) is identified and it is shown via simulations that spreading out the multicast connections 'geographically' in the network reduces the mean packet copies per node. A new dynamic point-to-multipoint routing algorithm for wide-area ATM networks, named the 'Geographic Spread Dynamic Multicast' (GSDM) [Kadirire_94] routing algorithm is proposed and implemented. Multiple simulations are performed to test the performance of the GSDM routing algorithm against the implementation of a well known near optimal Steiner tree heuristic commonly referred to in the literature, as the KMB [Kou]. The effect of GS is also investigated to see how it affects the performance of the GSDM algorithm. The source rooted shortest path (SP) algorithm, which uses multiple direct point-to-point connections with each of the destinations, the naive source rooted shortest path (NSP) algorithm [Doar_93a], which takes the union of the paths sharing a common link and the Greedy algorithm [Waxman_88], [Waxman_89] are also implemented. The performance of the GSDM routing algorithm is compared against the implementations of these dynamic multicast routing algorithms using randomly generated graphs to simulate the computer networks. "Also, that the soul be without knowledge, it is not good;..." Proverbs 19:2.

Download activity - last month

Export as JSONCSVXML

Download activity - last 12 months

Export as JSONXMLCSV

Downloads by country - last 12 months

Export as JSONXMLCSV

Archive Staff Only

View Item