262 search results - page 32 / 53 » Stability bounds in networks with dynamic link capacities |
STOC
2005
ACM
15 years 10 months ago
2005
ACM
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
EURONGI
2006
Springer
15 years 1 months ago
2006
Springer
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...
TWC
2008
14 years 9 months ago
2008
Traffic scheduling is key to the provision of quality of service (QoS) differentiation and guarantees in wireless networks. Unlike its wireline counterpart, wireless communications...
DIALM
2005
ACM
14 years 11 months ago
2005
ACM
We investigate to what extent flooding and routing is possible if the graph is allowed to change unpredictably at each time step. We study what minimal requirements are necessary...
106
click to vote
GLOBECOM
2008
IEEE
15 years 4 months ago
2008
IEEE
—We consider the problem of joint routing, scheduling and power control in multi-hop wireless networks. We use a linear relation between link capacity and signal to interference ...