Kadloor, S. and Kiyavash, N.. (2015) Delay-Privacy Tradeoff in the Design of Scheduling Policies. Ieee Transactions on Information Theory, 61 (5). pp. 2557-2573.
Full text not available from this repository.Abstract
Traditionally, scheduling policies have been optimized to perform well on metrics, such as throughput, delay, and fairness. In the context of shared event schedulers, where a common processor is shared among multiple users, one also has to consider the privacy offered by the scheduling policy. The privacy offered by a scheduling policy measures how much information about the usage pattern of one user of the system can be learned by another as a consequence of sharing the scheduler. We introduced an estimation error-based metric to quantify this privacy. We showed that the most commonly deployed scheduling policy, the first-come-first-served offers very little privacy to its users. We also proposed a parametric nonwork conserving policy, which traded off delay for improved privacy. In this paper, we ask the question, is a tradeoff between delay and privacy fundamental to the design to scheduling policies? In particular, is there a work conserving, possibly randomized, and scheduling policy that scores high on the privacy metric? Answering the first question, we show that there does exist a fundamental limit on the privacy performance of a work-conserving scheduling policy. We quantify this limit. Furthermore, answering the second question, we demonstrate that the round-robin scheduling policy (deterministic policy) is privacy optimal within the class of work-conserving policies.
| Item Type: | Article |
|---|---|
| Additional Information: | ISI Document Delivery No.: CG7WATimes Cited: 0Cited Reference Count: 29Kadloor, Sachin Kiyavash, NegarCenter for Hierarchical Manufacturing, National Science Foundation FA 9550-10-1-0345; FA 9550-11-1-0016; FA 9550-10-1-0573; 727 AF Sub; TX 0200-07UIManuscript received February 28, 2014; revised September 25, 2014; accepted February 1, 2015. Date of publication February 24, 2015; date of current version April 17, 2015. This work was supported in part by the Center for Hierarchical Manufacturing, National Science Foundation under Grant FA 9550-10-1-0345, in part by the Research Project under Grant FA 9550-11-1-0016 and Grant FA 9550-10-1-0573, and in part by the 727 AF Sub under Grant TX 0200-07UI. This paper was presented at the 2013 International Conference on Computer Communications.0Ieee-inst electrical electronics engineers incPiscataway1557-9654 |
| Uncontrolled Keywords: | Engineering |
| Collections: | Nanomanufacturing Research Collection > Nanomanufacturing Nanoscale Science and Engineering Centers > Center for Hierarchical Manufacturing |
| Depositing User: | Robert Stevens |
| Date Deposited: | 12 Nov 2015 18:38 |
| Last Modified: | 12 Nov 2015 18:38 |
| URI: | http://eprints.internano.org/id/eprint/2327 |
Actions (login required)
 |
View Item |
