Bid-based cost sharing among multicast receivers
Article No.: 42, Pages 1 - 7
Abstract
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.
References
[1]
M. Adler and D. Rubenstein. Pricing multicasting in more flexible network models. ACM Transactions on Algorithms, 1(1):48--73, July 2005.
[2]
S. Bajaj, L. Breslau, and S. Shenker. Uniform versus priority dropping for layered video. ACM SIGCOMM Computer Communication Review, 28(4):131--143, October 1998.
[3]
M. Bläser. Approximate budget balanced mechanisms with low communication costs for the multicast cost-sharing problem. In Proceedings of 15th ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 625-195, New Orleans, LA, USA, January 2004.
[4]
A. Bueno, P. Vila, and R. Fabregat. Multicast extension of unicast charging for qos services. In Proceedings of 4th IEEE European Conference on Universal Multiservice Networks (ECUMN), pages 119--126, Toulouse, France, February 2007.
[5]
S. Chawla, D. Kitchin, U. Rajan, R. Ravi, and A. Sinha. Profit guaranteeing mechanisms for multicast networks. In Proceedings of 4th ACM Conference on Electronic Commerce (EC), pages 190--191, San Diego, CA, USA, June 2003.
[6]
S. E. Deering. Host extensions for IP multicasting. RFC 1112, Network Working Group, August 1989.
[7]
H. J. Einsiedler, P. Hurley, B. Stiller, and T. Braun. Charging multicast communications based on a tree metric. In Proceedings of GI Multicast Workshop, Braunschweig, Germany, May 1999.
[8]
J. Feigenbaum, C. H. Papadimitriou, and S. Shenker. Sharing the cost of multicast transmissions. Elsevier Journal of Computer and System Sciences, 63(1):21--41, August 2001.
[9]
S. Herzog, S. Shenker, and D. Estrin. Sharing the "cost" of multicast trees: An axiomatic analysis. IEEE/ACM Transactions on Networking, 5(6):847--860, December 1997.
[10]
C.-C. Liu, S.-C. Chang, and H.-H. Cheng. Pricing and fee sharing for point to multipoint and quality guaranteed multicast services. In Proceedings of 7th IEEE International Conference on Parallel and Distributed Systems (ICPADS), pages 255--260, Iwate, Japan, July 2000.
[11]
S. McCanne, V. Jacobson, and M. Vetterli. Receiver-driven layered multicast. ACM SIGCOMM Computer Communication Review, 26(4):117--130, October 1996.
[12]
H. Moulin and S. Shenker. Strategyproof sharing of submodular access costs: Budget balance versus efficiency. Springer Journal on Economic Theory, 18(3):511--533, 2001.
[13]
P. Österberg and T. Zhang. Revised definition of multicast-favorable max-min fairness. In Proceedings of 3rd IASTED International Conference on Communications and Computer Networks (CCN), pages 63--68, Lima, Peru, October 2006.
[14]
P. Österberg and T. Zhang. Fair cost sharing among multicast receivers. In Proceedings of 2nd IEEE International Conference on Digital Telecommunications (ICDT), Silicon Valley, CA, USA, July 2007.
Index Terms
- Bid-based cost sharing among multicast receivers
Recommendations
Robust and fair Multicast Congestion Control (M2C)
Since 1995 and the Receiver-driven Layered Multicast (RLM) protocol, numerous multicast congestion control protocols have been proposed, such as RLC, FLID-SL, FLID-DL and finally the WEBRC protocol. However these protocols suffer from some limitations ...
Fair Cost Sharing among Multicast Receivers
ICDT '07: Proceedings of the Second International Conference on Digital TelecommunicationsIn 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 ...
Extending TCP congestion control to multicast
This paper proposes a new single-rate multicast congestion control scheme named PGMTCC, which has been implemented and investigated in PGM. The primary idea of PGMTCC is to extend Sack TCP congestion control mechanism to multicast in order to make ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © 2007 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
In-Cooperation
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 14 August 2007
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
QShine07
QShine07: Heterogeneous Networking for Quality, Reliability, Security and Robustness
August 14 - 17, 2007
Vancouver, Canada
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 35Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 24 Sep 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in