Abstract

International audience We introduce a continuous time stochastic broadcast calculus for mobile and wireless networks. The mobility between nodes in a network is modeled by a stochastic mobility function which allows to change part of a network topology depending on an exponentially distributed delay and a network topology constraint. We allow continuous time stochastic behavior of processes running at network nodes, e.g. in order to be able to model randomized protocols. The introduction of group broadcast and an operator to help avoid flooding allows us to define a novel notion of broadcast abstraction. Finally, we define a weak bisimulation congruence and apply our theory on a leader election protocol. Document type: Part of book or chapter of book

Abstract

In order to accommodate fluctuations in network conditions, adaptive applications need to obtain information about resource availability. Using active networks, new models for adaptive applications can be envisaged, which can benefit from the possibility to send mobile code to the network nodes. We describe a model for trading resources inside an active network node, based on the interaction between capsules as reactive user agents, and resource manager agents which reside in the network nodes. We apply the model to the case of a many-to-one audio application with congestion control, which trades off link resources against memory when there is congestion at the outgoing interface towards the destination. Our simulation results indicate that the application makes effective use of the available reources, and it also allows resources to bc shared according to uscr preferences. Document type: Part of book or chapter of book