This paper investigates time management for distributed simulations in ctive networks.Time man gement is essentially the computation of the Lower Bound Time Stamp (LBTS)cross feder tes in distributed simulation,including in-transit (inflight) messages.We show that the LBTS computation is an instance of the Distributed Termination Detection (DTD) problem and how DTD algorithms can be applied to 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 that can compute LBTS in O (logn )time in general network topologies using 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 will have to be systematically addressed.