Sciweavers

881 search results - page 100 / 177
» A decentralized task scheduling algorithm and its performanc...
Sort
View
SIGMETRICS
2004
ACM
105views Hardware» more  SIGMETRICS 2004»
14 years 2 months ago
A model of BGP routing for network engineering
The performance of IP networks depends on a wide variety of dynamic conditions. Traffic shifts, equipment failures, planned maintenance, and topology changes in other parts of th...
Nick Feamster, Jared Winick, Jennifer Rexford
MOBIHOC
2003
ACM
14 years 8 months ago
Lightweight sensing and communication protocols for target enumeration and aggregation
The development of lightweight sensing and communication protocols is a key requirement for designing resource constrained sensor networks. This paper introduces a set of efficien...
Qing Fang, Feng Zhao, Leonidas J. Guibas
PERCOM
2007
ACM
14 years 8 months ago
Sensor Scheduling for Optimal Observability Using Estimation Entropy
We consider sensor scheduling as the optimal observability problem for partially observable Markov decision processes (POMDP). This model fits to the cases where a Markov process ...
Mohammad Rezaeian
ICNP
1998
IEEE
14 years 1 months ago
On Reducing the Processing Cost of On-Demand QoS Path Computation
Quality of Service (QoS) routing algorithms have become the focus of recent research due to their potential for increasing the utilization of an Integrated Services Packet Network...
George Apostolopoulos, Satish K. Tripathi
EUROPAR
2010
Springer
13 years 10 months ago
Hierarchical Work-Stealing
Abstract. We study the problem of dynamic load-balancing on hierarchical platforms. In particular, we consider applications involving heavy communications on a distributed platform...
Jean-Noël Quintin, Frédéric Wag...