Skip to content
naulon
Not checkedNot checked for notices yet.

Low-Latency Oriented Network Planning for MEC-Enabled WDM-PON Based Fiber-Wireless Access Networks

Xin Wang, Yuefeng Ji, Jiawei Zhang and 2 more

IEEE Access · 2019

doi:10.1109/access.2019.2926795 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

WDM-PON-based mobile edge computing (MEC)-enabled fiber wireless access networks (MFWAN) have been identified as a promising technology for next-generation broadband access. Low-latency oriented network planning of the WDM-PON-based MFWAN would be required for low-latency access to newly emerging latency-sensitive applications in the fifth-generation (5G) era. However, this would require a low-latency oriented network design in the network planning phase and has thus become a crucial challenge. In this paper, we investigate low-latency oriented network planning of the WDM-PON-based MFWAN under physical and management constraints. To this end, we develop a mathematical model to minimize total transmission latency for all latency-sensitive services. Our model is composed of the propagation latency on the paths and the processing latency on the network equipment and is subject to constraints of maximal transmission distance, maximal PON power budget, bandwidth requests, and the fronthaul latency limit under some functional split options. Given the model's complexity, we also propose a heuristic algorithm called latency-minimized integrated multi-associated positioning and routing algorithm (LMI-MAPRA). The simulation results show that the proposed algorithm outperforms the benchmark algorithm with more total transmission latency reductions in both sparse and dense networks. We also analyze the impact of key parameters on comparisons of different approaches in terms of low-latency optimal performances.

Abstract licence: CC BY-NC-ND

References30

    30 more references, whose wording the paper’s licence keeps private.

    Reads

    Read by people on this page

    None yet.

    Checked or read by AI through naulon

    None yet.

    A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

    Are you an author?

    Is this your paper?

    Claim it to add your note and be paid when agents cite it. Free.