Key points are not available for this paper at this time.
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.
Building similarity graph...
Analyzing shared references across papers
Loading...
Technion – Israel Institute of Technology
Add This Paper to Your Research Feed
Any time a new paper drops it will be there.
Awerbuch et al. (Sun,) studied this question.