1147 search results - page 202 / 230 » LinkedDataLens: linked data as a network of networks |
164
click to vote
OSDI
2002
ACM
16 years 6 months ago
2002
ACM
This paper shows how to quickly move the state of a running computer across a network, including the state in its disks, memory, CPU registers, and I/O devices. We call this state...
141
click to vote
ICNP
2007
IEEE
16 years 9 days ago
2007
IEEE
— Congestion caused by a large number of interacting TCP flows at a bottleneck network link is different from that caused by a lesser number of flows sending large amounts of d...
204
click to vote
PODC
2004
ACM
15 years 11 months ago
2004
ACM
We present a low-cost, decentralized algorithm for ID management in distributed hash tables (DHTs) managed by a dynamic set of hosts. Each host is assigned an ID in the unit inter...
146
click to vote
IWQOS
2005
Springer
15 years 11 months ago
2005
Springer
Most congestion control algorithms try to emulate processor sharing (PS) by giving each competing flow an equal share of a bottleneck link. This approach leads to fairness, and pr...
318
click to vote
GIS
2003
ACM
16 years 7 months ago
2003
ACM
This paper introduces an approach for closer integration of selforganizing maps into the visualization of spatio-temporal phenomena in GIS. It is proposed to provide a more explic...