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...
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...
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...
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...
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...
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...
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...
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...
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...
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...