In this paper, we propose several deadlock-free protocols for implementing the generalized alternative construct, where a process non-deterministically chooses between sending or ...
Abstract—Sequencer, privilege-based, and communication history algorithms are popular approaches to implement total ordering, where communication history algorithms are most suit...
Li Ou, Xubin He, Christian Engelmann, Stephen L. S...
We present the first analytic study of stream tapping protocols, a family of protocols that provide the most efficient way to distribute videos on demand at low to medium request ...
Today’s RFID protocols that govern the communication between RFID readers and tags are solely optimized for performance, but fail to address consumer privacy concerns by support...
Christian Floerkemeier, Roland Schneider, Marc Lan...
Abstract. In this paper, we define the routing overhead as the amount of information needed to describe the changes in a network topology. We derive a universal lower bound on the...