Abstract

Much of the work on routing algorithms, particularly for multicast, which has been done in the past has used fairly simple models to generate the topological graph which represents the nodes in the network. Some such random graphs bear little resemblance to data communication networks which are actually deployed. This paper proposes a more realistic model for such random networks and describes various scenarios which can be more accurately represented. The approach described here can be developed to provide more refined models in the future, and the source code of an implementation is freely available. 1.0 INTRODUCTION One of the major areas of interest in recent routing research has been how to route multicast packets in a connection-oriented network such as an IP network, and similarly, how to set up multicast connections in a connection-oriented network, such as an ATM network. Many algorithms have been described in the literature. Some produce an optimal solution [Karp72] but many...

Citations