A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Sharing the Cost of Multicast Transmissions
2001
Journal of computer and system sciences (Print)
Preserved Fulltext
We investigate cost-sharing algorithms for multicast transmission. ...
We prove that the former has a natural algorithm that uses only two messages per link of the multicast tree, while we give evidence that the latter requires a quadratic total number of messages. ...
ACKNOWLEDGMENT We thank our colleague Li Li for pointing out an error in an earlier version of this paper. ...
doi:10.1006/jcss.2001.1754
fatcat:dbewgbroufchlhrt5pgm64fzty
Trustful Mechanism for Sharing the Cost of Multicast Transmissions
2017
International Journal of Urban Design for Ubiquitous Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The issue of sharing the cost of multicast transmissions was considered before, and two systems, Marginal Cost (MC) and Shapley Value (SH), were proposed to unravel it. ...
We additionally concentrate the merging and versatility of the instruments by fluctuating the quantity of hubs and the quantity of clients per hub. ...
Algorithm / technique used
SH-ANM mechanism: Algorithm Description: We propose a circulated SH instrument for sharing the cost of multicast transmissions for the ANM, called SH-ANM. ...
doi:10.21742/ijuduc.2017.5.1.02
fatcat:souoskyinfe6nk3nlzivx4fy4a
Sharing the cost of multicast transmissions in wireless networks
2006
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
A crucial issue in non-cooperative wireless networks is that of sharing the cost of multicast transmissions to different users residing at the stations of the network. ...
A mechanism is said budget balanced (BB) if the receivers pay exactly the (possibly minimum) cost of the transmission, and -approximate budget balanced ( -BB) if the total cost charged to the receivers ...
Cost sharing mechanisms for wired networks The problem of sharing the cost of multicast transmissions in standard networks, where the cost is the total cost of the links of a multicast subtree connecting ...
doi:10.1016/j.tcs.2006.09.004
fatcat:dn3yqiglfrdxphsxennye2npxa
A Faithful Distributed Mechanism for Sharing the Cost of Multicast Transmissions
2009
IEEE Transactions on Parallel and Distributed Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
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. ...
We experimentally investigate the performance of the existing and the proposed cost-sharing mechanisms by implementing and deploying them on PlanetLab. ...
The authors wish to express their thanks to the editor and the anonymous referees for their helpful and constructive suggestions, which considerably improved the quality of the paper. ...
doi:10.1109/tpds.2008.221
fatcat:j3oktcrs4bb3zk2zclfjqkwr64
Faithful Distributed Shapley Mechanisms for Sharing the Cost of Multicast Transmissions
2007
Proceedings of the IEEE Symposium on Computers and Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
Sharing the cost of multicast transmissions was studied in the past and two mechanisms, Marginal Cost and Shapley Value, were proposed. ...
Compared to the Marginal Cost Mechanism the Shapley Value mechanism has the advantage of being budget balanced. ...
[6] proposed two distributed mechanisms to calculate the cost shares of participants in a multicast transmission: the Marginal Cost (MC) mechanism and the Shapley Value (SH) mechanism. ...
doi:10.1109/iscc.2007.4381614
dblp:conf/iscc/GargG07
fatcat:wd3j6oixjzduzdme5775ur7smy
Cross-Monotonic in Cost Sharing Mechanisms Using Ns2
2018
International Journal of Engineering & Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
A cost-sharing plan is an arrangement of guidelines characterizing how to distribute the cost among adjusted clients. ...
CM is an key techniques to achieve the group strategy proofness. By using the multicast plans that objective the enhanced directing, cross-monotonic cost sharing, and stabilize budget. ...
The perfect multicast course ensures that there are no dull transmissions by any center point, thusly ensuring the total cost of remote transmissions is constrained. ...
doi:10.14419/ijet.v7i2.4.11169
fatcat:v766gc6bgnfnthap373ztk2tda
Performance Evaluation of Multicast Cost Sharing Mechanisms
2007
Advanced Information Networking and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
In this paper we investigate experimentally the performance of Marginal Cost (MC) and Shapley Value (SH) mechanisms for sharing the cost of multicast transmissions. ...
We also study the convergence and scalability of the mechanisms by varying the number of nodes and the number of users per node. ...
If the cost of the transmission is shared by several users, the users' cost shares will be different (depending on their positions in the multicast tree). ...
doi:10.1109/aina.2007.111
dblp:conf/aina/GargG07
fatcat:oonu5mfgxbfcbgivdl5nzuihpy
The wireless multicast coalition game and the non-cooperative association problem
2011
2011 Proceedings IEEE INFOCOM
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
We study in this paper the problem of sharing the cost of a multicast service in a wireless network. ...
In this work, the cost for broadcasting is taken to be the transmission power. We begin by proposing various schemes to share the cost, and study their properties. ...
Related Work The problem of sharing the cost of multicast transmission in wired networks is well studied (e.g., see [1] , [2] , [3] ). Penna and Ventre [4] and Bilo et al. ...
doi:10.1109/infcom.2011.5935101
dblp:conf/infocom/SinghA11
fatcat:l5z7kkpllvef7fcvxwu63kxsyq
A Multicast Approach for UMTS: A Performance Study
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
within the cells and the type of transport channel used for the transmission of the multicast data over the air. ...
The critical parameters for the evaluation of the scheme are the number of multicast users within the multicast group, the amount of data sent to the multicast users, the density of the multicast users ...
The transmission of the packets over Uu interface, may be performed on dedicated (DCH) or shared transport channels (ex. High Speed Downlink Shared Channel -HS-DSCH) [7] . ...
doi:10.1007/11753810_91
fatcat:gfjcge6wwvbkfnp4bmdixzkpuu
Hardness results for multicast cost sharing
2003
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We continue the study of multicast cost sharing from the viewpoints of both computational complexity and economic mechanism design. ...
Our results show that one important and natural case of multicast cost sharing is an example of a canonical hard problem in distributed, algorithmic mechanism design; in this sense, they represent progress ...
A recent series of papers has addressed the problem of cost sharing for Internet multicast transmissions. ...
doi:10.1016/s0304-3975(03)00085-9
fatcat:aob5cj5dpjfhzp6b5ytyukafoe
Hardness Results for Multicast Cost Sharing
[chapter]
2002
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We continue the study of multicast cost sharing from the viewpoints of both computational complexity and economic mechanism design. ...
Our results show that one important and natural case of multicast cost sharing is an example of a canonical hard problem in distributed, algorithmic mechanism design; in this sense, they represent progress ...
A recent series of papers has addressed the problem of cost sharing for Internet multicast transmissions. ...
doi:10.1007/3-540-36206-1_13
fatcat:hf7rfdm5obftllqsnerklgbtxu
An SDN based CBT for Distributed Shared Memory
2016
International Journal of Grid and Distributed Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Multicast avoids redundant transmissions and lessens network contention. These properties make it significant for distributed shared memory. ...
The forwarding rule reduces the number of consistency-related messages without interfering the unrelated processes in the same multicast group. ...
In this case, computing cost is not acceptable. Shared tree multicast mechanism builds a multicast tree for the whole multicast group. ...
doi:10.14257/ijgdc.2016.9.1.18
fatcat:lfg554verjhsncdgv72as6ft2m
Topology-based Multicast Scheduling for On-Demand Multimedia Service Provisioning
2011
International Journal of Modeling and Optimization
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
requests until the next transmission period, and consequently sharing the cost with a larger number of receivers. ...
distribution paths via multicast cost sharing. ...
multicast cost sharing. ...
doi:10.7763/ijmo.2011.v1.70
fatcat:427ib6kyjzbcnh27bxewrd6mjm
Multicast Routing Algorithm of Network Lifetime
2016
International Journal of Future Generation Communication and Networking
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The genetic operators of this algorithm reduce the transmission cost and energy consumption of multicast trees, and mutation operator prolongs the network lifetime, thus accelerating the convergence speed ...
Experiment results show that the multicast tree found by this algorithm not only has the minimum transmission cost, but also has the longest network lifetime. ...
Maximum network lifetime minimum cost multicast tree ensures: (1) the longest lifetime of multicast tree's bottleneck nodes once multicast tasks are completed; (2) the least total transmission cost of ...
doi:10.14257/ijfgcn.2016.9.2.03
fatcat:wbmrqhaq5rakzegznrjouwj43e
Robust provisioning of multicast sessions in cognitive radio networks
2014
2014 International Wireless Communications and Mobile Computing Conference (IWCMC)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This sharing method allows efficient use of resources and reduces the cost of multicast session protection. ...
On the other hand, link-sharing method used in multicast sessions protection with link-sharing algorithm allows it to outperform multicast
Figure 4 . 4 : 44 The cost of the multicast session with respect ...
doi:10.1109/iwcmc.2014.6906393
dblp:conf/iwcmc/AlmasoudK14
fatcat:al73fo6y7fbzzmhynuegijnrh4
« Previous
Showing results 1 — 15 out of 16,266 results