One Pass is Sufficient: A Solver for Minimizing Data Delivery Time over Time-varying Networks

P Wang, S Sourav, H Li, B Chen - IEEE INFOCOM 2023-IEEE …, 2023 - ieeexplore.ieee.org
How to allocate network paths and their resources to minimize the delivery time of data
transfer tasks over time-varying networks? Solving this MDDT (Minimizing Data Delivery …

A maximum flow algorithm based on storage time aggregated graph for delay-tolerant networks

H Li, T Zhang, Y Zhang, K Wang, J Li - Ad Hoc Networks, 2017 - Elsevier
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 …

Realization of maximum flow in DTN and application in CGR

C Li, H Li, T Wu, L Yan, S Cao - Ad Hoc Networks, 2024 - Elsevier
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 …

A dynamic combined flow algorithm for the two-commodity max-flow problem over delay-tolerant networks

T Zhang, H Li, J Li, S Zhang… - IEEE transactions on …, 2018 - ieeexplore.ieee.org
The multi-commodity flow problem plays an important role in network optimization, routing,
and service scheduling. With the network partitioning and the intermittent connectivity, the …

A maximum flow algorithm for buffer-limited delay tolerant networks

T Zhang, S Deng, H Li, R Hou, H Zhang - Journal of Communications and …, 2017 - Springer
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 …

An open shop approach in approximating optimal data transmission duration in WDM networks

T Aslanidis, S Birmpilis - arXiv preprint arXiv:1701.02030, 2017 - arxiv.org
In the past decade Optical WDM Networks (Wavelength Division Multiplexing) are being
used quite often and especially as far as broadband applications are concerned. Message …

A minimum task-based end-to-end delivery delay routing strategy with updated discrete graph for satellite disruption-tolerant networks

P Yuan, Z Yang, Q Zhang… - 2018 IEEE/CIC …, 2018 - ieeexplore.ieee.org
Recently, a variety of time-varying graphs, such as space-time graph and event-driven
graph, are widely employed for modelling the dynamic topologies of satellite Disruption …

A tale of two metrics in network delay optimization

Q Liu, L Deng, H Zeng, M Chen - IEEE/ACM Transactions on …, 2020 - ieeexplore.ieee.org
We consider a single-unicast networking scenario where a sender streams a flow at a fixed
rate to a receiver across a multi-hop network, possibly using multiple paths. Transmission …

Noticeable network delay minimization via node upgrades

S Medya, S Ranu, J Vachery, A Singh - Proceedings of the VLDB …, 2018 - dl.acm.org
In several domains, the flow of data is governed by an underlying network. Reduction of
delays in end-to-end data flow is an important network optimization task. Reduced delays …

A delay-tolerant network routing algorithm based on column generation

G Amantea, H Rivano… - 2013 IEEE 12th …, 2013 - ieeexplore.ieee.org
Delay-Tolerant Networks (DTN) model systems that are characterized by intermittent
connectivity and frequent partitioning. Routing in DTNs has drawn much research effort …