Nothing Special   »   [go: up one dir, main page]

×
Please click here if you are not redirected within a few seconds.
This paper presents the rst polynomial complexity end-to-end communication protocol in dynamic networks. In the worst case the protocol sends O(n2m) messages ...
This paper introduces the slide protocol and uses it to provide the first polynomial complexity end-to-end communication protocol in dynamic w x networks ...
This paper presents the first polynomial complexity end-to-end communication protocol in dynamic networks.
We consider the basic task of of end-to-end communication in dynamic networks, that is, delivery in finite time of data items generated on-line by a sender, ...
This paper presents the first polynomial complexity end-to-end communication protocol in dynamic networks. In the worst case the protocol sendsO(n2m) messages ...
This paper presents the first polynomial complexity end-to-end communication protocol in dynamic networks. In the worst case the protocol sendsO(n2m) messages ...
Slide—The Key to Polynomial End-To-End Communication by Yehuda Afek, Baruch Awerbuch, Eli Gafni, Yishay Mansour, Adi Rosén, Nir Shavit published in.
People also ask
This paper presents the first polynomial complexity end-to-end communication protocol in dynamic networks, a simple and efficient method for delivering ...
... for fast load balancing in communication networks. Expand. 56 Citations · PDF. Add to Library. Alert. Slide-The Key to Polynomial End-to-End Communication.
Slide—The Key to Polynomial End-to-End Communication. Article. Full-text available. Jan 1997. Yehuda Afek · Baruch Awerbuch · Eli Gafni ...