Faculté des Sciences appliquées
Faculté des Sciences appliquées

Dynamic Network Flow Classification with Hardware offloading

Pieroux, Alexandre ULiège
Promotor(s) : Mathy, Laurent ULiège
Date of defense : 7-Sep-2017/8-Sep-2017 • Permalink :
Title : Dynamic Network Flow Classification with Hardware offloading
Author : Pieroux, Alexandre ULiège
Date of defense  : 7-Sep-2017/8-Sep-2017
Advisor(s) : Mathy, Laurent ULiège
Committee's member(s) : Barbette, Tom ULiège
Leduc, Guy ULiège
Donnet, Benoît ULiège
Language : English
Number of pages : 48
Keywords : [fr] Network classification offloading
Discipline(s) : Engineering, computing & technology > Computer science
Target public : Researchers
Professionals of domain
General public
Complementary URL :
Institution(s) : Université de Liège, Liège, Belgique
Degree: Master en sciences informatiques, à finalité spécialisée en "computer systems and networks"
Faculty: Master thesis of the Faculté des Sciences appliquées


[fr] Nowadays, network applications and connected devices are calling for a better management of the network infrastructures. With the growth of network load, efficient network classification is playing a key role for providing quality of service.

In this document we present a network classification scheme that allow to contextualize a packet in its flow. The designed classifier is composed of four components: a static classifier, a dynamic classifier, a tag system and queues. The static classifier is responsible for matching the packets to the provided classification rules. The tag mechanism is elaborated to give to the user a mean of retrieving information about the flow of the processed packet. The dynamic classifier associate the packets with their tags and a queue system is used to forward the results to the user.

The implementation is provided under the form of a C library that ease the use of it in network low level applications. The design of it allow a flexible modularity and portability. The results show that our solution give scalability when a large amount of rules is used and allow fast dynamic classification. The use of lock-free algorithms to handle multithreading and concurrency allow to perform the classification of several packets simultaneously with efficiency. The designed tag mechanism allow an easy consultation of the flow of a processed packet. The hardware capabilities offered by advanced network hardware is studied and matched with the need of the solution, enabling possibilities of offloading it for efficiency.

Network classification is a problem hard to solve efficiently, many solutions are available depending on the situation and the requirements. In today's network, portable and scalable solutions are important and need a particular attention. The implementation of our solution give the opportunity for efficient dynamic network classification that ease the processing of packets in their contexts.



Access TFE___Dynamic_Network_Flow_Classification_with_Hardware_offloading.pdf
Description: -
Size: 1.34 MB
Format: Adobe PDF


Access DNFC.tar.gz
Description: Code
Size: 73.37 kB
Format: Unknown


  • Pieroux, Alexandre ULiège Université de Liège > Master sc. informatiques, à fin.


Committee's member(s)

  • Barbette, Tom ULiège Université de Liège - ULg > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Systèmes informatiques répartis et sécurité
    ORBi View his publications on ORBi
  • Leduc, Guy ULiège Université de Liège - ULg > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Réseaux informatiques
    ORBi View his publications on ORBi
  • Donnet, Benoît ULiège Université de Liège - ULg > Dép. d'électric., électron. et informat. (Inst.Montefiore) > Algorithmique des grands systèmes
    ORBi View his publications on ORBi
  • Total number of views 42
  • Total number of downloads 6

All documents available on MatheO are protected by copyright and subject to the usual rules for fair use.
The University of Liège does not guarantee the scientific quality of these students' works or the accuracy of all the information they contain.