There is increasing concern among developers that future Web servers running commercial
workloads may be limited by network processing overhead in the CPU as 10Gb Ethernet …

We describe a distributed algorithm for computing spanning trees in dynamic networks by
using mobile agents. Each agent uses a random walk to move in the network and to …

This paper deals with the delimitation of the power of local computations on graphs having
some initial knowledge, eg the size or the topology of the network. We refine a proof …

Distributed systems have been studied thoroughly. Many applications are based on huge
systems and one of the main property an algorithm running on such systems should verified …

This thesis applies game-theoretic mechanism design to the management of energy
consumption in mobile ad hoc networks. In this setting, routes must be selected based on …

La première partie de cette thèse est consacrée à l'étude du degré de parallélisme des
monoïdes de commutation modélisant les exécutions distribuées des algorithmes. Après …

In this paper, we investigate the following problem: k mobile agents are placed in a network.
The agents initially move in the network using random walks. They have unique identities …

This thesis deals with the use of mobile agents in distributed algorithms by performing
random walks in the network. k mobile agents having unique identities are placed initially in …

Ê× ÙÑ ÆÓÙ× ÔÖÓÔÓ× ÓÒ× ÙÒ Ø Ò ÕÙ ÔÐ ÔÓÙÖ Ú Ö Ö Ð×× Ý× Ø Ñ× ÓÒ¹ ÙÖÖ ÒØ× Ò
Ò× Ò× ØÖÙ ØÙÖ× º ÖØ Ò× ÔÖÓÔÖ Ø× ³ ÒØ Ö Ø ÓÑÑ Ð ÓÖÒ ØÙ Ð ÓÙÚ ÖØÙÖ Ø Ð Ø ÖÑ …