IDEAS home Printed from https://ideas.repec.org/a/wly/intnem/v27y2017i2ne1960.html
   My bibliography  Save this article

A dynamic pricing algorithm for a network of virtual resources

Author

Listed:
  • Bram Naudts
  • Mario Flores
  • Rashid Mijumbi
  • Sofie Verbrugge
  • Joan Serrat
  • Didier Colle

Abstract

A service function chain (SFC) is an ordered combination of abstract network functions (eg, network address translation and a firewall) that together define a network service (eg, video on demand). In an SDN/NFV‐based architecture, SFCs are composed of virtual network functions that need to be mapped to physical network components. Because the mapping of an SFC may be possible by multiple competing infrastructure providers (InPs), price will be a key differentiating factor. The pricing algorithm is therefore essential towards revenue management, yet current static pricing approaches suffer from several limitations. Among others, they do not consider the characteristics of the requests or the current state of the physical network. Using historical data, market data, and the current state of the physical network we investigate whether it is possible to increase total revenue of an InP compared to traditional static pricing approaches. This paper proposes a dynamic pricing algorithm to determine (1) at which utilization level it is rewarding to charge a higher price for a particular resource and (2) the alternative price that should be charged. Our simulation results for 8 different setups show that the proposed heuristic outperforms a static pricing approach significantly (by 8‐85% points for the considered scenarios). As a consequence, the proposed approach can be considered as an alternative for static pricing approaches. Still, it is unclear how the total revenue of an InP is affected when multiple or all competitors use a dynamic pricing algorithm; this will therefore remain the focus of future work.

Suggested Citation

  • Bram Naudts & Mario Flores & Rashid Mijumbi & Sofie Verbrugge & Joan Serrat & Didier Colle, 2017. "A dynamic pricing algorithm for a network of virtual resources," International Journal of Network Management, John Wiley & Sons, vol. 27(2), March.
    • Handle: RePEc:wly:intnem:v:27:y:2017:i:2:n:e1960
    DOI: 10.1002/nem.1960
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nem.1960
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nem.1960?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
    ---><---

    References listed on IDEAS

    as
    1. Gabriel Bitran & René Caldentey, 2003. "An Overview of Pricing Models for Revenue Management," Manufacturing & Service Operations Management, INFORMS, vol. 5(3), pages 203-229, August.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Laszlo Toka & Marton Zubor & Attila Korosi & George Darzanos & Ori Rottenstreich & Balazs Sonkoly, 2021. "Pricing games of NFV infrastructure providers," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 76(2), pages 219-232, February.

    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. Vincent Mak & Amnon Rapoport & Eyran J. Gisches & Jiaojie Han, 2014. "Purchasing Scarce Products Under Dynamic Pricing: An Experimental Investigation," Manufacturing & Service Operations Management, INFORMS, vol. 16(3), pages 425-438, July.
    2. Schulte, Benedikt & Sachs, Anna-Lena, 2020. "The price-setting newsvendor with Poisson demand," European Journal of Operational Research, Elsevier, vol. 283(1), pages 125-137.
    3. Dasci, A. & Karakul, M., 2009. "Two-period dynamic versus fixed-ratio pricing in a capacity constrained duopoly," European Journal of Operational Research, Elsevier, vol. 197(3), pages 945-968, September.
    4. Alessandro Avenali & Yuri Maria Chianese & Graziano Ciucciarelli & Giorgio Grani & Laura Palagi, 2019. "Profit optimization in one-way free float car sharing services: a user based relocation strategy relying on price differentiation and Urban Area Values," DIAG Technical Reports 2019-04, Department of Computer, Control and Management Engineering, Universita' degli Studi di Roma "La Sapienza".
    5. Yiwei Chen & Vivek F. Farias, 2013. "Simple Policies for Dynamic Pricing with Imperfect Forecasts," Operations Research, INFORMS, vol. 61(3), pages 612-624, June.
    6. Vincent Mak & Amnon Rapoport & Eyran J. Gisches, 2018. "Dynamic Pricing Decisions and Seller-Buyer Interactions under Capacity Constraints," Games, MDPI, vol. 9(1), pages 1-23, February.
    7. Yuri Levin & Jeff McGill & Mikhail Nediak, 2008. "Risk in Revenue Management and Dynamic Pricing," Operations Research, INFORMS, vol. 56(2), pages 326-343, April.
    8. Adam J. Mersereau & Dan Zhang, 2012. "Markdown Pricing with Unknown Fraction of Strategic Customers," Manufacturing & Service Operations Management, INFORMS, vol. 14(3), pages 355-370, July.
    9. Talebian, Masoud & Boland, Natashia & Savelsbergh, Martin, 2014. "Pricing to accelerate demand learning in dynamic assortment planning for perishable products," European Journal of Operational Research, Elsevier, vol. 237(2), pages 555-565.
    10. Sabri Çelik & Alp Muharremoglu & Sergei Savin, 2009. "Revenue Management with Costly Price Adjustments," Operations Research, INFORMS, vol. 57(5), pages 1206-1219, October.
    11. René Caldentey & Gustavo Vulcano, 2007. "Online Auction and List Price Revenue Management," Management Science, INFORMS, vol. 53(5), pages 795-813, May.
    12. Qi (George) Chen & Stefanus Jasin & Izak Duenyas, 2016. "Real-Time Dynamic Pricing with Minimal and Flexible Price Adjustment," Management Science, INFORMS, vol. 62(8), pages 2437-2455, August.
    13. Chen, Bo & Zhang, Xiandong, 2019. "Scheduling with time-of-use costs," European Journal of Operational Research, Elsevier, vol. 274(3), pages 900-908.
    14. Irene Ng & Nick K.T. Yip, 2009. "Mechanism design in an integrated approach towards revenue management: the case of Empress Cruise Lines," The Service Industries Journal, Taylor & Francis Journals, vol. 31(3), pages 469-482, February.
    15. Chua, Geoffrey A. & Lim, Wei Shi & Yeo, Wee Meng, 2016. "Market structure and the value of overselling under stochastic demands," European Journal of Operational Research, Elsevier, vol. 252(3), pages 900-909.
    16. Anming Zhang & Yimin Zhang & Joseph A. Clougherty, 2011. "Competition and Regulation in Air Transport," Chapters, in: André de Palma & Robin Lindsey & Emile Quinet & Roger Vickerman (ed.), A Handbook of Transport Economics, chapter 35, Edward Elgar Publishing.
    17. Lingxiu Dong & Panos Kouvelis & Zhongjun Tian, 2009. "Dynamic Pricing and Inventory Control of Substitute Products," Manufacturing & Service Operations Management, INFORMS, vol. 11(2), pages 317-339, December.
    18. Wei Shi Lim, 2009. "Overselling in a Competitive Environment: Boon or Bane?," Marketing Science, INFORMS, vol. 28(6), pages 1129-1143, 11-12.
    19. Selcuk, Cemil & Gokpinar, Bilal, 2017. "Fixed vs. Flexible Pricing in a Competitive Market," Cardiff Economics Working Papers E2017/9, Cardiff University, Cardiff Business School, Economics Section.
    20. J. B. G. Frenk & Canan Pehlivan & Semih O. Sezer, 2019. "Order and exit decisions under non-increasing price curves for products with short life cycles," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 90(3), pages 365-397, December.

    More about this item

    Statistics

    Access and download statistics

    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:wly:intnem:v:27:y:2017:i:2:n:e1960. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1099-1190 .

    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.