Time management in active networks

Abstract

Investigates time management for distributed simulations in active networks. Time management is essentially the computation of the lower-bound time stamp (LBTS) across federates in a distributed simulation, including in-transit (in-flight) messages. We show that LBTS computation is an instance of the distributed termination detection (DTD) problem and how DTD algorithms can be applied to the LBTS in an active network. These algorithms are potentially much more efficient than traditional algorithms that rely on point-to-point communication. We demonstrate the potential of the distinguished root node algorithm, which can compute the LBTS in O(log n) time in general network topologies using a prototype implemented in Java. While active network algorithms have the potential for improved functionality and superior performance, this potential will only be realized when native implementations are possible. For wide-scale deployment, real-world issues, such as reliable delivery, dynamic routing topologies, security and fault tolerance, have to be systematically addressed.