Sciweavers

167 search results - page 16 / 34
» About the Lifespan of Peer to Peer Networks
Sort
View
NSDI
2004
13 years 10 months ago
Efficient Routing for Peer-to-Peer Overlays
Most current peer-to-peer lookup schemes keep a small amount of routing state per node, typically logarithmic in the number of overlay nodes. This design assumes that routing info...
Anjali Gupta, Barbara Liskov, Rodrigo Rodrigues
JCP
2007
121views more  JCP 2007»
13 years 8 months ago
p-Trust: A New Model of Trust to Allow Finer Control Over Privacy in Peer-to-Peer Framework
— Every time a user conducts an electronic transaction over the Internet a wealth of personal information is revealed, either voluntarily or involuntarily. This causes serious br...
Sudip Chakraborty, Indrajit Ray
DASFAA
2005
IEEE
106views Database» more  DASFAA 2005»
14 years 2 months ago
Real Datasets for File-Sharing Peer-to-Peer Systems
The fundamental drawback of unstructured peer-to-peer (P2P) networks is the flooding-based query processing protocol that seriously limits their scalability. As a result, a signiï...
Shen-Tat Goh, Panos Kalnis, Spiridon Bakiras, Kian...
EPEW
2005
Springer
14 years 2 months ago
Reasoning About Interaction Patterns in Choreography
Choreography languages provide a top-view design way for describing complex systems composed of services distributed over the network. The basic building block of such languages is...
Roberto Gorrieri, Claudio Guidi, Roberto Lucchi
P2PKM
2004
13 years 10 months ago
RDFGrowth, a P2P annotation exchange algorithm for scalable Semantic Web applications
We present RDFGrowth, an algorithm that addresses a specific yet important scenario: large scale, end user targeted, metadata exchange P2P applications. In this scenario, peers per...
Giovanni Tummarello, Christian Morbidoni, Joackin ...