The maximum flow problem based on a contact graph in Delay-Tolerant Networking (DTN)
is very important for routing and data planning. Common deterministic algorithms employing …

Abstract Delay-tolerant networks (DTNs)(eg, Internet, satellite networks, sensor networks, ad
hoc networks) have attracted considerable attentions in both academia and industry. As a …

In delay tolerant networks (DTNs), the lack of continuous connectivity, network partitioning,
and long delays make design of network protocols very challenging. Previous DTN research …

As a space network technology, DTN (Delay/Disruption Tolerant Networks) has a wide
range of applications in space system networking, and the application of DTN in LEO (Low …

Delay Tolerant Networks (DTN) are networks of self-organizing wireless nodes, where end-
to-end connectivity is intermittent. In these networks, forwarding decisions are made using …

To address the congestion control problem in space DTN (delay/disruption tolerant
networks), an EOCC (early offloading-based congestion control) strategy was proposed. As …

In this paper, we study the cost efficient topology design (CETD) problem in a predictable
delay tolerant networks (DTN) where the time-evolving network topology is known a priori or …

Deep space networks, satellite networks, ad hoc networks, and the Internet can be modeled
as DTNs (Delay Tolerant Networks). As a fundamental problem, the maximum flow problem …

In this paper, we present a routing algorithm for a class of dynamic networks called the delay
tolerant networks (DTNs). The proposed algorithm takes into account the quintessential DTN …

We formulate the delay-tolerant networking routing problem, where messages are to be
moved end-to-end across a connectivity graph that is time-varying but whose dynamics may …