Peer-to-peer systems (p2p) are highly dynamic in nature. They may consist of millions of peers joining only for a limited period of time, resulting in hundreds of join and leave e...
We present a purely functional implementation of search trees that requires O(log n) time for search and update operations and supports the join of two trees in worst case constant...
In this paper we propose a deployable approach to improving QoS by using a generic, extendable, overlay architecture; the Generalized Application Layer Overlay (GALO). The goals of...
Raheem A. Beyah, Raghupathy Sivakumar, John A. Cop...
Reputation mechanisms for detecting and punishing free-riders in ad hoc networks depend on the local detection of selfish behavior. Although naive selfish strategies based on drop...
Bo Wang 0001, Sohraab Soltani, Jonathan K. Shapiro...
Abstract. We describe a heuristic algorithm which searches for spreading clopen sets of a cellular automaton. Then the algorithms searches for the corresponding subshift attractors...
Enrico Formenti, Petr Kurka, Ondrej Zahradní...