Sciweavers

2497 search results - page 96 / 500
» Requirements for models of achievable routing
Sort
View
WIDM
2006
ACM
15 years 7 months ago
SRI: exploiting semantic information for effective query routing in a PDMS
The huge amount of data available from Internet information sources has focused much attention on the sharing of distributed information through Peer Data Management Systems (PDMS...
Federica Mandreoli, Riccardo Martoglia, Simona Sas...
INFOCOM
2005
IEEE
15 years 7 months ago
Distributed algorithms for secure multipath routing
— To proactively defend against intruders from readily jeopardizing single-path data sessions, we propose a distributed secure multipath solution to route data across multiple pa...
Patrick P. C. Lee, Vishal Misra, Dan Rubenstein
ADHOC
2007
122views more  ADHOC 2007»
15 years 1 months ago
Minimum latency joint scheduling and routing in wireless sensor networks
Wireless sensor networks are expected to be used in a wide range of applications from environment monitoring to event detection. The key challenge is to provide energy efficient ...
Gang Lu, Bhaskar Krishnamachari
SIGMETRICS
2008
ACM
140views Hardware» more  SIGMETRICS 2008»
15 years 1 months ago
Scalable VPN routing via relaying
Enterprise customers are increasingly adopting MPLS (Multiprotocol Label Switching) VPN (Virtual Private Network) service that offers direct any-to-any reachability among the cust...
Changhoon Kim, Alexandre Gerber, Carsten Lund, Dan...
DATE
2008
IEEE
121views Hardware» more  DATE 2008»
15 years 8 months ago
A Bridging Fault Model Where Undetectable Faults Imply Logic Redundancy
We define a robust fault model as a model where the existence of an undetectable fault implies the existence of logic redundancy, or more generally, a suboptimality in the synthe...
Irith Pomeranz, Sudhakar M. Reddy