Nothing Special   »   [go: up one dir, main page]

skip to main content
article
Free access

Sharing the “cost” of multicast trees: an axiomatic analysis

Published: 01 December 1997 Publication History
First page of PDF

References

[1]
A. J. Ballardie, P. F. Francis, and J. Crowcroft, "Core based trees (CBT)," in Proc. ACM SIGCOMM'93, Aug. 1993.]]
[2]
H. W. Braun and K. Claffy, "A framework for flow-based accounting on the Intemet," in Proe. IEEE SICON, Singapore, 1993.]]
[3]
D. Clark, "Adding service discrimination to the interact" in Proc. 23rd Amnt. Telecommun. Policy Res. Conf., I995; Available H'ITP: http://anawww.lcs.mit.edu/anaweblps-papers/TPRC2-0.ps]]
[4]
D. Clark, S. Shenker, and L. Zhang, "Supporting real-time applications in an integrated services packet network: Architecture and mechanism," in Proc, ACM SIGCOMM, Aug. 1992.]]
[5]
R. Cocchi, S. Shenker, D. Estrin, and L. 7_,hang, "Pricing in computer networks: Motivation, formulation, and example" IEEFJACM Trans. Networking, vol. 1, pp. 614-627, Dec. 1993.]]
[6]
S. Deefing and D. Cheriton, "Multicast routing in datagram Interactworks and extended LAWs," ACM Trans. Comput. Syst., pp. 85-111, May 1990.]]
[7]
S, Deering, D. Estrin, D. Farinacci, V. Jacobson, C. G. Liu, and L. Wei, "An architecture for wide-area multicast routing," in Proc. A CM SIGCOMM, Sept. 1994.]]
[8]
D. Henriet and H. Moulin, "Traffic based cost allocation in a network," Rand J. Econ., vol. 27, no. 2, pp. 332--345, 1996.]]
[9]
S. Herzog, "'Accounting and access control for multicast distributions," Ph.D. dissertation, Univ. Southern California, Comput. Sci. Dept., Aug. 1996.]]
[10]
S. C. Litflechild and (3. Owen, "A simple expression for the Shapley value in a special case," Manag. Sci., vol. 20, pp. 370-372, 1973.]]
[11]
J. IC MacKie-Mason and H. R. Varian, "Pricing congestable network resources" IEEE J. Selected Areas Commun, vol. 13, pp. 1141-1149, 1995; also, Available FI~: ftp://gopher.econ.lsa.umich.edu/pub/ Papers/pricing-congestible.ps.Z]]
[12]
, "Pricing the Interact," B. Kahin and J. Keller, Eds., Public Access to the Internet. Englewood Cliffs, NJ: Prentice- Hall, 1995; available HTrP: http-./Iwww.spp.umich.edu/sppl papers/jmm/Pricing~_the~Intemet.ps.Z]]
[13]
N. Megiddo, "Computational complexity of the gam~ theory approach to cost allocation for a tree," Math. Operations Res., vol. 3, pp. 189-196, 1978.]]
[14]
H. Moulin, "Uniform externalities: Two axioms for fair allocation," J. Public Economy, vol. 43, pp. 305--326, 1990.]]
[15]
~, "%Velfare bound in the cooperative production problem," Games Econ. Behavior, vol. 4, pp. 373-401, 1992.]]
[16]
H. Moulin and S. Shenker, "Average cost pricing versus serial cost sharing: An axiomatic comparison" J. Econ. Theor); vol. 64, no. 1, pp. 178--201, 1994.]]
[17]
J. Moy, "'Multicast extensions to OSPF," Internet Request for Comments, RFC-1584, Mar. 1994.]]
[18]
R. B. Myerson, Game Theory. Cambridge, MA: Harvard Univ. Press, 1991.]]
[19]
I-L Peyton-Young, Ed., Cost Allocation: Methods, Principles, Applica. tions. New York:. Elseviers Sci., 1985.]]
[20]
A. E. Roth, Ed., The Shapley Value, An Essay in Honor of Lloyd S. Shapley. Cambridge, U.K.: Cambridge Univ. Press, 1988.]]
[21]
J. Sairamesh, D. F. Ferguson, and Y. Yemini, "An approach to pricing, optimal allocation and quality of service provisioning in high-speed packet networks," in Proc. Infocom'95, Apr. 1995.]]
[22]
L. S. Shapley, "A value for H-person games;' H. W. Kuhn and A. W. Tucker, Ed., Contributions to the ~heory of Games, Vol. tl, Annals of Mathematics Studies No. 28. Princeton, NJ: Princeton Univ. Press, 1953, pp. 307-317.]]
[23]
W. W. Sharkey, "Network models in economics," M. O. Ball et al., Eds., Handbook Operations Res. Management Sci.: Networks, vol. 8, 1995, pp. 713--765.]]
[24]
S. Shenker, "Service models and pricing policies for an integrated services Interne.t," 13. Kabin and J. Keller, Eds., Public Access to lhe Internet. Englewood Cliffs, HJ: Prentice-Hall, 1995,]]
[25]
S. Shenker, D. Clark, D. Estrin, and S. Herzog, "Pricing in computer networks: Reshaping the research agenda," Telecommtmications Policy, vol. 20, 1996; also published in Prec. 23rd Ann. Telecommun. Policy Res. Conf., 1995.]]
[26]
D. Waitzman, C. Partridge, and S. Deering, "Distance vector muldcast routing protocol;" lnternet Request For Comments, RFC-l(}75, Nov. 1988.]]
[27]
D. Zappala, "Multicast routing support for integrated services," Ph.D. dissertation, Univ. Southern California, Comput. Sci. Dept., 1995; Available FTP: ftp://catarina.usc.edu/publdaniel/RSRR/quals.ps.]]

Cited By

View all

Recommendations

Reviews

Cecilia G. Manrique

Gone are the days when the Internet was the domain of the military and academics. It is now dominated by business. This commercialization has made issues of cost recovery and profit incentives relevant to discussions about the future of the Internet. The allocation of costs among users, that is, the assignment to various users of some measure of the network resources that they are consuming, will play an important role in future networks. The authors use equations, theorems, and axioms to try to show how one would split the cost of a single data flow among many receivers. Proofs of the theorems are given in an appendix. There are various ways to allocate costs. The authors prefer an axiomatic approach that tries to address the desirable properties of cost allocation schemes, including anonymity, fairness, and equity. They look at the pros and cons of various approaches, and favor what they call the “one-pass” approach. In their analysis, they explain various models and schemes. In the equal tree split scheme, one can divide the total cost equally among all receivers, but this scheme does not distinguish between receivers far from the source and those close to the source. With the standalone axiom, every receiver is guaranteed that joining a group can never cost more than the individual unicast cost. In the “sharing is good” model, no free riders (members who do not pay their fair share) are allowed. This model requires that the allocations decrease as more members join. The authors recognize that their original model addresses only the issue of how to share costs between equivalent users in different locations. The reader is left with the same question that the authors have to grapple with: having multiple quality of service (QoS) levels raises the issue of how to share the cost among several members who are in the same place but request different QoS levels. The paper, though complicated by the mathematical explanations, sheds light on an important aspect of the Internet, which is being debated by various parties interested in the advances in this technology.

Access critical reviews of Computing literature here

Become a reviewer for Computing Reviews.

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Publisher

IEEE Press

Publication History

Published: 01 December 1997
Published in TON Volume 5, Issue 6

Author Tags

  1. Internet economics
  2. cost allocation
  3. cost sharing
  4. multicast
  5. network accounting
  6. quality of service

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)21
  • Downloads (Last 6 weeks)2
Reflects downloads up to 24 Sep 2024

Other Metrics

Citations

Cited By

View all
  • (2022)Cost Sharing over Combinatorial DomainsACM Transactions on Economics and Computation10.1145/350558610:1(1-26)Online publication date: 8-Apr-2022
  • (2016)Network-formation games with regular objectivesInformation and Computation10.1016/j.ic.2016.08.004251:C(165-178)Online publication date: 1-Dec-2016
  • (2012)Conflicting Congestion Effects in Resource Allocation GamesOperations Research10.1287/opre.1120.105160:3(529-540)Online publication date: 1-May-2012
  • (2010)Cost sharing and strategyproof mechanisms for set cover gamesJournal of Combinatorial Optimization10.1007/s10878-009-9209-x20:3(259-284)Online publication date: 1-Oct-2010
  • (2009)Pricing traffic in a spanning networkProceedings of the 10th ACM conference on Electronic commerce10.1145/1566374.1566378(21-30)Online publication date: 6-Jul-2009
  • (2008)On the value of coordination in network designProceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms10.5555/1347082.1347115(294-303)Online publication date: 20-Jan-2008
  • (2007)Bid-based cost sharing among multicast receiversThe Fourth International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness & Workshops10.1145/1577222.1577280(1-7)Online publication date: 14-Aug-2007
  • (2006)Non-cooperative multicast and facility location gamesProceedings of the 7th ACM conference on Electronic commerce10.1145/1134707.1134716(72-81)Online publication date: 11-Jun-2006
  • (2006)10 networking papersACM SIGCOMM Computer Communication Review10.1145/1111322.111133436:1(51-52)Online publication date: 10-Jan-2006
  • (2005)Share the Multicast Payment FairlyProceedings of the 11th Annual International Conference on Computing and Combinatorics - Volume 359510.5555/2958119.2958208(210-219)Online publication date: 16-Aug-2005
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Full Access

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media