We consider a controlled queueing system of the G/M/n/B +GI type, with many servers and impatient customers. The queue-capacity B is the control process. Customers who arrive to a full queue are blocked and customers who wait too long in the queue abandon. We study the tradeoff between blocking and abandonment, with cost accumulated over a random, finite time-horizon, which yields a queueing co...

We consider a controlled queueing system of the G/M/n/B +M type, with many servers and impatient customers. The queue-capacity B is the control process. Customers who arrive to a full queue are blocked and customers who wait too long in the queue abandon. We study the tradeoff between blocking and abandonment, with cost accumulated over a random, finite time-horizon, which yields a queueing con...

This paper investigates a risk-averse inventory model by balancing the expected profit and conditional value-at-risk (CVaR) in a newsvendor model setting. We find out that: i) The optimal order quantity is increasing in the shortage cost for both the CVaR only criterion and the tradeoff objective. ii) For the case of zero shortage cost, the optimal order quantity to the CVaR criterion or tradeo...

ed from Tradeoff Model 1 r ff l ( ) 1 ⋅ T Tradeoff Model 2 r ff l ( ) 2 ⋅ T Tradeoff Model L r ff l ( ) L ⋅ T ... Select the 1 l L ∈ ... with the smallest ( ) ( ) * * 0 l − T y T y ... (b) Figure 3.3: Illustration of two procedures for making selection decisions using tradeoff models. Approach (a) involves an independent optimization problem for each tradeoff model; approach (b) requires only o...

In this paper, we study some of the design tradeoffs of video streaming systems in networks with QoS guarantees. We approach this problem by using a utility function to quantify the benefit a user derives from the quality of the received video sequence. We also consider the cost to the network user for streaming the video sequence. We have formulated this utility maximization problem as a joint...

Time memory tradeoff algorithms are tools for inverting oneway functions, and they are often used to recover passwords from unsalted password hashes. There are many publicly known tradeoff algorithms, and the rainbow tradeoff is widely believed to be the best algorithm. This work provides an accurate complexity analysis of the fuzzy rainbow tradeoff algorithm, which has not yet received much at...

With the recent advances of the VLSI technologies, stabilizing the physical behavior of VLSI chips is becoming a very complicated problem. Power grid optimization is required to minimize the risks of timing error by IR drop, defects by electro migration (EM), and manufacturing cost by the chip size. This problem includes complicated tradeoff relationships. We propose a new approach by observing...

In this paper we discuss how communication can be used advantageously for cooperative navigation in sparse environments. Specifically, we analyze the tradeoff between the cost of communication cost and the efficient completion of the navigation task. We make use of a partially observable Markov decision process (POMDP) to model the navigation task, since this model allows to explicitly consider...

The problem of minimum cost in-network fusion of measurements, collected from distributed sensors via multihop routing is considered. A designated fusion center collects all the sensor measurements and performs a statistical-inference test on the measurements, which are spatially correlated according to a Markov random field. Conditioned on the delivery of a sufficient statistic to the fusion c...