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

Optimal management of reusable functional blocks in 5G superfluid networks

Author

Listed:
  • Luca Chiaraviglio
  • Lavinia Amorosi
  • Nicola Blefari‐Melazzi
  • Paolo Dell'Olmo
  • Mohammad Shojafar
  • Stefano Salsano

Abstract

We consider the problem of managing a 5G network composed of virtualized entities, called reusable functional blocks (RFBs), as proposed by the Horizon 2020 SUPERFLUIDITY project. The RFBs are used to decompose network functions and services and are deployed on top of physical nodes, in order to realize the 5G functionalities. After formally modeling the RFBs in a 5G network, as well as the physical nodes hosting them, we formulate the problem of managing the 5G network through the RFBs, in order to satisfy different key performance indicators to users. In particular, we focus either on the maximization of the amount of downlink throughput sent to users or on the minimization of the number of powered‐on physical nodes. We then consider different scenarios to evaluate the proposed formulations. Our results show that, when an RFB‐based approach is put into place, a high level of flexibility and dynamicity is achieved. In particular, the RFBs can be shared, moved, and rearranged based on the network conditions. As a result, the downlink throughput can be extremely high, ie, more than 150 Mbps per user on average when the throughput maximization is pursued and more than 100 Mbps on average when the goal is the minimization of the number of powered‐on physical nodes.

Suggested Citation

  • Luca Chiaraviglio & Lavinia Amorosi & Nicola Blefari‐Melazzi & Paolo Dell'Olmo & Mohammad Shojafar & Stefano Salsano, 2019. "Optimal management of reusable functional blocks in 5G superfluid networks," International Journal of Network Management, John Wiley & Sons, vol. 29(1), January.
    • Handle: RePEc:wly:intnem:v:29:y:2019:i:1:n:e2045
    DOI: 10.1002/nem.2045
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nem.2045
    Download Restriction: no
    File URL: https://libkey.io/10.1002/nem.2045?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. Warren P. Adams & Hanif D. Sherali, 1990. "Linearization Strategies for a Class of Zero-One Mixed Integer Programming Problems," Operations Research, INFORMS, vol. 38(2), pages 217-226, April.
    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. Tae-Yeun Kim & A. K. Singh & Hoon Ko, 2022. "RETRACTED ARTICLE: Modeling for small cell networks in 5G communication environment," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 80(2), pages 189-214, June.

    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. Osman, Hany & Demirli, Kudret, 2010. "A bilinear goal programming model and a modified Benders decomposition algorithm for supply chain reconfiguration and supplier selection," International Journal of Production Economics, Elsevier, vol. 124(1), pages 97-105, March.
    2. Rostami, Borzou & Malucelli, Federico & Belotti, Pietro & Gualandi, Stefano, 2016. "Lower bounding procedure for the asymmetric quadratic traveling salesman problem," European Journal of Operational Research, Elsevier, vol. 253(3), pages 584-592.
    3. de Meijer, Frank, 2023. "Integrality and cutting planes in semidefinite programming approaches for combinatorial optimization," Other publications TiSEM b1f1088c-95fe-4b8a-9e15-c, Tilburg University, School of Economics and Management.
    4. Guanglei Wang & Hassan Hijazi, 2018. "Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches," Computational Optimization and Applications, Springer, vol. 71(2), pages 553-608, November.
    5. Hao Hu & Renata Sotirov, 2021. "The linearization problem of a binary quadratic problem and its applications," Annals of Operations Research, Springer, vol. 307(1), pages 229-249, December.
    6. Hanif Sherali, 2007. "RLT: A unified approach for discrete and continuous nonconvex optimization," Annals of Operations Research, Springer, vol. 149(1), pages 185-193, February.
    7. Pessoa, Artur Alves & Hahn, Peter M. & Guignard, Monique & Zhu, Yi-Rong, 2010. "Algorithms for the generalized quadratic assignment problem combining Lagrangean decomposition and the Reformulation-Linearization Technique," European Journal of Operational Research, Elsevier, vol. 206(1), pages 54-63, October.
    8. Keith Zorn & Nikolaos Sahinidis, 2014. "Global optimization of general nonconvex problems with intermediate polynomial substructures," Journal of Global Optimization, Springer, vol. 59(2), pages 673-693, July.
    9. Ghaffarpour, Reza & Mozafari, Babak & Ranjbar, Ali Mohammad & Torabi, Taghi, 2018. "Resilience oriented water and energy hub scheduling considering maintenance constraint," Energy, Elsevier, vol. 158(C), pages 1092-1104.
    10. Alumur, Sibel A. & Campbell, James F. & Contreras, Ivan & Kara, Bahar Y. & Marianov, Vladimir & O’Kelly, Morton E., 2021. "Perspectives on modeling hub location problems," European Journal of Operational Research, Elsevier, vol. 291(1), pages 1-17.
    11. de Klerk, Etienne & -Nagy, Marianna E. & Sotirov, Renata & Truetsch, Uwe, 2014. "Symmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problems," European Journal of Operational Research, Elsevier, vol. 233(3), pages 488-499.
    12. Sándor F. Tóth & Robert G. Haight & Luke W. Rogers, 2011. "Dynamic Reserve Selection: Optimal Land Retention with Land-Price Feedbacks," Operations Research, INFORMS, vol. 59(5), pages 1059-1078, October.
    13. Peter Hahn & J. MacGregor Smith & Yi-Rong Zhu, 2010. "The Multi-Story Space Assignment Problem," Annals of Operations Research, Springer, vol. 179(1), pages 77-103, September.
    14. Warren Adams & Hanif Sherali, 2005. "A Hierarchy of Relaxations Leading to the Convex Hull Representation for General Discrete Optimization Problems," Annals of Operations Research, Springer, vol. 140(1), pages 21-47, November.
    15. Hesham Rakha & Mazen Arafeh, 2010. "Calibrating Steady-State Traffic Stream and Car-Following Models Using Loop Detector Data," Transportation Science, INFORMS, vol. 44(2), pages 151-168, May.
    16. Maximilian Roth & Georg Franke & Stephan Rinderknecht, 2022. "A Comprehensive Approach for an Approximative Integration of Nonlinear-Bivariate Functions in Mixed-Integer Linear Programming Models," Mathematics, MDPI, vol. 10(13), pages 1-17, June.
    17. Zvi Drezner & Peter Hahn & Éeric Taillard, 2005. "Recent Advances for the Quadratic Assignment Problem with Special Emphasis on Instances that are Difficult for Meta-Heuristic Methods," Annals of Operations Research, Springer, vol. 139(1), pages 65-94, October.
    18. Jung, Jihye & Choi, In-Chan, 2022. "A multi-objective optimization model for dissolving circular shareholdings in Korean conglomerates," Socio-Economic Planning Sciences, Elsevier, vol. 82(PB).
    19. Antonio Frangioni & Fabio Furini & Claudio Gentile, 2016. "Approximated perspective relaxations: a project and lift approach," Computational Optimization and Applications, Springer, vol. 63(3), pages 705-735, April.
    20. Azizi, Nader & Salhi, Said, 2022. "Reliable hub-and-spoke systems with multiple capacity levels and flow dependent discount factor," European Journal of Operational Research, Elsevier, vol. 298(3), pages 834-854.

    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:29:y:2019:i:1:n:e2045. 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.