Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Réseaux d'ordinateurs --- Computer networks

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Today, the network traffic keeps growing again and again. Software middleboxes are crucial elements and can't become bottlenecks, at the risk of dropping network performances. They are either a firewall, a NAT, an intrusion detection system, a WAN optimizer, a load balancer, etc. That's why they must be efficient and choices made for their implementation are very important.

The objective of this work is to speed up Snort, which is an intrusion detection system, in a context of user level service chaining. Some improvements are studied and implemented in order to reach that goal. Thanks to those, Snort itself is also improved.

This paper describes the whole work, step by step. It begins with an introduction to define the context and to explain each protagonist. Then, next chapters are each dedicated to specific tests and measurements, in a view of comparing each result and improve performances. DPDK, a fast I/O framework developed by Intel, is introduced to speed up Snort. In a context of cooperation, FastClick and Snort exchange packets through DPDK rings and jobs repetitions are avoided thanks to a notion which is also introduced: metadata. Those metadata are used to pass information between multiple middleboxes. Other ideas are also studied. Finally, it ends with future possible improvements and a conclusion that discusses whether it is worthwhile to improve elements, in a view of a cooperation.

Snort --- DPDK --- FastClick --- NFV --- Ingénierie, informatique & technologie > Sciences informatiques

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

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.

Network classification offloading --- Ingénierie, informatique & technologie > Sciences informatiques

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Accessing the University of Liège without a car is not optimal. Parking spots are a scarce resource. Moving from one building to another with public transportation is unpractical. Distances are too large to travel by foot. Biking is not really an option, because few secured parking spots and charging stations for electric bikes are available.

The goal of this thesis is to ease accessing, leaving, and moving around the university, by leveraging the empty space in the fleet of cars of the University members.

Practically, this means we want to create an ergonomic system to offer empty seats and to ask for lifts,
to, from, and between ULg locations. This system should thus, from the end-user point of view, be available on smart-phones. Offers and demands should be centralised and re-dispatched in a smart way to propose simple and efficient combinations to end-users, and in real-time.

This work consists in the development of an Android application providing carpooling functionalities, enhancing the back-end system developed in the context of another project, authored by PhD student Thibaut Cuvelier, who implemented a first version of a website providing basic matching between drivers and passengers, based on a static graph including the most important towns around the University of Liège.

android, carpooling --- Ingénierie, informatique & technologie > Sciences informatiques