Network Intrusion Using Heap Sort On Weak Interactions of System Partitioning with Binary LP
Loading...
Date
Journal Title
Journal ISSN
Volume Title
Publisher
Department of Computer Science, Nasarawa State University Keffi
DOI
Abstract
Abstract—The development and design of a reliable network and its services depend on the understanding of the character- istics of the traffic on its network. Different models have been developed from the network traffic throughout history. These are used for evaluating the existing and main proposed networks and the services that come with them. The demands on network traffic on computer networks are not predictable because performance modelling is needed for deciding the quality of the services at all levels. The performance models require accurate traffic on the network and a lot of traffic models have been designed based on the kind of traffic on the network. With little effect. This paper proposed a weak interaction based on system partition with the binary linear problem (LP) on Heap sort. The heap sort algorithm was used to filter the data packets for a normalized sequence of the data packets to easily identify anomalous effect during process search. The invariant state-space process on LP is used to detect and predict anomalous activities from the large packets of network traffic collected. The result shows that the state space model in the form of n4sid is very effective in predicting anomalous effects more easily than on physical phenomenal systems and can serve as a future perspective for a control dynamic for network traffic prediction that could be useful in deep learning for more additional plugins to artificial intelligence (AI) algorithms.
Description
Citation
Umar, M.A. Et. al. (2023). Network Intrusion Using Heap Sort On Weak Interactions of System Partitioning with Binary LP
