Towards line speed and accurateness on-line content popularity monitoring on Content Centric Networking(CCN) routers, we propose a three-stage scheme based on Bloom filters and hash tables for differentiated traffic. ...Towards line speed and accurateness on-line content popularity monitoring on Content Centric Networking(CCN) routers, we propose a three-stage scheme based on Bloom filters and hash tables for differentiated traffic. At the first stage, we decide whether to deliver the content to the next stage depending on traffic types. The second stage consisting of Standard Bloom filters(SBF) and Counting Bloom filters(CBF) identifies the popular content. Meanwhile, a scalable sliding time window based monitoring scheme for different traffic types is proposed to implement frequent and real-time updates by the change of popularities. Hash tables according with sliding window are used to record the popularity at the third stage. Simulation results reveal that this method reaches a 40 Gbps processing speed at lower error probability with less memory, and it is more sensitive to the change of popularity. Additionally, the architecture which can be implemented in CCN router is flexible and scalable.展开更多
The growing trend of network virtualization results in a widespread adoption of virtual switches in virtualized environments. However, virtual switching is confronted with great performance challenges regarding packet...The growing trend of network virtualization results in a widespread adoption of virtual switches in virtualized environments. However, virtual switching is confronted with great performance challenges regarding packet classification especially in Open Flow-based software defined networks. This paper first takes an insight into packet classification in virtual Open Flow switching, and points out that its performance bottleneck is dominated by flow table traversals of multiple failed mask probing for each arrived packet. Then we are motivated to propose an efficient packet classification algorithm based on counting bloom filters. In particular, counting bloom filters are applied to predict the failures of flow table lookups with great possibilities, and bypass flow table traversals for failed mask probing. Finally, our proposed packet classification algorithm is evaluated with real network traffic traces by experiments. The experimental results indicate that our proposed algorithm outperforms the classical one in Open v Switch in terms of average search length, and contributes to promote virtual Open Flow switching performance.展开更多
提出了一种基于双层Counter Bloom Filter的长流识别算法(algorithm based on double counter bloom filter for long flows identification,简称CCBF).该算法使用两层Counter Bloom Filter结构,将长流过滤和长流存在分开处理.分析了该...提出了一种基于双层Counter Bloom Filter的长流识别算法(algorithm based on double counter bloom filter for long flows identification,简称CCBF).该算法使用两层Counter Bloom Filter结构,将长流过滤和长流存在分开处理.分析了该算法的误判率,通过模拟数据分析了算法错误率和内存资源限制的关系,并在相同内存资源限制的条件下,将该算法与类似算法的准确性进行了比较.结果表明,在数据量较大的情况下,该算法具有比现有算法更小的平均错误率;对算法的时间效率分析表明,该算法可以达到1500kpps的处理速度.各项指标反映出,该算法可以应用于大规模主干网的长流监测.展开更多
基金supported by the Foundation for Innovative Research Groups of the National Natural Science Foundation of China (Grant No.61521003)the National Basic Research Program of China (2012CB315901, 2013CB329104)+1 种基金the National Natural Science Foundation of China (Grant No. 61372121, 61309019, 61309020)the National HighTech Research & Development Program of China (Grant No. 2015AA016102, 2013AA013505)
文摘Towards line speed and accurateness on-line content popularity monitoring on Content Centric Networking(CCN) routers, we propose a three-stage scheme based on Bloom filters and hash tables for differentiated traffic. At the first stage, we decide whether to deliver the content to the next stage depending on traffic types. The second stage consisting of Standard Bloom filters(SBF) and Counting Bloom filters(CBF) identifies the popular content. Meanwhile, a scalable sliding time window based monitoring scheme for different traffic types is proposed to implement frequent and real-time updates by the change of popularities. Hash tables according with sliding window are used to record the popularity at the third stage. Simulation results reveal that this method reaches a 40 Gbps processing speed at lower error probability with less memory, and it is more sensitive to the change of popularity. Additionally, the architecture which can be implemented in CCN router is flexible and scalable.
基金supported in part by National Natural Science Foundation of China(61272148,61572525,61502056,and 61602525)Hunan Provincial Natural Science Foundation of China(2015JJ3010)Scientific Research Fund of Hunan Provincial Education Department(15B009,14C0285)
文摘The growing trend of network virtualization results in a widespread adoption of virtual switches in virtualized environments. However, virtual switching is confronted with great performance challenges regarding packet classification especially in Open Flow-based software defined networks. This paper first takes an insight into packet classification in virtual Open Flow switching, and points out that its performance bottleneck is dominated by flow table traversals of multiple failed mask probing for each arrived packet. Then we are motivated to propose an efficient packet classification algorithm based on counting bloom filters. In particular, counting bloom filters are applied to predict the failures of flow table lookups with great possibilities, and bypass flow table traversals for failed mask probing. Finally, our proposed packet classification algorithm is evaluated with real network traffic traces by experiments. The experimental results indicate that our proposed algorithm outperforms the classical one in Open v Switch in terms of average search length, and contributes to promote virtual Open Flow switching performance.
文摘提出了一种基于双层Counter Bloom Filter的长流识别算法(algorithm based on double counter bloom filter for long flows identification,简称CCBF).该算法使用两层Counter Bloom Filter结构,将长流过滤和长流存在分开处理.分析了该算法的误判率,通过模拟数据分析了算法错误率和内存资源限制的关系,并在相同内存资源限制的条件下,将该算法与类似算法的准确性进行了比较.结果表明,在数据量较大的情况下,该算法具有比现有算法更小的平均错误率;对算法的时间效率分析表明,该算法可以达到1500kpps的处理速度.各项指标反映出,该算法可以应用于大规模主干网的长流监测.