A Faithful Distributed Mechanism for Sharing the Cost of Multicast Transmissions
Thread Rating:
  • 0 Vote(s) - 0 Average
  • 1
  • 2
  • 3
  • 4
  • 5
computer science topics
Active In SP

Posts: 610
Joined: Jun 2010
02-07-2010, 04:53 PM

A Faithful Distributed Mechanism for Sharing the Cost of Multicast Transmissions


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.
Use Search at http://topicideas.net/search.php wisely To Get Information About Project Topic and Seminar ideas with report/source code along pdf and ppt presenaion

Important Note..!

If you are not satisfied with above reply ,..Please


So that we will collect data for you and will made reply to the request....OR try below "QUICK REPLY" box to add a reply to this page
Tagged Pages: a faithful distributed mechanism for sharing the cost of multicast transmissions doc, anm result, a faithful distributed mechanism for sharing the cost of multicast transmissions,
Popular Searches: minimum cost multicast routing against selfish information flow, motors without mechanical transmissions seminar projects, use of combined ac dc transmissions, seminar topics for ece in transmissions lines and waveguide, multicast communication in distributed systems, effcts of location awareness on concurrent transmissions for adhoc networks, minimum cost multicast trees in adhoc networks,

Quick Reply
Type your reply to this message here.

Image Verification
Please enter the text contained within the image into the text box below it. This process is used to prevent automated spam bots.
Image Verification
(case insensitive)

Possibly Related Threads...
Thread Author Replies Views Last Post
  Automatic Transformer Load Sharing With SMS Altering PPT project girl 4 1,075 13-07-2016, 03:48 PM
Last Post: jaseela123
  Learn to Personalized Image Search from the Photo Sharing Websites seminar flower 7 4,148 15-11-2014, 08:36 AM
Last Post: Guest
  MABS: Multicast Authentication Based on Batch Signature seminar class 20 12,304 03-07-2014, 06:19 PM
Last Post: Guest
  ONTOLOGY BASED DATA SHARING WITH CRYTOGRAPHY PROJECT REPORT seminar projects maker 0 425 13-09-2013, 11:36 AM
Last Post: seminar projects maker
  Kalman Filter-Based Distributed Predictive Control of Large-Scale Multi-Rate pdf study tips 0 358 09-09-2013, 03:32 PM
Last Post: study tips
  Energy Optimization Mechanism for Mobile Terminals using Vertical Handoff pdf study tips 0 296 07-09-2013, 02:10 PM
Last Post: study tips
  Software Requirements Specification For Internet connection sharing from mobile study tips 0 453 26-08-2013, 04:46 PM
Last Post: study tips
  Inter Bank Fund Transfer in Distributed Network smart paper boy 1 1,408 01-08-2013, 03:07 PM
Last Post: Guest
  Scalable and Secure Sharing of Personal Health Records in Cloud Computing seminar flower 1 1,964 01-08-2013, 02:06 PM
Last Post: Guest
  A Secret-Sharing-Based Method for Authentication of Grayscale Document Images pdf study tips 0 414 19-07-2013, 02:09 PM
Last Post: study tips