Sciweavers

162 search results - page 7 / 33
» Minimizing Average Finish Time in P2P Networks
Sort
View
HPDC
2006
IEEE
15 years 3 months ago
WOW: Self-Organizing Wide Area Overlay Networks of Virtual Workstations
— This paper describes WOW, a distributed system that combines virtual machine, overlay networking and peerto-peer techniques to create scalable wide-area networks of virtual wor...
Arijit Ganguly, Abhishek Agrawal, P. Oscar Boykin,...
IPPS
2006
IEEE
15 years 3 months ago
Model-based evaluation of search strategies in peer-to-peer networks
This paper exploits a previously developed analytical modeling framework to compare several variations of the basic flooding search strategy in unstructured decentralized peer-to...
Rossano Gaeta, Matteo Sereno
P2P
2005
IEEE
112views Communications» more  P2P 2005»
15 years 3 months ago
Randomized Protocols for Duplicate Elimination in Peer-to-Peer Storage Systems
Distributed peer-to-peer systems rely on voluntary participation of peers to effectively manage a storage pool. In such systems, data is generally replicated for performance and a...
Ronaldo A. Ferreira, Murali Krishna Ramanathan, An...
ALGOSENSORS
2008
Springer
14 years 11 months ago
Minimizing Average Flow Time in Sensor Data Gathering
Vincenzo Bonifaci, Peter Korteweg, Alberto Marchet...
CONEXT
2009
ACM
14 years 10 months ago
Exploiting dynamicity in graph-based traffic analysis: techniques and applications
Network traffic can be represented by a Traffic Dispersion Graph (TDG) that contains an edge between two nodes that send a particular type of traffic (e.g., DNS) to one another. T...
Marios Iliofotou, Michalis Faloutsos, Michael Mitz...