Download Now Free registration required
This paper addresses the problem of discovering frequent items in unstructured P2P networks. This problem is relevant for several distributed services such as cache management, data replication, sensor networks and security. The authors make three contributions to the current state of the art. First, they propose a fully distributed Protocol for Frequent Item Set Discovery (ProFID) where the result is produced at every peer. ProFID uses a novel pair-wise averaging function and network size estimation together to discover frequent items in an unstructured P2P network.
- Format: PDF
- Size: 259.3 KB