Improving Reliability for Application-Layer Multicast Overlays

Improving Reliability for

Application-Layer Multicast Overlays

Abstract:

     Reliability of tree-like multicast overlays caused by nodes’ abrupt failures is considered as one of the major problems for the Internet application-layer media streaming service, we address this problem by designing a distributed and light weighted protocol named the instantaneous reliability oriented protocol (IRP). Unlike most of existing empirical solutions, we first define the overlay reliability problem formally, and propose a protocol containing a node joining algorithm (IRP-Join), a node preemption algorithm (IRP-Preempt), and a node switching algorithm (IRP-Switch) for reactively constructing and repairing the overlay, as well as  proactively maintaining the overlay. With the formal problem presentation, we set up a paradigm for solving the overlay reliability problem by theoretically proving the effectiveness of our algorithms. Moreover, by comparing IRP with existing solutions via simulation based experiments and real-world deployment, we show that IRP achieves a better reliability, while incurs fewer structural adjustments on the multicast overlay, thus, providing a superior overall performance.

Existing System:

                      

             Existing solutions on improving the tree-like application layer multicast overlay’s reliability could be classified into two types: proactive ones and reactive ones. In the reactive solutions, adjustments on the overlay’s structure are made only on events of node joining and failure, while in the proactive ones, the multicast overlay is periodically adjusted proactively. The empirical and their effectiveness are testified mainly with experiments. Moreover, there is a lack of theoretical work on formally understanding and

presenting the overlay reliability problem, and theoretically verifying the effectiveness of the solutions.

Proposed System:

             Proposed IRP protocol is composed of three algorithms, namely IRP-Join, IRP-Preempt, and IRP-Switch. we conclude that there are two merits for our proposed IRP protocol compared with the existing solutions: first, the protocol improves the overlay reliability nontrivially; second, it achieves better reliability with much fewer structure adjustments., we note that the superiority of IRP is observed under a number of traces with great diversity, suggesting that our setting of NRI is appropriate as long as the nodes’ lifetimes are heavy tailed

          Present the overlay reliability problem and propose a new solution with theoretical proofs for its effectiveness, this is the first solution with its effectiveness theoretically verified. Moreover, our protocol does not require any detailed knowledge on nodes’ lifetime model, and has a superior performance compared with existing solutions.

Hardware requirements

            Processor                     : Any Processor above 500 MHz.

            Ram                             :  128Mb.

            Hard Disk                    :  10 Gb.

            Compact Disk              :  650 Mb.

            Input device                 :  Standard Keyboard and Mouse.

            Output device              :  VGA and High Resolution Monitor

Software requirements:

        Operating System        :  Windows Family.

         Language                    :  JDK 1.5

         Data Bases                  :  Microsoft Sql Server

         Front End                    :  Java Swing