Energy Saving Algorithms for Networking Systems

Energy saving is a key issue for networks and data centers. Brute force optimization is usually not possible as the optimal allocation of tasks to energy consumption levels usually is a NP hard problem. In this project we will use randomized algorithms to optimize energy consumption. Distributed versions of the algorithms will eventually be obtained.

Required Skills

Probability, Programming, Simulation, TCP/IP

Modelling Dissemination in Ad-Hoc Wireless Networks

The project will consist in analyzing information propagation in wireless, mobile networks. Malware as well as legitimate (non bogus) information will be considered. The problem is to analyze and simulate propagation schemes implemented by well behaving or malicious nodes.

More information about the context, including an implementation on smartphones is available under the Haggle project http://ica1www.epfl.ch/haggle/.

The analytical part could be based on general markov chain modeld, mean field interaction models, or ordinary different equations. The precise choice will depend on which aspect is considered. A starting point are the following papers:

1. T. Karagiannis, J.-Y. Le Boudec and M. Vojnovic Power law and exponential decay of inter contact times between mobile devices Mobicom 2007. pdf
2. M. Benaim and J.-Y. Le Boudec A Class Of Mean Field Interaction Models for Computer and Communication Systems Technical Report, 2008. pdf
3. J. Mundinger and J.-Y. Le Boudec Analysis of a reputation system for Mobile Ad-Hoc Networks with liars, accepted to Performance Evaluation, 2007. pdf

Required Skills

Programming, simulation, stochastic processes.