Exploiting geographic spread (GS) for wide-area asynchronous transfer mode (ATM) dynamic multipoint routing

This paper looks at how geographic spread (GS) can be used to aid with the routing of dynamic multipoint connections in wide-area packet switched networks like ATM networks. It presents the geographic spread dynamic multipoint (GSDM) routing algorithm proposed by Kadirire (see ACM SIGCOM Computer Communications Review October 1994) and investigates how the algorithm performs when the GS, the multicast group size and the number of nodes in the graph are increased. We also compare the GSDM with the greedy algorithm of Waxman (1988) and present simulation results over random graphs that demonstrate the performance of these algorithms.<
>