Delay-tolerant resource scheduling in large-scale virtualized radio access networks

Xianfu Chen, Huaqing Zhang, Zhu Han

    Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

    1 Citation (Scopus)

    Abstract

    Network virtualization facilitates radio access network (RAN) sharing by decoupling the physical network infrastructure from the wireless services. This paper considers a scenario in which a virtual network operator (VNO) leases wireless resources from a software-defined networking based virtualized RAN set up by a third-party infrastructure provider (InP). In order to optimize the revenue, the VNO explores jointly the delay tolerance in mobile traffic and the weak load coupling across the base stations (BSs) when making the resource scheduling decisions to serve its mobile users (MUs). The problem faced by the VNO can be straightforwardly transformed to the problem of minimizing the payments to the InP, which is formulated as a finite time horizon constrained Markov decision process (MDP). However, for a large-scale network with a huge number of MUs, the problem solving becomes extremely challenging. Through the dual decomposition approach, we decompose the problem into a series of per-MU MDPs, which can be solved distributedly. Moreover, the independence of channel conditions between a MU and the BSs is expected to further simplify solving each per-MU MDP. The simulations carried out in this paper show that our proposed scheme achieves minimal average payments compared with other existing approaches in literature.
    Original languageEnglish
    Title of host publication2017 IEEE International Conference on Communications, ICC 2017
    EditorsMerouane Debbah, David Gesbert, Abdelhamid Mellouk
    PublisherInstitute of Electrical and Electronic Engineers IEEE
    ISBN (Electronic)978-1-4673-8999-0
    ISBN (Print)978-1-4673-9000-2
    DOIs
    Publication statusPublished - 28 Jul 2017
    MoE publication typeA4 Article in a conference publication
    EventIEEE International Conference on Communications, ICC 2017 - Paris, France
    Duration: 21 May 201725 May 2017

    Conference

    ConferenceIEEE International Conference on Communications, ICC 2017
    Abbreviated titleICC 2017
    CountryFrance
    CityParis
    Period21/05/1725/05/17

    Fingerprint

    Scheduling
    Base stations
    Decomposition

    Cite this

    Chen, X., Zhang, H., & Han, Z. (2017). Delay-tolerant resource scheduling in large-scale virtualized radio access networks. In M. Debbah, D. Gesbert, & A. Mellouk (Eds.), 2017 IEEE International Conference on Communications, ICC 2017 [7996599] Institute of Electrical and Electronic Engineers IEEE. https://doi.org/10.1109/ICC.2017.7996599
    Chen, Xianfu ; Zhang, Huaqing ; Han, Zhu. / Delay-tolerant resource scheduling in large-scale virtualized radio access networks. 2017 IEEE International Conference on Communications, ICC 2017. editor / Merouane Debbah ; David Gesbert ; Abdelhamid Mellouk. Institute of Electrical and Electronic Engineers IEEE, 2017.
    @inproceedings{21d59e7000934e97a8c06855a9a2124c,
    title = "Delay-tolerant resource scheduling in large-scale virtualized radio access networks",
    abstract = "Network virtualization facilitates radio access network (RAN) sharing by decoupling the physical network infrastructure from the wireless services. This paper considers a scenario in which a virtual network operator (VNO) leases wireless resources from a software-defined networking based virtualized RAN set up by a third-party infrastructure provider (InP). In order to optimize the revenue, the VNO explores jointly the delay tolerance in mobile traffic and the weak load coupling across the base stations (BSs) when making the resource scheduling decisions to serve its mobile users (MUs). The problem faced by the VNO can be straightforwardly transformed to the problem of minimizing the payments to the InP, which is formulated as a finite time horizon constrained Markov decision process (MDP). However, for a large-scale network with a huge number of MUs, the problem solving becomes extremely challenging. Through the dual decomposition approach, we decompose the problem into a series of per-MU MDPs, which can be solved distributedly. Moreover, the independence of channel conditions between a MU and the BSs is expected to further simplify solving each per-MU MDP. The simulations carried out in this paper show that our proposed scheme achieves minimal average payments compared with other existing approaches in literature.",
    author = "Xianfu Chen and Huaqing Zhang and Zhu Han",
    year = "2017",
    month = "7",
    day = "28",
    doi = "10.1109/ICC.2017.7996599",
    language = "English",
    isbn = "978-1-4673-9000-2",
    editor = "Merouane Debbah and David Gesbert and Abdelhamid Mellouk",
    booktitle = "2017 IEEE International Conference on Communications, ICC 2017",
    publisher = "Institute of Electrical and Electronic Engineers IEEE",
    address = "United States",

    }

    Chen, X, Zhang, H & Han, Z 2017, Delay-tolerant resource scheduling in large-scale virtualized radio access networks. in M Debbah, D Gesbert & A Mellouk (eds), 2017 IEEE International Conference on Communications, ICC 2017., 7996599, Institute of Electrical and Electronic Engineers IEEE, IEEE International Conference on Communications, ICC 2017, Paris, France, 21/05/17. https://doi.org/10.1109/ICC.2017.7996599

    Delay-tolerant resource scheduling in large-scale virtualized radio access networks. / Chen, Xianfu; Zhang, Huaqing; Han, Zhu.

    2017 IEEE International Conference on Communications, ICC 2017. ed. / Merouane Debbah; David Gesbert; Abdelhamid Mellouk. Institute of Electrical and Electronic Engineers IEEE, 2017. 7996599.

    Research output: Chapter in Book/Report/Conference proceedingConference article in proceedingsScientificpeer-review

    TY - GEN

    T1 - Delay-tolerant resource scheduling in large-scale virtualized radio access networks

    AU - Chen, Xianfu

    AU - Zhang, Huaqing

    AU - Han, Zhu

    PY - 2017/7/28

    Y1 - 2017/7/28

    N2 - Network virtualization facilitates radio access network (RAN) sharing by decoupling the physical network infrastructure from the wireless services. This paper considers a scenario in which a virtual network operator (VNO) leases wireless resources from a software-defined networking based virtualized RAN set up by a third-party infrastructure provider (InP). In order to optimize the revenue, the VNO explores jointly the delay tolerance in mobile traffic and the weak load coupling across the base stations (BSs) when making the resource scheduling decisions to serve its mobile users (MUs). The problem faced by the VNO can be straightforwardly transformed to the problem of minimizing the payments to the InP, which is formulated as a finite time horizon constrained Markov decision process (MDP). However, for a large-scale network with a huge number of MUs, the problem solving becomes extremely challenging. Through the dual decomposition approach, we decompose the problem into a series of per-MU MDPs, which can be solved distributedly. Moreover, the independence of channel conditions between a MU and the BSs is expected to further simplify solving each per-MU MDP. The simulations carried out in this paper show that our proposed scheme achieves minimal average payments compared with other existing approaches in literature.

    AB - Network virtualization facilitates radio access network (RAN) sharing by decoupling the physical network infrastructure from the wireless services. This paper considers a scenario in which a virtual network operator (VNO) leases wireless resources from a software-defined networking based virtualized RAN set up by a third-party infrastructure provider (InP). In order to optimize the revenue, the VNO explores jointly the delay tolerance in mobile traffic and the weak load coupling across the base stations (BSs) when making the resource scheduling decisions to serve its mobile users (MUs). The problem faced by the VNO can be straightforwardly transformed to the problem of minimizing the payments to the InP, which is formulated as a finite time horizon constrained Markov decision process (MDP). However, for a large-scale network with a huge number of MUs, the problem solving becomes extremely challenging. Through the dual decomposition approach, we decompose the problem into a series of per-MU MDPs, which can be solved distributedly. Moreover, the independence of channel conditions between a MU and the BSs is expected to further simplify solving each per-MU MDP. The simulations carried out in this paper show that our proposed scheme achieves minimal average payments compared with other existing approaches in literature.

    UR - http://www.scopus.com/inward/record.url?scp=85028297701&partnerID=8YFLogxK

    U2 - 10.1109/ICC.2017.7996599

    DO - 10.1109/ICC.2017.7996599

    M3 - Conference article in proceedings

    SN - 978-1-4673-9000-2

    BT - 2017 IEEE International Conference on Communications, ICC 2017

    A2 - Debbah, Merouane

    A2 - Gesbert, David

    A2 - Mellouk, Abdelhamid

    PB - Institute of Electrical and Electronic Engineers IEEE

    ER -

    Chen X, Zhang H, Han Z. Delay-tolerant resource scheduling in large-scale virtualized radio access networks. In Debbah M, Gesbert D, Mellouk A, editors, 2017 IEEE International Conference on Communications, ICC 2017. Institute of Electrical and Electronic Engineers IEEE. 2017. 7996599 https://doi.org/10.1109/ICC.2017.7996599