Wireless resource scheduling in virtualized radio access networks using stochastic learning

Xianfu Chen, Zhu Han, Honggang Zhang, Guoliang Xue, Yong Xiao, Mehdi Bennis

    Research output: Contribution to journalArticleScientificpeer-review

    14 Citations (Scopus)

    Abstract

    How to allocate the limited wireless resource in dense radio access networks (RANs) remains challenging. By leveraging a software-defined control plane, the independent base stations (BSs) are virtualized as a centralized network controller (CNC). Such virtualization decouples the CNC from the wireless service providers (WSPs). We investigate a virtualized RAN, where the CNC auctions channels at the beginning of scheduling slots to the mobile terminals (MTs) based on bids from their subscribing WSPs. Each WSP aims at maximizing the expected long-term payoff from bidding channels to satisfy the MTs for transmitting packets. We formulate the problem as a stochastic game, where the channel auction and packet scheduling decisions of a WSP depend on the state of network and the control policies of its competitors. To approach the equilibrium solution, an abstract stochastic game is proposed with bounded regret. The decision making process of each WSP is modeled as a Markov decision process (MDP). To address the signalling overhead and computational complexity issues, we decompose the MDP into a series of single-agent MDPs with reduced state spaces, and derive an online localized algorithm to learn the state value functions. Our results show significant performance improvements in terms of per-MT average utility.
    Original languageEnglish
    Pages (from-to)961-974
    Number of pages14
    JournalIEEE Transactions on Mobile Computing
    Volume17
    Issue number4
    Early online date2017
    DOIs
    Publication statusPublished - 2018
    MoE publication typeA1 Journal article-refereed

    Fingerprint

    Scheduling
    Networks (circuits)
    Controllers
    Base stations
    Computational complexity
    Decision making

    Keywords

    • wireless communication
    • stochastic processes
    • games
    • radio access networks
    • mobile computing
    • mobile communication
    • scheduling

    Cite this

    Chen, Xianfu ; Han, Zhu ; Zhang, Honggang ; Xue, Guoliang ; Xiao, Yong ; Bennis, Mehdi. / Wireless resource scheduling in virtualized radio access networks using stochastic learning. In: IEEE Transactions on Mobile Computing. 2018 ; Vol. 17, No. 4. pp. 961-974.
    @article{cb52c1b8322a4f2b992041ac1a2031de,
    title = "Wireless resource scheduling in virtualized radio access networks using stochastic learning",
    abstract = "How to allocate the limited wireless resource in dense radio access networks (RANs) remains challenging. By leveraging a software-defined control plane, the independent base stations (BSs) are virtualized as a centralized network controller (CNC). Such virtualization decouples the CNC from the wireless service providers (WSPs). We investigate a virtualized RAN, where the CNC auctions channels at the beginning of scheduling slots to the mobile terminals (MTs) based on bids from their subscribing WSPs. Each WSP aims at maximizing the expected long-term payoff from bidding channels to satisfy the MTs for transmitting packets. We formulate the problem as a stochastic game, where the channel auction and packet scheduling decisions of a WSP depend on the state of network and the control policies of its competitors. To approach the equilibrium solution, an abstract stochastic game is proposed with bounded regret. The decision making process of each WSP is modeled as a Markov decision process (MDP). To address the signalling overhead and computational complexity issues, we decompose the MDP into a series of single-agent MDPs with reduced state spaces, and derive an online localized algorithm to learn the state value functions. Our results show significant performance improvements in terms of per-MT average utility.",
    keywords = "wireless communication, stochastic processes, games, radio access networks, mobile computing, mobile communication, scheduling",
    author = "Xianfu Chen and Zhu Han and Honggang Zhang and Guoliang Xue and Yong Xiao and Mehdi Bennis",
    year = "2018",
    doi = "10.1109/TMC.2017.2742949",
    language = "English",
    volume = "17",
    pages = "961--974",
    journal = "IEEE Transactions on Mobile Computing",
    issn = "1536-1233",
    publisher = "Institute of Electrical and Electronic Engineers IEEE",
    number = "4",

    }

    Wireless resource scheduling in virtualized radio access networks using stochastic learning. / Chen, Xianfu; Han, Zhu; Zhang, Honggang; Xue, Guoliang; Xiao, Yong; Bennis, Mehdi.

    In: IEEE Transactions on Mobile Computing, Vol. 17, No. 4, 2018, p. 961-974.

    Research output: Contribution to journalArticleScientificpeer-review

    TY - JOUR

    T1 - Wireless resource scheduling in virtualized radio access networks using stochastic learning

    AU - Chen, Xianfu

    AU - Han, Zhu

    AU - Zhang, Honggang

    AU - Xue, Guoliang

    AU - Xiao, Yong

    AU - Bennis, Mehdi

    PY - 2018

    Y1 - 2018

    N2 - How to allocate the limited wireless resource in dense radio access networks (RANs) remains challenging. By leveraging a software-defined control plane, the independent base stations (BSs) are virtualized as a centralized network controller (CNC). Such virtualization decouples the CNC from the wireless service providers (WSPs). We investigate a virtualized RAN, where the CNC auctions channels at the beginning of scheduling slots to the mobile terminals (MTs) based on bids from their subscribing WSPs. Each WSP aims at maximizing the expected long-term payoff from bidding channels to satisfy the MTs for transmitting packets. We formulate the problem as a stochastic game, where the channel auction and packet scheduling decisions of a WSP depend on the state of network and the control policies of its competitors. To approach the equilibrium solution, an abstract stochastic game is proposed with bounded regret. The decision making process of each WSP is modeled as a Markov decision process (MDP). To address the signalling overhead and computational complexity issues, we decompose the MDP into a series of single-agent MDPs with reduced state spaces, and derive an online localized algorithm to learn the state value functions. Our results show significant performance improvements in terms of per-MT average utility.

    AB - How to allocate the limited wireless resource in dense radio access networks (RANs) remains challenging. By leveraging a software-defined control plane, the independent base stations (BSs) are virtualized as a centralized network controller (CNC). Such virtualization decouples the CNC from the wireless service providers (WSPs). We investigate a virtualized RAN, where the CNC auctions channels at the beginning of scheduling slots to the mobile terminals (MTs) based on bids from their subscribing WSPs. Each WSP aims at maximizing the expected long-term payoff from bidding channels to satisfy the MTs for transmitting packets. We formulate the problem as a stochastic game, where the channel auction and packet scheduling decisions of a WSP depend on the state of network and the control policies of its competitors. To approach the equilibrium solution, an abstract stochastic game is proposed with bounded regret. The decision making process of each WSP is modeled as a Markov decision process (MDP). To address the signalling overhead and computational complexity issues, we decompose the MDP into a series of single-agent MDPs with reduced state spaces, and derive an online localized algorithm to learn the state value functions. Our results show significant performance improvements in terms of per-MT average utility.

    KW - wireless communication

    KW - stochastic processes

    KW - games

    KW - radio access networks

    KW - mobile computing

    KW - mobile communication

    KW - scheduling

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

    U2 - 10.1109/TMC.2017.2742949

    DO - 10.1109/TMC.2017.2742949

    M3 - Article

    VL - 17

    SP - 961

    EP - 974

    JO - IEEE Transactions on Mobile Computing

    JF - IEEE Transactions on Mobile Computing

    SN - 1536-1233

    IS - 4

    ER -