Tag Archives: Performance Evaluation

27/11/2019 – Talk by Carey Lee Williamson

Title: An Empirical Study of Campus-Level Instagram Traffic
Time: 13:00
Location: Meeting Room B, Building Zeta
Speaker: Carey Lee Williamson
Abstract: Instagram is a popular network application for photo sharing, video streaming, and online social media interaction. This talk presents results from an empirical study of Instagram network traffic, as viewed from a large campus edge network. Despite the challenges of NAT, DHCP, end-to-end encryption, and high traffic volume, we are able to identify key characteristics of Instagram traffic, which exceeds 1 TB per day. The main highlights from our study include classic observations such as diurnal usage patterns, Zipf-like distributions for IP frequency-rank profile, and heavy-tailed transfer size distributions. Several new observations include anomalous spikes in Instagram traffic, some network policies that inhibit Instagram usage, and some small differences in Instagram usage between campus-based users and the general public.

23/11/2018 – Talk by Leonardo Maccari

Title: Community Networks, a theme for networking research
Time: 13:00
Location: Meeting Room A, Building Zeta
Type: Research talk
Speaker:  Leonardo Maccari
In the last few years, thanks to a series of European research projects, the scientific interest in community networks (CNs) raised considerably.
A CN is a wireless mesh network built by a community of people that grows in an unplanned way when the community enlarges.
Due to the improved performance of wireless standards, today we have mesh networks made of hundreds of nodes, or even thousands of nodes, and many stakeholders consider them a key instrument to reduce digital divide (50% of the world population was still disconnected in 2017).
CNs are also a stimulating playground for networking research to be applied to other fields. As an example, in this talk I will describe one of the challenges we tackled, which is the scalability of routing protocols.
The solution we proposed exploits the concept of betweenness centrality to fine-tune routing protocols in an automated and back-compatible way.
While we designed, tested and implemented it in CNs, we also extended the concept to other kinds of networks. Specifically, we are now considering how to apply the same principle to Internet routing, in order improve the convergence of the BGP protocol. In the process, we formalized the first fully distributed exact algorithm for centrality computation on a generic graph, which is needed to compute centrality when the full network graph is unknown. We can now study centrality-based optimizations on BGP but also in other application domains, like sensor networks.
I will conclude with a future step of this research, which is a data-based approach to generate realistic network topologies using several communication technologies. The final goal is to characterize the high level features of the network graph (cost, population coverage, robustness etc.) in order to take informed decisions on the choice of the best technology for a specific context.

The talk is based on the following publications:

1) Leonardo Maccari, Renato Lo Cigno. “Pop-routing: Centrality-based tuning of control messages for faster route convergence”. Proceedings of the International Conference on Computer Communications (INFOCOM), April 2016.
2) Leonardo Maccari, Renato Lo Cigno, “Improving Routing Convergence with Centrality: Theory and Implementation of Pop-Routing”. IEEE Transactions on Networking, vol. 26, pp. 2216–2229, Oct. 2018
3) Leonardo Maccari, Lorenzo Ghiro, Alessio Guerrieri, Alberto Montresor, Renato Lo Cigno, “On the Distributed Computation of Load Centrality and Its Application to DV Routing”. Proceedings of the International Conference on Computer Communications (INFOCOM), April 2018.

15/11/2016 – Talk by Andrea Marin

Title: Fair workload distribution for multi-server systems with pulling strategies
Time: 13:00
Location: Meeting room, Building Zeta
Type: Research Result
Speaker: Andrea Marin
In this talk we present the paper that has received the best paper award at the conference Valuetools 2016.

We consider systems with a single queue and multiple parallel servers. Each server fetches a job from the queue immediately after completing its current work. We propose a pulling strategy that aims at achieving a fair distribution of the number of processed jobs among the servers. We show that if the service times are exponentially distributed then our strategy ensures that in the long run the expected difference among the processed jobs at each server is finite while maintaining a reasonable throughput.
We give the analytical expressions for the stationary distribution and the relevant stationary performance indices like the throughput and the system’s balance.
Interestingly, the proposed strategy can be used to control the join-queue length in fork-join queues and the analytical model gives the closed form expression of the performance indices in saturation.

08/11/2016 – Talk by Filippo Cavallin

Title: Multi-Step Discrete Time Process Algebra (MuPA)
Time: 13:00
Location: Meeting room, Building Zeta
Type: Research Result
Speaker: Filippo Cavallin
We consider Discrete Time Markov Chains with synchronous behaviour, i.e. models in which multiple events may occur at each recorded time in the model. This is based on a conceptual model in which the discrete times are sampling points when the system is observed and at each instant all events that have occurred since the previous observation point will be noted. We propose the first process algebra which is capable of capturing such systems and demonstrate its application to discrete time queues both in isolation and forming networks.

07/09/2016 – Talk by Mohsin Jafri

Title:  Simulating Depth-based routing in Underwater Networks
Time: 13:45
Location: Meeting room
Type: Research Result
Speaker: Mohsin Jafri
Abstract: In this talk, I will briefly discuss my ongoing research activities. I will present the implementation of a simulator for
studying Depth-Based Routing (DBR) in Underwater Wireless Sensor Networks (UWSNs). One of the major challenges for DBR is the configuration of a parameter called “holding time” which influences the network throughput, response time and energy consumption. I will show how it is possible to use the simulator to support the validation of a choice for a given value of the holding time, as well as other network parameters. The presentation will also discuss the important features that distinguish the implemented simulator with respect to the other ones available in the scientific literature and its validation against previous simulation models or measurements.

02/03/2016 – Talk by Filippo Cavallin

Title:  Cronization: a method to pass from Continuous Time to Discrete Time Automata
Time: 14:00
Location: Meeting room, building Zeta
Type: Research Result
Speaker: Filippo Cavallin
Discrete and Continuous Time automata are important formalisms to model and analyze systems such queuing and telecommunication networks. The stationary performance analysis of these automata requires the computation of the steady-state distribution of their underlying Markov chains. Sometimes for the analysis is more convenient to pass from continuous to discrete time. The main methods are focused on the underlying Markov chains and not on the automatas. To preserve the transitions with labels and the synchronization between them, we will introduce a method to pass from a continuous time stochastic automaton (SA) to a probabilistic Input/Output automaton (PIOA). This method is a bijection from continuous to discrete time and it allows us to switch between the two different types of automata and it preserves the parallel composition.

18/11/2015 – Talk by Gian-Luca dei Rossi

Title:  Evaluating the impact of eDoS attacks to cloud facilities
Time: 12:00
Location: Meeting Room, building Zeta
Type: Research Results
Speaker: Gian-Luca Dei Rossi
The complexity of modern cloud facilities requires attentive management policies that should encompass all aspects of the system. Security is a critical issue, as intrusions, misuse or denial of service attacks may damage both the users and the cloud provider including its reputation on the market.
Disruptive attacks happen fast, cause evident and short term damages and are usually the result of operations that are hard to disguise. On the other hand, Energy oriented Denial of Service (eDoS) attacks aim at producing continuous minor damages, eventually with long term consequences. These long lasting attacks are difficult to detect. In this tale we present a model of the behavior of a system under eDoS attack.
We study the impact in terms of cloud energy consumption of an attack strategy previously proposed in the literature and compare it with other strategies that we propose. Our findings show that the strategy previously proposed in the literature, based on keeping the cloud close to saturation, is not optimal (from the point of view of the attacker) in presence of non-constant workload and that there is a trade-off between the aggressiveness of the attacker and the duration of the attack in order to maximize the damage.

27/10/2015 – Talk by Jean-Michel Fourneau (Université de Versailles Saint Quintin)

Title: Discrete Time Stochastic Automata Network with Steady-State Product Form distribution
Time: 13:00
Location: Meeting Room, building Zeta
Type: Research result
Speaker: Jean-Michel Fourneau
Abstract: We present some sufficient conditions for a discrete time Stochastic Automata Networks (SAN) to have a steady-state distribution which has a multiplicative form. The proofs are based on algebraic properties of the tensor operations associated with SAN. Some examples are given.
Bio sketch: J.M. Fourneau is Professor of Computer Science at the University of Versailles St. Quentin, France. He was formerly with Ecole Nationale des Telecommunications, Paris and University of Paris XI Orsay as an Assistant Professor. He graduated in Statistics and Economics from Ecole Nationale de la Statistique et de l’Administation Economique, Paris and he obtained is Ph.D. and his habilitation in Computer Science at the University of Paris XI Orsay in 1987 and 1991 respectively. He is the Head of the Performance Evaluation team within PRiSM laboratory at Versailles University and his recent research interests are algorithmic performance evaluation, Stochastic Automata Networks, G-networks, stochastic bounds, and application to high speed networks, and all optical networks.

06/05/2015: Talk by Benny Van Houdt (University of Antwerp)

Title: Mean field models for SSD garbage collection
Time: 14:00
Location: Conference Room, building Alpha
Type: Research result
Speaker: Benny Van Houdt
Abstract: In this talk we discuss some mean field models for a broad class of garbage collection algorithms for flash-based solid state drives (SSDs) and as well as the insights they provide. We start with a basic introduction on mean field models and SSDs. Next we take a detailed look at the mean field model in the most basic setting (uniform random writes) and discuss its implications. Finally, if time permits, some of the new insights provided by more advanced models with hot and cold data or hot data identification will be presented.

11/03/2015 – Talk by Robbe Block

Title: Spatial Fairness in Multi-Channel CSMA Line Networks
Time: 14:00
Location: Meeting Room, building Zeta
Type: Research Result
Speaker: Robbe Block (University of Antwerp)
In this talk we will consider a line of wifi-hotspots placed in a single line. Starting from earlier results, we will show the steady state of this system has a product form solution and using this product form, a fast method to calculate the per-hotspot throughput will be given. Furthermore, for a single channel setting it was shown in previous work that a simple formula could be used to achieve fairness among the different nodes in the network. It will be shown that the same formula still achieves fairness in the multi-channel setting in either heavy or low traffic conditions, but no such simple formula exists in general. However, through numerical experiments, we see that the fairness index of the multi-channel system still remains very close to one, meaning the simple formula eliminates most of the unfairness in the network.