An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
This paper shows how to build and maintain a distributed heap which we call SHELL. In contrast to standard heaps, our heap is oblivious in the sense that its structure only depends...
The Peer Sampling Service (PSS) has been proposed as a method to initiate and maintain the set of connections between nodes in unstructured peer to peer (P2P) networks. The PSS us...
Gian Paolo Jesi, Edoardo Mollona, Srijith K. Nair,...
A Distributed Hash Table (DHT) is a structured overlay network service that provides a decentralized lookup for mapping objects to locations. In this paper, we study the lookup pe...
Hun Jeong Kang, Eric Chan-Tin, Nicholas Hopper, Yo...
Abstract. We developed a reliable mobile Peer-to-Peer (P2P) data sharing system and performed some experiments for verifying our routing scheme using our real testbed. Our method f...
Mee Young Sung, Jong Hyuk Lee, Jong Seung Park, Se...