Sciweavers

Share
SIGMETRICS
2010
ACM
131views Hardware» more  SIGMETRICS 2010»
8 years 4 months ago
Energy efficient management of two cellular access networks
In this paper we evaluate the energy saving that can be achieved with the energy-aware cooperative management of the cellular access networks of two operators offering service ove...
Marco Ajmone Marsan, Michela Meo
SIGMETRICS
2010
ACM
115views Hardware» more  SIGMETRICS 2010»
8 years 4 months ago
The average response time in a heavy-traffic srpt queue
Shortest Remaining Processing Time first (SRPT) has long been known to optimize the queue length distribution and the mean response time (a.k.a. flow time, sojourn time). As such,...
Minghong Lin, Adam Wierman, Bert Zwart
SIGMETRICS
2010
ACM
106views Hardware» more  SIGMETRICS 2010»
8 years 4 months ago
Distributed averaging in dynamic networks
Shreevatsa Rajagopalan, Devavrat Shah
SIGMETRICS
2010
ACM
174views Hardware» more  SIGMETRICS 2010»
8 years 7 months ago
Decomposition results for an m/m/k with staggered setup
In this paper, we consider an M/M/k queueing system with setup costs. Servers are turned off when there is no work to do, but turning on an off server incurs a setup cost. The s...
Anshul Gandhi, Mor Harchol-Balter, Ivo Adan
SIGMETRICS
2010
ACM
152views Hardware» more  SIGMETRICS 2010»
8 years 7 months ago
A fluid approximation for large-scale service systems
We introduce and analyze a deterministic fluid model that serves as an approximation for the Gt/GI/st + GI manyserver queueing model, which has a general time-varying arrival pro...
Yunan Liu, Ward Whitt
SIGMETRICS
2010
ACM
147views Hardware» more  SIGMETRICS 2010»
8 years 7 months ago
On random walks in direction-aware network problems
Graph theory provides a powerful set of metrics and conceptual ideas to model and investigate the behavior of communication networks. Most graph-theoretical frameworks in the netw...
Ali Tizghadam, Alberto Leon-Garcia
SIGMETRICS
2010
ACM
122views Hardware» more  SIGMETRICS 2010»
8 years 7 months ago
Heavy-traffic limits for nearly deterministic queues
We establish heavy-traffic limits for nearly deterministic queues, such as the G/D/n many-server queue. Since waiting times before starting service in the G/D/n queue are equivale...
Karl Sigman, Ward Whitt
SIGMETRICS
2010
ACM
215views Hardware» more  SIGMETRICS 2010»
8 years 7 months ago
Quantifying the sustainability impact of data center availability
Data center availability is critical considering the explosive growth in Internet services and people’s dependence on them. Furthermore, in recent years, sustainability has beco...
Manish Marwah, Paulo Romero Martins Maciel, Amip S...
SIGMETRICS
2010
ACM
180views Hardware» more  SIGMETRICS 2010»
8 years 7 months ago
Route oracle: where have all the packets gone?
Many network-management problems in large backbone networks need the answer to a seemingly simple question: where does a given IP packet, entering the network at a particular plac...
Yaping Zhu, Jennifer Rexford, Subhabrata Sen, Aman...
books