IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v9y2017i11p2127-d119433.html
   My bibliography  Save this article

Tradeoff between User Quality-Of-Experience and Service Provider Profit in 5G Cloud Radio Access Network

Author

Listed:
  • Mahbuba Afrin

    (Department of Computer Science and Engineering, University of Dhaka, Dhaka 1000, Bangladesh)

  • Md. Abdur Razzaque

    (Department of Computer Science and Engineering, University of Dhaka, Dhaka 1000, Bangladesh)

  • Iffat Anjum

    (Department of Computer Science and Engineering, University of Dhaka, Dhaka 1000, Bangladesh)

  • Mohammad Mehedi Hassan

    (College of Computer and Information Sciences, King Saud University, Riyadh 11543, Saudi Arabia)

  • Atif Alamri

    (College of Computer and Information Sciences, King Saud University, Riyadh 11543, Saudi Arabia)

Abstract

In recent years, the Cloud Radio Access Network (CRAN) has become a promising solution for increasing network capacity in terms of high data rates and low latencies for fifth-generation (5G) cellular networks. In CRAN, the traditional base stations (BSs) are decoupled into remote radio heads (RRHs) and base band units (BBUs) that are respectively responsible for radio and baseband functionalities. The RRHs are geographically proximated whereas the the BBUs are pooled in a centralized cloud named BBU pool. This virtualized architecture facilitates the system to offer high computation and communication loads from the impetuous rise of mobile devices and applications. Heterogeneous service requests from the devices to different RRHs are now sent to the BBUs to process centrally. Meeting the baseband processing of heterogeneous requests while keeping their Quality-of-Service (QoS) requirements with the limited computational resources as well as enhancing service provider profit is a challenging multi-constraint problem. In this work, a multi-objective non-linear programming solution to the Quality-of-Experience (QoE) and Profit-aware Resource Allocation problem is developed which makes a trade-off in between the two. Two computationally viable scheduling algorithms, named First Fit Satisfaction and First Fit Profit algorithms, are developed to focus on maximization of user QoE and profit, respectively, while keeping the minimum requirement level for the other one. The simulation environment is built on a relevant simulation toolkit. The experimental results demonstrate that the proposed system outperforms state-of-the-art works well across the requests QoS, average waiting time, user QoE, and service provider profit.

Suggested Citation

  • Mahbuba Afrin & Md. Abdur Razzaque & Iffat Anjum & Mohammad Mehedi Hassan & Atif Alamri, 2017. "Tradeoff between User Quality-Of-Experience and Service Provider Profit in 5G Cloud Radio Access Network," Sustainability, MDPI, vol. 9(11), pages 1-19, November.
  • Handle: RePEc:gam:jsusta:v:9:y:2017:i:11:p:2127-:d:119433
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/9/11/2127/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2071-1050/9/11/2127/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Marshall L. Fisher & R. Jaikumar & Luk N. Van Wassenhove, 1986. "A Multiplier Adjustment Method for the Generalized Assignment Problem," Management Science, INFORMS, vol. 32(9), pages 1095-1103, September.
    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. David Gil & Magnus Johnsson & Higinio Mora & Julian Szymański, 2019. "Review of the Complexity of Managing Big Data of the Internet of Things," Complexity, Hindawi, vol. 2019, pages 1-12, February.
    2. Waqas Khalid & Heejung Yu, 2018. "Sum Utilization of Spectrum with Spectrum Handoff and Imperfect Sensing in Interweave Multi-Channel Cognitive Radio Networks," Sustainability, MDPI, vol. 10(6), pages 1-18, May.
    3. Yousaf Bin Zikria & Sung Won Kim & Muhammad Khalil Afzal & Haoxiang Wang & Mubashir Husain Rehmani, 2018. "5G Mobile Services and Scenarios: Challenges and Solutions," Sustainability, MDPI, vol. 10(10), pages 1-9, October.

    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. Behiri, Walid & Belmokhtar-Berraf, Sana & Chu, Chengbin, 2018. "Urban freight transport using passenger rail network: Scientific issues and quantitative analysis," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 115(C), pages 227-245.
    2. Corbett, Charles J. & Debets, Frank J.C. & Van Wassenhove, Luk N., 1995. "Decentralization of responsibility for site decontamination projects: A budget allocation approach," European Journal of Operational Research, Elsevier, vol. 86(1), pages 103-119, October.
    3. Drexl, Andreas, 1990. "Scheduling of project networks by job assignment," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 247, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    4. Lin, Yi-Kuei & Yeh, Cheng-Ta, 2011. "Maximal network reliability for a stochastic power transmission network," Reliability Engineering and System Safety, Elsevier, vol. 96(10), pages 1332-1339.
    5. Laguna, Manuel & Kelly, James P. & Gonzalez-Velarde, JoseLuis & Glover, Fred, 1995. "Tabu search for the multilevel generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 82(1), pages 176-189, April.
    6. Broekmeulen, Rob A. C. M. & van Weert, Arjen & Saedt, Anton P. H., 2002. "Comparing three alternative optimisation methods for the treatment planning of bulbs," Agricultural Systems, Elsevier, vol. 72(1), pages 59-71, April.
    7. Lorenzo Ros-McDonnell & Norina Szander & María Victoria de-la-Fuente-Aragón & Robert Vodopivec, 2019. "Scheduling Sustainable Homecare with Urban Transport and Different Skilled Nurses Using an Approximate Algorithm," Sustainability, MDPI, vol. 11(22), pages 1-14, November.
    8. 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.
    9. Lin, Yi-Kuei & Yeh, Cheng-Ta, 2012. "Multi-objective optimization for stochastic computer networks using NSGA-II and TOPSIS," European Journal of Operational Research, Elsevier, vol. 218(3), pages 735-746.
    10. Yeh, Cheng-Ta, 2019. "An improved NSGA2 to solve a bi-objective optimization problem of multi-state electronic transaction network," Reliability Engineering and System Safety, Elsevier, vol. 191(C).
    11. Lorenzo Ros-McDonnell & M. de-la-Fuente-Aragon & Marija Bogataj, 2012. "An approximate algorithm for optimal logistics of heavy and variable size items," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 20(1), pages 1-17, March.
    12. Samuel Bazzi & Arya Gaduh & Alexander D. Rothenberg & Maisy Wong, 2016. "Skill Transferability, Migration, and Development: Evidence from Population Resettlement in Indonesia," American Economic Review, American Economic Association, vol. 106(9), pages 2658-2698, September.
    13. Marco Antonio Boschetti & Vittorio Maniezzo, 2022. "Matheuristics: using mathematics for heuristic design," 4OR, Springer, vol. 20(2), pages 173-208, June.
    14. Norina Szander & Lorenzo Ros-McDonnell & María Victoria De-la-Fuente-Aragón & Robert Vodopivec, 2018. "Sustainable Urban Homecare Delivery with Different Means of Transport," Sustainability, MDPI, vol. 10(2), pages 1-12, February.
    15. Sabyasachi Mitra & Ishwar Murthy, 1998. "A Dual Ascent Procedure with Valid Inequalities for Designing Hierarchical Network Topologies," INFORMS Journal on Computing, INFORMS, vol. 10(1), pages 40-55, February.
    16. Narciso, Marcelo G. & Lorena, Luiz Antonio N., 1999. "Lagrangean/surrogate relaxation for generalized assignment problems," European Journal of Operational Research, Elsevier, vol. 114(1), pages 165-177, April.
    17. Helena Ramalhinho-Lourenço & Daniel Serra, 1998. "Adaptive approach heuristics for the generalized assignment problem," Economics Working Papers 288, Department of Economics and Business, Universitat Pompeu Fabra.
    18. Park, Junhyuk & Kim, Byung-In, 2010. "The school bus routing problem: A review," European Journal of Operational Research, Elsevier, vol. 202(2), pages 311-319, April.
    19. Diaz, Juan A. & Fernandez, Elena, 2001. "A Tabu search heuristic for the generalized assignment problem," European Journal of Operational Research, Elsevier, vol. 132(1), pages 22-38, July.
    20. Amini, Mohammad M. & Racer, Michael & Ghandforoush, Parviz, 1998. "Heuristic sensitivity analysis in a combinatoric environment: An exposition and case study," European Journal of Operational Research, Elsevier, vol. 108(3), pages 604-617, August.

    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:gam:jsusta:v:9:y:2017:i:11:p:2127-:d:119433. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.