a study on scalable high-performance virus
N.RAJA RAJAN,L.DINESH
Published in International Journal of Advanced Research in Computer Science Engineering and Information Technology
ISSN: 2321-3337 Impact Factor:1.521 Volume:3 Issue:1 Year: 26 June,2014 Pages:331-336
Abstract
In proxy Generation Wireless Networks (NGWN), lots of information, such as voice and video data, will be used in All-IP networks. It is important to note that in such environments, seamless service for users and handoff between heterogeneous networks must be taken into account. Therefore, in this paper, we propose a SePH (Seamless Proxy based Handoff) using PMIPv6-based proxy model, which is able to improve the performance of handoff in NGWN. The SePH can efficiently support seamless and IP-based mobility, by reducing the search process. The performance results show that our proposed scheme outperforms in terms of Quality of Service (QoS), such as throughput, handoff latency, packet loss, and signaling overhead, comparing to the existing schemes. These performance measures are used in an optimization problem that is formulated to determine the optimal number and optimal location of proxy servers problem. Based on a comparison with a genetic algorithm, it can be concluded that algorithm produces near-optimal to optimal results in a very short time.
Kewords
Scalable,Wireless.
Reference
[1] Chieh-Jen Cheng, Chao-Ching Wang, Wei-Chun Ku, Tien-Fu Chen , and Jinn-Shyan Wang, “Scalable High-Performance Virus Detection Processor Against a Large Pattern Set for Embedded Network Security” Commun. vol. 51, pp. 62–70,2011. [2] O. Villa, D. P. Scarpazza, and F. Petrini, “Accelerating real-time string searching with multicore processors,” Computer, vol. 41, pp. 42–50,2008. [3] D. P. Scarpazza, O. Villa, and F. Petrini, “High-speed string searching against large dictionaries on the Cell/B.E. processor,” in Proc. IEEE Int. Symp. Parallel Distrib. Process., 2008, pp. 1–8. [4] D. P. Scarpazza, O. Villa, and F. Petrini, “Peak-performance DFA based string matching on the Cell processor,” in Proc. IEEE Int. Symp. Parallel Distrib. Process., 2007, pp. 1–8. [5] L. Tan and T. Sherwood, “A high throughput string matching architecture for intrusion detection and prevention,”in Proc. 32nd Annu. Int. Symp. Comput. Arch., 2005, pp. 112–122. [6] S. Dharmapurikar, P. Krishnamurthy, and T. S. Sproull, “Deep packet inspection using parallel bloom filters,” IEEE Micro, vol. 24, no. 1, pp.52–61, Jan. 2004. [7] R.-T. Liu, N.-F. Huang, C.-N. Kao, and C.-H. Chen, “A fast string matching algorithm for network processor-based intrusion detection system,” ACMTrans. Embed. Comput. Syst., vol. 3, pp. 614–633, 2004. [8] F. Yu, R. H. Katz, and T. V. Lakshman, “Gigabit rate packet pattern matching using TCAM,” in Proc. 12th IEEE Int. Conf. Netw. Protocols, 2004, pp. 174–178.intrusion detection system,” ACMTrans. Embed. Comput. Syst., vol. 3, pp. 614–633, 2004. [9] R. S. Boyer and J. S. Moore, “A fast string searching algorithm,”Commun. ACM, vol. 20, pp. 762–772, 1977. [10] V. Aho and M. J. Corasick, “Efficient string matching: An aid to bibliographic search,” Commun. ACM, vol. 18, pp. 333–340, 1975
