Sciweavers

152 search results - page 18 / 31
» Application of Network Calculus to General Topologies using ...
Sort
View
STOC
2004
ACM
61views Algorithms» more  STOC 2004»
15 years 12 months ago
The zero-one principle for switching networks
Recently, approximation analysis has been extensively used to study algorithms for routing weighted packets in various network settings. Although different techniques were applied...
Yossi Azar, Yossi Richter
SIGMETRICS
2003
ACM
119views Hardware» more  SIGMETRICS 2003»
15 years 4 months ago
Incrementally improving lookup latency in distributed hash table systems
Distributed hash table (DHT) systems are an important class of peer-to-peer routing infrastructures. They enable scalable wide-area storage and retrieval of information, and will ...
Hui Zhang 0002, Ashish Goel, Ramesh Govindan
DCOSS
2009
Springer
15 years 6 months ago
Performance of Bulk Data Dissemination in Wireless Sensor Networks
Wireless sensor networks (WSNs) have recently gained a great deal of attention as a topic of research, with a wide range of applications being explored. Bulk data dissemination is ...
Wei Dong, Chun Chen, Xue Liu, Jiajun Bu, Yunhao Li...
SENSYS
2004
ACM
15 years 5 months ago
Synopsis diffusion for robust aggregation in sensor networks
Previous approaches for computing duplicate-sensitive aggregates in sensor networks (e.g., in TAG) have used a tree topology, in order to conserve energy and to avoid double-count...
Suman Nath, Phillip B. Gibbons, Srinivasan Seshan,...
SIGCOMM
2009
ACM
15 years 6 months ago
A programmable overlay router for service provider innovation
The threat of commoditization poses a real challenge for service providers. While the end-to-end principle is often paraphrased as “dumb network, smart end-systems”, the origi...
Bruce S. Davie, Jan Medved