The problem of applying static distributed algorithms in an eventually connected network is addressed. We propose a new technique, bootstrap resynchronization, by which any static diffusing computations can be reliably adapted to such a network. The communication overhead for each execution of the diffusing computation adapted by our technique is 0(nE) messages, were n and E are the total number of nodes and links in the network. The time overhead of the bootstrap resynchronization per execution is 0(n2). One of the simplest diffusing computations is flood. Flood can be used to send a data item in the end-to-end problem, and to receive its acknowledgment in a return flood. Applying our technique to this algorithm results in an 0(nE) messages per data item, data oblivious end-to-end protocol (0(E • D + nE log n) bits of communication per data item of size D bits).