arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2008.00905cs.NIcs.AIeess.SP
收藏

基于学习的链路测量流量矩阵估计方法

Learning Based Methods for Traffic Matrix Estimation from Link Measurements

NYU Tandon School of Engineering(纽约大学坦登工程学院);Nokia Bell Labs(诺基亚贝尔实验室)

Shenghe Xu, Murali Kodialam, T. V. Lakshman, Shivendra Panwar

摘要:

网络流量需求矩阵是容量规划、异常检测和许多其他网络管理相关任务的关键输入。需求矩阵通常根据链路负载测量值计算。流量矩阵(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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑