IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v61y2016i2d10.1007_s11235-015-9995-7.html
   My bibliography  Save this article

A non-cooperative game-theoretic framework for resource allocation in network virtualization

Author

Listed:
  • M. Said Seddiki

    (University of Carthage, City of Communication Technologies
    LORIA - Université de Lorraine)

  • Mounir Frikha

    (Higher School of Communication of Tunis)

  • Ye-Qiong Song

    (LORIA - Université de Lorraine)

Abstract

Network virtualization is a new technology that aims at allowing multiple virtual networks (VNs) to coexist in the same equipment and to hide the heterogeneity of network infrastructure. The critical issue for a given infrastructure provider (InP), is how to provide customized and on demand resources for multiple service providers (SPs) with different Quality of Service (QoS) requirements. The should also fairly distribute the network physical resources, such as bandwidth of each physical link, buffer spaces, and processing cycles at each node. In this paper, we propose a new framework based on game theory, for both link and node dynamic allocation between multiple infrastructure providers (InPs) and service providers (SPs). Our approach focuses on provisioning and managing the physical resources in a virtualized network infrastructure. We propose a two-stage approach based on non-cooperative games. The first one is the resource negotiation game where the SP requests link and node resources from multiple InPs. The InP may reject the SP’s request when it can potentially cause network congestion. The second stage of the proposal concerns dynamic resource provisioning and consists of two non cooperative games; the node allocation game and the link allocation game. The objective of both games is to allocate physical resources for different isolated VNs that are sharing the same physical substrate network. In the node allocation game, the proportional share mechanism is used. Every SP assigns a weight and submits a bid to each physical node and thereafter it receives a share proportional to its bid. In the link allocation game we investigate the case when multiple SPs compete for a portion of the available physical network capacity. Simulation results show that the proposed approach achieves high resource utilization, improves the network performance, and fairly distributes the link and node resources between multiple SPs.

Suggested Citation

  • M. Said Seddiki & Mounir Frikha & Ye-Qiong Song, 2016. "A non-cooperative game-theoretic framework for resource allocation in network virtualization," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 61(2), pages 209-219, February.
  • Handle: RePEc:spr:telsys:v:61:y:2016:i:2:d:10.1007_s11235-015-9995-7
    DOI: 10.1007/s11235-015-9995-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-015-9995-7
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s11235-015-9995-7?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Eric Maskin, 1999. "Nash Equilibrium and Welfare Optimality," Review of Economic Studies, Oxford University Press, vol. 66(1), pages 23-38.
    2. Drew Fudenberg & Jean Tirole, 1991. "Game Theory," MIT Press Books, The MIT Press, edition 1, volume 1, number 0262061414, December.
    3. Dharm P.S. Bhawuk, 2009. "Intercultural Communication in a Dynamic Environment," Psychology and Developing Societies, , vol. 21(2), pages 161-181, July.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Dirk Bergemann & Stephen Morris, 2019. "Information Design: A Unified Perspective," Journal of Economic Literature, American Economic Association, vol. 57(1), pages 44-95, March.
    2. Darrell Duffie & Piotr Dworczak & Haoxiang Zhu, 2017. "Benchmarks in Search Markets," Journal of Finance, American Finance Association, vol. 72(5), pages 1983-2044, October.
    3. Philippe Aghion & Drew Fudenberg & Richard Holden & Takashi Kunimoto & Olivier Tercieux, 2012. "Subgame-Perfect Implementation Under Information Perturbations," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 127(4), pages 1843-1881.
    4. Eduardo M Azevedo & Eric Budish, 2019. "Strategy-proofness in the Large," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 86(1), pages 81-116.
    5. Janvier D. Nkurunziza, 2005. "Reputation and Credit without Collateral in Africa`s Formal Banking," Economics Series Working Papers WPS/2005-02, University of Oxford, Department of Economics.
    6. Margarita Kirneva & Matias Nunez, 2021. "Voting by Simultaneous Vetoes," Working Papers 2021-08, Center for Research in Economics and Statistics.
    7. Kessing, Sebastian G. & Konrad, Kai A. & Kotsogiannis, Christos, 2006. "Federal tax autonomy and the limits of cooperation," Journal of Urban Economics, Elsevier, vol. 59(2), pages 317-329, March.
    8. Sandy Fréret & Denis Maguain, 2017. "The effects of agglomeration on tax competition: evidence from a two-regime spatial panel model on French data," International Tax and Public Finance, Springer;International Institute of Public Finance, vol. 24(6), pages 1100-1140, December.
    9. , & ,, 2015. "A folk theorem for stochastic games with infrequent state changes," Theoretical Economics, Econometric Society, vol. 10(1), January.
    10. Lombardi, Michele & Yoshihara, Naoki, 2016. "Partially-honest Nash Implementation with Non-connected Honesty Standards," Discussion Paper Series 633, Institute of Economic Research, Hitotsubashi University.
    11. Mezzetti, Claudio & Renou, Ludovic, 2012. "Implementation in mixed Nash equilibrium," Journal of Economic Theory, Elsevier, vol. 147(6), pages 2357-2375.
    12. Carlo Rosa & Giovanni Verga, 2006. "The Impact of Central Bank Announcements on Asset Prices in Real Time: Testing the Efficiency of the Euribor Futures Market," CEP Discussion Papers dp0764, Centre for Economic Performance, LSE.
    13. Dubey, Pradeep & Sondermann, Dieter, 2009. "Perfect competition in an oligopoly (including bilateral monopoly)," Games and Economic Behavior, Elsevier, vol. 65(1), pages 124-141, January.
    14. Hitoshi Matsushima & Shunya Noda, 2020. "Mechanism Design with Blockchain Enforcement," DSSR Discussion Papers 111, Graduate School of Economics and Management, Tohoku University.
    15. Núñez, Matías & Laslier, Jean-François, 2015. "Bargaining through Approval," Journal of Mathematical Economics, Elsevier, vol. 60(C), pages 63-73.
    16. Marco Bassetto, 2002. "A Game-Theoretic View of the Fiscal Theory of the Price Level," Econometrica, Econometric Society, vol. 70(6), pages 2167-2195, November.
    17. Casey Rothschild & Florian Scheuer, 2014. "A Theory of Income Taxation under Multidimensional Skill Heterogeneity," NBER Working Papers 19822, National Bureau of Economic Research, Inc.
    18. Arthur Schram & Boris Van Leeuwen & Theo Offerman, 2013. "Superstars Need Social Benefits: An Experiment on Network Formation," Working Papers 1306, Departament Empresa, Universitat Autònoma de Barcelona, revised Jul 2013.
    19. Feltenstein, Andrew & Lagunoff, Roger, 2005. "International versus domestic auditing of bank solvency," Journal of International Economics, Elsevier, vol. 67(1), pages 73-96, September.
    20. Patrick W. Schmitz, 2006. "Book Review," Journal of Institutional and Theoretical Economics (JITE), Mohr Siebeck, Tübingen, vol. 162(3), pages 535-542, September.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:telsys:v:61:y:2016:i:2:d:10.1007_s11235-015-9995-7. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.