Sciweavers

94 search results - page 5 / 19
» Interposed Request Routing for Scalable Network Storage
Sort
View
NCA
2006
IEEE
14 years 1 months ago
Congestion Control for Distributed Hash Tables
Distributed Hash Tables (DHTs) provide a scalable mechanism for mapping identifiers to socket addresses. As each peer in the network can initiate lookup requests, a DHT has to pr...
Fabius Klemm, Jean-Yves Le Boudec, Karl Aberer
PE
2006
Springer
127views Optimization» more  PE 2006»
13 years 7 months ago
Cycloid: A constant-degree and lookup-efficient P2P overlay network
There are many structured P2P systems that use DHT technologies to map data items onto the nodes in various ways for scalable routing and location. Most of the systems require O(lo...
Haiying Shen, Cheng-Zhong Xu, Guihai Chen
UBIMOB
2009
ACM
225views Management» more  UBIMOB 2009»
14 years 3 days ago
Historical data storage for large scale sensor networks
Wireless sensor networks are rapidly finding their way through a plethora of new applications like precision farming and forestry, with increasing network scale, system complexit...
Loïc Petit, Abdelhamid Nafaa, Raja Jurdak
ICCS
2009
Springer
14 years 2 months ago
Improving the Scalability of SimGrid Using Dynamic Routing
Research into large-scale distributed systems often relies on the use of simulation frameworks in order to bypass the disadvantages of performing experiments on real testbeds. SimG...
Silas De Munck, Kurt Vanmechelen, Jan Broeckhove
TPDS
2010
222views more  TPDS 2010»
13 years 5 months ago
Energy-Efficient Beaconless Geographic Routing in Wireless Sensor Networks
—Geographic routing is an attractive localized routing scheme for wireless sensor networks (WSNs) due to its desirable scalability and efficiency. Maintaining neighborhood inform...
Haibo Zhang, Hong Shen