High speed self-study packet classification method for traffic measurement on IP backbone

2008 ◽  
Author(s):  
Hongtao Guan ◽  
Jianping Wu ◽  
Youjian Zhao ◽  
Zhenhua Liu ◽  
Xiaoping Zhang
Keyword(s):  
High Speed ◽  
Packet Classification ◽  
Classification Method ◽  
Traffic Measurement ◽  
Self Study

Efficient Memristor-Based Architecture for Intrusion Detection and High-Speed Packet Classification

2018 ◽  
Vol 14 (4) ◽  
pp. 1-27 ◽  
Author(s):  
Venkataramesh Bontupalli ◽  
Chris Yakopcic ◽  
Raqibul Hasan ◽  
Tarek M. Taha
Keyword(s):  
Intrusion Detection ◽  
High Speed ◽  
Packet Classification

scholarly journals Wildcard Fields-Based Partitioning for Fast and Scalable Packet Classification in Vehicle-to-Everything

Sensors ◽  
2019 ◽  
Vol 19 (11) ◽  
pp. 2563 ◽  
Author(s):  
Jaehyung Wee ◽  
Jin-Ghoo Choi ◽  
Wooguil Pak
Keyword(s):  
Decision Tree ◽  
Communication Networks ◽  
High Speed ◽  
Classification Performance ◽  
Packet Classification ◽  
Classification Algorithms ◽  
Packet Processing ◽  
Security Issues ◽  
Security Of Network ◽  
High Level

Vehicle-to-Everything (V2X) requires high-speed communication and high-level security. However, as the number of connected devices increases exponentially, communication networks are suffering from huge traffic and various security issues. It is well known that performance and security of network equipment significantly depends on the packet classification algorithm because it is one of the most fundamental packet processing functions. Thus, the algorithm should run fast even with the huge set of packet processing rules. Unfortunately, previous packet classification algorithms have focused on the processing speed only, failing to be scalable with the rule-set size. In this paper, we propose a new packet classification approach balancing classification speed and scalability. It can be applied to most decision tree-based packet classification algorithms such as HyperCuts and EffiCuts. It determines partitioning fields considering the rule duplication explicitly, which makes the algorithm memory-effective. In addition, the proposed approach reduces the decision tree size substantially with the minimal sacrifice of classification performance. As a result, we can attain high-speed packet classification and scalability simultaneously, which is very essential for latest services such as V2X and Internet-of-Things (IoT).

Living with Fish: Breaking Tunny in the Newmanry and the Testery

Colossus ◽  
2006 ◽  
Author(s):  
Peter Hilton
Keyword(s):  
High Speed ◽  
Higher Education System ◽  
Chief Of Staff ◽  
Alan Turing ◽  
European Languages ◽  
Self Study ◽  
Jewish Refugee ◽  
Foreign Office ◽  
German Jewish ◽  
British Foreign Office

I should begin by explaining how I happened to find myself, on 12 January 1942, at the age of 18, awaiting permission to enter the gates of Bletchley Park, to undertake work, on behalf of the British Foreign Office, of whose nature I had essentially no knowledge. In October 1941, four very distinguished members of the Bletchley Park team (Alan Turing, Hugh Alexander, Stuart Milner-Barry, and Gordon Welchman) had written a letter to Churchill, drawing his attention to the importance of the work being done at BP on deciphering Enigma, and, therefore, the urgency of recruiting appropriately trained people (principally mathematicians), and of making funds available for building more of the high-speed Bombes needed to expedite the decoding process. Churchill, to his great credit, did not react like a bureaucrat appalled that the writers of the letter had not gone through the proper channels; he immediately saw the importance and good sense of the letter and minuted it ‘Action this day’ to his chief of staff, General Ismay. The result was the empanelling of an interviewing team which toured the universities looking for mathematicians with a knowledge of modern European languages. Such people, however, were not easy to find, since the British higher education system of the time, based as it was on the principle of premature specialisation, virtually guaranteed that no such people would exist. (Ironically there were many German Jewish refugee mathematicians in Britain at that time, but they were ‘enemy aliens’ and so not to be trusted!) The team came to Oxford and I was, I believe, the only person presenting himself for interview. I was not a mathematician, merely a second-year undergraduate specialising in mathematics, and my knowledge of German was very rudimentary, acquired by self-study. But the interviewing team snapped me up, and offered me a position in the Foreign Office, to carry out certain entirely unspecified duties, provided I was willing to start in January 1942. I suspect the interviewing team did not themselves know the nature of the work I would be doing.

A Packet Classification Method via Cascaded Circular-Run-Based Trie

2019 ◽  
Vol E102.A (9) ◽  
pp. 1171-1178
Author(s):  
Takashi HARADA ◽  
Yuki ISHIKAWA ◽  
Ken TANAKA ◽  
Kenji MIKAWA
Keyword(s):  
Packet Classification ◽  
Classification Method
Sign in / Sign up

Export Citation Format

Share Document