Efficient and reliable broadcast is achievable in an eventually connected network(Extended Abstract)
Baruch Awerbuch, Shimon Even · 1984
We deal with communication networks whose topology changes arbitrarily subject to the restriction that no edge-cut in the network persists forever. Up to now, no formal-ground rules have been proposed for such networks, and no protocol has been proved to possess any desirable property. We introduce a new proof methodology, in the sense that link-behavior in such networks is axiomatized.