30-09-2010, 06:08 PM
[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
