[attachment=1002]
Continuous Delivery Message Dissemination
Problems under the Multicasting Communication Mode


1.1 Abstract:
In the Continuous Delivery Message Dissemination (CDMD) problem, each message has a length and is partitioned into packets, however, the packets of every message must arrive at its destination in its original order, and all packets for each message must arrive during consecutive time units.
To cope with intractability, efficient Message dissemination approximation algorithms for classes of networks under different communication assumption have been developed. These algorithms may be used for a different version of the CDMD problem where the packets may arrive to their destinations at any time and in any order.

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.

ENVIRONMENT:
Servers:
Operating System Server: Windows XP or later
Tools: Microsoft Visual Studio .Net-2005 (2.0)
Code Behind: C#.Net
Database: SqlServer2005
Hardware Specification:
Processor: Intel Pentium or More
RAM: 1 GB Ram
Hard Disk: PC with 20GB

[attachment=4672]

Continuous Delivery Message Dissemination
Problems under the Multicasting Communication Mode


Abstract:
In the Continuous Delivery Message Dissemination (CDMD) problem, each message has a length and is partitioned into packets, however, the packets of every message must arrive at its destination in its “original” order, and all packets for each message must arrive during consecutive time units.
To cope with intractability, efficient Message dissemination approximation algorithms for classes of networks under different communication assumption have been developed. These algorithms may be used for a different version of the CDMD problem where the packets may arrive to their destinations at any time and in any order

[attachment=6800]

Continuous Delivery Message Dissemination
Problems under the Multicasting
Communication Mode


Teofilo F. Gonzalez, Member, IEEE

---

Abstract—..

We consider the Continuous Delivery Message Dissemination (CDMD) problem over the n-processor single-port complete
(all links are present and are bidirectional) static network with the multicasting communication primitive. This problem has been shown
to be NP-complete, even when all messages have the same length. For 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 needs to send or receive. The algorithm takes OðqnÞ time, where n is the number of processors and q is
the total number of messages that the processors receive.