Fault-tolerant multicast routing protocol for real-time traffic on the internet

Abstract

Multicasting is a network-layer function that constructs paths along which data packets from a source are distributed to reach many, but not all, destinations in a communication network. Multicasting sends a single copy of a data packet simultaneously to multiple receivers over a communication link that is shared by the paths to the receivers. The sharing of links in the collection of the paths to receivers implicitly defines a tree used to distribute multicast packets. Real-time multicast is a multicast scheme in which messages should be received by all destinations within a specified delay bound. The interaction between multicasting and the delivery of applications with real-time delay requirements poses various new and interesting problems. Given the need to support group communications in real-time environments and to build efficient multicast communication, the first objective of this dissertation is to design a bounded-delay multicast algorithmwhile cost is our secondary concern. So it is to find an optimal multicast routing protocol such that the delay constraint criteria has to be met. We apply this concept to a shared tree multicast routing protocol, CBT (core based tree). The second objective of this dissertation is addressing the fault-tolerance aspect of our proposed real-time multicast protocol in addition to meeting the delay constraint values. A key issue here is to find a pre-computed disjoint backup paths for any two nodes in the multicast tree and use them as alternative paths when a single link failure is encountered. All disjoint backup paths must be checked for meeting real-time constraints before the rerouting of the paths take place.