Sciweavers

302 search results - page 47 / 61
» On Queues with Inter-Arrival Times Proportional to Service T...
Sort
View
SENSYS
2003
ACM
14 years 24 days ago
Differentiated surveillance for sensor networks
For many sensor network applications such as military surveillance, it is necessary to provide full sensing coverage to a security-sensitive area while at the same time minimizing...
Ting Yan, Tian He, John A. Stankovic
EURONGI
2006
Springer
13 years 11 months ago
Job Scheduling for Maximal Throughput in Autonomic Computing Systems
Abstract. Autonomic computing networks manage multiple tasks over a distributed network of resources. In this paper, we view an autonomic computing system as a network of queues, w...
Kevin Ross, Nicholas Bambos
IPSN
2010
Springer
14 years 2 months ago
Routing without routes: the backpressure collection protocol
Current data collection protocols for wireless sensor networks are mostly based on quasi-static minimum-cost routing trees. We consider an alternative, highly-agile approach calle...
Scott Moeller, Avinash Sridharan, Bhaskar Krishnam...
SIMPRA
2011
13 years 2 months ago
Virtual segment: Store-carry-forward relay-based support for wide-area non-real-time data exchange
—In the Internet of the future, a flexible, dynamic combination of wireless and wired access networks is expected to be a key driver for enlarging the broadband communication se...
Shinya Yamamura, Akira Nagata, Masato Tsuru, Hitom...
SIGMETRICS
2008
ACM
159views Hardware» more  SIGMETRICS 2008»
13 years 7 months ago
Weighted fair sharing for dynamic virtual clusters
In a shared server infrastructure, a scheduler controls how quantities of resources are shared over time in a fair manner across multiple, competing consumers. It should support w...
Laura E. Grit, Jeffrey S. Chase