Efficient and decentralized computation of approximate global state.

The need for efficient computation of approximate global state lies at the heart of a wide range of problems in distributed systems. Examples include routing in the Internet, sensor fusion, search in peer-to-peer networks, coordinated intrusion detection, and Top-K queries in stream-oriented databas...

詳細記述

書誌詳細
出版年:Computer communication review. 36, 1 (2006).
第一著者: Keshav, S.
フォーマット: 論文
言語:English
主題: