Sciweavers

Share
PE
2015
Springer
54views Optimization» more  PE 2015»
2 years 10 months ago
On optimal monitor placement for localizing node failures via network tomography
We investigate the problem of placing monitors to localize node failures in a communication network from binary states (normal/failed) of end-to-end paths, under the assumption th...
Liang Ma, Ting He, Ananthram Swami, Don Towsley, K...
PE
2015
Springer
17views Optimization» more  PE 2015»
2 years 10 months ago
Dynamic service migration and workload scheduling in edge-clouds
Edge-clouds provide a promising new approach to significantly reduce network operational costs by moving computation closer to the edge. A key challenge in such systems is to dec...
Rahul Urgaonkar, Shiqiang Wang, Ting He, Murtaza Z...
PE
2015
Springer
15views Optimization» more  PE 2015»
2 years 10 months ago
Construction of Markov chains for discrete time MAP/PH/K queues
Two GI/M/1 type Markov chains associated with the queue length are often used in analyzing the discrete time MAP/PH/K queue. The first Markov chain is introduced by tracking servic...
Qi-Ming He, Attahiru Sule Alfa
PE
2015
Springer
19views Optimization» more  PE 2015»
2 years 10 months ago
Greening multi-tenant data center demand response
Data centers have emerged as promising resources for demand response, particularly for emergency demand response (EDR), which saves the power grid from incurring blackouts during ...
Niangjun Chen, Xiaoqi Ren, Shaolei Ren, Adam Wierm...
PE
2015
Springer
12views Optimization» more  PE 2015»
2 years 10 months ago
Queueing analysis of peer-to-peer swarms: Stationary distributions and their scaling limits
In this paper we analyze the dynamics of a P2P file exchange swarm from a queueing standpoint. In such systems, the service rate a peer receives depends on one mostly fixed comp...
Andrés Ferragut, Fernando Paganini
PE
2015
Springer
21views Optimization» more  PE 2015»
2 years 10 months ago
A discrete-time queue with customers with geometric deadlines
This paper studies a discrete-time queueing system where each customer has a maximum allowed sojourn time in the system, referred to as the “deadline” of the customer. More sp...
Herwig Bruneel, Tom Maertens
PE
2015
Springer
22views Optimization» more  PE 2015»
2 years 10 months ago
On optimal policies for energy-aware servers
As energy costs and energy used by server farms increase, so does the desire to implement energy-aware policies. Although under some metrics, optimal policies for single as well a...
Vincent J. Maccio, Douglas G. Down
PE
2015
Springer
25views Optimization» more  PE 2015»
2 years 10 months ago
Characterizing the impact of the workload on the value of dynamic resizing in data centers
Energy consumption imposes a significant cost for data centers; yet much of that energy is used to maintain excess service capacity during periods of predictably low load. Result...
Kai Wang, Minghong Lin, Florin Ciucu, Adam Wierman...
PE
2015
Springer
20views Optimization» more  PE 2015»
2 years 10 months ago
RECAST: Telling apart social and random relationships in dynamic networks
In this paper, we argue that the ability to accurately spot random and social relationships in dynamic networks is essential to network applications that rely on human routines, s...
Pedro O. S. Vaz de Melo, Aline Carneiro Viana, Mar...
PE
2015
Springer
29views Optimization» more  PE 2015»
2 years 10 months ago
Receding learning-aided control in stochastic networks
In this paper, we develop the Receding Learning-aided Control algorithm (RLC) for solving optimization problems in general stochastic networks with potentially non-stationary syst...
Longbo Huang
books