We present the design and evaluation of a fully decentralized software application discovery scheme – iDiscover, which is used in the iShare Internet-sharing system being built at Purdue University. The scheme employs a structured peer-to-peer (P2P) overlay routing mechanism and a hierarchical name space. The structured P2P routing mechanism is self-organizing and scalable. The hierarchical nam...

Document (re)structuration consists in mapping documents coming from different sources, with different formats, onto a predefined semistructured format. This generic problem appears in different applications settings like heterogeneous semi-structured databases querying, peer to peer systems, legacy document conversion, XML information retrieval. In the paper, we define the restructuration prob...

High lookup latencies prohibit peer-to-peer overlays from being used in many performance intensive applications, even though they provide self-organization, scalability, and failure resilience. In this paper, we show that lookup performance of structured DHTs can be improved to any desirable constant, even under 1 hop, by controlled proactive replication. By exploiting the popularity distributi...

Often when modeling structured domains, it is desirable to leverage information that is not naturally expressed as simply a label. Examples include knowledge about the evaluation measure that will be used at test time, and partial (weak) label information. When the additional information has structure that factorizes according to small subsets of variables (i.e., is low order, or decomposable),...