Unstructured peer-to-peer lookup systems incur small constant overhead per single join or leave operation, and can easily support keyword searches. Hence, they are suitable for dy...
The main problem we address in this paper is how to map the requirements of a known media service workload into the corresponding system resource requirements and to accurately siz...
: When traveling and visiting new places, tourists are mobile as they wander around and follow tours through cities and landscapes. Location-based mobile systems today typically pr...
This paper proves a necessary and sufficient condition for the existence of iterative algorithms that achieve approximate Byzantine consensus in arbitrary directed graphs, where e...
We propose a peer-to-peer system that supports distributed virtual world applications. For these applications, the connections between directly neighboring peers are of the utmost ...