论文标题
从链接测量的基于学习的流量矩阵估算方法
Learning Based Methods for Traffic Matrix Estimation from Link Measurements
论文作者
论文摘要
网络流量需求矩阵是容量计划,异常检测和许多其他与网络管理相关任务的关键输入。需求矩阵通常是根据链路负载测量来计算的。流量矩阵(TM)估计问题是从链接负载测量值确定流量需求矩阵。链接负载与生成链路负载的流量矩阵之间的关系可以建模为不确定的线性系统,并具有多个可行的解决方案。因此,必须使用对交通需求模式的先验知识,以找到潜在的可行需求矩阵。在本文中,我们考虑了TM估计问题,其中我们拥有有关需求量分布的信息。可以从对过去测得的几个流量矩阵的分析或操作员的经验中获得此信息。我们为解决该问题的解决方案开发了一种基于迭代投影的算法。如果可以访问大量过去的流量矩阵,我们建议一种基于生成的对抗网络(GAN)解决问题的方法。我们比较了两种方法的优势,并使用不同量的过去数据评估了它们的多个网络的性能。
Network traffic demand matrix is a critical input for capacity planning, anomaly detection and many other network management related tasks. The demand matrix is often computed from link load measurements. The traffic matrix (TM) estimation problem is the determination of the traffic demand matrix from link load measurements. The relationship between the link loads and the traffic matrix that generated the link load can be modeled as an under-determined linear system and has multiple feasible solutions. Therefore, prior knowledge of the traffic demand pattern has to be used in order to find a potentially feasible demand matrix. In this paper, we consider the TM estimation problem where we have information about the distribution of the demand sizes. This information can be obtained from the analysis of a few traffic matrices measured in the past or from operator experience. We develop an iterative projection based algorithm for the solution of this problem. If large number of past traffic matrices are accessible, we propose a Generative Adversarial Network (GAN) based approach for solving the problem. We compare the strengths of the two approaches and evaluate their performance for several networks using varying amounts of past data.