Sciweavers

1815 search results - page 249 / 363
» Path Planning for Network Performance
Sort
View
CLUSTER
2004
IEEE
15 years 10 months ago
Simplifying administration through dynamic reconfiguration. in a cooperative cluster storage system
Cluster Storage Systems where storage devices are distributed across a large number of nodes are able to reduce the I/O bottleneck problems present in most centralized storage sys...
Renaud Lachaize, Jorgen S. Hansen
HEURISTICS
2000
127views more  HEURISTICS 2000»
15 years 6 months ago
Fast, Efficient Equipment Placement Heuristics for Broadband Switched or Internet Router Networks
Planning and designing the next generation of IP router or switched broadband networks seems a daunting challenge considering the many complex, interacting factors affecting the p...
Joel W. Gannett
GIS
2006
ACM
16 years 7 months ago
Distance join queries on spatial networks
The result of a distance join operation on two sets of objects R, S on a spatial network G is a set P of object pairs <p, q>, p R, q S such that the distance of an object ...
Jagan Sankaranarayanan, Houman Alborzi, Hanan Same...
SENSYS
2009
ACM
16 years 1 months ago
Experiences with a high-fidelity wireless building energy auditing network
We describe the design, deployment, and experience with a wireless sensor network for high-fidelity monitoring of electrical usage in buildings. A network of 38 mote-class AC met...
Xiaofan Jiang, Minh Van Ly, Jay Taneja, Prabal Dut...
ICNP
2005
IEEE
15 years 12 months ago
Efficient Hop ID based Routing for Sparse Ad Hoc Networks
Routing in mobile ad hoc networks remains as a challenging problem given the limited wireless bandwidth, users’ mobility and potentially large scale. Recently, there has been a ...
Yao Zhao, Bo Li, Qian Zhang, Yan Chen, Wenwu Zhu