Learn More
Studying structural and functional characteristics of large scale graphs (or networks) has been a challenging task due to the related computational overhead. Hence, most studies consult to sampling to gather necessary information to estimate various features of these big networks. On the other hand, using a best effort approach to graph sampling within the(More)
We consider buffer management in support of large-scale gossip-based peer-to-peer data dissemination protocols. Coupled with an efficient buffering mechanism, system-wide buffer usage can be optimized while providing reliability and scalability in such protocols. We propose a novel approach, Stepwise Fair-share Buffering, that provides uniform load(More)
We address the problem of discovering frequent items in unstructured P2P networks which is relevant for several distributed services such as cache management, data replication, query refinement, topology optimization and security. This study makes the following contributions to the current state of the art. First, we propose and develop a fully distributed(More)
In large scale distributed systems, epidemic or gossip-based communication mechanisms are preferred for their ease of deployment, simplicity, robustness against failures, load-balancing and limited resource usage. Although they have extensive applicability, there is no prior work on developing energy cost models for epidemic distributedmechanisms. In this(More)
For large scale distributed systems, designing energy efficient protocols and services has become as significant as considering conventional performance criteria like scalability, reliability, fault-tolerance and security. We consider frequent item set discovery problem in this context. Although it has attracted attention due to its extensive applicability(More)
Estimating the structural characteristics of large graphs from a sample is a classical problem. In this study, we propose asymptotically unbiased estimators for the average degree characteristic of a network under ego-centric sampling. In this sampling design, we first sample a number of vertices called ego vertices from the underlying graph and then obtain(More)
In large-scale peer-to-peer (P2P) systems, epidemic or gossip-based protocols have become significant as an alternative to the hierarchical protocols due to their simplicity, robustness and scalability. In this study, we provide the details of the sum aggregation technique, namely atomic pairwise averaging, used in peer-to-peer networks. Various distributed(More)