Summary Through accurate network‐wide traffic prediction, network operators can agilely manage resources and improve robustness by proactively adapting to new traffic patterns, especially for traffic engineering, capacity planning and quality of service provisioning. However, due to the proliferation of backbone network traffic as well as the complexity and dynamics of network communication behavior, accurate and effective network‐wide traffic prediction is challenging. To address the challenges, this paper focuses on short‐term traffic matrix (TM) prediction in large‐scale IP backbone networks. In order to improve the prediction performance, a novel spatiotemporal graph convolutional recurrent network (SGCRN)—a deep learning framework that incorporates both spatial and temporal dependencies of traffic flows, is proposed to implement TM prediction with high accuracy and efficiency. By learning network‐wide traffic as graph‐structured TM time series, SGCRN jointly utilizes graph convolutional networks (GCN) and gated recurrent units (GRU) networks to extract comprehensive spatiotemporal correlations among traffic flows. Specifically, SGCRN employs GCNs to identify structural spatial features of traffic flows by considering topological properties, and utilizes GRUs to implement temporal features learning by considering short and long‐term dynamics of traffic flows. Extensive experimental results on the inter‐Points of Presence network traffic data from four real IP backbone networks show that SGCRN can effectively predict short‐term network‐wide TM with superior accuracy compared with other four widely used traffic prediction methods.

Overlay networks have emerged as a useful approach to providing a general framework for new applications and services that are to be implemented without significantly changing the IP-layer network infrastructure. Overlay routing has been used as an alternative to the default best effort Internet routing for the absence of end-to-end Quality of Service (QoS). While the former has recently been investigated, the conflict of QoS restraints and resource optimization remains unsolved. Recent studies have shown that overlay paths can give better latency, loss rate and TCP throughput. In this paper, a multi-dimensional QoS objective model based on the analysis of multiple QoS constraints has been presented, and a routing algorithm to optimise the overlay resource of its nodes and links is then proposed. In fact, the algorithm obtained multiple QoS values using probability theory to achieve the routing according to the multi-dimensional QoS objective vector of the QoS objective model. Simulation results reveals that the algorithm works better than other existing algorithms in balancing the network resources, and applications with stringent QoS requirements could be run.

No abstract

No abstract

No abstract