Continuous Delivery Message Dissemination Problems under the Multicasting Communication Mode

About the project:

                             In this paper, we consider the CDMD problem. We present an efficient approximation algorithm to construct a message-routing schedule with a total communication time (TCT) of at most 3:5d, where d is the total length of the messages that each processor may send (or receive). The algorithm takes O (nq) time, where n is the number of processors and q is the total number of messages that the processors receive. Before we formally define the CDMD problem, we define the communication network, the communication model, and the communication primitives under the version of the CDMD problem we consider in this paper. The communication network is the n-processor complete static (all links are present and are bidirectional) network N. The communication model is the single-port model where every processor sends at most one message and receives at most one message during each communication round. The communication primitive is called multicasting, which means that the message a processor sends at time t may be concurrently sent to a set of processors. All the messages take one communication round to reach their destination, regardless of the source or destination processor.

      2. Existing System:

                        

·         A restricted version of the CDMD problem, where all messages have the same length, is called the multimessage multicasting MMC problem.

• A restricted version of the MMC problem is the all-to-all communication problem (also known as the gossiping problem) when each processor is restricted to send one message to all the other processors
• The all-to-many and many-to-many  communication problems are restrictions of the all-to-all communication problem when message destinations and/or sources are limited to subsets of processors

2.1. Disadvantages:

                       

·          When a large amount of data is sent it takes long time to reach the destination

·         Individual processor is responsible for sending data through the network

3. Proposed System:

                            We consider the CDMD problem. We present an efficient approximation algorithm to construct a message-routing schedule with a total communication time of at most 3:5d, where d is the total length of the messages that each processor may send. The algorithm takes time, where n is the number of processors and q is the total number of messages that the processors receive. The communication network is the n-processor complete static (all links are present and are bidirectional) network N. The communication model is the single-port model where every processor sends at most one message and receives at most one message during each communication round. The communication primitive is called multicasting, which means that the message a processor sends at time t may be concurrently sent to a set of processors. All the messages take one communication round to reach their destination, regardless of the source or destination processor.

      3.1 Advantages:

·         Large amount of data are split into many smaller ones

·         Various processors are responsible for delivering the messages

·         Each processor sends a message to other processors in its time cycle

System Requirements

Hardware Requirements

•         Processor                     : Pentium III / IV

•         Hard Disk                   : 40 GB

•         Monitor                       : 15 VGA colour

•         Mouse                         : Ball / Optical

•         Ram                             : 256 MB

Software Requirements

•         Operating system        : Windows XP Professional

•         Front End                    : Microsoft Visual Studio .Net 2005

•         Coding Language       : Visual C# .Net

•         Database                     :SQL Server 2000