[attachment=11091]
COST SHARING MECHANISM IN 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 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 experimentally investigate the performance of the existing and the proposed cost-sharing mechanisms by implementing and deploying them on PlanetLab. We compare the execution time of MC and SH mechanisms for the Tamper-Proof and Autonomous Node models. 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 and economic perspectives.
EXISTING SYSTEM:
In multicast trees, the content provider is the root of the tree, and the receivers are the other nodes in the tree. A node in the multicast tree receives the transmission from the parent node and forwards the content to its child nodes, if any. We consider a model in which each node in the multicast tree has multiple users. The node receives the content from the content provider and delivers it to the users by using IP Multicast or other techniques that are efficient in local scopes.
Demerits of existing system:
 The MC Mechanism does not generate sufficient revenue.
 It is not a suitable mechanism from the content provider’s point of view.
 The node can cheat by manipulating the values sent to other nodes.
PROPOSED SYSTEM:
The nodes are responsible for paying the content provider for the received content. This model is especially useful in scenarios where smaller CDNs subscribe to bigger CDNs and pay them to receive the content that they deliver to their subscribers (called users). The benefit for each user is quantified by a private single valued parameter known as the user’s utility. User will like to receive the transmission if her cost share is less than her utility. Cost-sharing mechanisms determine who receives the multicast and how much they have to pay for the service. However, the calculation of cost shares is not a trivial task, as the users may cheat by lying about their utility.
Merits of proposed system:
 SH mechanism is better choice to reduce the cheating process
 It is bargained the data traffic and Load balance and reduce the cost and data loss
 Strong-communication compatibility
 Strong-algorithm compatibility
 Faithful implementation
SYSTEM SPECIFICATION
HARDWARE REQUIREMENTS
• SYSTEM : Pentium III 700 MHz
• HARD DISK : 40 GB
• FLOPPY DRIVE : 1.44 MB
• MONITOR : 15 VGA colour
• MOUSE : Logitech.
• RAM : 128 MB
• KEYBOARD : 110 keys enhanced.
SOFTWARE REQUIREMENTS
• Operating system :- Windows XP Professional
• Front End :- Microsoft Visual Studio .Net 2005
• Coding Language :- C# .Net
• Back End :- SQL SERVER 2000