Sciweavers

11580 search results - page 1925 / 2316
» Communication vs. Computation
Sort
View
P2P
2008
IEEE
16 years 1 months ago
Playing with the Bandwidth Conservation Law
We investigate performance bounds of P2P systems by application of the law of bandwidth conservation. This approach is quite general and allows us to consider various sharing syst...
Farid Benbadis, Fabien Mathieu, Nidhi Hegde, Diego...
P2P
2008
IEEE
16 years 1 months ago
Incentives Against Hidden Action in QoS Overlays
Peer-to-peer networks providing QoS-enabled services are sensitive to hidden action situations, where the actions of a server peer are hidden from the peers who receive services f...
Raul Landa, Miguel Rio, David Griffin, Richard G. ...
P2P
2008
IEEE
184views Communications» more  P2P 2008»
16 years 1 months ago
Ad Hoc Limited Scale-Free Models for Unstructured Peer-to-Peer Networks
Several protocol efficiency metrics (e.g., scalability, search success rate, routing reachability and stability) depend on the capability of preserving structure even over the ch...
Hasan Guclu, Durgesh Kumari, Murat Yuksel
P2P
2008
IEEE
135views Communications» more  P2P 2008»
16 years 1 months ago
Popularity-Aware Prefetch in P2P Range Caching
Unstructured peer-to-peer infrastructure has been widely employed to support large-scale distributed applications. Many of these applications, such as locationbased services and m...
Qiang Wang, Khuzaima Daudjee, M. Tamer Özsu
P2P
2008
IEEE
16 years 1 months ago
Faster Content Access in KAD
Many different Distributed Hash Tables (DHTs) have been designed, but only few have been successfully deployed. The implementation of a DHT needs to deal with practical aspects (e...
Moritz Steiner, Damiano Carra, Ernst W. Biersack
« Prev « First page 1925 / 2316 Last » Next »