Sciweavers

1877 search results - page 4 / 376
» Network Locality at the Scale of Processes
Sort
View
WWW
2003
ACM
14 years 8 months ago
A Scalable Locality-Aware Event Dispatching Mechanism for Network Servers
Network servers often need to process a large amount of network events asynchronously. They usually use select() or poll() to retrieve events from file descriptors. However, previ...
Hao-Ran Liu, Tien-Fu Chen
MOBIDE
2005
ACM
14 years 1 months ago
Tolerance of localization imprecision in efficiently managing mobile sensor databases
Query processing on mobile sensor networks requires efficient indexing and partitioning of the data space to support efficient routing as the network scales up. Building an index ...
Lin Xiao, Aris M. Ouksel
RSA
1998
82views more  RSA 1998»
13 years 7 months ago
Convergence of branching processes to the local time of a Bessel process
We study Galton-Watson branching processes conditioned on the total progeny to be n which are scaled by a sequence cn tending to infinity as o( √ n). It is shown that this proce...
Bernhard Gittenberger
INFOCOM
2008
IEEE
14 years 2 months ago
Connectivity-Based Localization of Large Scale Sensor Networks with Complex Shape
—We study the problem of localizing a large sensor network having a complex shape, possibly with holes. A major challenge with respect to such networks is to figure out the corr...
Sol Lederer, Yue Wang, Jie Gao
CCGRID
2002
IEEE
14 years 18 days ago
Tracing a Large-Scale Peer to Peer System: An Hour in the Life of Gnutella
Peer-to-peer computing and networking, an emerging model of communication and computation, has recently started to gain significant acceptance. This model not only enables client...
Evangelos P. Markatos