Contact multigraph routing: Overview and implementation

M Moy, R Kassouf-Short, N Kortas… - 2023 IEEE …, 2023 - ieeexplore.ieee.org
In Delay Tolerant Networking (DTN), the standard routing algorithm used to navigate time-
varying networks has been Contact Graph Routing (CGR). In CGR, a globally distributed list …

Multigraph-based routing in delay tolerant networks: An alternative to contact graph routing

A Hylton, M Moy, R Kassouf-Short… - … and Networks (ICCCN …, 2023 - ieeexplore.ieee.org
Satellites are leaving the realms of niche use, extending our day-to-day networked
infrastructure to space-thereby forcing a generalization of network architectures. The Delay …

Multi-domain routing in Delay Tolerant Networks

A Hylton, B Mallery, J Hwang… - 2024 IEEE …, 2024 - ieeexplore.ieee.org
The goal of Delay Tolerant Networking (DTN) is to provide the missing ingredient for the
ever-growing collection of communicating nodes in our solar system to become a Solar …

Cooperative clustering techniques for space network scalability

Y Kirkpatrick, R Dudukovich… - 2023 IEEE Cognitive …, 2023 - ieeexplore.ieee.org
Routing in the space internet must face many unique challenges-from unplanned
disconnections and interruptions to predictable intermittent connectivity due to high network …

Algebraic and geometric models for space networking

W Bernardoni, R Cardona, J Cleveland, J Curry… - arxiv preprint arxiv …, 2023 - arxiv.org
In this paper we introduce some new algebraic and geometric perspectives on networked
space communications. Our main contribution is a novel definition of a time-varying graph …

Advances in modeling solar system internet structures and their data flows

A Hylton, N Tsuei, M Ronnenberg… - 2023 IEEE …, 2023 - ieeexplore.ieee.org
With an ever-increasing presence in space, there is also an increasing burden on existing
communications infrastructure. We are heading towards an inflection point where the …

Faster feasibility for dynamic flows and transshipments on temporal networks

K Sheridan, S Chawla - arxiv preprint arxiv:2411.04906, 2024 - arxiv.org
In this paper we study flow problems on temporal networks, where edge capacities and
travel times change over time. We consider a network with $ n $ nodes and $ m $ edges …

A novel method for vertex clustering in dynamic networks

DV Dabke, O Dorabiala - … Conference on Complex Networks and Their …, 2023 - Springer
In this paper, we introduce spatiotemporal graph k-means (STG k M), a novel, unsupervised
method to cluster vertices within a dynamic network. Drawing inspiration from traditional k …

Vertex clustering in diverse dynamic networks

DV Dabke, O Dorabiala - PLOS Complex Systems, 2024 - journals.plos.org
We present theoretical and experimental results for spatiotemporal graph k-means (STG k
M)—a new unsupervised method to cluster vertices within a dynamic network. STG k M finds …

Delay Tolerant Networks for Industry 4.0

J Garcia, MA Demir, G Ciocarlie… - 2023 18th Annual …, 2023 - ieeexplore.ieee.org
Advances in Industry 4.0 are being increasingly incorporated into general manufacturing as
stakeholders are persuaded of the benefits. One of the key technologies viewed beneficial to …