Sharing the Cost of Multicast Transmissions

DMCA

Sharing the Cost of Multicast Transmissions (2001)

Cached

Download Links

by Joan Feigenbaum , Christos H. Papadimitriou , Scott Shenker

Citations:

284 - 16 self

BibTeX

@MISC{Feigenbaum01sharingthe,
    author = {Joan Feigenbaum and Christos H. Papadimitriou and Scott Shenker},
    title = { Sharing the Cost of Multicast Transmissions },
    year = {2001}
}

OpenURL

Abstract

We investigate cost-sharing algorithms for multicast transmission. Economic considerations point to two distinct mechanisms, marginal cost and Shapley value, as the two solutions most appropriate in this context. 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. We also show that the welfare value achieved by an optimal multicast tree is NP-hard to approximate within any constant factor, even for bounded-degree networks. The lower-bound proof for the Shapley value uses a novel algebraic technique for bounding from below the number of messages exchanged in a distributed computation; this technique may prove useful in other contexts as well.

Keyphrases

multicast transmission shapley value economic consideration quadratic total number bounded-degree network constant factor cost-sharing algorithm welfare value marginal cost natural algorithm lower-bound proof multicast tree academic press distinct mechanism novel algebraic technique distributed computation optimal multicast tree

DMCA