Multicast Routing in High-Speed Networks

Multicast routing problem is one of the essential problems for supporting multicast services which are considered to be very important services of high-speed networks. In the past, much research work has been focused on best-effort multicasting, e.g. the Internet multicast routing schemes: DVMRP (the reverse path multicasting), MOSPF (shortest path multicasting), CBT (group shared multicasting) and PIM (protocol independent multicasting). Even though these schemes exhibit simplicity and some also exhibit excellent scalability, they are not suitable for real-time applications.

Real-time applications (e.g. videoconferencing, multimedia education etc.) have strict Quality of Service requirements that must be guaranteed by the underlying network. Most real-time multicast routing schemes involve computing constrained multicast routing trees, that is, the QoS requirements of a real-time application are usually expressed in terms of constraints that the multicast routing algorithm must satisfy. Many things indicate, however, that routing problems in high-speed networks (e.g. ATM networks) are very complex.

In this project, we study various multicast routing schemes for high-speed networks, especially for ATM networks.

People involved in this project

Prof. Dr. Horst Langendorfer
M.Sc. Quan Sun

sun@ibr.cs.tu-bs.de