6800 search results - page 1275 / 1360 » On optimizing collective communication |
194
click to vote
IPSN
2007
Springer
15 years 12 months ago
2007
Springer
We study the problem of aggregating data from a sparse set of nodes in a wireless sensor network. This is a common situation when a sensor network is deployed to detect relatively...
143
click to vote
INFOCOM
2006
IEEE
15 years 11 months ago
2006
IEEE
— While structured P2P systems (such as DHTs) are often regarded as an improvement over unstructured P2P systems (such as super-peer networks) in terms of routing efficiency, it...
183
click to vote
INFOCOM
2006
IEEE
15 years 11 months ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
137
click to vote
INFOCOM
2006
IEEE
15 years 11 months ago
2006
IEEE
—Routing algorithms such as Distance Vector and Link States have the routing table size as ΩΩΩΩ (n), where n is the number of destination identifiers, thus providing only...
148
click to vote
INFOCOM
2006
IEEE
15 years 11 months ago
2006
IEEE
— The distribution of broadcast TV across large provider networks has become a highly topical subject as satellite distribution capacity exhausts and competitive pressures increa...