ABSTRACT
This chapter describes routing algorithms for multicast connections in packet networks and analyzes their efciency with computer simulations.
The rst part presents an analysis of the methods for network topology modelling that are to represent real telecommunications and computer networks with the application of graphs. The most important parameters for the description of the network that allow the selected models to be compared qualitatively are presented and discussed. The adopted methods for modelling network topology make it possible to formulate a methodology for a comparative research study of multicast routing algorithms. The efcacy of the proposed algorithms is examined in the second part of the chapter.
