162 search results - page 8 / 33 » Minimizing Average Finish Time in P2P Networks |
P2P
2003
IEEE
14 years 20 days ago
2003
IEEE
Sensor networks, that consist of potentially several thousands of nodes each with sensing (heat, sound, light, magnetism, etc.) and wireless communication capabilities, provide gr...
CONEXT
2006
ACM
14 years 1 months ago
2006
ACM
We consider the case of a virtual world of peers that are organized in an overlay built by Delaunay Triangulation. Application layer routing is used to determine the path taken in...
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
JPDC
2006
13 years 7 months ago
2006
Distributed hash tables (DHTs), used in a number of structured peer-to-peer (P2P) systems provide efficient mechanisms for resource placement and location. A key distinguishing fe...
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— Instantaneous Fair Sharing (IFS) is a traditional network ideal prescribing to share the network capacity among competing applications fairly during any infinitesimal time int...