Performance evaluation of multipoint routing algorithms

The problem of developing efficient multipoint routing algorithms for asynchronous transfer mode (ATM) networks is considered. Emphasis is placed on practical algorithms that have efficient distributed implementation. In particular, the weighted greedy algorithm (WGA) is investigated. This algorithm is of particular interest since one version can be implemented as a simple extension of point-to-point routing and since a straightforward distributed implementation is possible. The performance of the WGA is studied by means of computer simulations and compared to that of a theoretically good algorithm. Experiments are conducted under realistic conditions involving different connection types, including point-to-point and dynamic multipoint connections. Performance is evaluated in terms of an algorithm´s load carrying potential. The goal is to find algorithms that maximize the load carrying ability of a network