A Supervised Learning Based QoS Assurance Architecture for 5G Networks

Abstract

The 5G networks are broadly characterized by three unique features: ubiquitous connectivity, extremely low latency, and extraordinary high-speed data transfer. The challenge of 5G is to assure the network performance and different quality of service (QoS) requirements of different services, such as machine type communication (MTC), enhanced mobile broad band (eMBB), and ultra-reliable low latency communications (URLLC) over 5G networks. Unlike the previous ”one size fits all” system, the softwarization, slicing and network capability exposure of 5G provide dynamic programming capabilities for QoS assurance. With the increasing complexity and dynamics of the network behaviors, it is non-trivial for a programmer to develop traditional software codes to schedule the network resources based on expert knowledge, especially when there is no quantitative relationship among the network events and the QoS anomalies. Machine learning is a computer technology that gives computer systems the ability to learn with data and improve performance and accuracy of decision making on a specific task, without being explicitly programmed. The areas of machine learning and communication technology are converging. Supervised learning based QoS assurance architecture for 5G networks was proposed in this paper. The supervised machine learning mechanisms can intelligently learn the network environment and react to dynamic situations. They can learn from the fore passed QoS related information and anomalies, and further reconstruct the relationship between the fore passed data and the current QoS related anomalies automatically and accurately. They, then, can trigger automatic mitigation or provide suggestions. The supervised machine learning mechanisms can also predict future QoS related anomalies with high confidence. In this paper, a case study for QoS anomaly root cause tracking based on decision tree was given to validate the proposed framework architecture.