Sciweavers

580 search results - page 67 / 116
» Choosing a random peer
Sort
View
JSAC
2007
124views more  JSAC 2007»
14 years 11 months ago
Optimal search performance in unstructured peer-to-peer networks with clustered demands
—This paper derives the optimal search time and the optimal search cost that can be achieved in unstructured peer-topeer networks when the demand pattern exhibits clustering (i.e...
Saurabh Tewari, Leonard Kleinrock
P2P
2007
IEEE
15 years 6 months ago
A Data Placement Scheme with Time-Related Model for P2P Storages
Maintaining desired data availability while minimizing costs is the primary challenge in designing P2P storages. Data placement schemes and data availability calculation methods a...
Jing Tian, Zhi Yang, Yafei Dai
P2P
2006
IEEE
153views Communications» more  P2P 2006»
15 years 5 months ago
Internet-Scale Storage Systems under Churn -- A Study of the Steady-State using Markov Models
Content storage in a distributed collaborative environment uses redundancy for better resilience and thus provides good availability and durability. In a peer-to-peer environment,...
Anwitaman Datta, Karl Aberer
WWW
2008
ACM
16 years 16 days ago
Behavioral classification on the click graph
A bipartite query-URL graph, where an edge indicates that a document was clicked for a query, is a useful construct for finding groups of related queries and URLs. Here we use thi...
Martin Szummer, Nick Craswell
INFOCOM
2009
IEEE
15 years 6 months ago
Enhanced Spatial Reuse in Multi-Cell WLANs
—When IEEE 802.11 access points (APs) share the same channel in a multi-cell WLAN, their downlink transmissions can interfere. Typically, an AP whose scheduled transmission to so...
Thomas Bonald, Ali Ibrahim, James Roberts