A new virtual indexing method for measuring host connection degrees
A new virtual indexing method for measuring host connection degrees
复制标题
DOI：
10.1109/infcom.2011.5934948
复制
发表时间：
2011-04
期刊：
影响因子：
--
通讯作者：
P. Wang;X. Guan;W. Gong;D. Towsley
中科院分区：
文献类型：
--
作者：
P. Wang;X. Guan;W. Gong;D. Towsley
我们提出了一种新的虚拟索引方法，用于估计高速链路的主机连接度。它基于虚拟连接度草图，其中通过为每个主机生成关联的虚拟位图来构建网络流量的紧凑草图。每个虚拟位图由通过记录相应主机的流量的新方法从共享位阵列中随机选择的固定数量的位组成。共享位数组被所有主机有效地利用，因为它的每一位都被多个主机的虚拟位图共享。为了减少由于共享而在主机虚拟位图中污染的“噪声”，我们提出了一种新方法来生成用于估计主机连接度的“过滤”位图。此外，它可以在并行和分布式处理环境中轻松实现。基于实际网络流量的实验和测试结果表明，新方法准确、高效。
We present a new virtual indexing method for estimating host connection degrees for high speed links. It is based on the virtual connection degree sketch where a compact sketch of network traffic is built by generating the associated virtual bitmaps for each host. Each virtual bitmap consists of a fixed number of bits selected randomly from a shared bit array by a new method for recording the traffic flows of the corresponding host. The shared bit array is efficiently utilized by all hosts since its every bit is shared by the virtual bitmaps of multiple hosts. To reduce the “noise” contaminated in a host's virtual bitmaps due to sharing, we propose a new method to generate the “filtered” bitmap used to estimate host connection degree. Furthermore, it can be easily implemented in parallel and distributed processing environments. The experimental and testing results based on the actual network traffic show that the new method is accurate and efficient.