Sujet de thèse financée (IRISA/Rennes)

Bonjour,
>
> Nous disposons d'une bourse de thèse pour le sujet suivant :
>
> PhD proposal (with grant):
>
> Deterministic performances bounds in communication and embedded networks
> with cyclic dependence using Network calculus.
>
> Keywords: performance evaluation, graphs, (min,plus) algebra, algorithms.
>
> Recent developments in communication and network theory lead to develop
> theories to compute deterministic upper performance bounds of systems,
> such as transmission delays or buffer occupancies. Those computations can
> be useful for applications such as Video on Demand, but for applications
> such as embedded systems where probabilistic bounds are not enough, they
> are crucial. Network Calculus is a very promising theory for efficiently
> computing upper bounds. A network is modeled by a graph, whose nodes are
> the network element. A mathematical function (service curve) models each
> network element and flows crossing the network as well (arrival curves).
> Applying some (min,plus) operators (that is, replacing the classical
> addition by min and the classical multiplication by +) to these functions
> enables to compute bounds.
>
> Direct application of these operators will give very pessimistic bounds.
> Some solutions have been developed to find tighter bounds in acyclic
> networks, but the problem of cyclic networks has not been extensively
> considered yet. Most of the studies deal with the question of stability.
> The aim of this thesis will be to find methods to compute deterministic
> upper bounds, possibly tight, for performance guaranties in cyclic
> networks.
>
> Candidates for this topic should be familiar with basic mathematics and
> with algorithmic.
>
> PhD advisers: Anne Bouillard (anne.bouillard@bretagne.ens-cachan.fr)
> and Claude Jard (Claude.Jard@bretagne.ens-cachan.fr)
>
> Team : DistribCom (INRIA/IRISA), Rennes
>
> --
> Anne Bouillard,
> maître de conférences ENS Cachan (Bretagne), IRISA
>