Pub Date : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360944
Sunho Lee, Dong Kyue Kim
Multiple pattern matching algorithms are essential engines of Network Intrusion Detection Systems (NIDSs) to inspect packets for occurrences of malicious patterns. For a set of patterns, the multiple pattern matching algorithms usually build a trie data structure. In this paper, we propose efficient implementations of the multiple pattern matching algorithms widely used in NIDSs by using a linearized compact trie. This linearized compact trie is an array representation of a compact trie and guarantees a size linear to the number of patterns with little loss of lookup time. Thus, our implementations achieve compact sizes with fast time, so it is useful to hardware embedding and cache exploiting.
{"title":"Efficient multiple pattern matching algorithms for Network Intrusion Detection Systems","authors":"Sunho Lee, Dong Kyue Kim","doi":"10.1109/ICNIDC.2009.5360944","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360944","url":null,"abstract":"Multiple pattern matching algorithms are essential engines of Network Intrusion Detection Systems (NIDSs) to inspect packets for occurrences of malicious patterns. For a set of patterns, the multiple pattern matching algorithms usually build a trie data structure. In this paper, we propose efficient implementations of the multiple pattern matching algorithms widely used in NIDSs by using a linearized compact trie. This linearized compact trie is an array representation of a compact trie and guarantees a size linear to the number of patterns with little loss of lookup time. Thus, our implementations achieve compact sizes with fast time, so it is useful to hardware embedding and cache exploiting.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130423499","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360815
Yue Wang, Jie Cui, Ping Li, Ling Xiao
This paper derives a β -order perceptually motivated minimum mean square error (MMSE) spectral estimator of the short-time spectral magnitude of speech, aimed to improve the performance in speech enhancement. The performance of the proposed estimators with different values of β has been evaluated by two kinds of objective measures. We have also compared the waveforms of perceptually motivated MMSE (PM) estimated speech and β -order PM estimated speech. The results showed the proposed estimator with different constant β value could focus on either noise reduction or preventing speech distortion. With an adaptive value of β, the proposed estimator have better performance in noise reduction than PM estimator.
{"title":"β -order perceptually motivated MMSE estimation for speech enhancement","authors":"Yue Wang, Jie Cui, Ping Li, Ling Xiao","doi":"10.1109/ICNIDC.2009.5360815","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360815","url":null,"abstract":"This paper derives a β -order perceptually motivated minimum mean square error (MMSE) spectral estimator of the short-time spectral magnitude of speech, aimed to improve the performance in speech enhancement. The performance of the proposed estimators with different values of β has been evaluated by two kinds of objective measures. We have also compared the waveforms of perceptually motivated MMSE (PM) estimated speech and β -order PM estimated speech. The results showed the proposed estimator with different constant β value could focus on either noise reduction or preventing speech distortion. With an adaptive value of β, the proposed estimator have better performance in noise reduction than PM estimator.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127620249","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360972
Yi-Zhu Gao, Yaojun Qiao, Yuefeng Ji
We propose a scheme in theory for any architecture of multistage 2-D MEMS to shrink the substrate for high cost performance. We take advantage of Gaussian beam to reduce the substrate size through the mirror radius, and give the theoretical derivation. By adopting the proposed architecture, we compare some multistage 2-D MEMS architecture in terms of the substrate size and the lens radius, and get some improved results.
{"title":"An approach of shrinking the substrate of multistage 2-D MEMS optical switch","authors":"Yi-Zhu Gao, Yaojun Qiao, Yuefeng Ji","doi":"10.1109/ICNIDC.2009.5360972","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360972","url":null,"abstract":"We propose a scheme in theory for any architecture of multistage 2-D MEMS to shrink the substrate for high cost performance. We take advantage of Gaussian beam to reduce the substrate size through the mirror radius, and give the theoretical derivation. By adopting the proposed architecture, we compare some multistage 2-D MEMS architecture in terms of the substrate size and the lens radius, and get some improved results.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127842588","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360992
Jing Tong, Huarui Wu, Changchuan Yin, Yan Ma, Jianfeng Li
IEEE 802.22 is the first worldwide wireless standard based on Cognitive Radio (CR) for Wireless Regional Area Networks (WRAN). Usually, Secondary Users (SUs) have to be interrupted periodically for spectrum sensing so as to avoid interference to Primary Users (PUs) operating in the licensed bands. Such interruptions of data transmission, however, impair the Quality of Service (QoS) of SUs. Dynamic Frequency Hopping (DFH) has been proposed for IEEE 802.22 system. In DFH, data transmission is performed in parallel with spectrum sensing without interruptions. In this paper, we compare this hopping mode with non-hopping one by computer simulation, the results show that although hopping mode requires a little more channels, it can reduce the collision with PUs and achieve higher ratio of valid delivery and higher throughput, thus provide enhanced QoS for SUs.
IEEE 802.22是第一个基于认知无线电(CR)的无线区域网络(WRAN)的全球无线标准。通常情况下，为了避免对在许可频段内工作的主用户(Primary user)造成干扰，需要周期性地中断从用户(Secondary user)的频谱感知。这样的数据传输中断会影响单节点的QoS (Quality of Service)。IEEE 802.22系统提出了动态跳频(DFH)技术。在DFH中，数据传输与频谱感知并行进行，不会中断。本文通过计算机仿真对该跳频模式与非跳频模式进行了比较，结果表明，虽然跳频模式需要多一些信道，但它可以减少与处理器的碰撞，实现更高的有效传送率和更高的吞吐量，从而为单元提供增强的QoS。
{"title":"Dynamic frequency hopping vs. non-hopping in IEEE 802.22 systems","authors":"Jing Tong, Huarui Wu, Changchuan Yin, Yan Ma, Jianfeng Li","doi":"10.1109/ICNIDC.2009.5360992","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360992","url":null,"abstract":"IEEE 802.22 is the first worldwide wireless standard based on Cognitive Radio (CR) for Wireless Regional Area Networks (WRAN). Usually, Secondary Users (SUs) have to be interrupted periodically for spectrum sensing so as to avoid interference to Primary Users (PUs) operating in the licensed bands. Such interruptions of data transmission, however, impair the Quality of Service (QoS) of SUs. Dynamic Frequency Hopping (DFH) has been proposed for IEEE 802.22 system. In DFH, data transmission is performed in parallel with spectrum sensing without interruptions. In this paper, we compare this hopping mode with non-hopping one by computer simulation, the results show that although hopping mode requires a little more channels, it can reduce the collision with PUs and achieve higher ratio of valid delivery and higher throughput, thus provide enhanced QoS for SUs.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126408603","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360929
Siguang Chen, Meng Wu
It is a challenge to thwart both the passive attacks and active attacks in mobile ad hoc networks for their unique characteristics. The improvement of security often sacrifices the delivery rate or other QoS. We propose secure multipath routing scheme based on modified secret sharing as an effective mechanism to protect data confidentiality and simultaneously enhance data delivery rate in mobile ad hoc networks. The scheme is based on multipath route finding algorithm, modified secret sharing scheme, cryptography and optimization technology. Simulation results show that our scheme provides a reasonably good level of security and delivery rate.
{"title":"Secure multipath routing based on secret sharing in mobile ad hoc networks","authors":"Siguang Chen, Meng Wu","doi":"10.1109/ICNIDC.2009.5360929","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360929","url":null,"abstract":"It is a challenge to thwart both the passive attacks and active attacks in mobile ad hoc networks for their unique characteristics. The improvement of security often sacrifices the delivery rate or other QoS. We propose secure multipath routing scheme based on modified secret sharing as an effective mechanism to protect data confidentiality and simultaneously enhance data delivery rate in mobile ad hoc networks. The scheme is based on multipath route finding algorithm, modified secret sharing scheme, cryptography and optimization technology. Simulation results show that our scheme provides a reasonably good level of security and delivery rate.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"351 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122985823","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360917
Jin Wang, Jongho Kim, Jechang Jeong
This paper introduces an adaptive postprocessing method in Block-based Discrete Cosine Transform (BDCT) coded images. We present a framework, which is a serial-concatenation of a 1-D simple deblocking filter and a 2-D directional filter. First, we classify the simple deblocking filter by an adaptive threshold depending on local statistical properties, and update block types appropriately by a simple rule, which affects the performance of deblocking progresses. Second, a 2-D directional filter is introduced to suppress the ringing artifacts caused at the sharp edges and the block discontinuities while preserving true edges and textural information. Finally, comprehensive experiments indicate that the proposed algorithm outperforms lots of deblocking methods in the literature, in terms of evaluation of PSNR and subjective visual qualities.
{"title":"An new deblocking algorithm for DCT coded images using adaptive spatial filters","authors":"Jin Wang, Jongho Kim, Jechang Jeong","doi":"10.1109/ICNIDC.2009.5360917","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360917","url":null,"abstract":"This paper introduces an adaptive postprocessing method in Block-based Discrete Cosine Transform (BDCT) coded images. We present a framework, which is a serial-concatenation of a 1-D simple deblocking filter and a 2-D directional filter. First, we classify the simple deblocking filter by an adaptive threshold depending on local statistical properties, and update block types appropriately by a simple rule, which affects the performance of deblocking progresses. Second, a 2-D directional filter is introduced to suppress the ringing artifacts caused at the sharp edges and the block discontinuities while preserving true edges and textural information. Finally, comprehensive experiments indicate that the proposed algorithm outperforms lots of deblocking methods in the literature, in terms of evaluation of PSNR and subjective visual qualities.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126560953","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360979
Jie Yang, Yang He, Ping Lin, Gang Cheng
The continuous growth in both commercial and public network traffic with various quality-of-service (QoS) requirements is calling for better service than the Internet's best effort mechanism. One of the challenging issues is to predict the overall behavior of aggregate network traffic. While network traffic characterization has been studied extensively due to its importance in network scheduling and throughput, an accurate characterization of network traffic still remains elusive. In this paper, in addition to characterizing the aggregate network traffic, we classify the traffic into different categories, e.g., P2P, VOIP, and provide insight to each of them in terms of their traffic pattern and impact to the overall traffic. Our study verifies that like many works reported in literature, majority Internet backbone traffic is contributed by a small portion of users. A major contribution of this paper is that we found a linear equation which could be used to approximate the impact of each user to the overall traffic. Many new applications appear recently and become more and more popular as Internet evolves. We show that in current Internet backbone of China, 9 applications, which can be classified into three categories, web browsing, P2P service, and gaming, contribute 95 percent of the total traffic. It is also demonstrated the P2P applications are the dominant traffic contributor among the three categories.
{"title":"Characterizing Internet backbone traffic from macro to micro","authors":"Jie Yang, Yang He, Ping Lin, Gang Cheng","doi":"10.1109/ICNIDC.2009.5360979","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360979","url":null,"abstract":"The continuous growth in both commercial and public network traffic with various quality-of-service (QoS) requirements is calling for better service than the Internet's best effort mechanism. One of the challenging issues is to predict the overall behavior of aggregate network traffic. While network traffic characterization has been studied extensively due to its importance in network scheduling and throughput, an accurate characterization of network traffic still remains elusive. In this paper, in addition to characterizing the aggregate network traffic, we classify the traffic into different categories, e.g., P2P, VOIP, and provide insight to each of them in terms of their traffic pattern and impact to the overall traffic. Our study verifies that like many works reported in literature, majority Internet backbone traffic is contributed by a small portion of users. A major contribution of this paper is that we found a linear equation which could be used to approximate the impact of each user to the overall traffic. Many new applications appear recently and become more and more popular as Internet evolves. We show that in current Internet backbone of China, 9 applications, which can be classified into three categories, web browsing, P2P service, and gaming, contribute 95 percent of the total traffic. It is also demonstrated the P2P applications are the dominant traffic contributor among the three categories.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125731718","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360882
Ho-seok Wey, A. Ito, Y. Suzuki
In audio communications over a lossy packet network, packet loss concealment techniques are needed to mitigate a user's frustration when perceiving the deterioration of the quality of the decoded signal. Multiple description coding (MDC) is a useful solution to this problem. In this paper, we describe an MDC method to conceal packet losses for wideband audio streaming based on the sample splitting method in the time domain and encoding by an MPEG-1 audio layer III (MP3) encoder. Experiments were conducted to compare the proposed method with several conventional methods, results confirming that our proposed method performs the playback of the decoded signal with sufficient quality for a range of bit rates from 160 to 320 kbps, even with a transmitted packet loss rate of 10%.
{"title":"Multiple description coding for wideband audio signal transmission","authors":"Ho-seok Wey, A. Ito, Y. Suzuki","doi":"10.1109/ICNIDC.2009.5360882","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360882","url":null,"abstract":"In audio communications over a lossy packet network, packet loss concealment techniques are needed to mitigate a user's frustration when perceiving the deterioration of the quality of the decoded signal. Multiple description coding (MDC) is a useful solution to this problem. In this paper, we describe an MDC method to conceal packet losses for wideband audio streaming based on the sample splitting method in the time domain and encoding by an MPEG-1 audio layer III (MP3) encoder. Experiments were conducted to compare the proposed method with several conventional methods, results confirming that our proposed method performs the playback of the decoded signal with sufficient quality for a range of bit rates from 160 to 320 kbps, even with a transmitted packet loss rate of 10%.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"35 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114125838","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360938
Wu Pan, Ning Li, Pandeng Liu
Six semiconductor gas sensors which are sensitive to Carbon monoxide (CO), Methane (CH4) and Hydrogen (H2) were chosen to compose the gas sensor array, and an on-line data acquisition system was constructed. Combining with the pattern recognition techniques of back propagation(BP) neuron network, the system was used to carry out the quantitative analysis of the partial gas concentration in a mixture. Pre-processing algorithms and the structures of the neural network was analyzed by experiments, and the results prove that the system can accomplish the quantitative analysis of the partial gas concentration of the mixture results using RRD pre-processing algorithm, then the training and testing of this three-layer BP neuron network with 9 neurons in hidden layer are performed.
{"title":"Application of electronic nose in gas mixture quantitative detection","authors":"Wu Pan, Ning Li, Pandeng Liu","doi":"10.1109/ICNIDC.2009.5360938","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360938","url":null,"abstract":"Six semiconductor gas sensors which are sensitive to Carbon monoxide (CO), Methane (CH4) and Hydrogen (H2) were chosen to compose the gas sensor array, and an on-line data acquisition system was constructed. Combining with the pattern recognition techniques of back propagation(BP) neuron network, the system was used to carry out the quantitative analysis of the partial gas concentration in a mixture. Pre-processing algorithms and the structures of the neural network was analyzed by experiments, and the results prove that the system can accomplish the quantitative analysis of the partial gas concentration of the mixture results using RRD pre-processing algorithm, then the training and testing of this three-layer BP neuron network with 9 neurons in hidden layer are performed.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121169771","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2009-12-31DOI: 10.1109/ICNIDC.2009.5360875
Yinan Dou, Peng Liu, Yiming Chen, Zhenming Lei
With the rapid development of Internet, network user behavior analysis is getting more and more attention. In this paper, an algorithm combining entropy concept and clustering method is proposed to analyze current broadband users' usage modes of network services, providing a strong support for further analysis or commercial applications. This algorithm can complete the process of division or clustering automatically, without requiring user to input any parameters associated with clustering. And it also can adapt to data set with different shape and size. Experiments have shown promising results when applying this algorithm to classify network users.
{"title":"Entropy based broadband user service behavior analysis","authors":"Yinan Dou, Peng Liu, Yiming Chen, Zhenming Lei","doi":"10.1109/ICNIDC.2009.5360875","DOIUrl":"https://doi.org/10.1109/ICNIDC.2009.5360875","url":null,"abstract":"With the rapid development of Internet, network user behavior analysis is getting more and more attention. In this paper, an algorithm combining entropy concept and clustering method is proposed to analyze current broadband users' usage modes of network services, providing a strong support for further analysis or commercial applications. This algorithm can complete the process of division or clustering automatically, without requiring user to input any parameters associated with clustering. And it also can adapt to data set with different shape and size. Experiments have shown promising results when applying this algorithm to classify network users.","PeriodicalId":127306,"journal":{"name":"2009 IEEE International Conference on Network Infrastructure and Digital Content","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125017466","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：