Skip to main content
SpringerLink
Log in

Toward microeconomic allocation of resources in multi-service overlay networks

  • Computer Methods
  • Published:
Journal of Computer and Systems Sciences International Aims and scope

Abstract

The main challenge in overlay multicasting is designing self-organizing mechanisms that can be able to exploit the inherent selfishness of the end-user nodes in such a way that the aggregate outcome of the activity of individual nodes behaving toward their own self-interests still leads to maximization of the network’s aggregate utility. We believe that the microeconomic theory is a good candidate to investigate this problem. Since each consumer in the economy acts as a selfish utility maximizer, the behavior of each end-host in the overlay network can be mapped to that of a consumer in the economy. We present a competitive economical framework in which a number of independent services are provided to the users by a number of origin servers. Each offered service can be thought of as a good and the origin servers and the users who relay the service to their downstream nodes can thus be thought of as firms of the economy. Also, the end-hosts can be viewed as consumers in the economy. On joining to the overlay network, each end-host is provided with an income and tries to obtain the services. The mechanism tries to regulate the price of each service in such a way that general equilibrium holds. For this property to hold in all generality, it tries to find a vector of prices such that demand of each service becomes equal to its supply. So, all allocations will be Pareto optimal in the sense that maximize welfare of the users.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Y. Chu, S. G. Rao, S. Seshan, et al., “A Case for End System Multicast,” IEEE J. Selected Areas in Communications Special Issue on Network Support for Multicast Communications 20(8), (2002).

  2. S. Banerjee, C. Kommareddy, K. Kar, et al., “ONMI: An Efficient Overlay Multicast Infrastructure for Real-Time Applications,” J. Computer Networks 50(6), (2006).

  3. Y. Chu, S. G. Rao, S. Seshan, et al., “Enabling Conferencing Applications on the Internet Using An Overlay Multicast Architecture,” in Proceedings of ACM SIGCOMM, 2001.

  4. B. Akbari, H. R. Rabiee, and M. Chanbari, “An Optimal Discrete Rate Allocation for Overlay Video Multicasting,” Elsevier J. Computer Communications 31(3), 551–562 (2008).

    Google Scholar 

  5. Y. Cui, Y. Xue, and K. Nahrstedt, “Optimal Resource Allocation in Overlay Multicast,” IEEE Transactions on Parallel and Distributed Systems 17(8), 808–823 (2006).

    Article  Google Scholar 

  6. Y. Cui, Y. Xue, and K. Nahrstedt, “Max-Min Overlay Multicast: Rate Allocation and Tree Construction,” ACM/IEEE Trans. Networking, No. 10 (2003).

  7. Y. Zhu, B. Li, and K. Q. Pu, “Dynamic Multicast in Overlay Networks with Linear Capacity Constraints,” IEEE Trans. Parallel and Distributed Systems (2009).

  8. Y. Zhu and B. Li, “Overlay Networks with Linear Capacity Constraints,” IEEE Trans. on Parallel and Distributed Systems 19(2), 159–173 (2008).

    Article  Google Scholar 

  9. T. Roughgarden and E. Tardos, “How Bad Is Selfish Routing?,” J. ACM 49(2), 236–259 (2002).

    Article  MathSciNet  Google Scholar 

  10. L. Mathy and N. Blundell, “Impact of Simple Cheating in Application-Level Multicast,” in Proceedings of IEEE INFOCOM’04, 2004.

  11. S. Yuen and B. Li, “Strategyproof Mechanisms for Dynamic Multicast Tree Formation in Overlay Networks,” in Proceedings of IEEE INEFOCOM’05, 2005.

  12. W. Wang, X. Li, Z. Suny, et al., “Design Multicast Protocols for Non-Cooperative Networks,” in Proceedings of IEEE INFOCOM’05, 2005.

  13. G. Tan and S. A. Jarvis, “A Payment-Based Incentive and Service Differentiation Mechanism for Peer-to-Peer Streaming Broadcast,” in Proceedings of IWQOS’06, 2006.

  14. W. Wang and B. Li, “Market-Based Self-Optimization for Autonomic Service Overlay Network,” IEEE J. on Selected Areas in Communications 23(12), 2320–2332 (2005).

    Article  Google Scholar 

  15. A. Mas-Colell and M. D. Whinston, MicroeconomicTheory (Univ. Press, Oxford, 1995).

    Google Scholar 

  16. G. A. Jehle and P. J. Reny, Advanced Microeconomic Theory (Addison Wesley, 2001).

  17. D. Bertsekas, Nonlinear Programming, 2nd ed. (Athena Scientific, 1999).

  18. D. A. Tran, K. A. Hua, and T. Do, “ZIGZAG: An Efficient Peer-to-Peer Scheme for Media Streaming,” in Proceedings of IEEE INFOCOM’03, 2003.

  19. S. Banerjee, B. Bhattacharjee, and C. Kommareddy, “Scalable Application Layer Multicast,” in Proceedings of ACM SIGCOMM’02, 2002.

  20. M. Castro, P. Druschel, A.-M. Kermarrec, et al., “SCRIBE: a Large-Scale and Decentralized Application-Level Multicast Infrastructure,” IEEE J. on Selected Areas in Communications 20(8), (2002).

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, University of Science and Technology (IUST), Tehran, Iran

    M. Analoui & M. H. Rezvani

Authors
  1. M. Analoui
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. H. Rezvani
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M. Analoui.

Additional information

Original Russian Text © M. Analoui, M.H. Rezvani, 2011, published in Izvestiya Akademii Nauk. Teoriya i Sistemy Upravleniya, 2011, No. 5, pp. 60–73.

The article is published in the original.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Analoui, M., Rezvani, M.H. Toward microeconomic allocation of resources in multi-service overlay networks. J. Comput. Syst. Sci. Int. 50, 741–755 (2011). https://doi.org/10.1134/S1064230711050030

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S1064230711050030

Keywords

Search

Navigation