In this paper, we focus on tradeoffs between storage cost and rekeying cost for secure multicast. Specifically, we present a family of algorithms that provide a tradeoff between the number of keys maintained by users and the time required for rekeying due to revocation of multiple users. We show that some well known algorithms in the literature are members of this family. We show that algorithm...

In this paper, we analyze the performance of one-hop network coding in multi-hop networks and optimize it by two solutions. One is evaluating cost-delay tradeoff of opportunistic network coding in a two-way relay network with asymmetric arrival rates, we first formulate the variance of the queue into a Markov chain and derive the transition probability and the stable distribution. Then we analy...

A tradeoff is a situation that involves losing one quality or aspect of something in return for gaining another quality or aspect. Speaking about the tradeoff between performance and security indicates that both, performance and security, can be measured, and that to increase one, we have to pay in terms of the other. While established metrics for performance of systems exist this is not quite ...

Despite the benefits of resistance, susceptibility to infectious disease is commonplace. Although specific susceptibility may be considered an inevitable consequence of the co-evolutionary arms race between parasite and host, a more general constraint may arise from the cost of an immune response. This "cost" hypothesis predicts a tradeoff between immune defense and other components of fitness....

We revisit the well-studied problem of constructing strategyproof approximation mechanisms for facility location games, but offer a fundamentally new perspective by considering risk averse designers. Specifically, we are interested in the tradeoff between a randomized strategyproof mechanism’s approximation ratio, and its variance (which has long served as a proxy for risk). When there is just ...

The purpose of this paper is to present the possibility of replacing physical unit cost in transportation or distribution problems by an aggregate coefficient, getting qualitative and subjective considerations involved. The model for constructing aggregate cost is a two stage multiple attribute decision-making problems. In the first stage supply points, demand points and routes of transportatio...

We consider the problem of scheduling n jobs without precedence constraints on m uniform machines (i.e., the machines are identical except for speed), with preemptions allowed at no cost. We are interested in generating the entire tradeoff curve of schedules which are Pareto-optimal (undominated) for the flowtime and makespan objectives. To achieve this, we first develop an O(mn) algorithm that...