IP Library › Granted Patent US 12,457,186
Granted Patent B2
US 12,457,186 · App. 17/382,608 · Granted Oct 28, 2025

Resilient file transfer (ResiFT) mechanism for networked communication

Inventors: Vijayasarathy Rajagopalan (Bangalore, IN); Kapaleeswaran Viswanathan (Karnataka, IN)
Assignee: The Boeing Company
H04L51/23H04L12/1868H04L47/283H04L67/06H04L67/1074H04L67/108
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,457,186
App. No.
17/382,608
Granted
Oct 28, 2025
Kind
B2
Abstract

A method for resilient file transfer comprises transmitting, by a source, a fragment of a file to a destination. The method further comprises transmitting, by the destination, an acknowledgement to the source, when the destination receives the fragment. Also, the method comprises calculating a current delay measurement (δ), which is a difference of a time the fragment is transmitted from the source and a time the acknowledgement is received by the source, when the source receives the acknowledgement. Additionally, the method comprises calculating a current delay estimation (δ e n+1 ), which is a sum of a previous delay estimation (δ e n ) weighted by a variable alpha (α) and the current delay measurement (δ) weighted by a variable beta (β), when the source receives the acknowledgement. Further, the method comprises determining whether a subsequent fragment transmitted should be retransmitted by the source to the destination by using the current delay estimation (δ e n+1 ).

Claims (44)

1. A method for resilient file transfer, the method comprising:

transmitting, by a source, a fragment of a file to a destination;

receiving, by the source, an acknowledgement to the source, when the destination receives the fragment;

calculating, by at least one processor associated with the source, a current delay measurement (δ), which is a difference of a time the fragment is transmitted from the source and a time the acknowledgement is received by the source, when the source receives the acknowledgement;

calculating, by the at least one processor, a current delay estimation (δen+1), which is a sum of a previous delay estimation (δen) weighted by a variable alpha (α) and the current delay measurement (δ) weighted by a variable beta (β), when the source receives the acknowledgement;

transmitting, by the source, a subsequent fragment to the destination; and

setting, by the at least one processor, the current delay measurement (δ) to equal the current delay estimation (δen+1) multiplied by a variable gamma (γ), when a time difference (ΔT), which is equal to a difference of a time the subsequent fragment is transmitted by the source and a current time, is greater than the current delay estimation (δen+1) multiplied by the variable gamma (γ).

2. The method of claim 1 , wherein the method further comprises:

calculating, by the at least one processor, a time difference (ΔT), which is equal to a difference of a time the subsequent fragment is transmitted by the source and a current time; and

retransmitting, by the source, the subsequent fragment to the destination, when the time difference (ΔT) is greater than the current delay estimation (δen+1) multiplied by a variable gamma (γ).

3. The method of claim 2 , wherein the method further comprises:

recalculating, by the at least one processor, the current delay estimation (δen+1) using the current delay measurement (δ) equal to the current delay estimation (δen+1) multiplied by the variable gamma (γ), when the time difference (ΔT) is greater than the current delay estimation (δen+1) multiplied by the variable gamma (γ).

4. The method of claim 3 , wherein the method further comprises:

calculating, by the at least one processor, a maximum delay (δmax), which is equal to an initial delay estimation multiplied by a maximum policy value; and

setting, by the at least one processor, the current delay estimation (δen+1) to equal the maximum delay (δmax), when the current delay estimation (δen+1) is greater than the maximum delay (δmax).

5. The method of claim 1 , wherein a sum of the variable alpha (α) and the variable beta (β) is equal to one (1).

6. The method of claim 1 , wherein the at least one processor is located at the source or remote from the source.

7. The method of claim 1 , wherein a source fragment communicator of the source transmits the fragment.

8. The method of claim 1 , wherein the method further comprises: receiving, by the destination, the fragment.

9. The method of claim 8 , wherein a destination fragment communicator of the destination receives the fragment.

10. The method of claim 1 , wherein a vehicle or a terrestrial node comprises the source.

11. The method of claim 10 , wherein the vehicle is one of an airborne vehicle, a marine vehicle, a terrestrial vehicle, or a space vehicle.

12. The method of claim 10 , wherein the vehicle is an autonomous vehicle.

13. The method of claim 1 , wherein a vehicle or a terrestrial node comprises the destination.

14. The method of claim 13 , wherein the vehicle is one of an airborne vehicle, a marine vehicle, a terrestrial vehicle, or a space vehicle.

15. The method of claim 13 , wherein the vehicle is an autonomous vehicle.

16. The method of claim 1 , wherein the fragment is transmitted by the source to the destination via a delay-tolerant and reliable file transfer (DR-FT) layer in a protocol stack.

17. The method of claim 16 , wherein the DR-FT layer is adjacent to a delay tolerant networking (DTN) layer in the protocol stack.

18. The method of claim 1 , wherein the acknowledgement is transmitted by the destination to the source via a delay-tolerant and reliable file transfer (DR-FT) layer in a protocol stack.

19. A system for resilient file transfer, the system comprising:

a source configured to transmit a fragment of a file to a destination;

the destination configured to transmit an acknowledgement to the source, when the destination receives the fragment; and

at least one processor configured to:

calculate a current delay measurement (δ), which is a difference of a time the fragment is transmitted from the source and a time the acknowledgement is received by the source, when the source receives the acknowledgement;

calculate a current delay estimation (δen+1), which is a sum of a previous delay estimation (δen) weighted by a variable alpha (α) and the current delay measurement (δ) weighted by a variable beta (β), when the source receives the acknowledgement;

determine whether a subsequent fragment transmitted should be retransmitted by the source to the destination by using the current delay estimation (δen+1); and

set the current delay measurement (δ) to equal the current delay estimation (δen+1) multiplied by a variable gamma (γ), when a time difference (ΔT), which is equal to a difference of a time the subsequent fragment is transmitted by the source and a current time, is greater than the current delay estimation (δen+1) multiplied by the variable gamma (γ).

20. A method for resilient file transfer (ResiFT), the method comprising:

identifying, by at least one processor associated with a source, a file to be transmitted from the source to a destination;

determining, by the at least one processor running a delay-tolerant and reliable file transfer (DR-FT) application, whether the source has a security certificate for the destination;

obtaining, by the at least one processor running a public key distribution network (PKDN) application, the security certificate for the destination from the destination, when the at least one processor determines that the source does not have the security certificate for the destination;

encrypting and signing, by the at least one processor, the file to generate a signed encrypted file;

stripping, by the at least one processor running another DR-FT application, the signed encrypted file to generate a plurality of fragments; and

transmitting, by the at least one processor running a delay tolerant networking (DTN) application, the fragments from the source to the destination by using the method of claim 1 .

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 22, 2021
From: VISWANATHAN, KAPALEESWARAN; RAJAGOPALAN, VIJAYASARATHY
To: THE BOEING COMPANY
Reel/Frame 057568/0927 →
Continuity (2)
Provisional Application 63059008 · Jul 30, 2020
Related Publication 20240291888A1 · Aug 29, 2024
References Cited (16)
US 6985454B1 · Wiedeman · 2006 [cited by examiner]
US 10050946B2 · Templin et al. · 2018 [cited by applicant]
US 20060262738A1 · Fernandes · 2006 [cited by examiner]
US 20130272286A1 · Sharma · 2013 [cited by examiner]
US 20150269445A1 · Ueda · 2015 [cited by examiner]
US 20150326633A1 · Chang · 2015 [cited by examiner]
US 20180027099A1 · Dajani · 2018 [cited by examiner]
US 20180091765A1 · Mobasher · 2018 [cited by examiner]
US 20200064826A1 · Engle · 2020 [cited by examiner]
EP 0948168A1 · 1999 [cited by examiner]
WO WO2013182122A1 · 2013 [cited by examiner]
Nyamekye, Kofi, “C2 in Underdeveloped, Degraded and Denied Operational Environments”, 18 [cited by applicant]
Scott, Keith, et al., “Robust Communications for Disconnected, Intermittent, Low-Bandwith (DIL) Environments,” 2011 Military Communications Conference, pp. 1009-1014. [cited by applicant]
“IBR-DTN—A modular and lightweight implementation of the bundle protocol,” Web Page <https://github.com>, 3 pages, retrieved from the Internet <https://github.com/ibrdtn/ibrdtn> on Oct. 28, 2021. [cited by applicant]
“Interplanetary Overlay Network (ION-DTN),” Web Page < https://sourceforge.net>, 3 pages, retrieved from the Internet <https://sourceforge.net/p/ion-dtn/wiki/Home/> on Oct. 28, 2021. [cited by applicant]
“Wave Glider platform Liquid Robotics,” Web Page < https://www.liquid-robotics.com>, 4 pages, retrieved from the Internet <https://www.liquid-robotics.com/wave-glider/overview/> on Oct. 28, 2021. [cited by applicant]