Sciweavers

9 search results - page 2 / 2
» One Kind of Network Complexity Pyramid with Universality and...
Sort
View
ADHOC
2005
143views more  ADHOC 2005»
13 years 5 months ago
Active query forwarding in sensor networks
While sensor networks are going to be deployed in diverse application specific contexts, one unifying view is to treat them essentially as distributed databases. The simplest mech...
Narayanan Sadagopan, Bhaskar Krishnamachari, Ahmed...
WWW
2003
ACM
14 years 6 months ago
Super-peer-based routing and clustering strategies for RDF-based peer-to-peer networks
RDF-based P2P networks have a number of advantages compared with simpler P2P networks such as Napster, Gnutella or with approaches based on distributed indices such as CAN and CHO...
Alexander Löser, Christoph Schmitz, Ingo Brun...
CCR
2008
85views more  CCR 2008»
13 years 4 months ago
On cycles in AS relationships
y be more complex than the course modeling abstraction we adopted in [2]. Real AS relationships may depend on a peering point, prefix, and even time [2]. For example, ISPs that dom...
Xenofontas A. Dimitropoulos, M. Ángeles Ser...
STOC
1993
ACM
264views Algorithms» more  STOC 1993»
13 years 9 months ago
Contention in shared memory algorithms
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
Cynthia Dwork, Maurice Herlihy, Orli Waarts