Sciweavers

266 search results - page 46 / 54
» Distributed Routing in Tree Networks with Few Landmarks
Sort
View
SASN
2006
ACM
14 years 1 months ago
Attack-resilient hierarchical data aggregation in sensor networks
In a large sensor network, in-network data aggregation, i.e., combining partial results at intermediate nodes during message routing, significantly reduces the amount of communic...
Sankardas Roy, Sanjeev Setia, Sushil Jajodia
IPPS
2006
IEEE
14 years 1 months ago
Topology-aware task mapping for reducing communication contention on large parallel machines
Communication latencies constitute a significant factor in the performance of parallel applications. With techniques such as wormhole routing, the variation in no-load latencies ...
T. Agarwal, Amit Sharma, A. Laxmikant, Laxmikant V...
ISPD
2005
ACM
130views Hardware» more  ISPD 2005»
14 years 1 months ago
Improved algorithms for link-based non-tree clock networks for skew variability reduction
In the nanometer VLSI technology, the variation effects like manufacturing variation, power supply noise, temperature etc. become very significant. As one of the most vital nets...
Anand Rajaram, David Z. Pan, Jiang Hu
IMC
2004
ACM
14 years 1 months ago
On the responsiveness of DNS-based network control
For the last few years, large Web content providers interested in improving their scalability and availability have increasingly turned to three techniques: mirroring, content dis...
Jeffrey Pang, Aditya Akella, Anees Shaikh, Balacha...
CIKM
2005
Springer
14 years 1 months ago
Query workload-aware overlay construction using histograms
Peer-to-peer (p2p) systems offer an efficient means of data sharing among a dynamically changing set of a large number of autonomous nodes. Each node in a p2p system is connected...
Georgia Koloniari, Yannis Petrakis, Evaggelia Pito...