Skip to main content
Log in

A Framework for Resource Allocation in Multi-Service Multi-Rate Overlay Networks Based on Microeconomic Theory

  • Published:
Journal of Network and Systems Management Aims and scope Submit manuscript

Abstract

A significant issue in overlay multicasting is designing self-organizing mechanisms that can be able to utilize the natural selfishness of users in such a way that leads to maximization of the total utility of the system. We present a competitive economical system including dynamic algorithms for joining and leaving in which a number of services are provided to the users by a number of origin servers. Each offered service can be considered as a commodity and the servers and the users who relay the services to their downstream nodes can thus be considered as producers of the economy. Also, the users can be viewed as consumers in the economy. On joining to the network, each user is provided with a budget and tries to get hold of the services. We use Walrasian equilibrium to show existence of market-clearing prices. The system is proved to be scalable and experimental results confirm that our proposed mechanism works near-optimal.

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

Access this article

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

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  1. Cui, Y., Xue, Y., Nahrstedt, K.: Max-min overlay multicast: rate allocation and tree construction, ACM/IEEE Trans. Networking, (2003)

  2. Zhu, Y., Li, B., Pu, K.Q.: Dynamic multicast in overlay networks with linear capacity constraints. IEEE Trans. Parallel Distrib. Syst. 20(7), 925–939 (2009)

    Article  Google Scholar 

  3. Cui, Y., Xue, Y., Nahrstedt, K.: Optimal resource allocation in overlay multicast. IEEE Trans. Parallel Distrib. Syst. 17(8), 808–823 (2006)

    Article  Google Scholar 

  4. Wang, W., Li, B.: Market-based self-optimization for autonomic service overlay networks. IEEE J. Sel. Areas Commun. 23(12), 2320–2332 (2005)

    Article  Google Scholar 

  5. Mas-Colell, A., Whinston, M.D.: Microeconomic theory. Oxford University Press, England (1995)

    Google Scholar 

  6. Jehle, G.A.: P.J. Reny. Advanced microeconomic theory, Addison Wesley (2001)

    Google Scholar 

  7. Bertsekas, D.: Nonlinear programming, 2nd edn. Athena Scientific, Massachusetts (1999)

    MATH  Google Scholar 

  8. Banerjee, S., Bhattacharjee, B., Kommareddy, C.: Scalable application layer multicast, Proceedings of ACM SIGCOMM’02, Pittsburgh. (2002)

  9. Castro, M., Druschel, P., Kermarrec, A.-M., Rowstron, A.: SCRIBE: a large-scale and decentralized application-level multicast infrastructure. IEEE J. Sel. Areas Commun. 20(8) (2002)

  10. Pendarakis, D., Shi, S.Y., Verma, D. Waldvogel, M.: ALMI: an application layer multicast, 3rd USENIX Symp. on Internet Technologies and Systems (2001)

  11. Jain, M., Dovrolis, C.: End-to-end available bandwidth: measurement methodology, dynamics, and relation with TCP throughput. Proceedings of ACM SIGCOMM, (2002)

  12. Lai, K., Baker, M.: Nettimer: a tool for measuring bottleneck link bandwidth. Proceedings of the third USENIX Symp. on Internet Technologies and Systems (2001)

  13. Medina, A., Lakhina, A., Matta, I., Byers, J.: BRITE: an approach to universal topology generation. Proceedings of IEEE Int’l Symp. Modeling, Analysis and Simulation of Computer and Telecomm. Systems (MASCOTS) (2001)

  14. Horowitz, E., Sahni, S., Mehta, D.: Fundamentals of data structures in C++. WH Freeman Press, New York (1995)

    Google Scholar 

  15. Tran, D.A., Hua, K.A., Do, T.: ZIGZAG: an efficient peer-to-peer scheme for media streaming. Proceedings of IEEE INFOCOM’03, San Francisco (2003)

  16. Chu, Y.H., Rao, S.G., Seshan, S., Zhang, H.: A case for end system multicast. IEEE J. Sel. Areas Commun. 20(8) (2002)

  17. Banerjee, S., Kommareddy, C., Kar, K., Bhattacharjee, B., Khulle, S.: OMNI: An Efficient Overlay Multicast Infrastructure for Real-Time Applications. J. Compt. Netw., (Special Issue on overlay distribution structures and their applications), 50(6) (2006)

  18. Roughgarden, T., Tardos, É.: How bad is selfish routing? J. ACM 49(2), 236–259 (2002)

    Article  MathSciNet  Google Scholar 

  19. Mathy, L., Blundell, N.: Impact of simple cheating in application-level multicast. Proceedings of IEEE INFOCOM’04, Hong Kong (2004)

  20. Yuen, S., Li, B.: Strategyproof mechanisms for dynamic multicast tree formation in overlay networks. Proceedings of IEEE INFOCOM’ 05, Miami (2005)

  21. Wang, W., Li, X., Suny, Z., Wang, Y.: Design multicast protocols for non-cooperative networks. Proceedings of IEEE INFOCOM’05, Miami (2005)

  22. Tan, G., Jarvis, S.A.: A payment-based incentive and service differentiation mechanism for peer-to-peer streaming broadcast. Proceedings of IWQOS’06, Yale University, New Haven (2006)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Mohammad Hossein Rezvani.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Analoui, M., Rezvani, M.H. A Framework for Resource Allocation in Multi-Service Multi-Rate Overlay Networks Based on Microeconomic Theory. J Netw Syst Manage 19, 178–208 (2011). https://doi.org/10.1007/s10922-010-9164-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10922-010-9164-y

Keywords

Navigation