A Faithful Distributed Mechanism for Sharing the Cost of Multicast Transmissions


Abstract:

The problem of sharing the cost of multicast transmissions was studied in the past and two mechanisms, Marginal Cost (MC) and Shapley Value (SH), were proposed to solve it. Although both of them are strategy proof mechanisms, the distributed protocols implementing them are susceptible to manipulation by autonomous nodes. We experimentally investigate the performance of the existing and the proposed cost sharing mechanisms by implementing .We compare the execution time of MC and SH mechanisms for the Tamper-Proof and Autonomous Node models.

Algorithm / Technique used:

SH-ANM Mechanism.

Algorithm Description:

We propose a distributed SH mechanism for sharing the cost of multicast transmissions for the ANM, called SH-ANM. To design our mechanism, we rely on the catch-and-punish technique to achieve faithfulness. This technique assumes the existence of a trusted node (in our case, the root of the multicast tree) that audits the nodes randomly and punishes the nodes that deviate from the specified mechanism. We use digital signatures to authenticate the messages sent by the nodes and perform auditing and verification to detect cheating by the nodes.

Existing System:
A two-tier overlay multicast architecture (TOMA) to provide scalable and efficient multicast support for various group communication applications. In TOMA, multicast service overlay network (MSON) is advocated as the backbone service domain, while end users in access domains form a number of small clusters, in which an application-layer multicast protocol is used for the communication between the clustered end users. TOMA is able to provide efficient resource utilization with less control overhead, especially for large-scale applications. It also alleviates the state scalability problem and simplifies multicast tree construction and maintenance when there are large numbers of groups in the network. To help MSON providers efficiently plan backbone service overlay.

Proposed System:

We propose a distributed Shapley Value mechanism in which the participating nodes do not have incentives to deviate from the mechanism specifications. We show that the proposed mechanism is a faithful implementation of the Shapley Value mechanism. We also study the convergence and scalability of the mechanisms by varying the number of nodes and the number of users per node. We show that the MC mechanisms generate a smaller revenue compared to the SH mechanisms and thus they are not attractive to the content provider. We also show that increasing the number of users per node is beneficial for the systems implementing the SH mechanisms from both computational as well as economic perspectives.


Hardware Requirements:

¢ System : Pentium IV 2.4 GHz.
¢ Hard Disk : 40 GB.
¢ Floppy Drive : 1.44 Mb.
¢ Monitor : 15 VGA Colour.
¢ Mouse : Logitech.
¢ Ram : 256 Mb.


Software Requirements:

¢ Operating system : - Windows XP Professional.
¢ Coding Language : - JAVA.
¢ Tool used : - Net beans.