We discuss our work-in-progress on a number of Distributed Termination Detection Algorithms. These algorithms use message histories to construct administrative trees called message futures. These algorithms allow generalized network topologies and support dynamic changes to the network. The performance of these algorithms can be optimized with special information about the properties of the nodes and the network topology.