Sciweavers

284 search results - page 55 / 57
» Distributed Agreement with Optimal Communication Complexity
Sort
View
77
Voted
ICC
2011
IEEE
201views Communications» more  ICC 2011»
13 years 9 months ago
Survivable Optical Grid Dimensioning: Anycast Routing with Server and Network Failure Protection
Abstract—Grids can efficiently deal with challenging computational and data processing tasks which cutting edge science is generating today. So-called e-Science grids cope with ...
Chris Develder, Jens Buysse, Ali Shaikh, Brigitte ...
MOBIHOC
2008
ACM
15 years 9 months ago
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...
Yiwei Wu, Yingshu Li
DAGSTUHL
2007
14 years 11 months ago
Programming self developing blob machines for spatial computing.
: This is a position paper introducing blob computing: A Blob is a generic primitive used to structure a uniform computing substrate into an easier-to-program parallel virtual mach...
Frédéric Gruau, Christine Eisenbeis
SIGMETRICS
2008
ACM
181views Hardware» more  SIGMETRICS 2008»
14 years 9 months ago
Counter braids: a novel counter architecture for per-flow measurement
Fine-grained network measurement requires routers and switches to update large arrays of counters at very high link speed (e.g. 40 Gbps). A naive algorithm needs an infeasible amo...
Yi Lu, Andrea Montanari, Balaji Prabhakar, Sarang ...
GLOBECOM
2008
IEEE
15 years 4 months ago
Network Resource Allocation for Competing Multiple Description Transmissions
Providing real-time multimedia services over a best-effort network is challenging due to the stringent delay requirements in the presence of complex network dynamics. Multiple des...
Ying Li, Chao Tian, Suhas N. Diggavi, Mung Chiang,...