Sciweavers

4037 search results - page 326 / 808
» Routing without ordering
Sort
View
MOBICOM
2006
ACM
15 years 9 months ago
On optimal communication cost for gathering correlated data through wireless sensor networks
In many energy-constrained wireless sensor networks, nodes cooperatively forward correlated sensed data to data sinks. In order to reduce the communication cost (e.g. overall ener...
Junning Liu, Micah Adler, Donald F. Towsley, Chun ...
KIVS
2005
Springer
15 years 8 months ago
Measuring Large Overlay Networks - The Overnet Example
Peer-to-peer overlay networks have grown significantly in size and sophistication over the last years. Meanwhile, distributed hash tables (DHT) provide efficient means to create g...
Kendy Kutzner, Thomas Fuhrmann
SIGMETRICS
2003
ACM
113views Hardware» more  SIGMETRICS 2003»
15 years 8 months ago
An empirical evaluation of wide-area internet bottlenecks
Conventional wisdom has been that the performance limitations in the current Internet lie at the edges of the network – i.e last mile connectivity to users, or access links of s...
Aditya Akella, Srinivasan Seshan, Anees Shaikh
ICSOC
2009
Springer
15 years 8 months ago
Message-Oriented Middleware with QoS Awareness
Publish/subscribe messaging is a fundamental mechanism for interconnecting disparate services and systems in the service-oriented computing architecture. The quality of services (Q...
Hao Yang, Minkyong Kim, Kyriakos Karenos, Fan Ye, ...
EURODAC
1994
IEEE
127views VHDL» more  EURODAC 1994»
15 years 7 months ago
Optimal equivalent circuits for interconnect delay calculations using moments
In performance-driven interconnect design, delay estimators are used to determine both the topology and the layout of good routing trees. We address the class of moment-matching, ...
Sudhakar Muddu, Andrew B. Kahng