Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Thuy T. T. Nguyen

dblp:92/2493 · DBLP profile ↗
← Back
7ranked-venue papers
4as first author
0since 2021 · last 2019
0000-0002-1764-3948ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 6 · 4 first-authorDatabases, data management, data science and information retrieval · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Network measurement and analytics · 87% Network management and operations · 13%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Network measurement and analytics › traffic classification
machine-learning-based classification
0.112012
Timely and continuous machine-learning-based classification for interactive IP traffic · IEEE/ACM Trans. Netw. 2012
Network measurement and analytics
traffic classification
0.112012
Timely and continuous machine-learning-based classification for interactive IP traffic · IEEE/ACM Trans. Netw. 2012
Network management and operations
quality of service management
0.012012
Timely and continuous machine-learning-based classification for interactive IP traffic · IEEE/ACM Trans. Netw. 2012

Methods — techniques the papers use, named apart from their topics

sub-flow selection · 0.1naive bayes · 0.1c4.5 decision tree · 0.1
YearPublicationVenuePosition
2019 An efficient method for mining high utility closed itemsets
Loan T. T. Nguyen, Vinh V. Vu, Mi T. H. Lam, Thuy T. M. Duong, Ly T. Manh, Thuy T. T. Nguyen, Bay Vo, Hamido Fujita
Inf. Sci.6
2012 Sub-flow packet sampling for scalable ML classification of interactive traffic
abstract
Machine Learning (ML) classifiers have been shown to provide accurate, timely and continuous IP flow classification when evaluating sub-flows (short moving windows of packets within flows). They can be used to provide automated QoS management for interactive traffic, such as fast-paced multiplayer games or VoIP. As with other ML classification approaches, previous sub-flow techniques have assumed all packets in all flows are being observed and evaluated. This limits scalability and poses a problem for practical deployment in network core or edge routers. In this paper we propose and evaluate subflow packet sampling (SPS) to reduce an ML sub-flow classifier's resource requirements with minimal compromise of accuracy. While random packet sampling increases classification time from <;1 second to over 30 seconds and can reduce accuracy from 98% to <;90%, our tailored SPS technique retains classification times of <;1 second while providing 98% accuracy.
Sebastian Zander, Thuy T. T. Nguyen, Grenville J. Armitage
LCN2
2012 Timely and continuous machine-learning-based classification for interactive IP traffic
abstract
Machine Learning (ML) for classifying IP traffic has relied on the analysis of statistics of full flows or their first few packets only. However, automated QoS management for interactive traffic flows requires quick and timely classification well before the flows finish. Also, interactive flows are often long-lived and should be continuously monitored during their lifetime. We propose to achieve this by using statistics derived from sub-flows—a small number of most recent packets taken at any point in a flow's lifetime. Then, the ML classifier must be trained on a set of sub-flows, and we investigate different sub-flow selection strategies. We also propose to augment training datasets so that classification accuracy is maintained even when a classifier mixes up client-to-server and server-to-client directions for applications exhibiting asymmetric traffic characteristics. We demonstrate the effectiveness of our approach with the Naive Bayes and C4.5 Decision Tree ML algorithms, for the identification of first-person-shooter online game and VoIP traffic. Our results show that we can classify both applications with up to 99% Precision and 95% Recall within less than 1 s. Stable results are achieved regardless of where within a flow the classifier captures the packets and the traffic direction.
Thuy T. T. Nguyen, Grenville J. Armitage, Philip Branch, Sebastian Zander
IEEE/ACM Trans. Netw.1
2008 Clustering to Assist Supervised Machine Learning for Real-Time IP Traffic Classification
abstract
Literature on the use of machine learning (ML) algorithms for classifying IP traffic has demonstrated potential to be deployed in real-world IP networks. The key challenges of timely and continuous classification are addressed, in which multiple short sub-flows taken at different points within the original application's flow lifetime are used to train the classifier. The classification decision process is repeated continuously using a sliding window of the flow's most recent N packets. The work left a critical question of how to automate the identification of appropriate sub-flows for training. In this paper we propose a novel approach for sub-flows identification and selection using ML clustering algorithms. We evaluate our approach using accuracy, model build time, classification speed and physical resource consumption metrics.
Thuy T. T. Nguyen, Grenville J. Armitage
ICC1
2006 Training on multiple sub-flows to optimise the use of Machine Learning classifiers in real-world IP networks
abstract
Literature on the use of machine learning (ML) algorithms for classifying IP traffic has relied on full-flows or the first few packets of flows. In contrast, many real-world scenarios require a classification decision well before a flow has finished even if the flow's beginning is lost. This implies classification must be achieved using statistics derived from the most recent N packets taken at any arbitrary point in a flow's lifetime. We propose training the classifier on a combination of short sub-flows (extracted from full-flow examples of the target application's traffic). We demonstrate this optimisation using the naive Bayes ML algorithm, and show that our approach results in excellent performance even when classification is initiated mid-way through a flow with windows as small as 25 packets long. We suggest future use of unsupervised ML algorithms to identify optimal sub-flows for training
Thuy T. T. Nguyen, Grenville J. Armitage
LCN1
2005 Automated Traffic Classification and Application Identification using Machine Learning
abstract
The dynamic classification and identification of network applications responsible for network traffic flows offers substantial benefits to a number of key areas in IP network engineering, management and surveillance. Currently such classifications rely on selected packet header fields (e.g. port numbers) or application layer protocol decoding. These methods have a number of shortfalls e.g. many applications can use unpredictable port numbers and protocol decoding requires a high amount of computing resources or is simply infeasible in case protocols are unknown or encrypted. We propose a novel method for traffic classification and application identification using an unsupervised machine learning technique. Flows are automatically classified based on statistical flow characteristics. We evaluate the efficiency of our approach using data from several traffic traces collected at different locations of the Internet. We use feature selection to find an optimal feature set and determine the influence of different features
Sebastian Zander, Thuy T. T. Nguyen, Grenville J. Armitage
LCN2
2004 Experimentally derived interactions between TCP traffic and service quality over DOCSIS cable links
abstract
We study the effect of upstream (US) and downstream (DS) rate caps and DOCSIS media access on the end-to-end performance of broadband IP services that share a typical home-access 'cable Internet' link. Our experimental study measures the performance of actual DOCSIS equipment in a typical network configuration. We observe that modestly long lived data transfers in the DS direction can create substantial latency spikes (over 100 ms) in the shared DOCSIS segment, even when the DS rate cap is one or two megabits per second. Such spikes can have a big impact on delay-sensitive applications, such as voice over IP (VoIP), online games and interactive streaming video that may be sharing the DOCSIS link. We also experimentally characterize the impact of US and DS bandwidth asymmetry, MTU sizes, and TCP window sizes in achieving maximum performance over DOCSIS links.
Thuy T. T. Nguyen, Grenville J. Armitage
GLOBECOM1