— In this paper, we present an O(1) time-complexity packet scheduling algorithm which we call G-3 that provides bounded end-to-end delay for fixed size packet networks. G-3 is b...
— In the last years peer-to-Peer (P2P) applications are emerging as potentially important structures for information, content management and distribution. The most popular P2P ap...
Mario Barbera, Alfio Lombardo, Giovanni Schembra, ...
Subscription pruning has been proven as valuable routing optimization for Boolean subscriptions in publish/subscribe systems. It aims at optimizing subscriptions independently of ...
The GCA (Global Cellular Automata) model consists of a collection of cells which change their states synchronously depending on the states of their neighbors like in the classical...
Wolfgang Heenes, Rolf Hoffmann, Johannes Jendrsczo...
— In existing query-based routing protocols in wireless sensor networks (WSNs), a node either keeps precise route information to desired events, such as in event flooding, or do...