Jacob Cleveland

TL;DR: In this paper , the authors propose a multigraph based approach for routing in delay tolerant networks, where nodes represent network nodes instead of contacts, and a modified version of Yen's algorithm for multigraphs is included.

TL;DR: This paper proposes several novel approaches to a mathematical foundation for Delay Tolerant Networking Theory that fall outside the traditional scope of temporal network theory and finds that several of these methods target desired engineering outcomes such as discovery and automatic sub-netting.

TL;DR: This work constructs sheaves on a graph with distinguished source and sink vertices, in which paths are represented by sections, and discusses the relationship between the two sheaves and summarizes how other pathfinding algorithms can be interpreted in a similar way.

TL;DR: It is found that tropical geometry is well-suited to the challenges offered by this new setting, including contact schedules featuring probabilities, and leverages the combinatorial nature of the problem to give feasible shortest path trees in the presence of variable channel conditions and latency, evolving topologies, and uncertainty inherent in space routing.