The rapid development of mobile network brings opportunities for researchers to analyze user behaviors based on largescale network traffic data. It is important for Internet Service Providers(ISP) to optimize resource...The rapid development of mobile network brings opportunities for researchers to analyze user behaviors based on largescale network traffic data. It is important for Internet Service Providers(ISP) to optimize resource allocation and provide customized services to users. The first step of analyzing user behaviors is to extract information of user actions from HTTP traffic data by multi-pattern URL matching. However, the efficiency is a huge problem when performing this work on massive network traffic data. To solve this problem, we propose a novel and accurate algorithm named Multi-Pattern Parallel Matching(MPPM) that takes advantage of HashMap in data searching for extracting user behaviors from big network data more effectively. Extensive experiments based on real-world traffic data prove the ability of MPPM algorithm to deal with massive HTTP traffic with better performance on accuracy, concurrency and efficiency. We expect the proposed algorithm and it parallelized implementation would be a solid base to build a high-performance analysis engine of user behavior based on massive HTTP traffic data processing.展开更多
This paper deals with the follower jamming(FJ)resistance for the frequency hopping(FH)communication system over additive white Gaussian noise(AWGN)channel.Conventional FH systems are susceptible to be jammed by FJ,and...This paper deals with the follower jamming(FJ)resistance for the frequency hopping(FH)communication system over additive white Gaussian noise(AWGN)channel.Conventional FH systems are susceptible to be jammed by FJ,and multi-pattern frequency hopping(MPFH)has good resistance to FJ.To further improve the FJ rejection capability of MPFH,we propose a wide gap multi-pattern frequency hopping(WGMPFH)scheme.WGMPFH uses channels to represent messages,and the data channel and complementary channel are hopping on orthogonal frequency slots according to wide gap FH patterns.The transmitted signal lures FJ to aim at the data channel and the complementary channel is away from FJ by adopting wide gap frequency patterns.FJ does not affect the complementary channel but increases the signal energy in the data channel,thus the effect of FJ is reduced.Its bit error rate(BER)is derived under FJ and the effects of three FJ parameters(tracking success probability,jamming duration ratio and jamming bandwidth ratio)on the BER performance of WGMPFH are investigated versus the co nventional FH/BFSK and MPFH system.Numerical and simulation results show that when under the worst-case FJ,the proposed WGMPFH outperforms the MPFH by about 1-3 dB and outperforms the conventional FH/BFSK by more than 4 dB.The proposed WGMPFH shows superior jamming rejection performance under FJ especially in severe signal-to-jamming ratio(SJR).展开更多
Multi-pattern matching with wildcards is a problem of finding the occurrence of all patterns in a pattern set {p^1,… ,p^k} in a given text t. If the percentage of wildcards in pattern set is not high, this problem ca...Multi-pattern matching with wildcards is a problem of finding the occurrence of all patterns in a pattern set {p^1,… ,p^k} in a given text t. If the percentage of wildcards in pattern set is not high, this problem can be solved using finite automata. We introduce a multi-pattern matching algorithm with a fixed number of wildcards to overcome the high percentage of the occurrence of wildcards in patterns. In our proposed method, patterns are matched as bit patterns using a sliding window approach. The window is a bit window that slides along the given text, matching against stored bit patterns. Matching process is executed using bit wise operations. The experimental results demonstrate that the percentage of wildcard occurrence does not affect the proposed algorithm＇s performance and the proposed algorithm is more efficient than the algorithms based on the fast Fourier transform. The proposed algorithm is simple to implement and runs efficiently in O（n ＋ d（n/σ ）（m/w）） time, where n is text length, d is symbol distribution over k patterns, m is pattern length, and σ is alphabet size.展开更多
基金supported in part by National Natural Science Foundation of China(61671078)the Director Funds of Beijing Key Laboratory of Network System Architecture and Convergence(2017BKL-NSACZJ-06)
文摘The rapid development of mobile network brings opportunities for researchers to analyze user behaviors based on largescale network traffic data. It is important for Internet Service Providers(ISP) to optimize resource allocation and provide customized services to users. The first step of analyzing user behaviors is to extract information of user actions from HTTP traffic data by multi-pattern URL matching. However, the efficiency is a huge problem when performing this work on massive network traffic data. To solve this problem, we propose a novel and accurate algorithm named Multi-Pattern Parallel Matching(MPPM) that takes advantage of HashMap in data searching for extracting user behaviors from big network data more effectively. Extensive experiments based on real-world traffic data prove the ability of MPPM algorithm to deal with massive HTTP traffic with better performance on accuracy, concurrency and efficiency. We expect the proposed algorithm and it parallelized implementation would be a solid base to build a high-performance analysis engine of user behavior based on massive HTTP traffic data processing.
基金The National Natural Science Foundation of China(No.61531009,No.61471108)The National Major Projects of China(No.2016ZX03001009)。
文摘This paper deals with the follower jamming(FJ)resistance for the frequency hopping(FH)communication system over additive white Gaussian noise(AWGN)channel.Conventional FH systems are susceptible to be jammed by FJ,and multi-pattern frequency hopping(MPFH)has good resistance to FJ.To further improve the FJ rejection capability of MPFH,we propose a wide gap multi-pattern frequency hopping(WGMPFH)scheme.WGMPFH uses channels to represent messages,and the data channel and complementary channel are hopping on orthogonal frequency slots according to wide gap FH patterns.The transmitted signal lures FJ to aim at the data channel and the complementary channel is away from FJ by adopting wide gap frequency patterns.FJ does not affect the complementary channel but increases the signal energy in the data channel,thus the effect of FJ is reduced.Its bit error rate(BER)is derived under FJ and the effects of three FJ parameters(tracking success probability,jamming duration ratio and jamming bandwidth ratio)on the BER performance of WGMPFH are investigated versus the co nventional FH/BFSK and MPFH system.Numerical and simulation results show that when under the worst-case FJ,the proposed WGMPFH outperforms the MPFH by about 1-3 dB and outperforms the conventional FH/BFSK by more than 4 dB.The proposed WGMPFH shows superior jamming rejection performance under FJ especially in severe signal-to-jamming ratio(SJR).
基金Supported by the European Framework Program(FP7)(FP7-PEOPLE-2011-IRSES)the National Sci-Tech Support Plan of China(2014BAH02F03)
文摘Multi-pattern matching with wildcards is a problem of finding the occurrence of all patterns in a pattern set {p^1,… ,p^k} in a given text t. If the percentage of wildcards in pattern set is not high, this problem can be solved using finite automata. We introduce a multi-pattern matching algorithm with a fixed number of wildcards to overcome the high percentage of the occurrence of wildcards in patterns. In our proposed method, patterns are matched as bit patterns using a sliding window approach. The window is a bit window that slides along the given text, matching against stored bit patterns. Matching process is executed using bit wise operations. The experimental results demonstrate that the percentage of wildcard occurrence does not affect the proposed algorithm＇s performance and the proposed algorithm is more efficient than the algorithms based on the fast Fourier transform. The proposed algorithm is simple to implement and runs efficiently in O（n ＋ d（n/σ ）（m/w）） time, where n is text length, d is symbol distribution over k patterns, m is pattern length, and σ is alphabet size.
