Active Queue Management (AQM) techniques are crucial for managing packet transmission efficiently, maintaining network performance, and preventing congestion in routers. However, achieving these objectives demands precise traffic modeling and simulations in extreme and unstable conditions. The internet traffic has distinct characteristics, such as aggregation, burstiness, and correlation. This paper presents an innovative approach for modeling internet traffic, addressing the limitations of conventional modeling and conventional AQM methods' development, which are primarily designed to stabilize the network traffic. The proposed model leverages the power of multiple Markov Modulated Bernoulli Processes (MMBPs) to tackle the challenges of traffic modeling and AQM development. Multiple states with varying probabilities are used to model packet arrivals, thus capturing the burstiness inherent in internet traffic. Yet, the overall probability is maintained identical, irrespective of the number of states (one, two, or four), by solving linear equations with multiple variables. Random Early Detection (RED) was used as a case study method with different packet arrival probabilities based on MMBPs with one, two, and four states. The results showed that the proposed model influences the outcomes of AQM methods. Furthermore, it was found that RED might not effectively address network burstiness due to its relatively slow reaction time. As a result, it can be concluded that RED performs optimally only with a single-state model.

The security and integrity of computer systems and networks highly depend on malware detection. In the realm of malware detection, the K-Nearest Neighbors (KNN) algorithm is a well-liked and successful machine learning algorithm. However, the choice of an acceptable distance metric parameter has a significant impact on the KNN algorithm's performance. This study tries to improve malware detection by adjusting the KNN algorithm's distance metric parameter. The distance metric greatly influences the similarity or dissimilarity between instances in the feature space. The KNN algorithm for malware detection can be more accurate and effective by carefully choosing or modifying the distance metric. This paper analyzes multiple distance metrics, including Minkowski distance, Manhattan distance, and Euclidean distance. These metrics account for the traits of malware samples while capturing various aspects of similarity. The effectiveness of the KNN algorithm is evaluated using the MalMem-2022 malware dataset, and the results are broken down into these three-distance metrics. The experimental findings show that, among the three distance metric parameters, the Euclidean and Minkowski distance metric parameters considerably produced the best outcomes with binary classification. While with multiclass classification, the KNN algorithm has achieved the highest outcomes using Manhattan distance.

Phishing websites are characterized by distinguished visual, address, domain, and embedded features, which identify and defend such threats. Yet, phishing website detection is challenged by overlapping these features with legitimate websites’ features. As the inter-class variance between legitimate and phishing websites becomes low, commonly utilized machine learning algorithms suffer from low performance in overlapping feature cases. Alternatively, ensemble learning that combines multiple predictions intending to address low inter-class variations in the classified data improves the performance in such cases. Ensemble learning utilizes multiple classifiers of similar or different types with multiple deviations of the training data. This paper develops a framework based on random forest ensemble techniques. The limitations of the random forest are the inability to capture the high correlation between features and their join dependency on the label. The random forest is combined with k-means clustering to capture the feature correlation. The framework is evaluated for phishing detection with a dataset of 5000 samples. The results showed the proposed framework over-performed the random forest classifier, all other ensemble classifiers, and the conventional classification algorithms. The proposed framework achieved an accuracy of 98.64%, precision of 0.986, recall of 0.987, and F-measure of 0.986.