One of the most striking properties of the Internet is its flexibility to accommodate features it
was not conceived for. Among the most significant examples, in this survey we consider the …

We outline a generic model for representing de-sign deliberation and the relation between
deliberation and the generation of method-specific artifacts. A design history is regarded as …

Peer-to-peer systems promise inexpensive scalability, adaptability, and robustness. Thus,
they are an attractive platform for file sharing, distributed wikis, and search engines. These …

Uniform sampling in networks is at the core of a wide variety of randomized algorithms.
Random sampling can be performed by modeling the system as an undirected graph with …

Document clustering is an important tool for applications such as Web search engines.
Clustering documents enables the user to have a good overall view of the information …

This paper analyzes the adoption of unstructured P2P overlay networks to build resource
discovery services. We consider a simple distributed communication protocol, which is …

Designing efficient search algorithms is a key challenge in unstructured peer-to-peer
networks. Flooding and random walk (RW) are two typical search algorithms. Flooding …

The main purpose of many current peer-to-peer (P2P) networks is off-line file sharing.
However, a potentially very promising use of such networks is to share video streams (eg …

Modern lifestyles heavily rely on the Internet, with mobile devices and wireless networks
being indispensable. However, in peer-to-peer (P2P) wireless networks, low battery levels …

Unstructured peer-to-peer (P2P) networks have become a very popular architecture for
content distribution in large-scale and dynamic environments. The search efficiency problem …