Sciweavers

33 search results - page 3 / 7
» Upper Bound on Pattern Storage in Feedforward Networks
Sort
View
INFOCOM
2007
IEEE
14 years 9 days ago
Oblivious Routing with Mobile Fusion Centers over a Sensor Network
— We consider the problem of aggregating data at a mobile fusion center (fusor) (eg. a PDA or a cellular phone) moving within a spatial region over which a wireless sensor networ...
Devavrat Shah, Sanjay Shakkottai
INFOCOM
2005
IEEE
13 years 11 months ago
Bounding the power rate function of wireless ad hoc networks
Abstract— Given a wireless ad hoc network and an endto-end traffic pattern, the power rate function refers to the minimum total power required to support different throughput un...
Yunnan Wu, Qian Zhang, Wenwu Zhu, Sun-Yuan Kung
CORR
2010
Springer
121views Education» more  CORR 2010»
13 years 6 months ago
Symmetric Allocations for Distributed Storage
We consider the problem of optimally allocating a given total storage budget in a distributed storage system. A source has a data object which it can code and store over a set of s...
Derek Leong, Alexandros G. Dimakis, Tracey Ho
IPPS
2006
IEEE
14 years 19 hour ago
Performance Analysis of the Reactor Pattern in Network Services
The growing reliance on services provided by software applications places a high premium on the reliable and efficient operation of these applications. A number of these applicat...
Swapna S. Gokhale, Aniruddha S. Gokhale, Jeffrey G...
SIGMETRICS
2008
ACM
161views Hardware» more  SIGMETRICS 2008»
13 years 5 months ago
Bound analysis of closed queueing networks with workload burstiness
Burstiness and temporal dependence in service processes are often found in multi-tier architectures and storage devices and must be captured accurately in capacity planning models...
Giuliano Casale, Ningfang Mi, Evgenia Smirni