In scenarios where many receivers simultaneously are interested in the same data, multicast transmission is more bandwidth efficient than unicast. The reason is that the receivers of a multicast session share the resources through a common transmission tree. Since the resources are shared between the receivers, it is reasonable that the costs corresponding to these resources should be shared as well. This paper deals with fair cost sharing among multicast receivers, and the work is based upon the assumption that costs should be shared according to the resource usage. However, it is not for certain that an optimally fair cost allocation is most beneficial for the receivers; receivers that cannot cover their fair share of the costs may nevertheless be able to contribute to the cost sharing to some extent. We propose a cost-allocation mechanism that strives to allocate the costs fairly, but gives discount to poor receivers who at least manage to cover the additional cost of providing them with the service.
[1]
Martin Vetterli,et al.
Receiver-driven layered multicast
,
1996,
SIGCOMM 1996.
[2]
Deborah Estrin,et al.
Sharing the “cost” of multicast trees: an axiomatic analysis
,
1997,
TNET.
[3]
Markus Bläser.
Approximate budget balanced mechanisms with low communication costs for the multicast cost-sharing problem
,
2004,
SODA '04.
[4]
S. Shenker,et al.
Pricing in computer networks: reshaping the research agenda
,
1996,
CCRV.
[5]
Tingting Zhang,et al.
Bid-based cost sharing among multicast receivers
,
2007,
QSHINE.
[6]
Ramón Fabregat,et al.
Multicast Extension of Unicast Charging for QoS Services
,
2007,
Fourth European Conference on Universal Multiservice Networks (ECUMN'07).