Sciweavers

417 search results - page 42 / 84
» A randomized algorithm for the joining protocol in dynamic d...
Sort
View
EWSN
2008
Springer
14 years 8 months ago
Resilient Coding Algorithms for Sensor Network Data Persistence
Storing and disseminating coded information instead of the original data can bring significant performance improvements to sensor network protocols. Such methods reduce the risk of...
Daniele Munaretto, Jörg Widmer, Michele Rossi...
SPAA
2005
ACM
14 years 2 months ago
Oblivious routing on geometric networks
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
Costas Busch, Malik Magdon-Ismail, Jing Xi
KDD
2007
ACM
149views Data Mining» more  KDD 2007»
14 years 9 months ago
Distributed classification in peer-to-peer networks
This work studies the problem of distributed classification in peer-to-peer (P2P) networks. While there has been a significant amount of work in distributed classification, most o...
Ping Luo, Hui Xiong, Kevin Lü, Zhongzhi Shi
HPDC
2006
IEEE
14 years 2 months ago
Improving I/O Performance of Clustered Storage Systems by Adaptive Request Distribution
We develop an adaptive load distribution protocol for logical volume I/O workload in clustered storage systems. It exploits data redundancy among decentralized storage servers to ...
Changxun Wu, Randal C. Burns
MOBICOM
1999
ACM
14 years 1 months ago
Multicast Operation of the Ad-Hoc On-Demand Distance Vector Routing Protocol
An ad-hoc network is the cooperative engagement of a collection of typically wireless mobile nodes without the required intervention of any centralized access point or existing ...
Elizabeth M. Belding-Royer, Charles E. Perkins