Design of network intrusion detection system based on parallel DPC clustering algorithm
by Jing Wang; Dezhi Han
International Journal of Embedded Systems (IJES), Vol. 13, No. 3, 2020

Abstract: With the advent of the era of big data, network intrusion detection systems based on K-means algorithm cannot meet the detection efficiency and detection speed requirements in big data environment. The DPC algorithm can be applied to high-dimensional network traffic and large-scale data application environments, but there are problems of large calculated amount and limited serial processing capability. Aiming at the problems of DPC algorithm, the DPC algorithm is adjusted firstly to improve the clustering accuracy of the algorithm. Then, the DPC algorithm a parallelised on the Spark platform, so that the processing ability and running speed of the DPC algorithm is greatly improved by running in parallel in the memory of multiple virtual machines. The experimental results show that the network intrusion detection system based on parallel DPC clustering algorithm has higher detection rate and lower false rate. The parallelisation clustering efficiency is much higher than the single-computer clustering efficiency.

Online publication date: Wed, 30-Sep-2020

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Embedded Systems (IJES):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email