[ { "id": "https://authors.library.caltech.edu/records/qb28c-gj814", "eprint_id": 116057, "eprint_status": "archive", "datestamp": "2023-08-20 07:53:35", "lastmod": "2023-10-24 20:58:14", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Li-Tongxin", "name": { "family": "Li", "given": "Tongxin" }, "orcid": "0000-0002-9806-8964" }, { "id": "Yang-Ruixiao", "name": { "family": "Yang", "given": "Ruixiao" } }, { "id": "Qu-Guannan", "name": { "family": "Qu", "given": "Guannan" }, "orcid": "0000-0002-5466-3550" }, { "id": "Shi-Guanya", "name": { "family": "Shi", "given": "Guanya" }, "orcid": "0000-0002-9075-3705" }, { "id": "Yu-Chenkai", "name": { "family": "Yu", "given": "Chenkai" }, "orcid": "0000-0001-8683-7773" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" }, "orcid": "0000-0002-5923-0199" }, { "id": "Low-S-H", "name": { "family": "Low", "given": "Steven" }, "orcid": "0000-0001-6476-3048" } ] }, "title": "Robustness and Consistency in Linear Quadratic Control with Untrusted Predictions", "ispublished": "unpub", "full_text_status": "public", "note": "\u00a9 2022 Copyright held by the owner/author(s). \n\nThis work is supported by the National Science Foundation, under grants ECCS1931662, CCF 1637598, ECCS 1619352, CPS 1739355, AitF-1637598, CNS-1518941, PIMCO and Amazon Web Services. Tongxin Li and Ruixiao Yang contributed equally to the paper.\n\n
Published - 3489048.3522658.pdf
Submitted - 2106.09659.pdf
", "abstract": "We study the problem of learning-augmented predictive linear quadratic control. Our goal is to design a controller that balances \"consistency\", which measures the competitive ratio when predictions are accurate, and \"robustness\", which bounds the competitive ratio when predictions are inaccurate. We propose a novel \u03bb-confident controller and prove that it maintains a competitive ratio upper bound of 1 + min {O(\u03bb\u00b2\u03b5)+ O(1-\u03bb)\u00b2,O(1)+O(\u03bb\u00b2)} where \u03bb\u2208 [0,1] is a trust parameter set based on the confidence in the predictions, and \u03b5 is the prediction error. Further, motivated by online learning methods, we design a self-tuning policy that adaptively learns the trust parameter \u03bb with a competitive ratio that depends on \u03b5 and the variation of system perturbations and predictions. We show that its competitive ratio is bounded from above by 1+O(\u03b5) /(\u0398)(1)+\u0398(\u03b5))+O(\u03bcVar) where \u03bcVar measures the variation of perturbations and predictions. It implies that by automatically adjusting the trust parameter online, the self-tuning scheme ensures a competitive ratio that does not scale up with the prediction error \u03b5.", "date": "2022-06-06", "date_type": "published", "publisher": "ACM", "id_number": "CaltechAUTHORS:20220802-839213000", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20220802-839213000", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "ECCS-1931662" }, { "agency": "NSF", "grant_number": "CCF-1637598" }, { "agency": "NSF", "grant_number": "ECCS-1619352" }, { "agency": "NSF", "grant_number": "ECCS-1739355" }, { "agency": "NSF", "grant_number": "CCF-1637598" }, { "agency": "NSF", "grant_number": "CNS-1518941" }, { "agency": "PIMCO" }, { "agency": "Amazon Web Services" } ] }, "doi": "10.1145/3489048.3522658", "primary_object": { "basename": "3489048.3522658.pdf", "url": "https://authors.library.caltech.edu/records/qb28c-gj814/files/3489048.3522658.pdf" }, "related_objects": [ { "basename": "2106.09659.pdf", "url": "https://authors.library.caltech.edu/records/qb28c-gj814/files/2106.09659.pdf" } ], "resource_type": "book_section", "pub_year": "2022", "author_list": "Li, Tongxin; Yang, Ruixiao; et el." }, { "id": "https://authors.library.caltech.edu/records/rm6ns-gjy67", "eprint_id": 113733, "eprint_status": "archive", "datestamp": "2023-08-22 15:49:34", "lastmod": "2023-10-23 23:12:43", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Pan-Weici", "name": { "family": "Pan", "given": "Weici" } }, { "id": "Shi-Guanya", "name": { "family": "Shi", "given": "Guanya" }, "orcid": "0000-0002-9075-3705" }, { "id": "Lin-Yiheng", "name": { "family": "Lin", "given": "Yiheng" }, "orcid": "0000-0001-6524-2877" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" }, "orcid": "0000-0002-5923-0199" } ] }, "title": "Online Optimization with Feedback Delay and Nonlinear Switching Cost", "ispublished": "unpub", "full_text_status": "public", "keywords": "online learning; online optimization; online control", "note": "\u00a9 2022 Copyright held by the owner/author(s).\n\nPublished - 3489048.3522657.pdf
Submitted - 2111.00095.pdf
", "abstract": "We study a variant of online optimization in which the learner receives k-round delayed feedback about hitting cost and there is a multi-step nonlinear switching cost, i.e., costs depend on multiple previous actions in a nonlinear manner. Our main result shows that a novel Iterative Regularized Online Balanced Descent (iROBD) algorithm has a constant, dimension-free competitive ratio that is O(L^(2k)), where L is the Lipschitz constant of the nonlinear switching cost. Additionally, we provide lower bounds that illustrate the Lipschitz condition is required and the dependencies on k and L are tight. Finally, via reductions, we show that this setting is closely related to online control problems with delay, nonlinear dynamics, and adversarial disturbances, where iROBD directly offers constant-competitive online policies. This extended abstract is an abridged version of [2].", "date": "2022-06", "date_type": "published", "publisher": "Association for Computing Machinery", "place_of_pub": "New York, NY", "pagerange": "81-82", "id_number": "CaltechAUTHORS:20220304-172341428", "isbn": "978-1-4503-9141-2", "book_title": "Abstract Proceedings of the 2022 ACM SIGMETRICS/IFIP PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20220304-172341428", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/3489048.3522657", "primary_object": { "basename": "2111.00095.pdf", "url": "https://authors.library.caltech.edu/records/rm6ns-gjy67/files/2111.00095.pdf" }, "related_objects": [ { "basename": "3489048.3522657.pdf", "url": "https://authors.library.caltech.edu/records/rm6ns-gjy67/files/3489048.3522657.pdf" } ], "resource_type": "book_section", "pub_year": "2022", "author_list": "Pan, Weici; Shi, Guanya; et el." }, { "id": "https://authors.library.caltech.edu/records/rqwbe-dd932", "eprint_id": 120062, "eprint_status": "archive", "datestamp": "2023-08-20 07:50:30", "lastmod": "2023-10-23 15:19:21", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Shi-Yuanyuan", "name": { "family": "Shi", "given": "Yuanyuan" }, "orcid": "0000-0002-6182-7664" }, { "id": "Qu-Guannan", "name": { "family": "Qu", "given": "Guannan" }, "orcid": "0000-0002-5466-3550" }, { "id": "Low-S-H", "name": { "family": "Low", "given": "Steven" }, "orcid": "0000-0001-6476-3048" }, { "id": "Anandkumar-A", "name": { "family": "Anandkumar", "given": "Anima" }, "orcid": "0000-0002-6974-6797" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" }, "orcid": "0000-0002-5923-0199" } ] }, "title": "Stability Constrained Reinforcement Learning for Real-Time Voltage Control", "ispublished": "unpub", "full_text_status": "public", "note": "Code and data are available at https://github.com/Yuanyuan-Shi/StableRL-VoltageCtrl.", "abstract": "Deep reinforcement learning (RL) has been recognized as a promising tool to address the challenges in real-time control of power systems. However, its deployment in real-world power systems has been hindered by a lack of formal stability and safety guarantees. In this paper, we propose a stability constrained reinforcement learning method for real-time voltage control in distribution grids and we prove that the proposed approach provides a formal voltage stability guarantee. The key idea underlying our approach is an explicitly constructed Lyapunov function that certifies stability. We demonstrate the effectiveness of the approach in case studies, where the proposed method can reduce the transient control cost by more than 30% and shorten the response time by a third compared to a widely used linear policy, while always achieving voltage stability. In contrast, standard RL methods often fail to achieve voltage stability.", "date": "2022-06", "date_type": "published", "publisher": "IEEE", "place_of_pub": "Piscataway, NJ", "pagerange": "2715-2721", "id_number": "CaltechAUTHORS:20230315-336401000.3", "book_title": "2022 American Control Conference (ACC)", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20230315-336401000.3", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.23919/acc53348.2022.9867476", "resource_type": "book_section", "pub_year": "2022", "author_list": "Shi, Yuanyuan; Qu, Guannan; et el." }, { "id": "https://authors.library.caltech.edu/records/p99an-mjp78", "eprint_id": 115283, "eprint_status": "archive", "datestamp": "2023-08-20 06:17:44", "lastmod": "2023-10-24 15:30:32", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Qu-Guannan", "name": { "family": "Qu", "given": "Guannan" }, "orcid": "0000-0002-5466-3550" }, { "id": "Yu-Chenkai", "name": { "family": "Yu", "given": "Chenkai" }, "orcid": "0000-0001-8683-7773" }, { "id": "Low-S-H", "name": { "family": "Low", "given": "Steven" }, "orcid": "0000-0001-6476-3048" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" }, "orcid": "0000-0002-5923-0199" } ] }, "title": "Exploiting Linear Models for Model-Free Nonlinear Control: A Provably Convergent Policy Gradient Approach", "ispublished": "unpub", "full_text_status": "restricted", "note": "\u00a9 2021 IEEE.", "abstract": "Model-free learning-based control methods have seen great success recently. However, such methods typically suffer from poor sample complexity and limited convergence guarantees. This is in sharp contrast to classical model-based control, which has a rich theory but typically requires strong modeling assumptions. In this paper, we combine the two approaches. We consider a dynamical system with both linear and non-linear components and use the linear model to define a warm start for a model-free, policy gradient method. We show this hybrid approach outperforms the model-based controller while avoiding the convergence issues associated with model-free approaches via both numerical experiments and theoretical analyses, in which we derive sufficient conditions on the non-linear component such that our approach is guaranteed to converge to the (nearly) global optimal controller.", "date": "2021-12-14", "date_type": "published", "publisher": "IEEE", "place_of_pub": "Piscataway, NJ", "pagerange": "6539-6546", "id_number": "CaltechAUTHORS:20220628-677879700", "isbn": "978-1-6654-3659-5", "book_title": "2021 60th IEEE Conference on Decision and Control (CDC)", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20220628-677879700", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1109/cdc45484.2021.9683735", "resource_type": "book_section", "pub_year": "2021", "author_list": "Qu, Guannan; Yu, Chenkai; et el." }, { "id": "https://authors.library.caltech.edu/records/qw767-p4h24", "eprint_id": 117377, "eprint_status": "archive", "datestamp": "2023-08-20 06:09:13", "lastmod": "2023-10-24 22:30:27", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Lin-Yiheng", "name": { "family": "Lin", "given": "Yiheng" }, "orcid": "0000-0001-6524-2877" }, { "id": "Hu-Yang", "name": { "family": "Hu", "given": "Yang" } }, { "id": "Shi-Guanya", "name": { "family": "Shi", "given": "Guanya" }, "orcid": "0000-0002-9075-3705" }, { "id": "Sun-Haoyuan", "name": { "family": "Sun", "given": "Haoyuan" }, "orcid": "0000-0002-6203-0198" }, { "id": "Qu-Guannan", "name": { "family": "Qu", "given": "Guannan" }, "orcid": "0000-0002-5466-3550" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" }, "orcid": "0000-0002-5923-0199" } ] }, "title": "Perturbation-based Regret Analysis of Predictive Control in Linear Time Varying Systems", "ispublished": "unpub", "full_text_status": "public", "note": "Yiheng Lin, Yang Hu, Haoyuan Sun, Guanya Shi, and Guannan Qu contributed equally to this work. \n\nThis work was supported by NSF grants CNS-2106403, NGSDI-2105648, and AitF-1637598, with additional support from Amazon AWS, PIMCO, and the Resnick Sustainability Insitute. Yiheng Lin was supported by Kortschak Scholars program.", "abstract": "We study predictive control in a setting where the dynamics are time-varying and linear, and the costs are time-varying and well-conditioned. At each time step, the controller receives the exact predictions of costs, dynamics, and disturbances for the future k time steps. We show that when the prediction window k is sufficiently large, predictive control is input-to-state stable and achieves a dynamic regret of O(\u03bb^kT), where \u03bb < 1 is a positive constant. This is the first dynamic regret bound on the predictive control of linear time-varying systems. We also show a variation of predictive control obtains the first competitive bound for the control of linear time-varying systems: 1 + O(\u03bb^k). Our results are derived using a novel proof framework based on a perturbation bound that characterizes how a small change to the system parameters impacts the optimal trajectory.", "date": "2021-12", "date_type": "published", "publisher": "Advances in Neural Information Processing Systems", "pagerange": "1-12", "id_number": "CaltechAUTHORS:20221012-231545995", "isbn": "9781713845393", "book_title": "Advances in Neural Information Processing Systems 34 (NeurIPS 2021)", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20221012-231545995", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CNS-2106403" }, { "agency": "NSF", "grant_number": "CNS-2105648" }, { "agency": "NSF", "grant_number": "CCF-1637598" }, { "agency": "Amazon Web Services" }, { "agency": "PIMCO" }, { "agency": "Resnick Sustainability Institute" }, { "agency": "Kortschak Scholars Program" } ] }, "local_group": { "items": [ { "id": "Resnick-Sustainability-Institute" } ] }, "contributors": { "items": [ { "id": "Ranzato-M", "name": { "family": "Ranzato", "given": "M." } }, { "id": "Beygelzimer-A", "name": { "family": "Beygelzimer", "given": "A." } }, { "id": "Dauphin-Y", "name": { "family": "Dauphin", "given": "Y." } }, { "id": "Liang-P-S", "name": { "family": "Liang", "given": "P. S." } }, { "id": "Wortman-Vaughan-Jennifer", "name": { "family": "Wortman Vaughan", "given": "J." }, "orcid": "0000-0002-7807-2018" } ] }, "resource_type": "book_section", "pub_year": "2021", "author_list": "Lin, Yiheng; Hu, Yang; et el." }, { "id": "https://authors.library.caltech.edu/records/heq72-bgy59", "eprint_id": 110650, "eprint_status": "archive", "datestamp": "2023-08-20 05:47:29", "lastmod": "2023-10-23 19:47:09", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Bashir-Noman", "name": { "family": "Bashir", "given": "Noman" } }, { "id": "Guo-Tian", "name": { "family": "Guo", "given": "Tian" }, "orcid": "0000-0003-0060-2266" }, { "id": "Hajiesmaili-Mohammad-H", "name": { "family": "Hajiesmaili", "given": "Mohammad" }, "orcid": "0000-0001-9278-2254" }, { "id": "Irwin-David", "name": { "family": "Irwin", "given": "David" } }, { "id": "Shenoy-Prashant", "name": { "family": "Shenoy", "given": "Prashant" }, "orcid": "0000-0002-5435-1901" }, { "id": "Sitaraman-Ramesh", "name": { "family": "Sitaraman", "given": "Ramesh" }, "orcid": "0000-0003-0558-6875" }, { "id": "Souza-Abel", "name": { "family": "Souza", "given": "Abel" }, "orcid": "0000-0001-6952-1195" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" }, "orcid": "0000-0002-5923-0199" } ] }, "title": "Enabling Sustainable Clouds: The Case for Virtualizing the Energy System", "ispublished": "unpub", "full_text_status": "public", "keywords": "Carbon-efficiency, virtualization, cloud computing, edge", "note": "\u00a9 2021 Copyright held by the owner/author(s). \n\nWe thank our shepherd Sangeetha Abdu Jyothi and the reviewers for their comments, electricityMap for the carbon data, and AWS. This work is funded by NSF grants 2105494, 2045641, and VMware.\n\nPublished - 3472883.3487009.pdf
Submitted - 2106.08872.pdf
", "abstract": "Cloud platforms' growing energy demand and carbon emissions are raising concern about their environmental sustainability. The current approach to enabling sustainable clouds focuses on improving energy-efficiency and purchasing carbon offsets. These approaches have limits: many cloud data centers already operate near peak efficiency, and carbon offsets cannot scale to near zero carbon where there is little carbon left to offset. Instead, enabling sustainable clouds will require applications to adapt to when and where unreliable low-carbon energy is available. Applications cannot do this today because their energy use and carbon emissions are not visible to them, as the energy system provides the rigid abstraction of a continuous, reliable energy supply. This vision paper instead advocates for a \"carbon first\" approach to cloud design that elevates carbon-efficiency to a firs--class metric. To do so, we argue that cloud platforms should virtualize the energy system by exposing visibility into, and software-defined control of, it to applications, enabling them to define their own abstractions for managing energy and carbon emissions based on their own requirements.", "date": "2021-11", "date_type": "published", "publisher": "Association for Computing Machinery", "place_of_pub": "New York, NY", "pagerange": "350-358", "id_number": "CaltechAUTHORS:20210831-203914693", "isbn": "978-1-4503-8638-8", "book_title": "Proceedings of the ACM Symposium on Cloud Computing (SoCC '21)", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20210831-203914693", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CNS-2105494" }, { "agency": "NSF", "grant_number": "CNS-2045641" }, { "agency": "VMware" } ] }, "doi": "10.1145/3472883.3487009", "primary_object": { "basename": "2106.08872.pdf", "url": "https://authors.library.caltech.edu/records/heq72-bgy59/files/2106.08872.pdf" }, "related_objects": [ { "basename": "3472883.3487009.pdf", "url": "https://authors.library.caltech.edu/records/heq72-bgy59/files/3472883.3487009.pdf" } ], "resource_type": "book_section", "pub_year": "2021", "author_list": "Bashir, Noman; Guo, Tian; et el." }, { "id": "https://authors.library.caltech.edu/records/fb159-j4486", "eprint_id": 110288, "eprint_status": "archive", "datestamp": "2023-08-22 10:34:26", "lastmod": "2023-10-23 19:32:51", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Liao-Guocheng", "name": { "family": "Liao", "given": "Guocheng" } }, { "id": "Su-Yu", "name": { "family": "Su", "given": "Yu" } }, { "id": "Ziani-Juba", "name": { "family": "Ziani", "given": "Juba" }, "orcid": "0000-0002-3324-4349" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" }, "orcid": "0000-0002-5923-0199" }, { "id": "Huang-Jianwei", "name": { "family": "Huang", "given": "Jianwei" } } ] }, "title": "The Privacy Paradox and Optimal Bias-Variance Trade-offs in Data Acquisition", "ispublished": "unpub", "full_text_status": "public", "keywords": "privacy paradox; mechanism design; data correlation; online platform", "note": "\u00a9 2021 Copyright held by the owner/author(s).\n\nPublished - The_Privacy_Paradox_and_Optimal_Bias-Variance_Trade-offs_in_Data_Acquisition.pdf
Submitted - 2105.14262.pdf
", "abstract": "While users claim to be concerned about privacy, often they do little to protect their privacy in their online actions. One prominent explanation for this \"privacy paradox\" is that when an individual shares her data, it is not just her privacy that is compromised; the privacy of other individuals with correlated data is also compromised. This information leakage encourages oversharing of data and significantly impacts the incentives of individuals in online platforms. In this paper, we study the design of mechanisms for data acquisition in settings with information leakage and verifiable data. We design an incentive compatible mechanism that optimizes the worst-case trade-off between bias and variance of the estimation subject to a budget constraint, where the worst-case is over the unknown correlation between costs and data. Additionally, we characterize the structure of the optimal mechanism in closed form and study monotonicity and non-monotonicity properties of the marketplace.", "date": "2021-07-18", "date_type": "published", "publisher": "Association for Computing Machinery", "place_of_pub": "New York, NY", "pagerange": "Art. No. 689", "id_number": "CaltechAUTHORS:20210817-154521920", "isbn": "978-1-4503-8554-1", "book_title": "Proceedings of the 22nd ACM Conference on Economics and Computation", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20210817-154521920", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Chinese University of Hong Kong" }, { "agency": "NSF", "grant_number": "CCF-1637598" }, { "agency": "NSF", "grant_number": "CNS-1518941" }, { "agency": "NSF", "grant_number": "CCF-1763307" }, { "agency": "University of Pennsylvania" }, { "agency": "Shenzhen Institute of Artificial Intelligence and Robotics for Society" }, { "agency": "PIMCO" } ] }, "doi": "10.1145/3465456.3467595", "primary_object": { "basename": "The_Privacy_Paradox_and_Optimal_Bias-Variance_Trade-offs_in_Data_Acquisition.pdf", "url": "https://authors.library.caltech.edu/records/fb159-j4486/files/The_Privacy_Paradox_and_Optimal_Bias-Variance_Trade-offs_in_Data_Acquisition.pdf" }, "related_objects": [ { "basename": "2105.14262.pdf", "url": "https://authors.library.caltech.edu/records/fb159-j4486/files/2105.14262.pdf" } ], "resource_type": "book_section", "pub_year": "2021", "author_list": "Liao, Guocheng; Su, Yu; et el." }, { "id": "https://authors.library.caltech.edu/records/1fzny-bps82", "eprint_id": 109657, "eprint_status": "archive", "datestamp": "2023-08-20 03:47:55", "lastmod": "2023-10-23 18:06:51", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Werner-Lucien", "name": { "family": "Werner", "given": "Lucien" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Low-S-H", "name": { "family": "Low", "given": "Steven H." }, "orcid": "0000-0001-6476-3048" } ] }, "title": "Pricing flexibility of shiftable demand in electricity markets", "ispublished": "unpub", "full_text_status": "public", "keywords": "electricity markets, demand response, mechanism design, incentives,\nflexibility, shiftable demand", "note": "\u00a9 2021 Copyright held by the owner/author(s).\nThis work is licensed under a Creative Commons Attribution International 4.0 License.\n\nPublished: 22 June 2021.\n\nThis work was supported by VMWare and NSF Grants CNS-2105648,\nAitF-1637598, CNS-1518941, NSF ECCS 1931662, and by the Resnick\nSustainability Institute at Caltech. We thank the anonymous reviewers\nfor their careful reading of this paper and for their insightful\nsuggestions.\n\nPublished - 3447555.3464847.pdf
", "abstract": "Enabling participation of demand-side flexibility in electricity markets is key to improving power system resilience and increasing the penetration of renewable generation. In this work we are motivated by the curtailment of near-zero-marginal-cost renewable resources during periods of oversupply, a particularly important cause of inefficient generation dispatch. Focusing on shiftable load in a multi-interval economic dispatch setting, we show that incompatible incentives arise for loads in the standard market formulation. While the system's overall efficiency increases from dispatching flexible demand, the overall welfare of loads can decrease as a result of higher spot prices. We propose a market design to address this incentive issue. Specifically, by imposing a small number of additional constraints on the economic dispatch problem, we obtain a mechanism that guarantees individual rationality for all market participants while simultaneously obtaining a more efficient dispatch. Our formulation leads to a natural definition of a uniform, time-varying flexibility price that is paid to loads to incentivize flexible bidding. We provide theoretical guarantees and empirically validate our model with simulations on real-world generation data from California Independent System Operator (CAISO).", "date": "2021-06-22", "date_type": "published", "publisher": "Association for Computing Machinery", "place_of_pub": "New York, NY", "pagerange": "1-14", "id_number": "CaltechAUTHORS:20210629-211519470", "isbn": "978-1-4503-8333-2", "book_title": "e-Energy '21: Proceedings of the Twelfth ACM International Conference on Future Energy Systems", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20210629-211519470", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "VMWare" }, { "agency": "NSF", "grant_number": "CNS-2105648" }, { "agency": "NSF", "grant_number": "CCF-1637598" }, { "agency": "NSF", "grant_number": "CNS-1518941" }, { "agency": "NSF", "grant_number": "ECCS-1931662" }, { "agency": "Resnick Sustainability Institute" } ] }, "local_group": { "items": [ { "id": "Resnick-Sustainability-Institute" } ] }, "doi": "10.1145/3447555.3464847", "primary_object": { "basename": "3447555.3464847.pdf", "url": "https://authors.library.caltech.edu/records/1fzny-bps82/files/3447555.3464847.pdf" }, "resource_type": "book_section", "pub_year": "2021", "author_list": "Werner, Lucien; Wierman, Adam; et el." }, { "id": "https://authors.library.caltech.edu/records/t7zjd-eeb92", "eprint_id": 109417, "eprint_status": "archive", "datestamp": "2023-08-22 10:04:25", "lastmod": "2023-10-23 17:55:44", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Sun-Bo", "name": { "family": "Sun", "given": "Bo" }, "orcid": "0000-0003-3172-7811" }, { "id": "Zeynali-Ali", "name": { "family": "Zeynali", "given": "Ali" } }, { "id": "Li-Tongxin", "name": { "family": "Li", "given": "Tongxin" }, "orcid": "0000-0002-9806-8964" }, { "id": "Hajiesmaili-Mohammad-H", "name": { "family": "Hajiesmaili", "given": "Mohammad" }, "orcid": "0000-0001-9278-2254" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Tsang-Danny-Hin-Kwok", "name": { "family": "Tsang", "given": "Danny H. K." }, "orcid": "0000-0003-0135-7098" } ] }, "title": "Competitive Algorithms for the Online Multiple Knapsack Problem with Application to Electric Vehicle Charging", "ispublished": "unpub", "full_text_status": "public", "keywords": "online knapsack problems; one-way trading; online algorithms; electric vehicle charging; online primal-dual analysis", "note": "\u00a9 2021 Copyright held by the owner/author(s). \n\nBo Sun and Danny H.K. Tsang acknowledge the support received from the Hong Kong Research Grant Council (RGC) General Research Fund (Project 16202619 and Project 16211220). Ali Zeynali and Mohammad Hajiesmaili's research is supported by NSF CNS-1908298 and CAREER 2045641. Tongxin Li's research is supported by NSF grants (CPS ECCS 1932611 and CPS ECCS 1739355). Adam Wierman acknowledges the support received from NSF grants (AitF-1637598 and NSF CNS-1518941). Bo Sun would also like to thank Dr. Xiaoqi Tan (University of Toronto) for insightful and useful discussions.\n\nPublished - 3410220.3456271.pdf
", "abstract": "We introduce and study a general version of the fractional online knapsack problem with multiple knapsacks, heterogeneous constraints on which items can be assigned to which knapsack, and rate-limiting constraints on the assignment of items to knapsacks. This problem generalizes variations of the knapsack problem and of the one-way trading problem that have previously been treated separately, and additionally finds application to the real-time control of electric vehicle (EV) charging. We introduce a new algorithm that achieves a competitive ratio within an additive factor of the best achievable competitive ratios for the general problem and matches or improves upon the best-known competitive ratio for special cases in the knapsack and one-way trading literatures. Moreover, our analysis provides a novel approach to online algorithm design based on an instance-dependent primal-dual analysis that connects the identification of worst-case instances to the design of algorithms. Finally, in the full version of this paper, we illustrate the proposed algorithm via trace-based experiments of EV charging.", "date": "2021-06", "date_type": "published", "publisher": "ACM", "place_of_pub": "New York, NY", "pagerange": "67-68", "id_number": "CaltechAUTHORS:20210607-115054262", "isbn": "9781450380720", "book_title": "SIGMETRICS '21: Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20210607-115054262", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Hong Kong Research Grant Council", "grant_number": "16202619" }, { "agency": "Hong Kong Research Grant Council", "grant_number": "16211220" }, { "agency": "NSF", "grant_number": "CNS-1908298" }, { "agency": "NSF", "grant_number": "CNS-2045641" }, { "agency": "NSF", "grant_number": "ECCS-1932611" }, { "agency": "NSF", "grant_number": "ECCS-1739355" }, { "agency": "NSF", "grant_number": "CCF-1637598" }, { "agency": "NSF", "grant_number": "CNS-1518941" } ] }, "doi": "10.1145/3410220.3456271", "primary_object": { "basename": "3410220.3456271.pdf", "url": "https://authors.library.caltech.edu/records/t7zjd-eeb92/files/3410220.3456271.pdf" }, "resource_type": "book_section", "pub_year": "2021", "author_list": "Sun, Bo; Zeynali, Ali; et el." }, { "id": "https://authors.library.caltech.edu/records/ah7r7-edq95", "eprint_id": 109416, "eprint_status": "archive", "datestamp": "2023-08-22 10:04:20", "lastmod": "2023-10-23 17:55:41", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Li-Tongxin", "name": { "family": "Li", "given": "Tongxin" }, "orcid": "0000-0002-9806-8964" }, { "id": "Chen-Yue", "name": { "family": "Chen", "given": "Yue" }, "orcid": "0000-0002-7594-7587" }, { "id": "Sun-Bo", "name": { "family": "Sun", "given": "Bo" }, "orcid": "0000-0003-3172-7811" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Low-S-H", "name": { "family": "Low", "given": "Steven" }, "orcid": "0000-0001-6476-3048" } ] }, "title": "Information Aggregation for Constrained Online Control", "ispublished": "unpub", "full_text_status": "public", "keywords": "online control; closed-loop control; model predictive control; regret\nanalysis; electric vehicle charging", "note": "\u00a9 2021 Copyright held by the owner/author(s).\n\nPublished - 3410220.3461737.pdf
", "abstract": "We consider a two-controller online control problem where a central controller chooses an action from a feasible set that is determined by time-varying and coupling constraints, which depend on all past actions and states. The central controller's goal is to minimize the cumulative cost; however, the controller has access to neither the feasible set nor the dynamics directly, which are determined by a remote local controller. Instead, the central controller receives only an aggregate summary of the feasibility information from the local controller, which does not know the system costs. We show that it is possible for an online algorithm using feasibility information to nearly match the dynamic regret of an online algorithm using perfect information whenever the feasible sets satisfy a causal invariance criterion and there is a sufficiently large prediction window size. To do so, we use a form of feasibility aggregation based on entropic maximization in combination with a novel online algorithm, named Penalized Predictive Control (PPC).", "date": "2021-06", "date_type": "published", "publisher": "ACM", "place_of_pub": "New York, NY", "pagerange": "7-8", "id_number": "CaltechAUTHORS:20210607-115053999", "isbn": "9781450380720", "book_title": "SIGMETRICS '21: Abstract Proceedings of the 2021 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20210607-115053999", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CCF-1637598" }, { "agency": "Amazon Web Services" }, { "agency": "Hong Kong Research Grant Council", "grant_number": "16207318" }, { "agency": "PIMCO", "grant_number": "ECCS-1931662" }, { "agency": "NSF", "grant_number": "ECCS-1932611" }, { "agency": "NSF", "grant_number": "CCF-1637598" }, { "agency": "NSF", "grant_number": "CNS-1518941" } ] }, "doi": "10.1145/3410220.3461737", "primary_object": { "basename": "3410220.3461737.pdf", "url": "https://authors.library.caltech.edu/records/ah7r7-edq95/files/3410220.3461737.pdf" }, "resource_type": "book_section", "pub_year": "2021", "author_list": "Li, Tongxin; Chen, Yue; et el." }, { "id": "https://authors.library.caltech.edu/records/qz2kk-shf32", "eprint_id": 109026, "eprint_status": "archive", "datestamp": "2023-08-20 03:17:25", "lastmod": "2023-10-23 17:31:11", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Zeynali-Ali", "name": { "family": "Zeynali", "given": "Ali" } }, { "id": "Sun-Bo", "name": { "family": "Sun", "given": "Bo" } }, { "id": "Hajiesmaili-Mohammad-H", "name": { "family": "Hajiesmaili", "given": "Mohammad" }, "orcid": "0000-0001-9278-2254" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Data-driven Competitive Algorithms for Online Knapsack and Set Cover", "ispublished": "unpub", "full_text_status": "public", "keywords": "Online Learning & Bandits, Other Applications, Optimization", "note": "\u00a9 2021 Association for the Advancement of Artificial\nIntelligence. \n\nPublished 2021-05-18. \n\nAli Zeynali and Mohammad Hajiesmaili acknowledge the support from NSF grant CNS-1908298, and NSF CAREER 2045641. Adam Wierman's research is supported by NSF AitF-1637598, and CNS-1518941. Also, Bo Sun received the support from Hong Kong General Research Fund, GRF 16211220.\n\nSubmitted - 2012.05361.pdf
", "abstract": "The design of online algorithms has tended to focus on algorithms with worst-case guarantees, e.g., bounds on the competitive ratio. However, it is well-known that such algorithms are often overly pessimistic, performing sub-optimally on non-worst-case inputs. In this paper, we develop an approach for data-driven design of online algorithms that maintain near-optimal worst-case guarantees while also performing learning in order to perform well for typical inputs. Our approach is to identify policy classes that admit global worst-case guarantees, and then perform learning using historical data within the policy classes. We demonstrate the approach in the context of two classical problems, online knapsack and online set cover, proving competitive bounds for rich policy classes in each case. Additionally, we illustrate the practical implications via a case study on electric vehicle charging.", "date": "2021-05-18", "date_type": "published", "publisher": "Association for the Advancement of Artificial Intelligence", "id_number": "CaltechAUTHORS:20210510-092934731", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20210510-092934731", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CNS-1908298" }, { "agency": "NSF", "grant_number": "CNS-2045641" }, { "agency": "NSF", "grant_number": "CCF-1637598" }, { "agency": "NSF", "grant_number": "CNS-1518941" }, { "agency": "Hong Kong Research Grant Council", "grant_number": "16211220" } ] }, "doi": "10.48550/arXiv.2012.05361", "primary_object": { "basename": "2012.05361.pdf", "url": "https://authors.library.caltech.edu/records/qz2kk-shf32/files/2012.05361.pdf" }, "resource_type": "book_section", "pub_year": "2021", "author_list": "Zeynali, Ali; Sun, Bo; et el." }, { "id": "https://authors.library.caltech.edu/records/b3cvj-npn92", "eprint_id": 118582, "eprint_status": "archive", "datestamp": "2023-08-20 00:44:32", "lastmod": "2023-10-24 23:24:56", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Shi-Guanya", "name": { "family": "Shi", "given": "Guanya" }, "orcid": "0000-0002-9075-3705" }, { "id": "Lin-Yiheng", "name": { "family": "Lin", "given": "Yiheng" }, "orcid": "0000-0001-6524-2877" }, { "id": "Chung-Soon-Jo", "name": { "family": "Chung", "given": "Soon-Jo" }, "orcid": "0000-0002-6657-3907" }, { "id": "Yue-Yisong", "name": { "family": "Yue", "given": "Yisong" }, "orcid": "0000-0001-9127-1989" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" }, "orcid": "0000-0002-5923-0199" } ] }, "title": "Online Optimization with Memory and Competitive Control", "ispublished": "unpub", "full_text_status": "public", "note": "This project was supported in part by funding from Raytheon, DARPA PAI, AitF-1637598 and CNS-1518941, with additional support for Guanya Shi provided by the Simoudis Discovery Prize. \n\nWe see no ethical concerns related to the results in this paper.", "abstract": "This paper presents competitive algorithms for a novel class of online optimization problems with memory. We consider a setting where the learner seeks to minimize the sum of a hitting cost and a switching cost that depends on the previous p decisions. This setting generalizes Smoothed Online Convex Optimization. The proposed approach, Optimistic Regularized Online Balanced Descent, achieves a constant, dimension-free competitive ratio. Further, we show a connection between online optimization with memory and online control with adversarial disturbances. This connection, in turn, leads to a new constant-competitive policy for a rich class of online control problems.", "date": "2020-12", "date_type": "published", "publisher": "Neural Information Processing Foundation", "place_of_pub": "La Jolla, CA", "pagerange": "1-12", "id_number": "CaltechAUTHORS:20221222-183256740", "isbn": "9781713829546", "book_title": "34th Conference on Neural Information Processing Systems (NeurIPS 2020)", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20221222-183256740", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Raytheon Company" }, { "agency": "Defense Advanced Research Projects Agency (DARPA)" }, { "agency": "NSF", "grant_number": "CCF-1637598" }, { "agency": "NSF", "grant_number": "CNS-1518941" }, { "agency": "Simoudis Discovery Prize" } ] }, "local_group": { "items": [ { "id": "GALCIT" } ] }, "contributors": { "items": [ { "id": "Larochelle-Hugo", "name": { "family": "Larochelle", "given": "Hugo" } }, { "id": "Ranzato-M", "name": { "family": "Ranzato", "given": "M." } }, { "id": "Hadsell-R", "name": { "family": "Hadsell", "given": "R." } }, { "id": "Balcan-M-F", "name": { "family": "Balcan", "given": "M. F." } }, { "id": "Lin-H", "name": { "family": "Lin", "given": "H." } } ] }, "resource_type": "book_section", "pub_year": "2020", "author_list": "Shi, Guanya; Lin, Yiheng; et el." }, { "id": "https://authors.library.caltech.edu/records/k462b-vce11", "eprint_id": 118583, "eprint_status": "archive", "datestamp": "2023-08-20 00:44:35", "lastmod": "2023-10-24 23:25:18", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Yu-Chenkai", "name": { "family": "Yu", "given": "Chenkai" }, "orcid": "0000-0001-8683-7773" }, { "id": "Shi-Guanya", "name": { "family": "Shi", "given": "Guanya" }, "orcid": "0000-0002-9075-3705" }, { "id": "Chung-Soon-Jo", "name": { "family": "Chung", "given": "Soon-Jo" }, "orcid": "0000-0002-6657-3907" }, { "id": "Yue-Yisong", "name": { "family": "Yue", "given": "Yisong" }, "orcid": "0000-0001-9127-1989" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" }, "orcid": "0000-0002-5923-0199" } ] }, "title": "The Power of Predictions in Online Control", "ispublished": "unpub", "full_text_status": "public", "note": "This project was supported in part by funding from Raytheon, DARPA PAI, AitF-1637598 and CNS-1518941, with additional support for Guanya Shi provided by the Simoudis Discovery Prize. \n\nWe see no ethical concerns related to the results in this paper.", "abstract": "We study the impact of predictions in online Linear Quadratic Regulator control with both stochastic and adversarial disturbances in the dynamics. In both settings, we characterize the optimal policy and derive tight bounds on the minimum cost and dynamic regret. Perhaps surprisingly, our analysis shows that the conventional greedy MPC approach is a near-optimal policy in both stochastic and adversarial settings. Specifically, for length-T problems, MPC requires only O(logT) predictions to reach O(1) dynamic regret, which matches (up to lower-order terms) our lower bound on the required prediction horizon for constant regret.", "date": "2020-12", "date_type": "published", "publisher": "Neural Information Processing Foundation", "place_of_pub": "La Jolla, CA", "pagerange": "1-11", "id_number": "CaltechAUTHORS:20221222-184439362", "isbn": "9781713829546", "book_title": "34th Conference on Neural Information Processing Systems (NeurIPS 2020)", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20221222-184439362", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Raytheon Company" }, { "agency": "Defense Advanced Research Projects Agency (DARPA)" }, { "agency": "NSF", "grant_number": "CCF-1637598" }, { "agency": "NSF", "grant_number": "CNS-1518941" }, { "agency": "Simoudis Discovery Prize" } ] }, "local_group": { "items": [ { "id": "GALCIT" } ] }, "contributors": { "items": [ { "id": "Larochelle-Hugo", "name": { "family": "Larochelle", "given": "Hugo" } }, { "id": "Ranzato-M", "name": { "family": "Ranzato", "given": "M." } }, { "id": "Hadsell-R", "name": { "family": "Hadsell", "given": "R." } }, { "id": "Balcan-M-F", "name": { "family": "Balcan", "given": "M. F." } }, { "id": "Lin-H", "name": { "family": "Lin", "given": "H." } } ] }, "resource_type": "book_section", "pub_year": "2020", "author_list": "Yu, Chenkai; Shi, Guanya; et el." }, { "id": "https://authors.library.caltech.edu/records/gjbhs-0b062", "eprint_id": 107473, "eprint_status": "archive", "datestamp": "2023-08-20 00:21:16", "lastmod": "2023-10-23 15:56:05", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Liang-Chen", "name": { "family": "Liang", "given": "Chen" } }, { "id": "Zhou-Fengyu", "name": { "family": "Zhou", "given": "Fengyu" }, "orcid": "0000-0002-2639-6491" }, { "id": "Zocca-Alessandro", "name": { "family": "Zocca", "given": "Alessandro" }, "orcid": "0000-0001-6585-4785" }, { "id": "Low-S-H", "name": { "family": "Low", "given": "Steven H." }, "orcid": "0000-0001-6476-3048" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Mitigating Cascading Failures via Local Responses", "ispublished": "unpub", "full_text_status": "restricted", "note": "\u00a9 2020 IEEE. \n\nThis work has been supported by NWO Rubicon grant 680.50.1529, NSF through awards ECCS 1619352, CNS 1545096, CCF 1637598, ECCS 1739355, CNS 1518941, CPS 154471, ARPA-E through award DEAR0000699 (NODES), and DTRA through award HDTRA 1-15-1-0003.", "abstract": "This work proposes an approach for failure mitigation in power systems via corrective control named Optimal Injection Adjustment (OIA). In contrast to classical approaches, which focus on minimizing load loss, OIA aims to minimize the post-contingency flow deviations by adjusting node power injections in response to failures. We prove that the optimal control actions obtained from OIA are localized around the original failure and use numerical simulations to highlight that OIA achieves near-optimal control costs despite using localized control actions.", "date": "2020-11-11", "date_type": "published", "publisher": "IEEE", "place_of_pub": "Piscataway, NJ", "pagerange": "1-7", "id_number": "CaltechAUTHORS:20210113-163505900", "isbn": "9781728161273", "book_title": "2020 IEEE International Conference on Communications, Control, and Computing Technologies for Smart Grids (SmartGridComm)", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20210113-163505900", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Nederlandse Organisatie voor Wetenschappelijk Onderzoek (NWO)", "grant_number": "680.50.1529" }, { "agency": "NSF", "grant_number": "ECCS-1619352" }, { "agency": "NSF", "grant_number": "CNS-1545096" }, { "agency": "NSF", "grant_number": "CCF-1637598" }, { "agency": "NSF", "grant_number": "ECCS-1739355" }, { "agency": "NSF", "grant_number": "CNS-1518941" }, { "agency": "NSF", "grant_number": "CPS-154471" }, { "agency": "ARPA-E", "grant_number": "DE-AR0000699" }, { "agency": "Defense Threat Reduction Agency (DTRA)", "grant_number": "HDTRA 1-15-1-0003" } ] }, "doi": "10.1109/smartgridcomm47815.2020.9302934", "resource_type": "book_section", "pub_year": "2020", "author_list": "Liang, Chen; Zhou, Fengyu; et el." }, { "id": "https://authors.library.caltech.edu/records/njwxj-jtj78", "eprint_id": 108290, "eprint_status": "archive", "datestamp": "2023-08-22 05:19:43", "lastmod": "2023-10-23 16:55:03", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Scully-Ziv", "name": { "family": "Scully", "given": "Ziv" }, "orcid": "0000-0002-8547-1068" }, { "id": "van-Kreveld-Lucas", "name": { "family": "van Kreveld", "given": "Lucas" } }, { "id": "Boxma-Onno-J", "name": { "family": "Boxma", "given": "Onno" }, "orcid": "0000-0003-4317-5380" }, { "id": "Dorsman-Jan-Pieter", "name": { "family": "Dorsman", "given": "Jan-Pieter" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Characterizing Policies with Optimal Response Time Tails under Heavy-Tailed Job Sizes", "ispublished": "unpub", "full_text_status": "public", "keywords": "response time; sojourn time; tail latency; tail optimality; Gittins\npolicy; shortest expected processing time (SERPT); randomized\nmulti-level feedback (RMLF); M/G/1", "note": "\u00a9 2020 Copyright held by the owner/author(s). \n\nZiv Scully was supported by an ARCS Foundation scholarship and the NSF Graduate Research Fellowship Program under Grant Nos. DGE-1745016 and DGE-125222. Lucas van Kreveld, Onno Boxma, and Jan-Pieter Dorsman were supported by the Netherlands Organisation for Scientific Research (NWO) through the Gravitation project NETWORKS, grant number 024.002.003. Adam Wierman was supported by NSF grant CNS-1518941.\n\nPublished - 3393691.3394179.pdf
", "abstract": "We consider the tail behavior of the response time distribution in an M/G/1 queue with heavy-tailed job sizes, specifically those with intermediately regularly varying tails. In this setting, the response time tail of many individual policies has been characterized, and it is known that policies such as Shortest Remaining Processing Time (SRPT) and Foreground-Background (FB) have response time tails of the same order as the job size tail, and thus such policies are tail-optimal. Our goal in this work is to move beyond individual policies and characterize the set of policies that are tail-optimal. Toward that end, we use the recently introduced SOAP framework to derive sufficient conditions on the form of prioritization used by a scheduling policy that ensure the policy is tail-optimal. These conditions are general and lead to new results for important policies that have previously resisted analysis, including the Gittins policy, which minimizes mean response time among policies that do not have access to job size information. As a by-product of our analysis, we derive a general upper bound for fractional moments of M/G/1 busy periods, which is of independent interest.", "date": "2020-06-08", "date_type": "published", "publisher": "Association for Computing Machinery", "place_of_pub": "New York, NY", "pagerange": "35-36", "id_number": "CaltechAUTHORS:20210303-131501254", "isbn": "9781450379854", "book_title": "Abstracts of the 2020 SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Systems", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20210303-131501254", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "ARCS Foundation" }, { "agency": "NSF Graduate Research Fellowship", "grant_number": "DGE-1745016" }, { "agency": "NSF Graduate Research Fellowship", "grant_number": "DGE-125222" }, { "agency": "Nederlandse Organisatie voor Wetenschappelijk Onderzoek (NWO)", "grant_number": "024.002.003" }, { "agency": "NSF", "grant_number": "CNS-1518941" } ] }, "doi": "10.1145/3393691.3394179", "primary_object": { "basename": "3393691.3394179.pdf", "url": "https://authors.library.caltech.edu/records/njwxj-jtj78/files/3393691.3394179.pdf" }, "resource_type": "book_section", "pub_year": "2020", "author_list": "Scully, Ziv; van Kreveld, Lucas; et el." }, { "id": "https://authors.library.caltech.edu/records/0z0zt-qzr25", "eprint_id": 108295, "eprint_status": "archive", "datestamp": "2023-08-22 05:19:49", "lastmod": "2023-10-23 16:55:16", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Yang-Lin", "name": { "family": "Yang", "given": "Lin" } }, { "id": "Hajiesmaili-Mohammad-H", "name": { "family": "Hajiesmaili", "given": "Mohammad H." } }, { "id": "Sitaraman-Ramesh", "name": { "family": "Sitaraman", "given": "Ramesh" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Mallada-Enrique", "name": { "family": "Mallada", "given": "Enrique" }, "orcid": "0000-0003-1568-1833" }, { "id": "Wong-Wing-S", "name": { "family": "Wong", "given": "Wing S." } } ] }, "title": "Online Linear Optimization with Inventory Management Constraints", "ispublished": "unpub", "full_text_status": "public", "keywords": "Online linear optimization; inventory management; competitive\nonline algorithms; energy procurement; data center", "note": "\u00a9 2020 Copyright held by the owner/author(s). \n\nThis work was funded by the National Science Foundation through the CNS-1908298, CNS-1763617, AitF-1637598, CNS-1518941, CPS-1544771, EPCN-1711188, CAREER-1752362, AMPS-1736448, TRIPODS-1934979 grants, and ARO: W911NF-17-1-0092, DoE: ENERGISE-DEEE0008006 grants, and a Google Faculty Research Award. Lin Yang wants to acknowledge the support from Schneider Electric, Lenovo Group (China) Limited and the Hong Kong Innovation and Technology Fund (ITS/066/17FP) under the HKUST-MIT Research Alliance Consortium.\n\nPublished - 3393691.3394207.pdf
Submitted - 1901.04372.pdf
", "abstract": "This paper considers the problem of online linear optimization with inventory management constraints. Specifically, we consider an online scenario where a decision maker needs to satisfy her timevarying demand for some units of an asset, either from a market with a time-varying price or from her own inventory. In each time slot, the decision maker is presented a (linear) price and must immediately decide the amount to purchase for covering the demand and/or for storing in the inventory for future use. The inventory has a limited capacity and can be used to buy and store assets at low price and cover the demand when the price is high. The ultimate goal of the decision maker is to cover the demand at each time slot while minimizing the cost of buying assets from the market. We propose ARP, an online algorithm for linear programming with inventory constraints, and ARPRate, an extended version that handles rate constraints to/from the inventory. Both ARP and ARPRate achieve optimal competitive ratios, meaning that no other online algorithm can achieve a better theoretical guarantee. To illustrate the results, we use the proposed algorithms in a case study focused on energy procurement and storage management strategies for data centers.", "date": "2020-06-08", "date_type": "published", "publisher": "Association for Computing Machinery", "place_of_pub": "New York, NY", "pagerange": "7", "id_number": "CaltechAUTHORS:20210303-140911921", "isbn": "9781450379854", "book_title": "Abstracts of the 2020 SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Systems", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20210303-140911921", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CNS-1908298" }, { "agency": "NSF", "grant_number": "CNS-1763617" }, { "agency": "NSF", "grant_number": "CCF-1637598" }, { "agency": "NSF", "grant_number": "CNS-1518941" }, { "agency": "NSF", "grant_number": "CPS-1544771" }, { "agency": "NSF", "grant_number": "EPCN-1711188" }, { "agency": "NSF", "grant_number": "ECCS-1752362" }, { "agency": "NSF", "grant_number": "DMS-1736448" }, { "agency": "NSF", "grant_number": "CCF-1934979" }, { "agency": "Army Research Office (ARO)", "grant_number": "W911NF-17-1-0092" }, { "agency": "Department of Energy (DOE)", "grant_number": "DE-EE0008006" }, { "agency": "Google Faculty Research Award" }, { "agency": "Schneider Electric" }, { "agency": "Lenovo Group Limited" }, { "agency": "Hong Kong Innovation and Technology Fund", "grant_number": "ITS/066/17FP" } ] }, "doi": "10.1145/3393691.3394207", "primary_object": { "basename": "1901.04372.pdf", "url": "https://authors.library.caltech.edu/records/0z0zt-qzr25/files/1901.04372.pdf" }, "related_objects": [ { "basename": "3393691.3394207.pdf", "url": "https://authors.library.caltech.edu/records/0z0zt-qzr25/files/3393691.3394207.pdf" } ], "resource_type": "book_section", "pub_year": "2020", "author_list": "Yang, Lin; Hajiesmaili, Mohammad H.; et el." }, { "id": "https://authors.library.caltech.edu/records/p5s82-sb963", "eprint_id": 96721, "eprint_status": "archive", "datestamp": "2023-08-19 18:51:09", "lastmod": "2023-10-20 21:27:59", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Goel-Gautam", "name": { "family": "Goel", "given": "Gautam" }, "orcid": "0000-0002-7054-7218" }, { "id": "Lin-Yiheng", "name": { "family": "Lin", "given": "Yiheng" }, "orcid": "0000-0001-6524-2877" }, { "id": "Sun-Haoyuan", "name": { "family": "Sun", "given": "Haoyuan" }, "orcid": "0000-0002-6203-0198" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" }, "orcid": "0000-0002-5923-0199" } ] }, "title": "Beyond Online Balanced Descent: An Optimal Algorithm for Smoothed Online Optimization", "ispublished": "unpub", "full_text_status": "public", "note": "\u00a9 2020 Neural Information Processing Systems Foundation, Inc.\n\nGautam Goel, Yiheng Lin, and Haoyuan Sun contributed equally to this work. \n\nThis work was supported by NSF grants AitF-1637598 and CNS-1518941, with additional support for Gautam Goel provided by an Amazon AWS AI Fellowship.\n\nPublished - 8463-beyond-online-balanced-descent-an-optimal-algorithm-for-smoothed-online-optimization.pdf
Submitted - 1905.12776.pdf
Supplemental Material - 8463-beyond-online-balanced-descent-an-optimal-algorithm-for-smoothed-online-optimization-supplemental.zip
", "abstract": "We study online convex optimization in a setting where the learner seeks to minimize the sum of a per-round hitting cost and a movement cost which is incurred when changing decisions between rounds. We prove a new lower bound on the competitive ratio of any online algorithm in the setting where the costs are m-strongly convex and the movement costs are the squared \u2113\u2082 norm. This lower bound shows that no algorithm can achieve a competitive ratio that is o(m^(\u22121/2)) as m tends to zero. No existing algorithms have competitive ratios matching this bound, and we show that the state-of-the-art algorithm, Online Balanced Decent (OBD), has a competitive ratio that is \u03a9(m^(\u22122/3)). We additionally propose two new algorithms, Greedy OBD (G-OBD) and Regularized OBD (R-OBD) and prove that both algorithms have an O(m^(\u22121/2)) competitive ratio. The result for G-OBD holds when the hitting costs are quasiconvex and the movement costs are the squared \u2113\u2082 norm, while the result for R-OBD holds when the hitting costs are m-strongly convex and the movement costs are Bregman Divergences. Further, we show that R-OBD simultaneously achieves constant, dimension-free competitive ratio and sublinear regret when hitting costs are strongly convex.", "date": "2019-12", "date_type": "published", "publisher": "Neural Information Processing Systems Foundation, Inc.", "id_number": "CaltechAUTHORS:20190626-100003384", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190626-100003384", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CCF-1637598" }, { "agency": "NSF", "grant_number": "CNS-1518941" }, { "agency": "Amazon Web Services" } ] }, "doi": "10.48550/arXiv.1905.12776", "primary_object": { "basename": "8463-beyond-online-balanced-descent-an-optimal-algorithm-for-smoothed-online-optimization-supplemental.zip", "url": "https://authors.library.caltech.edu/records/p5s82-sb963/files/8463-beyond-online-balanced-descent-an-optimal-algorithm-for-smoothed-online-optimization-supplemental.zip" }, "related_objects": [ { "basename": "8463-beyond-online-balanced-descent-an-optimal-algorithm-for-smoothed-online-optimization.pdf", "url": "https://authors.library.caltech.edu/records/p5s82-sb963/files/8463-beyond-online-balanced-descent-an-optimal-algorithm-for-smoothed-online-optimization.pdf" }, { "basename": "1905.12776.pdf", "url": "https://authors.library.caltech.edu/records/p5s82-sb963/files/1905.12776.pdf" } ], "resource_type": "book_section", "pub_year": "2019", "author_list": "Goel, Gautam; Lin, Yiheng; et el." }, { "id": "https://authors.library.caltech.edu/records/pqhxh-6sk78", "eprint_id": 96748, "eprint_status": "archive", "datestamp": "2023-08-19 18:51:17", "lastmod": "2023-10-20 21:29:24", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Guo-Linqi", "name": { "family": "Guo", "given": "Linqi" } }, { "id": "Liang-Chen", "name": { "family": "Liang", "given": "Chen" } }, { "id": "Zocca-A", "name": { "family": "Zocca", "given": "Alessandro" }, "orcid": "0000-0001-6585-4785" }, { "id": "Low-S-H", "name": { "family": "Low", "given": "Steven H." }, "orcid": "0000-0001-6476-3048" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Less is More: Real-time Failure Localization in Power Systems", "ispublished": "unpub", "full_text_status": "public", "note": "\u00a9 2019 IEEE.\n\nThis work has been supported by Resnick Fellowship, Linde Institute Research Award, NWO Rubicon grant 680.50.1529., NSF grants through PFI:AIR-TT award 1602119, EPCN 1619352, CNS 1545096, CCF 1637598, ECCS 1619352, CNS 1518941, CPS 154471, AitF 1637598, ARPA-E grant through award DE-AR0000699 (NODES) and GRID DATA, DTRA through grant HDTRA 1-15-1-0003 and Skoltech through collaboration agreement 1075-MRA.\n\nSubmitted - 1904.05461.pdf
", "abstract": "Cascading failures in power systems exhibit nonlocal propagation patterns, which make the analysis and mitigation of failures difficult. In this work, we propose a distributed control framework inspired by the recently proposed concepts of unified controller and network tree-partition that offers strong guarantees in both the mitigation and localization of cascading failures in power systems. In this framework, the transmission network is partitioned into several control areas which are connected in a tree structure, and the unified controller is adopted by generators or controllable loads for fast timescale disturbance response. After an initial failure, the proposed strategy always prevents successive failures from happening, and regulates the system to the desired steady state where the impact of initial failures are localized as much as possible. For extreme failures that cannot be localized, the proposed framework has a configurable design, that progressively involves and coordinates more control areas for failure mitigation and, as a last resort, imposes minimal load shedding. We compare the proposed control framework with Automatic Generation Control (AGC) on the IEEE 118-bus test system. Simulation results show that our novel framework greatly improves the system robustness in terms of the N - 1 security standard, and localizes the impact of initial failures in majority of the load profiles that are examined. Moreover, the proposed framework incurs significantly less load loss, if any, compared to AGC.", "date": "2019-12", "date_type": "published", "publisher": "IEEE", "place_of_pub": "Piscataway, NJ", "pagerange": "3871-3877", "id_number": "CaltechAUTHORS:20190626-143544929", "isbn": "978-1-7281-1398-2", "book_title": "2019 IEEE 58th Conference on Decision and Control (CDC)", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190626-143544929", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Resnick Sustainability Institute" }, { "agency": "Linde Institute of Economic and Management Science" }, { "agency": "Nederlandse Organisatie voor Wetenschappelijk Onderzoek (NWO)", "grant_number": "680.50.1529" }, { "agency": "NSF", "grant_number": "IIP-1602119" }, { "agency": "NSF", "grant_number": "ECCS-1619352" }, { "agency": "NSF", "grant_number": "CNS-1545096" }, { "agency": "NSF", "grant_number": "CCF-1637598" }, { "agency": "NSF", "grant_number": "ECCS-1619352" }, { "agency": "NSF", "grant_number": "CNS-1518941" }, { "agency": "NSF", "grant_number": "CPS-154471" }, { "agency": "NSF", "grant_number": "CCF-1637598" }, { "agency": "Advanced Research Projects Agency-Energy (ARPA-E)", "grant_number": "DE-AR0000699" }, { "agency": "Defense Threat Reduction Agency (DTRA)", "grant_number": "HDTRA 1-15-1-0003" }, { "agency": "Skoltech", "grant_number": "1075-MRA" } ] }, "local_group": { "items": [ { "id": "Resnick-Sustainability-Institute" } ] }, "doi": "10.1109/CDC40024.2019.9029393", "primary_object": { "basename": "1904.05461.pdf", "url": "https://authors.library.caltech.edu/records/pqhxh-6sk78/files/1904.05461.pdf" }, "resource_type": "book_section", "pub_year": "2019", "author_list": "Guo, Linqi; Liang, Chen; et el." }, { "id": "https://authors.library.caltech.edu/records/4bng9-pkh40", "eprint_id": 97032, "eprint_status": "archive", "datestamp": "2023-08-22 01:45:08", "lastmod": "2023-10-23 16:10:54", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Lin-Qiulin", "name": { "family": "Lin", "given": "Qiulin" } }, { "id": "Yi-Hanling", "name": { "family": "Yi", "given": "Hanling" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Pang-John-Z-F", "name": { "family": "Pang", "given": "John" }, "orcid": "0000-0002-6485-7922" }, { "id": "Honig-Michael", "name": { "family": "Honig", "given": "Michael" } }, { "id": "Chen-Minghua", "name": { "family": "Chen", "given": "Minghua" } }, { "id": "Xiao-Yuanzhang", "name": { "family": "Xiao", "given": "Yuanzhang" } } ] }, "title": "Competitive Online Optimization under Inventory Constraints", "ispublished": "unpub", "full_text_status": "public", "keywords": "Inventory Constraints; Revenue Maximization; Online Algorithms; One-way Trading; Price Elasticity", "note": "\u00a9 2019 held by the owner/author(s).\n\nPublished - p35-lin.pdf
", "abstract": "This paper studies online optimization under inventory (budget) constraints. While online optimization is a well-studied topic, versions with inventory constraints have proven difficult. We consider a formulation of inventory-constrained optimization that is a generalization of the classic one-way trading problem and has a wide range of applications. We present a new algorithmic framework, CR-Pursuit, and prove that it achieves the optimal competitive ratio among all deterministic algorithms (up to a problem-dependent constant factor) for inventory-constrained online optimization. Our algorithm and its analysis not only simplify and unify the state-of-the-art results for the standard one-way trading problem, but they also establish novel bounds for generalizations including concave revenue functions. For example, for one-way trading with price elasticity, CR-Pursuit achieves a competitive ratio within a small additive constant (i.e., 1/3) to the lower bound of ln\u04e8+1, where \u04e8 is the ratio between the maximum and minimum base prices.", "date": "2019-06", "date_type": "published", "publisher": "Association for Computing Machinery", "place_of_pub": "New York, NY", "pagerange": "35-36", "id_number": "CaltechAUTHORS:20190710-131506895", "isbn": "978-1-4503-6678-6", "book_title": "Abstracts of the 2019 SIGMETRICS/Performance Joint International Conference on Measurement and Modeling of Computer Systems", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190710-131506895", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/3309697.3331495", "primary_object": { "basename": "p35-lin.pdf", "url": "https://authors.library.caltech.edu/records/4bng9-pkh40/files/p35-lin.pdf" }, "resource_type": "book_section", "pub_year": "2019", "author_list": "Lin, Qiulin; Yi, Hanling; et el." }, { "id": "https://authors.library.caltech.edu/records/vvqya-6g408", "eprint_id": 96699, "eprint_status": "archive", "datestamp": "2023-08-22 01:45:03", "lastmod": "2023-10-23 16:10:52", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Azizan-Ruhi-N", "name": { "family": "Azizan", "given": "Navid" }, "orcid": "0000-0002-4299-2963" }, { "id": "Su-Yu", "name": { "family": "Su", "given": "Yu" } }, { "id": "Dvijotham-K", "name": { "family": "Dvijotham", "given": "Krishnamurthy" }, "orcid": "0000-0002-1328-4677" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Optimal Pricing in Markets with Non-Convex Costs", "ispublished": "unpub", "full_text_status": "public", "keywords": "non-convexities; pricing; market-clearing price; networked market", "note": "\u00a9 2019 ACM.\n\nSubmitted - pricing-non-convex.pdf
", "abstract": "We consider a market run by an operator who seeks to satisfy a given consumer demand for a commodity by purchasing the needed amount from a group of competing suppliers with non-convex cost functions. The operator knows the suppliers' cost functions and announces a price/payment function for each supplier, which determines the payment to that supplier for producing different quantities. Each supplier then makes an individual decision about how much to produce (and whether to participate at all), in order to maximize its own profit. The key question is how to design the price functions. This problem is relevant for many applications, including electricity markets. The main contribution of this paper is the introduction of a new pricing scheme, \\name (\\acr ) pricing, which is applicable to general non-convex costs, allows using general parametric price functions, and guarantees market clearing, revenue adequacy, and ecomonic efficiency while supporting comptitive euqilibrium. The name of this scheme stems from the fact that we directly impose all the equilibrium conditions as constraints in the optimization problem for finding the best allocations, as opposed to adjusting the prices later to make the allocations an equilibrium. While the optimization problem is, of course, non-convex, and non-convex problems are intractable in general, we present a tractable approximation algorithm for solving the proposed optimization problem. Our framework extends to the case of networked markets, which, to the best of our knowledge, has not been considered in previous work.", "date": "2019-06", "date_type": "published", "publisher": "Association for Computing Machinery", "place_of_pub": "New York, NY", "pagerange": "595", "id_number": "CaltechAUTHORS:20190625-114233447", "isbn": "978-1-4503-6792-9", "book_title": "Proceedings of the 2019 ACM Conference on Economics and Computation", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190625-114233447", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/3328526.3329575", "primary_object": { "basename": "pricing-non-convex.pdf", "url": "https://authors.library.caltech.edu/records/vvqya-6g408/files/pricing-non-convex.pdf" }, "resource_type": "book_section", "pub_year": "2019", "author_list": "Azizan, Navid; Su, Yu; et el." }, { "id": "https://authors.library.caltech.edu/records/76deq-fe812", "eprint_id": 92578, "eprint_status": "archive", "datestamp": "2023-08-19 13:04:15", "lastmod": "2023-10-20 15:52:32", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Guo-Linqi", "name": { "family": "Guo", "given": "Linqi" } }, { "id": "Liang-Chen", "name": { "family": "Liang", "given": "Chen" } }, { "id": "Zocca-A", "name": { "family": "Zocca", "given": "Alessandro" }, "orcid": "0000-0001-6585-4785" }, { "id": "Low-S-H", "name": { "family": "Low", "given": "Steven H." }, "orcid": "0000-0001-6476-3048" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Failure Localization in Power Systems via Tree Partitions", "ispublished": "unpub", "full_text_status": "public", "note": "\u00a9 2018 IEEE. \n\nThis work has been supported by Resnick Fellowship, Linde Institute Research Award, NWO Rubicon grant 680.50.1529., NSF grants through PFI:AIR-TT award 1602119, EPCN 1619352, CNS 1545096, CCF 1637598, ECCS 1619352, CNS 1518941, CPS 154471, AitF 1637598, ARPA-E grant through award DE-AR0000699 (NODES) and GRID DATA, DTRA through grant HDTRA 1-15-1-0003 and Skoltech through collaboration agreement 1075-MRA.\n\nSubmitted - 1803.08551.pdf
", "abstract": "Cascading failures in power systems propagate non-locally, making the control and mitigation of outages extremely hard. In this work, we use the emerging concept of the tree partition of transmission networks to provide an analytical characterization of line failure localizability in transmission systems. Our results rigorously establish the well perceived intuition in power community that failures cannot cross bridges, and reveal a finer-grained concept that encodes more precise information on failure propagations within tree-partition regions. Specifically, when a non-bridge line is tripped, the impact of this failure only propagates within well-defined components, which we refer to as cells, of the tree partition defined by the bridges. In contrast, when a bridge line is tripped, the impact of this failure propagates globally across the network, affecting the power flow on all remaining transmission lines. This characterization suggests that it is possible to improve the system robustness by temporarily switching off certain transmission lines, so as to create more, smaller components in the tree partition; thus spatially localizing line failures and making the grid less vulnerable to large-scale outages. We illustrate this approach using the IEEE 118-bus test system and demonstrate that switching off a negligible portion of transmission lines allows the impact of line failures to be significantly more localized without substantial changes in line congestion.", "date": "2018-12", "date_type": "published", "publisher": "IEEE", "place_of_pub": "Piscataway, NJ", "pagerange": "6832-6839", "id_number": "CaltechAUTHORS:20190201-135634765", "isbn": "9781538613955", "book_title": "2018 IEEE Conference on Decision and Control (CDC)", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190201-135634765", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Resnick Sustainability Institute" }, { "agency": "Linde Institute of Economic and Management Science" }, { "agency": "Nederlandse Organisatie voor Wetenschappelijk Onderzoek (NWO)", "grant_number": "680.50.1529" }, { "agency": "NSF", "grant_number": "IIP-1602119" }, { "agency": "NSF", "grant_number": "ECCS-1619352" }, { "agency": "NSF", "grant_number": "CNS-1545096" }, { "agency": "NSF", "grant_number": "CCF-1637598" }, { "agency": "NSF", "grant_number": "ECCS-1619352" }, { "agency": "NSF", "grant_number": "CNS-1518941" }, { "agency": "NSF", "grant_number": "CPS-154471" }, { "agency": "NSF", "grant_number": "CCF-1637598" }, { "agency": "Advanced Research Projects Agency-Energy (ARPA-E)", "grant_number": "DE-AR0000699" }, { "agency": "Defense Threat Reduction Agency (DTRA)", "grant_number": "HDTRA 1-15-1-0003" }, { "agency": "Skoltech", "grant_number": "1075-MRA" } ] }, "local_group": { "items": [ { "id": "Resnick-Sustainability-Institute" } ] }, "doi": "10.1109/cdc.2018.8619562", "primary_object": { "basename": "1803.08551.pdf", "url": "https://authors.library.caltech.edu/records/76deq-fe812/files/1803.08551.pdf" }, "resource_type": "book_section", "pub_year": "2018", "author_list": "Guo, Linqi; Liang, Chen; et el." }, { "id": "https://authors.library.caltech.edu/records/6ftbv-42a36", "eprint_id": 87294, "eprint_status": "archive", "datestamp": "2023-08-19 09:29:26", "lastmod": "2023-10-18 21:01:24", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Fang-Zhixuan", "name": { "family": "Fang", "given": "Zhixuan" } }, { "id": "Huang-Longbo", "name": { "family": "Huang", "given": "Longbo" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Loyalty Programs in the Sharing Economy: Optimality and Competition", "ispublished": "unpub", "full_text_status": "public", "note": "\u00a9 2018 ACM, Inc.\n\nThe work of Zhixuan Fang and Longbo Huang is supported by the National Natural Science Foundation of China Grant 61672316 and 61303195, the Tsinghua Initiative Research Grant and the China Youth 1000-Talent Grant. The work of Adam Wierman is supported by NSF Grant AitF-1637598, CNS-1518941.\n\nSubmitted - 1805.03581.pdf
", "abstract": "Loyalty programs are important tools for sharing platforms seeking to grow supply. Online sharing platforms use loyalty programs to heavily subsidize resource providers, encouraging participation and boosting supply. As the sharing economy has evolved and competition has increased, the design of loyalty programs has begun to play a crucial role in the pursuit of maximal revenue. In this paper, we first characterize the optimal loyalty program for a platform with homogeneous users. We then show that optimal revenue in a heterogeneous market can be achieved by a class of multi-threshold loyalty program (MTLP) which admits a simple implementation-friendly structure. We also study the performance of loyalty programs in a setting with two competing sharing platforms, showing that the degree of heterogeneity is a crucial factor for both loyalty programs and pricing strategies. Our results show that sophisticated loyalty programs that reward suppliers via stepwise linear functions outperform simple sign-up bonuses, which give them a one time reward for participating.", "date": "2018-06", "date_type": "published", "publisher": "ACM", "place_of_pub": "New York, NY", "pagerange": "131-140", "id_number": "CaltechAUTHORS:20180621-074412313", "isbn": "978-1-4503-5770-8", "book_title": "Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20180621-074412313", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "National Natural Science Foundation of China", "grant_number": "61672316" }, { "agency": "National Natural Science Foundation of China", "grant_number": "61303195" }, { "agency": "Tsinghua Initiative Research Grant" }, { "agency": "China Youth 1000-Talent Grant" }, { "agency": "NSF", "grant_number": "AitF-1637598" }, { "agency": "NSF", "grant_number": "CNS-1518941" } ] }, "doi": "10.1145/3209582.3209596", "primary_object": { "basename": "1805.03581.pdf", "url": "https://authors.library.caltech.edu/records/6ftbv-42a36/files/1805.03581.pdf" }, "resource_type": "book_section", "pub_year": "2018", "author_list": "Fang, Zhixuan; Huang, Longbo; et el." }, { "id": "https://authors.library.caltech.edu/records/k0zy4-8hf39", "eprint_id": 99218, "eprint_status": "archive", "datestamp": "2023-08-21 22:43:39", "lastmod": "2023-10-18 17:58:33", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "London-P", "name": { "family": "London", "given": "Palma" } }, { "id": "Vardi-S", "name": { "family": "Vardi", "given": "Shai" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Yi-Hanling", "name": { "family": "Yi", "given": "Hanling" } } ] }, "title": "A Parallelizable Acceleration Framework for Packing Linear Programs", "ispublished": "unpub", "full_text_status": "public", "keywords": "optimization; linear programs; parallel algorithms", "note": "\u00a9 2018 Association for the Advancement of Artificial Intelligence. \n\nThis work was supported in part by NSF grants AitF-1637598,\nCNS-1518941, CPS-154471, the Linde Institute, and the International Teochew Doctors Association Zheng Hanming Visiting Scholar Award Scheme.\n\nPublished - 17118-77355-1-PB.pdf
", "abstract": "This paper presents an acceleration framework for packing linear programming problems where the amount of data available is limited, i.e., where the number of constraints m is small compared to the variable dimension n. The framework can be used as a black box to speed up linear programming solvers dramatically, by two orders of magnitude in our experiments. We present worst-case guarantees on the quality of the solution and the speedup provided by the algorithm, showing that the framework provides an approximately optimal solution while running the original solver on a much smaller problem. The framework can be used to accelerate exact solvers, approximate solvers, and parallel/distributed solvers. Further, it can be used for both linear programs and integer linear programs.", "date": "2018-02", "date_type": "published", "publisher": "Association for the Advancement of Artificial Intelligence", "id_number": "CaltechAUTHORS:20191010-134649754", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20191010-134649754", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CCF-1637598" }, { "agency": "NSF", "grant_number": "CNS-1518941" }, { "agency": "NSF", "grant_number": "CPS-154471" }, { "agency": "Linde Institute of Economic and Management Science" }, { "agency": "International Teochew Doctors Association" } ] }, "primary_object": { "basename": "17118-77355-1-PB.pdf", "url": "https://authors.library.caltech.edu/records/k0zy4-8hf39/files/17118-77355-1-PB.pdf" }, "resource_type": "book_section", "pub_year": "2018", "author_list": "London, Palma; Vardi, Shai; et el." }, { "id": "https://authors.library.caltech.edu/records/m0neq-1jj27", "eprint_id": 90570, "eprint_status": "archive", "datestamp": "2023-08-21 22:43:21", "lastmod": "2023-10-19 14:35:05", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "London-P", "name": { "family": "London", "given": "Palma" } }, { "id": "Vardi-S", "name": { "family": "Vardi", "given": "Shai" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Yi-Hanling", "name": { "family": "Yi", "given": "Hanling" } } ] }, "title": "A Parallelizable Acceleration Framework for Packing Linear Programs", "ispublished": "unpub", "full_text_status": "public", "keywords": "Approximation algorithms; Acceleration; Parallel algorithms; Cloning; Linear programming; Markov random fields; Task analysis", "note": "\u00a9 2018 Association for the Advancement of Artificial Intelligence. \n\nPL, SV, and AW were supported in part by NSF grants AitF-1637598, CNS-1518941, CPS-154471 and the Linde Institute. HY was supported by the International Teochew Doctors Association Zheng Hanming Visiting Scholar Award Scheme.\n\nSubmitted - 1711.06656.pdf
", "abstract": "This paper presents an acceleration framework for packing linear programming problems where the amount of data available is limited, i.e., where the number of constraints m is small compared to the variable dimension n . The framework can be used as a black box to speed up linear programming solvers dramatically, by two orders of magnitude in our experiments. We present worst-case guarantees on the quality of the solution and the speedup provided by the algorithm, showing that the framework provides an approximately optimal solution while running the original solver on a much smaller problem. The framework can be used to accelerate exact solvers, approximate solvers, and parallel/distributed solvers. Further, it can be used for both linear programs and integer linear programs.", "date": "2018-02", "date_type": "published", "publisher": "IEEE", "place_of_pub": "Piscataway, NJ", "pagerange": "1-10", "id_number": "CaltechAUTHORS:20181101-121244788", "isbn": "9781728101248", "book_title": "2018 Information Theory and Applications Workshop (ITA)", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20181101-121244788", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CCF-1637598" }, { "agency": "NSF", "grant_number": "CNS-1518941" }, { "agency": "NSF", "grant_number": "CPS-154471" }, { "agency": "Linde Institute of Economic and Management Science" }, { "agency": "International Teochew Doctors Association" } ] }, "doi": "10.1109/ita.2018.8503261", "primary_object": { "basename": "1711.06656.pdf", "url": "https://authors.library.caltech.edu/records/m0neq-1jj27/files/1711.06656.pdf" }, "resource_type": "book_section", "pub_year": "2018", "author_list": "London, Palma; Vardi, Shai; et el." }, { "id": "https://authors.library.caltech.edu/records/aek6g-jta96", "eprint_id": 88841, "eprint_status": "archive", "datestamp": "2023-08-19 07:39:08", "lastmod": "2023-10-18 22:20:51", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Islam-M-A", "name": { "family": "Islam", "given": "Mohammad A." } }, { "id": "Ren-Xiaoqi", "name": { "family": "Ren", "given": "Xiaoqi" }, "orcid": "0000-0002-1121-9046" }, { "id": "Ren-Shaolei", "name": { "family": "Ren", "given": "Shaolei" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "A Spot Capacity Market to Increase Power Infrastructure Utilization in Multi-tenant Data Centers", "ispublished": "unpub", "full_text_status": "restricted", "keywords": "Data center, market approach, power management, spot capacity", "note": "\u00a9 2018 IEEE. \n\nAn extended abstract of this paper appeared at the ACM SIGMETRICS 2017. \n\nThis work was supported in part by the U.S. NSF under grants CNS-1551661, CNS-1565474, CNS-1518941, CPS-154471, ECCS-1610471, and AitF-1637598.", "abstract": "Despite the common practice of oversubscription, power capacity is largely under-utilized in data centers. A significant factor driving this under-utilization is fluctuation of the aggregate power demand, resulting in unused \"spot (power) capacity\". In this paper, we tap into spot capacity for improving power infrastructure utilization in multi-tenant data centers, an important but under-explored type of data center where multiple tenants house their own physical servers. We propose a novel market, called SpotDC, to allocate spot capacity to tenants on demand. Specifically, SpotDC extracts tenants' racklevel spot capacity demand through an elastic demand function, based on which the operator sets the market price for spot capacity allocation. We evaluate SpotDC using both testbed experiments and simulations, demonstrating that SpotDC improves power infrastructure utilization and creates a \"win-win\" situation: the data center operator increases its profit (by nearly 10%), while tenants improve their performance (by 1.2-1.8x on average compared to the no spot capacity case, yet at a marginal cost).", "date": "2018-02", "date_type": "published", "publisher": "IEEE", "place_of_pub": "Los Alamitos, CA", "pagerange": "776-788", "id_number": "CaltechAUTHORS:20180816-075811590", "isbn": "978-1-5386-3659-6", "book_title": "2018 IEEE International Symposium on High Performance Computer Architecture (HPCA)", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20180816-075811590", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CNS-1551661" }, { "agency": "NSF", "grant_number": "CNS-1565474" }, { "agency": "NSF", "grant_number": "CNS-1518941" }, { "agency": "NSF", "grant_number": "CPS-154471" }, { "agency": "NSF", "grant_number": "ECCS-1610471" }, { "agency": "NSF", "grant_number": "CCF-1637598" } ] }, "doi": "10.1109/HPCA.2018.00071", "resource_type": "book_section", "pub_year": "2018", "author_list": "Islam, Mohammad A.; Ren, Xiaoqi; et el." }, { "id": "https://authors.library.caltech.edu/records/4q030-txg70", "eprint_id": 84540, "eprint_status": "archive", "datestamp": "2023-08-19 06:23:33", "lastmod": "2023-10-18 16:19:31", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Lin-Weixuan", "name": { "family": "Lin", "given": "Weixuan" } }, { "id": "Pang-John-Z-F", "name": { "family": "Pang", "given": "John Z. F." }, "orcid": "0000-0002-6485-7922" }, { "id": "Bitar-E", "name": { "family": "Bitar", "given": "Eilyan" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Networked Cournot Competition in Platform Markets: Access Control and Efficiency Loss", "ispublished": "unpub", "full_text_status": "restricted", "note": "\u00a9 2017 IEEE. \n\nDate Added to IEEE Xplore: 23 January 2018. \n\nThis work has received support from the NSF through AitF-1637598, CNS-1518941, CPS-154471, ECCS-1351621, and IIP-1632124. The collaboration began while the authors were visiting the Simons Institute for the Theory of Computing.", "abstract": "This paper studies network design and efficiency loss in online platforms using the model of networked Cournot competition. We consider two styles of platforms: open access platforms and discriminatory access platforms. In open access platforms, every firm can connect to every market, while discriminatory access platforms limit connections between firms and markets in order to improve social welfare. Our results provide tight bounds on the efficiency loss of both open access and discriminatory access platforms. For open access platforms, we show that the efficiency loss at a Nash equilibrium is upper bounded by 3/2. In the case of discriminatory access platforms, we prove that, under an assumption on the linearity of cost functions, a greedy algorithm for optimizing network connections can guarantee the efficiency loss at a Nash equilibrium is upper bounded by 4/3.", "date": "2017-12", "date_type": "published", "publisher": "IEEE", "place_of_pub": "Piscataway, NJ", "pagerange": "4606-4611", "id_number": "CaltechAUTHORS:20180126-083709835", "isbn": "978-1-5090-2874-0", "book_title": "2017 IEEE 56th Annual Conference on Decision and Control (CDC)", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20180126-083709835", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CCF-1637598" }, { "agency": "NSF", "grant_number": "CNS-1518941" }, { "agency": "NSF", "grant_number": "CPS-154471" }, { "agency": "NSF", "grant_number": "ECCS-1351621" }, { "agency": "NSF", "grant_number": "IIP-1632124" } ] }, "doi": "10.1109/CDC.2017.8264340", "resource_type": "book_section", "pub_year": "2017", "author_list": "Lin, Weixuan; Pang, John Z. F.; et el." }, { "id": "https://authors.library.caltech.edu/records/z1wwm-v7t37", "eprint_id": 84531, "eprint_status": "archive", "datestamp": "2023-08-19 06:22:41", "lastmod": "2023-10-18 16:18:55", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Goel-Gautam", "name": { "family": "Goel", "given": "Gautam" }, "orcid": "0000-0002-7054-7218" }, { "id": "Chen-Niangjun", "name": { "family": "Chen", "given": "Niangjun" }, "orcid": "0000-0002-2289-9737" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" }, "orcid": "0000-0002-5923-0199" } ] }, "title": "Thinking Fast and Slow: Optimization Decomposition Across Timescales", "ispublished": "unpub", "full_text_status": "public", "note": "\u00a9 2017 IEEE. \n\nDate Added to IEEE Xplore: 23 January 2018. \n\nThis work was supported by the NSF through grants AitF-1637598, CNS-1518941, CPS-154471, CNS-1319820, EPAS-1307794. We also thank Desmond Cai and Nik Matni for helpful discussions.\n\nSubmitted - 1704.07785.pdf
", "abstract": "Many real-world control systems, such as the smart grid and human sensorimotor control systems, have decentralized components that react quickly using local information and centralized components that react slowly using a more global view. This paper seeks to provide a theoretical framework for how to design controllers that are decomposed across timescales in this way. The framework is analogous to how the network utility maximization framework uses optimization decomposition to distribute a global control problem across independent controllers, each of which solves a local problem; except our goal is to decompose a global problem temporally, extracting a timescale separation. Our results highlight that decomposition of a multi-timescale controller into a fast timescale, reactive controller and a slow timescale, predictive controller can be near-optimal in a strong sense. In particular, we exhibit such a design, named Multi-timescale Reflexive Predictive Control (MRPC), which maintains a pertimestep cost within a constant factor of the offline optimal in an adversarial setting.", "date": "2017-12", "date_type": "published", "publisher": "IEEE", "place_of_pub": "Piscataway, NJ", "pagerange": "1291-1298", "id_number": "CaltechAUTHORS:20180125-151615858", "isbn": "978-1-5090-2874-0", "book_title": "2017 IEEE 56th Annual Conference on Decision and Control (CDC)", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20180125-151615858", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CCF-1637598" }, { "agency": "NSF", "grant_number": "CNS-1518941" }, { "agency": "NSF", "grant_number": "CPS-154471" }, { "agency": "NSF", "grant_number": "CNS-1319820" }, { "agency": "NSF", "grant_number": "ECCS-1307794" } ] }, "doi": "10.1109/CDC.2017.8263834", "primary_object": { "basename": "1704.07785.pdf", "url": "https://authors.library.caltech.edu/records/z1wwm-v7t37/files/1704.07785.pdf" }, "resource_type": "book_section", "pub_year": "2017", "author_list": "Goel, Gautam; Chen, Niangjun; et el." }, { "id": "https://authors.library.caltech.edu/records/207qs-6wk44", "eprint_id": 85702, "eprint_status": "archive", "datestamp": "2023-08-21 22:08:14", "lastmod": "2023-10-18 18:41:36", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Islam-M-A", "name": { "family": "Islam", "given": "Mohammad A." } }, { "id": "Ren-Shaolei", "name": { "family": "Ren", "given": "Shaolei" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Exploiting a Thermal Side Channel for Power Attacks in Multi-Tenant Data Centers", "ispublished": "unpub", "full_text_status": "restricted", "keywords": "Data center; power attack; thermal side channel", "note": "\u00a9 2017 ACM. \n\nThis work was supported in part by the U.S. NSF under grants CNS-1551661, CNS-1565474, ECCS-1610471, AitF-1637598, CNS-1518941, and CNS-1319820.", "abstract": "The power capacity of multi-tenant data centers is typically oversubscribed in order to increase the utilization of expensive power infrastructure. This practice can create dangerous situations and compromise data center availability if the designed power capacity is exceeded. This paper demonstrates that current safeguards are vulnerable to well-timed power attacks launched by malicious tenants (i.e., attackers). Further, we demonstrate that there is a physical side channel --- a thermal side channel due to hot air recirculation --- that contains information about the benign tenants' runtime power usage and can enable a malicious tenant to time power attacks effectively. In particular, we design a state-augmented Kalman filter to extract this information from the side channel and guide an attacker to use its maximum power at moments that coincide with the benign tenants' high power demand, thus overloading the shared power capacity. Our experimental results show that an attacker can capture 54% of all attack opportunities, significantly compromising the data center availability. Finally, we discuss a set of possible defense strategies to safeguard the data center infrastructure against power attacks.", "date": "2017-11", "date_type": "published", "publisher": "Association for Computing Machinery (ACM)", "place_of_pub": "New York, NY", "pagerange": "1079-1094", "id_number": "CaltechAUTHORS:20180409-162518902", "isbn": "978-1-4503-4946-8", "book_title": "Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security - CCS '17", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20180409-162518902", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CNS-1551661" }, { "agency": "NSF", "grant_number": "CNS-1565474" }, { "agency": "NSF", "grant_number": "ECCS-1610471" }, { "agency": "NSF", "grant_number": "CCF-1637598" }, { "agency": "NSF", "grant_number": "CNS-1518941" }, { "agency": "NSF", "grant_number": "CNS-1319820" } ] }, "doi": "10.1145/3133956.3133994", "resource_type": "book_section", "pub_year": "2017", "author_list": "Islam, Mohammad A.; Ren, Shaolei; et el." }, { "id": "https://authors.library.caltech.edu/records/6rtwp-c4t40", "eprint_id": 84526, "eprint_status": "archive", "datestamp": "2023-08-19 05:25:58", "lastmod": "2023-10-18 16:18:32", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Li-Weixuan", "name": { "family": "Lin", "given": "Weixuan" } }, { "id": "Pang-John-Z-F", "name": { "family": "Pang", "given": "John Z. F." }, "orcid": "0000-0002-6485-7922" }, { "id": "Bitar-E", "name": { "family": "Bitar", "given": "Eilyan" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Networked Cournot Competition in Platform Markets", "ispublished": "unpub", "full_text_status": "restricted", "note": "\u00a9 2017 IEEE. \n\nDate Added to IEEE Xplore: 18 January 2018. \n\nThis work has received support from the NSF through AitF-1637598, CNS-1518941, CPS-154471, ECCS-1351621, and IIP-1632124. The collaboration began while the authors were visiting the Simons Institute for the Theory of Computing.", "abstract": "Unlike traditional firms, platforms do not manufacture products. Instead, they arrange matches between firms and consumers, facilitating a safe and simple trading process, providing value for all parties involved. Among the many design considerations for platforms is the trade-off between transparency and search costs. In this talk, we discuss the impact of transparency and search on the economic efficiency of platforms.", "date": "2017-10", "date_type": "published", "publisher": "IEEE", "place_of_pub": "Piscataway, NJ", "pagerange": "761-761", "id_number": "CaltechAUTHORS:20180125-133803270", "isbn": "978-1-5386-3267-3", "book_title": "2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20180125-133803270", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CCF-1637598" }, { "agency": "NSF", "grant_number": "CNS-1518941" }, { "agency": "NSF", "grant_number": "CPS-154471" }, { "agency": "NSF", "grant_number": "ECCS-1351621" }, { "agency": "NSF", "grant_number": "IIP-1632124" } ] }, "doi": "10.1109/ALLERTON.2017.8262815", "resource_type": "book_section", "pub_year": "2017", "author_list": "Lin, Weixuan; Pang, John Z. F.; et el." }, { "id": "https://authors.library.caltech.edu/records/bvyep-y7s87", "eprint_id": 78219, "eprint_status": "archive", "datestamp": "2023-08-19 03:20:59", "lastmod": "2023-10-25 23:53:19", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Islam-M-A", "name": { "family": "Islam", "given": "Mohammad A." } }, { "id": "Ren-Xiaoqi", "name": { "family": "Ren", "given": "Xiaoqi" }, "orcid": "0000-0002-1121-9046" }, { "id": "Ren-Shaolei", "name": { "family": "Ren", "given": "Shaolei" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "A Spot Capacity Market to Increase Power Infrastructure Utilization in Multi-Tenant Data Centers", "ispublished": "unpub", "full_text_status": "restricted", "note": "\u00a9 2017 Copyright held by the owner/author(s). \n\nThis work was supported in part by the U.S. NSF under grants\nCNS-1551661, CNS-1565474, ECCS-1610471, AitF-1637598 and CNS-1518941, and the Resnick Sustainability Institute at Caltech.", "abstract": "Despite the common practice of oversubscription, power capacity is largely under-utilized in data centers. A significant factor driving this under-utilization is fluctuation of the aggregate power demand, resulting in unused \"spot (power) capacity\". In this paper, we tap into spot capacity for improving power infrastructure utilization in multi-tenant data centers, an important but under-explored type of data center where multiple tenants house their own physical servers. We propose a novel spot capacity market, called SpotDC, to allocate spot capacity to tenants on demand. Specifically, SpotDC extracts tenants' rack-level spot capacity demand through an elastic demand function, based on which the operator sets the market price for spot capacity allocation. We evaluate SpotDC using both testbed experiments and simulations, demonstrating that SpotDC improves power infrastructure utilization and creates a \"win-win\" situation: the data center operator increases its profit (by nearly 10%), while tenants improve their performance (by 1.2{1.8x on average, yet at a marginal cost).", "date": "2017-06", "date_type": "published", "publisher": "ACM", "place_of_pub": "New York, NY", "pagerange": "19-20", "id_number": "CaltechAUTHORS:20170614-154927009", "isbn": "978-1-4503-5032-7", "book_title": "Proceedings of the 2017 ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems - SIGMETRICS '17 Abstracts", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170614-154927009", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CNS-1551661" }, { "agency": "NSF", "grant_number": "CNS-1565474" }, { "agency": "NSF", "grant_number": "ECCS-1610471" }, { "agency": "NSF", "grant_number": "CCF-1637598" }, { "agency": "NSF", "grant_number": "CNS-1518941" }, { "agency": "Resnick Sustainability Institute" } ] }, "local_group": { "items": [ { "id": "Resnick-Sustainability-Institute" } ] }, "doi": "10.1145/3078505.3078542", "resource_type": "book_section", "pub_year": "2017", "author_list": "Islam, Mohammad A.; Ren, Xiaoqi; et el." }, { "id": "https://authors.library.caltech.edu/records/0f82b-c8h45", "eprint_id": 82305, "eprint_status": "archive", "datestamp": "2023-08-19 02:58:13", "lastmod": "2023-10-17 22:10:51", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Pang-John-Z-F", "name": { "family": "Pang", "given": "John Z. F." }, "orcid": "0000-0002-6485-7922" }, { "id": "Fu-Hu", "name": { "family": "Fu", "given": "Hu" } }, { "id": "Lee-Won-I", "name": { "family": "Lee", "given": "Won I." } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "The efficiency of open access in platforms for networked cournot markets", "ispublished": "unpub", "full_text_status": "restricted", "note": "\u00a9 2017 IEEE. \n\nDate of Conference: 1-4 May 2017. Date Added to IEEE Xplore: 05 October 2017. \n\nThis work is supported by grants from NSF AitF-1637598, CNS-1518941, CPS-154471 and the Ronald & Maxine Linde Institute of Economic and Management Science at Caltech.", "abstract": "This paper studies how the efficiency of an online platform is impacted by the degree to which access of platform participants is open or controlled. The study is motivated by an emerging trend within platforms to impose increasingly finegrained control over the options available to platform participants. While early online platforms allowed open access, e.g., Ebay allows any seller to interact with any buyer; modern platforms often impose matches directly, e.g., Uber directly matches drivers to riders. This control is performed with the goal of achieving more efficient market outcomes. However, the results in this paper highlight that imposing matches may create new strategic incentives that lead to increased inefficiency. In particular, in the context of networked Cournot competition, we prove that open access platforms guarantee social welfare within 7/16 of the optimal; whereas controlled allocation platforms can have social welfare unboundedly worse than optimal.", "date": "2017-05", "date_type": "published", "publisher": "IEEE", "place_of_pub": "Piscataway, NJ", "pagerange": "1-9", "id_number": "CaltechAUTHORS:20171012-094453409", "isbn": "978-1-5090-5336-0", "book_title": "IEEE INFOCOM 2017 - IEEE Conference on Computer Communications", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20171012-094453409", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CCF-1637598" }, { "agency": "NSF", "grant_number": "CNS-1518941" }, { "agency": "NSF", "grant_number": "CPS-154471" }, { "agency": "Linde Institute of Economic and Management Science" } ] }, "doi": "10.1109/INFOCOM.2017.8057125", "resource_type": "book_section", "pub_year": "2017", "author_list": "Pang, John Z. F.; Fu, Hu; et el." }, { "id": "https://authors.library.caltech.edu/records/ab055-2m185", "eprint_id": 76616, "eprint_status": "archive", "datestamp": "2023-08-19 02:17:50", "lastmod": "2023-10-25 16:09:38", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Fang-Zhixuan", "name": { "family": "Fang", "given": "Zhixuan" } }, { "id": "Huang-Longbo", "name": { "family": "Huang", "given": "Longbo" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Prices and Subsidies in the Sharing Economy", "ispublished": "unpub", "full_text_status": "public", "keywords": "Sharing Economy, Game Theory", "note": "\u00a9 2017 International World Wide Web Conference Committee (IW3C2), published under Creative commons CC BY 4.0 License. \n\nThe work of Zhixuan Fang and Longbo Huang was supported in part by the National Natural Science Foundation of China Grants 61672316, 61303195, the Tsinghua Initiative Research Grant, and the China youth 1000-talent grant. The work of Adam Wierman was supported in part by NSF Grants AitF-1637598, CNS-1518941. The work was partially done when Longbo Huang and Adam Wierman were with the Simons institute for the Theory of Computing at Berkeley. The authors also want to thank Didi Chuxing for data usage authorization.\n\nPublished - p53-fang.pdf
Submitted - 1604.01627.pdf
", "abstract": "The growth of the sharing economy is driven by the emergence of sharing platforms, e.g., Uber and Lyft, that match owners looking to share their resources with customers looking to rent them. The design of such platforms is a complex mixture of economics and engineering, and how to \"optimally\" design such platforms is still an open problem. In this paper, we focus on the design of prices and subsidies in sharing platforms. Our results provide insights into the tradeoff between revenue maximizing prices and social welfare maximizing prices. Specifically, we introduce a novel model of sharing platforms and characterize the profit and social welfare maximizing prices in this model. Further, we bound the efficiency loss under profit maximizing prices, showing that there is a strong alignment between profit and efficiency in practical settings. Our results highlight that the revenue of platforms may be limited in practice due to supply short- ages; thus platforms have a strong incentive to encourage sharing via subsidies. We provide an analytic characterization of when such subsidies are valuable and show how to optimize the size of the subsidy provided. Finally, we validate the insights from our analysis using data from Didi Chuxing, the largest ridesharing platform in China.", "date": "2017-04", "date_type": "published", "publisher": "ACM", "place_of_pub": "New York, NY", "pagerange": "53-62", "id_number": "CaltechAUTHORS:20170417-144012765", "isbn": "978-1-4503-4913-0", "book_title": "Proceedings of the 26th International Conference on World Wide Web - WWW '17", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170417-144012765", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "National Natural Science Foundation of China", "grant_number": "61672316" }, { "agency": "National Natural Science Foundation of China", "grant_number": "61303195" }, { "agency": "Tsinghua Initiative" }, { "agency": "China youth 1000-talent grant" }, { "agency": "NSF", "grant_number": "AitF-1637598" }, { "agency": "NSF", "grant_number": "CNS-1518941" } ] }, "collection": "CaltechAUTHORS", "doi": "10.1145/3038912.3052564", "primary_object": { "basename": "1604.01627.pdf", "url": "https://authors.library.caltech.edu/records/ab055-2m185/files/1604.01627.pdf" }, "related_objects": [ { "basename": "p53-fang.pdf", "url": "https://authors.library.caltech.edu/records/ab055-2m185/files/p53-fang.pdf" } ], "resource_type": "book_section", "pub_year": "2017", "author_list": "Fang, Zhixuan; Huang, Longbo; et el." }, { "id": "https://authors.library.caltech.edu/records/f0qdm-w8153", "eprint_id": 77533, "eprint_status": "archive", "datestamp": "2023-08-19 01:48:42", "lastmod": "2023-10-25 23:08:39", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Xu-Yunjian", "name": { "family": "Xu", "given": "Yunjian" } }, { "id": "Cai-Desmond-W-H", "name": { "family": "Cai", "given": "Desmond" }, "orcid": "0000-0001-9207-1890" }, { "id": "Bose-Subhonmesh", "name": { "family": "Bose", "given": "Subhonmesh" }, "orcid": "0000-0002-3445-4479" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "On the efficiency of networked Stackelberg competition", "ispublished": "unpub", "full_text_status": "restricted", "note": "\u00a9 2017 IEEE. \n\nThis work was supported in part by NSF through grants CNS-1319820, EPAS-1307794.", "abstract": "We study the impact of strategic anticipative behavior in networked markets. We focus on the case of electricity markets and model the market as a game between a system operator (market maker) and generators at different nodes of the network. Generators submit quantity bids and the system operator balances demand and supply over the network subject to transmission constraints. We compare the efficiency of a networked Stackelberg equilibrium, where generators anticipate the market clearing actions of the market maker, with a networked Cournot equilibrium, where they do not. We show that networked Cournot equilibria always exists but its efficiency loss is unbounded in the worst case. In contrast, networked Stackelberg equilibria do not always exist, but in certain settings where they do exist, the efficiency loss may be bounded above by a constant.", "date": "2017-03", "date_type": "published", "publisher": "IEEE", "place_of_pub": "Piscataway, NJ", "id_number": "CaltechAUTHORS:20170517-152204343", "isbn": "978-1-5090-4780-2", "book_title": "51st Annual Conference on Information Sciences and Systems (CISS)", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170517-152204343", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CNS-1319820" }, { "agency": "NSF", "grant_number": "EPAS-1307794" } ] }, "collection": "CaltechAUTHORS", "doi": "10.1109/CISS.2017.7926159", "resource_type": "book_section", "pub_year": "2017", "author_list": "Xu, Yunjian; Cai, Desmond; et el." }, { "id": "https://authors.library.caltech.edu/records/32xaj-efb37", "eprint_id": 73397, "eprint_status": "archive", "datestamp": "2023-08-20 11:55:31", "lastmod": "2023-10-24 15:19:19", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Ren-Xiaoqi", "name": { "family": "Ren", "given": "Xiaoqi" }, "orcid": "0000-0002-1121-9046" }, { "id": "London-P", "name": { "family": "London", "given": "Palma" } }, { "id": "Ziani-Juba", "name": { "family": "Ziani", "given": "Juba" }, "orcid": "0000-0002-3324-4349" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Joint Data Purchasing and Data Placement in a Geo-Distributed Data Market", "ispublished": "unpub", "full_text_status": "public", "note": "\u00a9 2016 Copyright held by the owner/author(s). \n\nThis work is partially supported by NSF grants CNS-1254169, CNS-1319820, NETS-1518941, and BSF grant 2012348.\n\nPublished - p383-ren.pdf
Submitted - 1604.02533.pdf
", "abstract": "This paper studies design challenges faced by a geo-distributed cloud data market: which data to purchase (data purchasing) and where to place/replicate the data (data placement). We show that the joint problem of data purchasing and data placement within a cloud data market is NP-hard in general. However, we give a provably optimal algorithm for the case of a data market made up of a single data center, and then generalize the structure from the single data center setting and propose Datum, a near-optimal, polynomial-time algorithm for a geo-distributed data market.", "date": "2016-06", "date_type": "published", "publisher": "ACM", "place_of_pub": "New York, NY", "pagerange": "383-384", "id_number": "CaltechAUTHORS:20170110-152309919", "isbn": "978-1-4503-4266-7", "book_title": "SIGMETRICS '16 Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170110-152309919", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CNS-1254169" }, { "agency": "NSF", "grant_number": "CNS-1319820" }, { "agency": "NSF", "grant_number": "NETS-1518941" }, { "agency": "Binational Science Foundation (USA-Israel)", "grant_number": "2012348" } ] }, "doi": "10.1145/2896377.2901486", "primary_object": { "basename": "1604.02533.pdf", "url": "https://authors.library.caltech.edu/records/32xaj-efb37/files/1604.02533.pdf" }, "related_objects": [ { "basename": "p383-ren.pdf", "url": "https://authors.library.caltech.edu/records/32xaj-efb37/files/p383-ren.pdf" } ], "resource_type": "book_section", "pub_year": "2016", "author_list": "Ren, Xiaoqi; London, Palma; et el." }, { "id": "https://authors.library.caltech.edu/records/akf6m-05e57", "eprint_id": 73399, "eprint_status": "archive", "datestamp": "2023-08-20 11:55:38", "lastmod": "2023-10-24 15:19:24", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Chen-Niangjun", "name": { "family": "Chen", "given": "Niangjun" }, "orcid": "0000-0002-2289-9737" }, { "id": "Comden-J", "name": { "family": "Comden", "given": "Joshua" } }, { "id": "Liu-Zhenhua", "name": { "family": "Liu", "given": "Zhenhua" } }, { "id": "Gandhi-A", "name": { "family": "Gandhi", "given": "Anshul" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Using Predictions in Online Optimization: Looking Forward with an Eye on the Past", "ispublished": "unpub", "full_text_status": "restricted", "note": "\u00a9 2016 ACM. \n\nThis work is partially supported by the NSF through CNS-1464388, CNS-1464151, CNS-1319820, NETS-1518941 and an A*STAR NSS (PhD) scholarship.", "abstract": "We consider online convex optimization (OCO) problems with switching costs and noisy predictions. While the design of online algorithms for OCO problems has received considerable attention, the design of algorithms in the context of noisy predictions is largely open. To this point, two promising algorithms have been proposed: Receding Horizon Control (RHC) and Averaging Fixed Horizon Control (AFHC). The comparison of these policies is largely open. AFHC has been shown to provide better worst-case performance, while RHC outperforms AFHC in many realistic settings. In this paper, we introduce a new class of policies, Committed Horizon Control (CHC), that generalizes both RHC and AFHC. We provide average-case analysis and concentration results for CHC policies, yielding the first analysis of RHC for OCO problems with noisy predictions. Further, we provide explicit results characterizing the optimal CHC policy as a function of properties of the prediction noise, e.g., variance and correlation structure. Our results provide a characterization of when AFHC outperforms RHC and vice versa, as well as when other CHC policies outperform both RHC and AFHC.", "date": "2016-06", "date_type": "published", "publisher": "ACM", "place_of_pub": "New York, NY", "pagerange": "193-206", "id_number": "CaltechAUTHORS:20170110-153001767", "isbn": "978-1-4503-4266-7", "book_title": "SIGMETRICS '16 Proceedings of the 2016 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Science", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170110-153001767", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CNS-1464388" }, { "agency": "NSF", "grant_number": "CNS-1464151" }, { "agency": "NSF", "grant_number": "CNS-1319820" }, { "agency": "NSF", "grant_number": "NETS-1518941" }, { "agency": "Agency for Science, Technology and Research (A*STAR)" } ] }, "doi": "10.1145/2896377.2901464", "resource_type": "book_section", "pub_year": "2016", "author_list": "Chen, Niangjun; Comden, Joshua; et el." }, { "id": "https://authors.library.caltech.edu/records/zgq9g-9w402", "eprint_id": 71102, "eprint_status": "archive", "datestamp": "2023-08-20 10:44:34", "lastmod": "2023-10-23 15:20:14", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Islam-M-A", "name": { "family": "Islam", "given": "Mohammad A." } }, { "id": "Ren-Xiaoqi", "name": { "family": "Ren", "given": "Xiaoqi" }, "orcid": "0000-0002-1121-9046" }, { "id": "Ren-Shaolei", "name": { "family": "Ren", "given": "Shaolei" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Wang-Xiaorui", "name": { "family": "Wang", "given": "Xiaorui" } } ] }, "title": "A Market Approach for Handling Power Emergencies in Multi-Tenant Data Center", "ispublished": "unpub", "full_text_status": "restricted", "note": "\u00a9 2016 IEEE. \n\nThis work was supported in part by the National Science Foundation under grants CNS-1143607 (CAREER), CNS-1319820, CNS-1421452, CNS-1551661 (CAREER), and CNS-1565474.", "abstract": "Power oversubscription in data centers may occasionally trigger an emergency when the aggregate power demand exceeds the capacity. Handling such an emergency requires a graceful power capping solution that minimizes the performance loss. In this paper, we study power capping in a multi-tenant data center where the operator supplies power to multiple tenants that manage their own servers. Unlike owner-operated data centers, the operator lacks control over tenants' servers. To address this challenge, we propose a novel market mechanism based on supply function bidding, called COOP, to financially incentivize and coordinate tenants' power reduction for minimizing total performance loss (quantified in performance cost) while satisfying multiple power capping constraints. We build a prototype to show that COOP is efficient in terms of minimizing the total performance cost, even compared to the ideal but infeasible case that assumes the operator has full control over tenants' servers. We also demonstrate that COOP is \"win-win\", increasing the operator's profit (through oversubscription) and reducing tenants' cost (through financial compensation for their power reduction during emergencies).", "date": "2016-03", "date_type": "published", "publisher": "IEEE", "place_of_pub": "Piscataway, NJ", "pagerange": "432-443", "id_number": "CaltechAUTHORS:20161014-121441510", "isbn": "978-1-4673-9211-2", "book_title": "International Symposium on High Performance Computer Architecture (HPCA), 2016", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20161014-121441510", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CNS-1143607" }, { "agency": "NSF", "grant_number": "CNS-1319820" }, { "agency": "NSF", "grant_number": "CNS-1421452" }, { "agency": "NSF", "grant_number": "CNS-1551661" }, { "agency": "NSF", "grant_number": "CNS-1565474" } ] }, "doi": "10.1109/HPCA.2016.7446084", "resource_type": "book_section", "pub_year": "2016", "author_list": "Islam, Mohammad A.; Ren, Xiaoqi; et el." }, { "id": "https://authors.library.caltech.edu/records/gxqpb-4xr19", "eprint_id": 64522, "eprint_status": "archive", "datestamp": "2023-08-20 09:17:35", "lastmod": "2023-10-23 15:28:58", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Cai-Desmond-W-H", "name": { "family": "Cai", "given": "Desmond" }, "orcid": "0000-0001-9207-1890" }, { "id": "Mallada-E", "name": { "family": "Mallada", "given": "Enrique" }, "orcid": "0000-0003-1568-1833" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Distributed optimization decomposition for joint economic dispatch and frequency regulation", "ispublished": "unpub", "full_text_status": "restricted", "note": "\u00a9 2015 IEEE. \n\nARPA-E grant DE-AR0000226, Los Alamos National Lab through an DoE grant DE-AC52-06NA25396, DTRA through grant HDTRA 1-15-1-0003, Skoltech, NSF grant 1545096 as part of the NSF/DHS/DOT/NASA/NIH Cyber-Physical Systems Program, NSF grant NETS-1518941, and NSF grant EPAS-1307794.", "abstract": "Economic dispatch and frequency regulation are typically viewed as fundamentally different problems in power systems, and hence are typically studied separately. In this paper, we frame and study a joint problem that optimizes both slow timescale economic dispatch resources and fast timescale frequency regulation resources. We provide sufficient conditions under which the joint problem can be decomposed without loss of optimality into slow and fast timescale problems. These slow and fast timescale problems have appealing interpretations as the economic dispatch and frequency regulation problems respectively. Moreover, the fast timescale problem can be solved using a distributed algorithm that preserves the stability of the network during transients. We also apply this optimal decomposition to propose an efficient market mechanism for economic dispatch that coordinates with frequency regulation.", "date": "2015-12", "date_type": "published", "publisher": "IEEE", "place_of_pub": "Piscataway, NJ", "pagerange": "15-22", "id_number": "CaltechAUTHORS:20160217-073125386", "isbn": "978-1-4799-7884-7", "book_title": "54th IEEE Conference on Decision and Control (CDC)", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20160217-073125386", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "ARPA-E", "grant_number": "DE-AR0000226" }, { "agency": "Department of Energy (DOE)", "grant_number": "DE-AC52-06NA25396" }, { "agency": "Defense Threat Reduction Agency (DTRA)", "grant_number": "HD-TRA 1-15-1-0003" }, { "agency": "Skoltech" }, { "agency": "NSF", "grant_number": "CNS-1545096" }, { "agency": "NSF", "grant_number": "CNS-1518941" }, { "agency": "NSF", "grant_number": "ECCS-1307794" } ] }, "doi": "10.1109/CDC.2015.7402081", "resource_type": "book_section", "pub_year": "2015", "author_list": "Cai, Desmond; Mallada, Enrique; et el." }, { "id": "https://authors.library.caltech.edu/records/7mhx6-3yc89", "eprint_id": 72663, "eprint_status": "archive", "datestamp": "2023-08-20 09:21:16", "lastmod": "2023-10-23 22:49:44", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Badiei-M", "name": { "family": "Badiei", "given": "Masoud" } }, { "id": "Li-Na", "name": { "family": "Li", "given": "Na" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Online convex optimization with ramp constraints", "ispublished": "unpub", "full_text_status": "restricted", "note": "\u00a9 2015 IEEE. \n\nDate Added to IEEE Xplore: 11 February 2016. \n\nAdam Wierman's research is supported by NSF CNS-1319820, NSF NETS-1518941, and NSF grant 1545096 as part of the NSF/DHS/DOT/NASA/NIH Cyber-Physical Systems Program. Na Li is supported by Harvard Center for Green Buildings and Cities.", "abstract": "We study a novel variation of online convex optimization where the algorithm is subject to ramp constraints limiting the distance between consecutive actions. Our contribution is results providing asymptotically tight bounds on the worst-case performance, as measured by the competitive difference, of a variant of Model Predictive Control termed Averaging Fixed Horizon Control (AFHC). Additionally, we prove that AFHC achieves the asymptotically optimal achievable competitive difference within a general class of \"forward looking\" online algorithms. Furthermore, we illustrate that the performance of AFHC in practice is often much better than indicated by the (worst-case) competitive difference using a case study in the context of the economic dispatch problem.", "date": "2015-12", "date_type": "published", "publisher": "IEEE", "place_of_pub": "Piscataway, NJ", "pagerange": "6730-6736", "id_number": "CaltechAUTHORS:20161208-110252233", "isbn": "978-1-4799-7886-1", "book_title": "54th IEEE Conference on Decision and Control (CDC), 2015", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20161208-110252233", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CNS-1319820" }, { "agency": "NSF", "grant_number": "NETS-1518941" }, { "agency": "NSF", "grant_number": "CNS-1545096" }, { "agency": "Harvard Center for Green Buildings and Cities" } ] }, "doi": "10.1109/CDC.2015.7403279", "resource_type": "book_section", "pub_year": "2015", "author_list": "Badiei, Masoud; Li, Na; et el." }, { "id": "https://authors.library.caltech.edu/records/2qw2c-ywb10", "eprint_id": 70529, "eprint_status": "archive", "datestamp": "2023-08-20 09:20:22", "lastmod": "2023-10-20 23:04:41", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Chen-Hao", "name": { "family": "Chen", "given": "Hao" } }, { "id": "Liu-Zhenhuan", "name": { "family": "Liu", "given": "Zhenhuan" } }, { "id": "Coskun-Ayse-K", "name": { "family": "Coskun", "given": "Ayse K." } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Optimizing Energy Storage Participation in Emerging Power Markets", "ispublished": "unpub", "full_text_status": "public", "note": "\u00a9 2015 IEEE. Date Added to IEEE Xplore: 28 January 2016.\n\nSubmitted - 1510.00083.pdf
", "abstract": "The growing amount of intermittent renewables in power generation creates challenges for real-time matching of supply and demand in the power grid. Emerging ancillary power markets provide new incentives to consumers (e.g., electrical vehicles, data centers, and others) to perform demand response to help stabilize the electricity grid. A promising class of potential demand response providers includes energy storage systems (ESSs). This paper evaluates the benefits of using various types of novel ESS technologies for a variety of emerging smart grid demand response programs, such as regulation services reserves (RSRs), contingency reserves, and peak shaving. We model, formulate and solve optimization problems to maximize the net profit of ESSs in providing each demand response. Our solution selects the optimal power and energy capacities of the ESS, determines the optimal reserve value to provide as well as the ESS real-time operational policy for program participation. Our results highlight that applying ultra-capacitors and flywheels in RSR has the potential to be up to 30 times more profitable than using common battery technologies such as LI and LA batteries for peak shaving.", "date": "2015-12", "date_type": "published", "publisher": "IEEE", "place_of_pub": "Piscataway, NJ", "pagerange": "1-6", "id_number": "CaltechAUTHORS:20160922-105824468", "isbn": "978-1-5090-0172-9", "book_title": "2015 Sixth International Green and Sustainable Computing Conference (IGSC)", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20160922-105824468", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1109/IGCC.2015.7393718", "primary_object": { "basename": "1510.00083.pdf", "url": "https://authors.library.caltech.edu/records/2qw2c-ywb10/files/1510.00083.pdf" }, "resource_type": "book_section", "pub_year": "2015", "author_list": "Chen, Hao; Liu, Zhenhuan; et el." }, { "id": "https://authors.library.caltech.edu/records/g3qys-8yj54", "eprint_id": 60521, "eprint_status": "archive", "datestamp": "2023-08-22 16:07:12", "lastmod": "2023-10-24 16:37:28", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Ren-Xiaoqi", "name": { "family": "Ren", "given": "Xiaoqi" }, "orcid": "0000-0002-1121-9046" }, { "id": "Ananthanarayanan-G", "name": { "family": "Ananthanarayanan", "given": "Ganesh" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Yu-Minlan", "name": { "family": "Yu", "given": "Minlan" } } ] }, "title": "Hopper: Decentralized Speculation-aware Cluster Scheduling at Scale", "ispublished": "unpub", "full_text_status": "public", "keywords": "speculation; decentralized scheduling; straggler; fairness", "note": "\u00a9 2015 ACM.\n\nWe would like to thank Michael Chien-Chun Hung, Shivaram Venkataraman, Masoud Moshref, Niangjun Chen, Qiuyu Peng, and Changhong Zhao for their insightful discussions. We would like to thank the anonymous reviewers and our shepherd, Lixin Gao, for their thoughtful suggestions. This work was supported in part by National Science Foundation (NSF) with Grants (CNS-1319820, CNS-1423505).\n\nPublished - p379-ren.pdf
Submitted - hopper.pdf
", "abstract": "As clusters continue to grow in size and complexity, providing scalable and predictable performance is an increasingly important challenge. A crucial roadblock to achieving predictable performance is stragglers, i.e., tasks that take significantly longer than expected to run. At this point, speculative execution has been widely adopted to mitigate the impact of stragglers. However, speculation mechanisms are designed and operated independently of job scheduling when, in fact, scheduling a speculative copy of a task has a direct impact on the resources available for other jobs. In this work, we present Hopper, a job scheduler that is speculation-aware, i.e., that integrates the tradeoffs associated with speculation into job scheduling decisions. We implement both centralized and decentralized prototypes of the Hopper scheduler and show that 50% (66%) improvements over state-of-the-art centralized (decentralized) schedulers and speculation strategies can be achieved through the coordination of scheduling and speculation.", "date": "2015-08", "date_type": "published", "publisher": "Association for Computing Machinery", "place_of_pub": "New York, NY", "pagerange": "379-392", "id_number": "CaltechAUTHORS:20150925-112011035", "isbn": "978-1-4503-3542-3", "book_title": "Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20150925-112011035", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CNS-1319820" }, { "agency": "NSF", "grant_number": "CNS-1423505" } ] }, "doi": "10.1145/2785956.2787481", "primary_object": { "basename": "hopper.pdf", "url": "https://authors.library.caltech.edu/records/g3qys-8yj54/files/hopper.pdf" }, "related_objects": [ { "basename": "p379-ren.pdf", "url": "https://authors.library.caltech.edu/records/g3qys-8yj54/files/p379-ren.pdf" } ], "resource_type": "book_section", "pub_year": "2015", "author_list": "Ren, Xiaoqi; Ananthanarayanan, Ganesh; et el." }, { "id": "https://authors.library.caltech.edu/records/yg990-t9x53", "eprint_id": 58891, "eprint_status": "archive", "datestamp": "2023-08-20 06:28:49", "lastmod": "2023-10-23 19:51:06", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Chen-Niangjun", "name": { "family": "Chen", "given": "Niangjun" }, "orcid": "0000-0002-2289-9737" }, { "id": "Agarwal-A", "name": { "family": "Agarwal", "given": "Anish" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Barman-S", "name": { "family": "Barman", "given": "Siddharth" } }, { "id": "Andrew-L-L-H", "name": { "family": "Andrew", "given": "Lachlan L. H." } } ] }, "title": "Online Convex Optimization Using Predictions", "ispublished": "unpub", "full_text_status": "public", "note": "\u00a9 2015 ACM.\n\nThis work is partially supported by the NSF through CNS-1319820, EPAS-1307794, CNS-0846025, CCF-1101470 and the ARC through DP130101378.\n\nSubmitted - 1504.06681v1.pdf
", "abstract": "Making use of predictions is a crucial, but under-explored, area of online algorithms. This paper studies a class of online optimization problems where we have external noisy predictions available. We propose a stochastic prediction error model that generalizes prior models in the learning and stochastic control communities, incorporates correlation among prediction errors, and captures the fact that predictions improve as time passes. We prove that achieving sublinear regret and constant competitive ratio for online algorithms requires the use of an unbounded prediction window in adversarial settings, but that under more realistic stochastic prediction error models it is possible to use Averaging Fixed Horizon Control (AFHC) to simultaneously achieve sublinear regret and constant competitive ratio in expectation using only a constant-sized prediction window. Furthermore, we show that the performance of AFHC is tightly concentrated around its mean.", "date": "2015-06", "date_type": "published", "publisher": "Association for Computing Machinery", "place_of_pub": "New York, NY", "pagerange": "191-204", "id_number": "CaltechAUTHORS:20150715-103043881", "isbn": "978-1-4503-3486-0", "book_title": "Proceedings of the 2015 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20150715-103043881", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CNS-1319820" }, { "agency": "NSF", "grant_number": "EPAS-1307794" }, { "agency": "NSF", "grant_number": "CNS-0846025" }, { "agency": "NSF", "grant_number": "CCF-1101470" }, { "agency": "Australian Research Council", "grant_number": "DP130101378" } ] }, "doi": "10.1145/2745844.2745854", "primary_object": { "basename": "1504.06681v1.pdf", "url": "https://authors.library.caltech.edu/records/yg990-t9x53/files/1504.06681v1.pdf" }, "resource_type": "book_section", "pub_year": "2015", "author_list": "Chen, Niangjun; Agarwal, Anish; et el." }, { "id": "https://authors.library.caltech.edu/records/f8y8q-tpf45", "eprint_id": 66121, "eprint_status": "archive", "datestamp": "2023-08-20 04:15:02", "lastmod": "2023-10-20 23:10:11", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Cai-Desmond-W-H", "name": { "family": "Cai", "given": "Desmond" }, "orcid": "0000-0001-9207-1890" }, { "id": "Mallada-E", "name": { "family": "Mallada", "given": "Enrique" }, "orcid": "0000-0003-1568-1833" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Distributed optimization decomposition for joint economic dispatch and frequency regulation", "ispublished": "unpub", "full_text_status": "public", "note": "\u00a9 2015 IEEE. \n\nARPA-E grant DE-AR0000226, Los Alamos National Lab through an DoE grant DE-AC52-06NA25396, DTRA through grant HDTRA 1-15-1-0003, Skoltech, NSF grant 1545096 as part of the NSF/DHS/DOT/NASA/NIH Cyber-Physical Systems Program, NSF grant NETS-1518941, and NSF grant EPAS-1307794. The authors would like to thank Steven H. Low from Caltech for insightful discussions.\n\nSubmitted - cdc15cmw.pdf
", "abstract": "Networked markets typically operate on multiple\ntime scales. For example, electricity markets are split into\nslow timescale economic dispatch and fast timescale frequency regulation markets. Nevertheless, the different time scales are typically viewed as fundamentally different problems and hence are studied separately. In this paper, we frame and study a joint problem that optimizes both slow and fast timescale resources in electricity markets. We provide necessary and sufficient conditions under which the joint problem can be decomposed without loss of optimality into slow and fast timescale problems. These slow and fast timescale problems have appealing interpretations as the economic dispatch and frequency regulation problems respectively. Moreover, the fast timescale problem can be solved using a distributed algorithm that preserves the stability of the network during transients.\nWe apply our result to propose an efficient market mechanism\nfor coordinating economic dispatch and frequency regulation\nresources.", "date": "2015", "date_type": "published", "publisher": "IEEE", "id_number": "CaltechAUTHORS:20160413-112712727", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20160413-112712727", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "ARPA-E", "grant_number": "DE-AR0000226" }, { "agency": "Department of Energy (DOE)", "grant_number": "DE-AC52-06NA25396" }, { "agency": "Defense Threat Reduction Agency (DTRA)", "grant_number": "HDTRA 1-15-1-0003" }, { "agency": "Skoltech" }, { "agency": "NSF", "grant_number": "1545096" }, { "agency": "NSF", "grant_number": "NETS-1518941" }, { "agency": "NSF", "grant_number": "EPAS-1307794" } ] }, "doi": "10.1109/ALLERTON.2015.7447078", "primary_object": { "basename": "cdc15cmw.pdf", "url": "https://authors.library.caltech.edu/records/f8y8q-tpf45/files/cdc15cmw.pdf" }, "resource_type": "book_section", "pub_year": "2015", "author_list": "Cai, Desmond; Mallada, Enrique; et el." }, { "id": "https://authors.library.caltech.edu/records/10c4g-rc417", "eprint_id": 80097, "eprint_status": "archive", "datestamp": "2023-08-20 03:54:18", "lastmod": "2023-10-17 15:29:49", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Chen-Niangjun", "name": { "family": "Chen", "given": "Niangjun" }, "orcid": "0000-0002-2289-9737" }, { "id": "Gan-Lingwen", "name": { "family": "Gan", "given": "Lingwen" } }, { "id": "Low-S-H", "name": { "family": "Low", "given": "Steven H." }, "orcid": "0000-0001-6476-3048" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Distributional analysis for model predictive deferrable load control", "ispublished": "unpub", "full_text_status": "public", "keywords": "Load flow control, Load modeling, Prediction algorithms, Predictive models, Load management, Algorithm design and analysis, Analytical models", "note": "\u00a9 2014 IEEE.\n\nSubmitted - 1403.6887.pdf
", "abstract": "Deferrable load control is essential for handling the uncertainties associated with the increasing penetration of renewable generation. Model predictive control has emerged as an effective approach for deferrable load control, and has received considerable attention. Though the average-case performance of model predictive deferrable load control has been analyzed in prior works, the distribution of the performance has been elusive. In this paper, we prove strong concentration results on the load variation obtained by model predictive deferrable load control. These results highlight that the typical performance of model predictive deferrable load control is tightly concentrated around the average-case performance.", "date": "2014-12", "date_type": "published", "publisher": "IEEE", "place_of_pub": "Piscataway, NJ", "pagerange": "6433-6438", "id_number": "CaltechAUTHORS:20170810-105540217", "isbn": "978-1-4799-7746-8", "book_title": "53rd IEEE Conference on Decision and Control", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170810-105540217", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1109/CDC.2014.7040398", "primary_object": { "basename": "1403.6887.pdf", "url": "https://authors.library.caltech.edu/records/10c4g-rc417/files/1403.6887.pdf" }, "resource_type": "book_section", "pub_year": "2014", "author_list": "Chen, Niangjun; Gan, Lingwen; et el." }, { "id": "https://authors.library.caltech.edu/records/7ak7c-qp636", "eprint_id": 80072, "eprint_status": "archive", "datestamp": "2023-08-20 03:54:10", "lastmod": "2023-10-20 23:22:15", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Bose-Subhonmesh", "name": { "family": "Bose", "given": "Subhonmesh" }, "orcid": "0000-0002-3445-4479" }, { "id": "Cai-Desmond-W-H", "name": { "family": "Cai", "given": "Desmond W. H." }, "orcid": "0000-0001-9207-1890" }, { "id": "Low-S-H", "name": { "family": "Low", "given": "Steven H." }, "orcid": "0000-0001-6476-3048" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "The role of a market maker in networked Cournot competition", "ispublished": "unpub", "full_text_status": "public", "keywords": "Generators, Electricity supply industry, Vectors, Games, Mathematical model, Nash equilibrium, Pricing", "note": "\u00a9 2014 IEEE. \n\nSupported by: NSF through NetSE CNS 0911041, ARPA-E through\nGENI DE-AR0000226, EPAS-1307794, Southern California Edison, the National Science Council of Taiwan through NSC 103-3113-P-008-001, the Los Alamos National Lab (DoE), and Caltech's Resnick Institute.\n\nSubmitted - 1403.7286.pdf
Submitted - 1701.08896.pdf
", "abstract": "We study the role of a market maker (or market operator) in a transmission constrained electricity market. We model the market as a one-shot networked Cournot competition where generators supply quantity bids and load serving entities provide downward sloping inverse demand functions. This mimics the operation of a spot market in a deregulated market structure. In this paper, we focus on possible mechanisms employed by the market maker to balance demand and supply. In particular, we consider three candidate objective functions that the market maker optimizes - social welfare, residual social welfare, and consumer surplus. We characterize the existence of Generalized Nash Equilibrium (GNE) in this setting and demonstrate that market outcomes at equilibrium can be very different under the candidate objective functions.", "date": "2014-12", "date_type": "published", "publisher": "IEEE", "place_of_pub": "Piscataway, NJ", "pagerange": "4479-4484", "id_number": "CaltechAUTHORS:20170810-101313051", "isbn": "978-1-4799-7746-8", "book_title": "53rd IEEE Annual Conference on Decision and Control", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170810-101313051", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CNS-0911041" }, { "agency": "ARPA-E", "grant_number": "DE-AR0000226" }, { "agency": "NSF", "grant_number": "EPAS-1307794" }, { "agency": "Southern California Edison" }, { "agency": "National Science Council (Taipei)", "grant_number": "NSC 103-3113-P-008-001" }, { "agency": "Los Alamos National Laboratory" }, { "agency": "Resnick Sustainability Institute" } ] }, "local_group": { "items": [ { "id": "Resnick-Sustainability-Institute" } ] }, "doi": "10.1109/CDC.2014.7040088", "primary_object": { "basename": "1403.7286.pdf", "url": "https://authors.library.caltech.edu/records/7ak7c-qp636/files/1403.7286.pdf" }, "related_objects": [ { "basename": "1701.08896.pdf", "url": "https://authors.library.caltech.edu/records/7ak7c-qp636/files/1701.08896.pdf" } ], "resource_type": "book_section", "pub_year": "2014", "author_list": "Bose, Subhonmesh; Cai, Desmond W. H.; et el." }, { "id": "https://authors.library.caltech.edu/records/b07zz-86426", "eprint_id": 73643, "eprint_status": "archive", "datestamp": "2023-08-20 02:48:23", "lastmod": "2023-10-24 15:33:28", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Nair-J", "name": { "family": "Nair", "given": "Jayakrishnan" } }, { "id": "Subramanian-V-G", "name": { "family": "Subramanian", "given": "Vijay G." } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "On competitive provisioning of ad-supported cloud services", "ispublished": "unpub", "full_text_status": "restricted", "note": "\u00a9 2014 IEEE.", "abstract": "Motivated by cloud services with ad-supported revenues, we consider the interplay of network effects, congestion, and competition in determining the market structure in such environments. In particular, we study the strategic interactions between competing service providers and a user base, modeling congestion sensitivity and two forms of positive network effects: \"firm-specific\" versus \"industry-wide.\" Our analysis reveals that users are generally no better off due to competition in a marketplace of ad-supported services as the congestion levels are of the same order as if there were only one firm. Further, our analysis highlights an important contrast between firm-specific and industry-wide network effects: multiple firms can coexist in a marketplace with industry-wide network effects, but near-monopolies tend to emerge in marketplaces with firm-specific network effects.", "date": "2014-09", "date_type": "published", "publisher": "IEEE", "place_of_pub": "Piscataway, NJ", "pagerange": "137-139", "id_number": "CaltechAUTHORS:20170123-171506679", "isbn": "978-1-4799-8009-3", "book_title": "52nd Annual Allerton Conference on Communication, Control, and Computing", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170123-171506679", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1109/ALLERTON.2014.7028447", "resource_type": "book_section", "pub_year": "2014", "author_list": "Nair, Jayakrishnan; Subramanian, Vijay G.; et el." }, { "id": "https://authors.library.caltech.edu/records/0t069-xcj49", "eprint_id": 47889, "eprint_status": "archive", "datestamp": "2023-08-22 12:54:08", "lastmod": "2023-10-26 21:19:57", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Gopalakrishnan-R", "name": { "family": "Gopalakrishnan", "given": "Ragavendran" } }, { "id": "Doroudi-S", "name": { "family": "Doroudi", "given": "Sherwin" } }, { "id": "Ward-A-R", "name": { "family": "Ward", "given": "Amy R." } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Routing and staffing when servers are strategic", "ispublished": "unpub", "full_text_status": "public", "keywords": "service systems; staffing; routing; scheduling; strategic servers", "note": "\u00a9 2014 ACM.\n\nPublication Date: June 1, 2014.\n\nThis work was supported by NSF grant #CCF-1101470, AFOSR grant #FA9550-12-1-0359, and ONR grant #N00014-09-1-0751.\n\nSubmitted - 1402.3606v1.pdf
", "abstract": "Traditionally, research focusing on the design of routing and staffing policies for service systems has modeled servers as having fixed (possibly heterogeneous) service rates. However, service systems are generally staffed by people. Furthermore, people respond to workload incentives; that is, how hard a person works can depend both on how much work there is, and how the work is divided between the people responsible for it. In a service system, the routing and staffing policies control such workload incentives; and so the rate servers work will be impacted by these policies. This observation has consequences when modeling service system performance, and our objective in this paper is to investigate those consequences.\n\nWe do this in the context of the M/M/N queue, which is the canonical model for large service systems. First, we present a model for \"strategic\" servers that choose their service rate, in which there is a trade-off between an \"effort cost\" and a \"value of idleness\": faster service rates require more exertion of effort, but also lead to more idle time. Next, we characterize the symmetric Nash equilibrium service rate under any routing policy that routes based on the server idle time (such as the Longest Idle Server First policy). This allows us to (asymptotically) solve the problem of minimizing the total cost, when there are linear staffing costs and linear waiting costs. We find that an asymptotically optimal staffing policy staffs strictly more than the common square-root staffing policy. Finally, we end by exploring the question of whether routing policies that are based on the service rate, instead of the server idle time, can improve system performance.", "date": "2014-06-01", "date_type": "published", "publisher": "Association for Computing Machinery", "place_of_pub": "New York", "pagerange": "713-714", "id_number": "CaltechAUTHORS:20140804-112736460", "isbn": "9781450325653", "book_title": "Proceedings of the Fifteenth ACM conference on Economics and Computation", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20140804-112736460", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CCF-1101470" }, { "agency": "Air Force Office of Scientific Research (AFOSR)", "grant_number": "FA9550-12-1-0359" }, { "agency": "Office of Naval Research (ONR)", "grant_number": "N00014-09-1-0751" } ] }, "doi": "10.1145/2600057.2602831", "primary_object": { "basename": "1402.3606v1.pdf", "url": "https://authors.library.caltech.edu/records/0t069-xcj49/files/1402.3606v1.pdf" }, "resource_type": "book_section", "pub_year": "2014", "author_list": "Gopalakrishnan, Ragavendran; Doroudi, Sherwin; et el." }, { "id": "https://authors.library.caltech.edu/records/27m6n-zym27", "eprint_id": 72605, "eprint_status": "archive", "datestamp": "2023-08-20 01:15:58", "lastmod": "2023-10-23 22:46:01", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Nair-J", "name": { "family": "Nair", "given": "Jayakrishnan" } }, { "id": "Adlakha-S", "name": { "family": "Adlakha", "given": "Sachin" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Energy procurement strategies in the presence of intermittent sources", "ispublished": "unpub", "full_text_status": "restricted", "note": "\u00a9 2014 ACM. \n\nThe authors gratefully acknowledge the support of the NSF through grant CNS 0846025 and NetSE grant CNS 0911041, the ARO through MURI grant W911NF-08-1-0233, and Bell Labs, Alcatel-Lucent. The first author also acknowledges support from an NWO VIDI grant.", "abstract": "The increasing penetration of intermittent, unpredictable renewable energy sources such as wind energy, poses significant challenges for utility companies trying to incorporate renewable energy in their portfolio. In this work, we study the problem of conventional energy procurement in the presence of intermittent renewable resources. We model the problem as a variant of the newsvendor problem, in which the presence of renewable resources induces supply side uncertainty, and in which conventional energy may be procured in three stages to balance supply and demand. We compute closed-form expressions for the optimal energy procurement strategy and study the impact of increasing renewable penetration, and of proposed changes to the structure of electricity markets. We explicitly characterize the impact of a growing renewable penetration on the procurement policy by considering a scaling regime that models the aggregation of unpredictable renewable sources. A key insight from our results is that there is a separation between the impact of the stochastic nature of this aggregation, and the impact of market structure and forecast accuracy. Additionally, we study the impact on procurement of two proposed changes to the market structure: the addition and the placement of an intermediate market. We show that addition of an intermediate market does not necessarily increase the efficiency of utilization of renewable sources. Further, we show that the optimal placement of the intermediate market is insensitive to the level of renewable penetration.", "date": "2014-06", "date_type": "published", "publisher": "ACM", "place_of_pub": "New York, NY", "pagerange": "85-97", "id_number": "CaltechAUTHORS:20161206-151325440", "isbn": "978-1-4503-2789-3", "book_title": "SIGMETRICS '14 The 2014 ACM international conference on Measurement and modeling of computer systems", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20161206-151325440", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CNS-0846025" }, { "agency": "NSF NetSE", "grant_number": "CNS-0911041" }, { "agency": "Army Research Office (ARO)", "grant_number": "W911NF-08-1-0233" }, { "agency": "Bell Labs of Alcatel-Lucent" }, { "agency": "Nederlandse Organisatie voor Wetenschappelijk Onderzoek (NWO)" } ] }, "contributors": { "items": [ { "id": "Sanghavi-S", "name": { "family": "Sanghavi", "given": "Sujay" } }, { "id": "Shakkottai-S", "name": { "family": "Shakkottai", "given": "Sanjay" } } ] }, "doi": "10.1145/2591971.2591982", "resource_type": "book_section", "pub_year": "2014", "author_list": "Nair, Jayakrishnan; Adlakha, Sachin; et el." }, { "id": "https://authors.library.caltech.edu/records/8s4tj-11n34", "eprint_id": 72348, "eprint_status": "archive", "datestamp": "2023-08-20 01:15:50", "lastmod": "2023-10-23 21:39:34", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Liu-Zhenhua", "name": { "family": "Liu", "given": "Zhenhua" } }, { "id": "Liu-Iris", "name": { "family": "Liu", "given": "Iris" } }, { "id": "Low-S-H", "name": { "family": "Low", "given": "Steven" }, "orcid": "0000-0001-6476-3048" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Pricing data center demand response", "ispublished": "unpub", "full_text_status": "restricted", "keywords": "data center, demand response, prediction based pricing, power network", "note": "\u00a9 2014 ACM. \n\nThis work was supported by NSF grants CCF 0830511, CNS 0911041, and CNS 0846025, DoE grant DE-EE0002890, ARO MURI grant W911NF-08-1-0233, Microsoft Research, Bell Labs, the Lee Center for Advanced Networking, and ARC grant FT0991594.", "abstract": "Demand response is crucial for the incorporation of renewable energy into the grid. In this paper, we focus on a particularly promising industry for demand response: data centers. We use simulations to show that, not only are data centers large loads, but they can provide as much (or possibly more) flexibility as large-scale storage if given the proper incentives. However, due to the market power most data centers maintain, it is difficult to design programs that are efficient for data center demand response. To that end, we propose that prediction-based pricing is an appealing market design, and show that it outperforms more traditional supply function bidding mechanisms in situations where market power is an issue. However, prediction-based pricing may be inefficient when predictions are inaccurate, and so we provide analytic, worst-case bounds on the impact of prediction error on the efficiency of prediction-based pricing. These bounds hold even when network constraints are considered, and highlight that prediction-based pricing is surprisingly robust to prediction error.", "date": "2014-06", "date_type": "published", "publisher": "ACM", "place_of_pub": "New York, NY", "pagerange": "111-123", "id_number": "CaltechAUTHORS:20161128-163510694", "isbn": "978-1-4503-2789-3", "book_title": "SIGMETRICS '14 The 2014 ACM international conference on Measurement and modeling of computer systems", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20161128-163510694", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CCF-0830511" }, { "agency": "NSF", "grant_number": "CNS-0911041" }, { "agency": "NSF", "grant_number": "CNS-0846025" }, { "agency": "Department of Energy (DOE)", "grant_number": "DE-EE0002890" }, { "agency": "Army Research Office (ARO)", "grant_number": "W911NF-08-1-0233" }, { "agency": "Microsoft Research" }, { "agency": "Bell Labs" }, { "agency": "Caltech Lee Center for Advanced Networking" }, { "agency": "Australian Research Council", "grant_number": "FT0991594" } ] }, "contributors": { "items": [ { "id": "Sanghavi-S", "name": { "family": "Sanghavi", "given": "Sujay" } }, { "id": "Shakkottai-S", "name": { "family": "Shakkottai", "given": "Sanjay" } } ] }, "doi": "10.1145/2591971.2592004", "resource_type": "book_section", "pub_year": "2014", "author_list": "Liu, Zhenhua; Liu, Iris; et el." }, { "id": "https://authors.library.caltech.edu/records/g0vaa-01664", "eprint_id": 70903, "eprint_status": "archive", "datestamp": "2023-08-22 12:52:10", "lastmod": "2023-10-20 23:37:51", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Cummings-R", "name": { "family": "Cummings", "given": "Rachel" } }, { "id": "Echenique-F", "name": { "family": "Echenique", "given": "Federico" }, "orcid": "0000-0002-1567-6770" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "The empirical implications of privacy-aware choice", "ispublished": "unpub", "full_text_status": "public", "keywords": "Privacy; revealed preference", "note": "Copyright is held by the author/owner(s). \n\nThis work was supported by NSF grants 1101470, 1216006, and CNS-1254169, as well as BFS grant 2012348 and the Charles Lee Powell Foundation.\n\nPublished - p969-cummings.pdf
Submitted - 1401.0336.pdf
", "abstract": "This paper initiates the study of the testable implications of choice data in settings where agents have privacy preferences. We adapt the standard conceptualization of consumer choice theory to a situation where the consumer is aware of, and has preferences over, the information revealed by her choices. The main message of the paper is that little can be inferred about consumers' preferences once we introduce the possibility that the consumer has concerns about privacy. This holds even when consumers' privacy preferences are assumed to be monotonic and separable. This motivates the consideration of stronger assumptions and, to that\nend, we introduce an additive model for privacy preferences that does have testable implications.", "date": "2014-06", "date_type": "published", "publisher": "ACM", "place_of_pub": "New York, NY", "pagerange": "969", "id_number": "CaltechAUTHORS:20161005-162239588", "isbn": "978-1-4503-2565-3", "book_title": "EC '14 Proceedings of the fifteenth ACM conference on Economics and computation", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20161005-162239588", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CCF-1101470" }, { "agency": "NSF", "grant_number": "CCF-1216006" }, { "agency": "NSF", "grant_number": "CNS-1254169" }, { "agency": "Binational Science Foundation (USA-Israel)", "grant_number": "2012348" }, { "agency": "Charles Lee Powell Foundation" } ] }, "doi": "10.1145/2600057.2602830", "primary_object": { "basename": "1401.0336.pdf", "url": "https://authors.library.caltech.edu/records/g0vaa-01664/files/1401.0336.pdf" }, "related_objects": [ { "basename": "p969-cummings.pdf", "url": "https://authors.library.caltech.edu/records/g0vaa-01664/files/p969-cummings.pdf" } ], "resource_type": "book_section", "pub_year": "2014", "author_list": "Cummings, Rachel; Echenique, Federico; et el." }, { "id": "https://authors.library.caltech.edu/records/8vrg5-b3886", "eprint_id": 66286, "eprint_status": "archive", "datestamp": "2023-08-20 00:16:43", "lastmod": "2023-10-18 17:56:48", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Ananthanarayanan-G", "name": { "family": "Ananthanarayanan", "given": "Ganesh" } }, { "id": "Hung-Michael-Chien-Chun", "name": { "family": "Hung", "given": "Michael Chien-Chun" } }, { "id": "Ren-Xiaoqi", "name": { "family": "Ren", "given": "Xiaoqi" }, "orcid": "0000-0002-1121-9046" }, { "id": "Stoica-I", "name": { "family": "Stoica", "given": "Ion" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Yu-Minlan", "name": { "family": "Yu", "given": "Minlan" } } ] }, "title": "GRASS: Trimming Stragglers in Approximation Analytics", "ispublished": "unpub", "full_text_status": "public", "note": "\u00a9 2014 Usenix Association. \n\nWe thank our shepherd Nina Taft and the anonymous reviewers for their suggestions to improve this work. We also thank Rohan Gandhi for his feedback on our early drafts. This research was partially funded by research grant NSF CNS-1319820, NSF CISE Expeditions award CCF-1139158, the DARPA XData Award FA8750-12-2-0331, and gifts from Qualcomm, Amazon Web Services, Google, SAP, Blue Goji, Cisco, Clearstory Data, Cloudera, Ericsson, Facebook, General Electric, Hortonworks, Huawei, Intel, Microsoft, NetApp, Oracle, Quanta, Samsung, Splunk, VMware and Yahoo!.\n\nPublished - nsdi14-paper-ananthanarayanan.pdf
Published - nsdi14_slides_ananthanarayanan.pdf
Presentation - ananthanarayanan.mp4
", "abstract": "In big data analytics, timely results, even if based on\nonly part of the data, are often good enough. For this\nreason, approximation jobs, which have deadline or error\nbounds and require only a subset of their tasks to\ncomplete, are projected to dominate big data workloads.\nStraggler tasks are an important hurdle when designing\napproximate data analytic frameworks, and the widely\nadopted approach to deal with them is speculative execution.\nIn this paper, we present GRASS, which carefully\nuses speculation to mitigate the impact of stragglers in\napproximation jobs. GRASS's design is based on first\nprinciples analysis of the impact of speculation. GRASS\ndelicately balances immediacy of improving the approximation\ngoal with the long term implications of using extra\nresources for speculation. Evaluations with production\nworkloads from Facebook and Microsoft Bing in an\nEC2 cluster of 200 nodes shows that GRASS increases\naccuracy of deadline-bound jobs by 47% and speeds up\nerror-bound jobs by 38%. GRASS's design also speeds\nup exact computations (zero error-bound), making it a\nunified solution for straggler mitigation.", "date": "2014-04", "date_type": "published", "publisher": "USENIX Association", "place_of_pub": "Berkeley, CA", "pagerange": "289-302", "id_number": "CaltechAUTHORS:20160419-161606584", "isbn": "978-1-931971-09-6", "book_title": "Proceedings of the 11th USENIX Symposium on Networked Systems Design and Implementation (NSDI '14)", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20160419-161606584", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CNS-1319820" }, { "agency": "NSF", "grant_number": "CCF-1139158" }, { "agency": "Defense Advanced Research Projects Agency (DARPA)" }, { "agency": "Qualcomm" }, { "agency": "Amazon Web Services" }, { "agency": "Google" }, { "agency": "SAP" }, { "agency": "Blue Goji" }, { "agency": "Cisco" }, { "agency": "Clearstory Data" }, { "agency": "Cloudera" }, { "agency": "Ericsson" }, { "agency": "Facebook" }, { "agency": "General Electric" }, { "agency": "Hortonworks" }, { "agency": "Huawei" }, { "agency": "Intel" }, { "agency": "Microsoft" }, { "agency": "NetApp" }, { "agency": "Oracle" }, { "agency": "Quanta" }, { "agency": "Samsung" }, { "agency": "Splunk" }, { "agency": "VMware" }, { "agency": "Yahoo!" }, { "agency": "Air Force Office of Scientific Research (AFOSR)", "grant_number": "FA8750-12-2-0331" } ] }, "primary_object": { "basename": "ananthanarayanan.mp4", "url": "https://authors.library.caltech.edu/records/8vrg5-b3886/files/ananthanarayanan.mp4" }, "related_objects": [ { "basename": "nsdi14-paper-ananthanarayanan.pdf", "url": "https://authors.library.caltech.edu/records/8vrg5-b3886/files/nsdi14-paper-ananthanarayanan.pdf" }, { "basename": "nsdi14_slides_ananthanarayanan.pdf", "url": "https://authors.library.caltech.edu/records/8vrg5-b3886/files/nsdi14_slides_ananthanarayanan.pdf" } ], "resource_type": "book_section", "pub_year": "2014", "author_list": "Ananthanarayanan, Ganesh; Hung, Michael Chien-Chun; et el." }, { "id": "https://authors.library.caltech.edu/records/40ykk-qy211", "eprint_id": 58232, "eprint_status": "archive", "datestamp": "2023-08-19 22:47:19", "lastmod": "2024-01-13 16:21:36", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Barman-S", "name": { "family": "Barman", "given": "Siddharth" } }, { "id": "Bhaskar-U", "name": { "family": "Bhaskar", "given": "Umang" } }, { "id": "Echenique-F", "name": { "family": "Echenique", "given": "Federico" }, "orcid": "0000-0002-1567-6770" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "On the Existence of Low-Rank Explanations for Mixed Strategy Behavior", "ispublished": "unpub", "full_text_status": "public", "keywords": "equilibrium computation, revealed preference, matrix rank", "note": "\u00a9 2014 Springer International Publishing Switzerland.\n\nThis research was supported by NSF grants CNS-0846025, EPAS-1307794, and CCF-1101470, along with a Linde/SISL postdoctoral fellowship.\n\nSubmitted - 1311.2655v2.pdf
", "abstract": "Nash equilibrium is used as a model to explain the observed behavior of players in strategic settings. For example, in many empirical applications we observe player behavior, and the problem is to determine if there exist payoffs for the players for which the equilibrium corresponds to observed player behavior. Computational complexity of Nash equilibria is important in this framework. If the payoffs that explain observed player behavior requires players to have solved a computationally hard problem, then the explanation provided is questionable. In this paper we provide conditions under which observed behavior of players can be explained by games in which Nash equilibria are easy to compute. We identify three structural conditions and show that if the data set of observed behavior satisfies any of these conditions, then it can be explained by payoff matrices for which Nash equilibria are efficiently computable.", "date": "2014", "date_type": "published", "publisher": "Springer", "place_of_pub": "Cambridge, MA", "pagerange": "447-452", "id_number": "CaltechAUTHORS:20150615-083251191", "isbn": "978-3-319-13129-0", "book_title": "Web and Internet Economics", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20150615-083251191", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CNS-0846025" }, { "agency": "NSF", "grant_number": "EPAS-1307794" }, { "agency": "NSF", "grant_number": "CCF-1101470" }, { "agency": "Linde Institute of Economic and Management Science" }, { "agency": "Caltech Social and Information Sciences Laboratory" } ] }, "contributors": { "items": [ { "id": "Liu-Tie-Yan", "name": { "family": "Liu", "given": "Tie Yan" } }, { "id": "Qi-Qi", "name": { "family": "Qi", "given": "Qi" } }, { "id": "Ye-Yinyu", "name": { "family": "Ye", "given": "Yinyu" } } ] }, "doi": "10.1007/978-3-319-13129-0_38", "primary_object": { "basename": "1311.2655v2.pdf", "url": "https://authors.library.caltech.edu/records/40ykk-qy211/files/1311.2655v2.pdf" }, "resource_type": "book_section", "pub_year": "2014", "author_list": "Barman, Siddharth; Bhaskar, Umang; et el." }, { "id": "https://authors.library.caltech.edu/records/agr35-vx679", "eprint_id": 80073, "eprint_status": "archive", "datestamp": "2023-08-19 22:26:31", "lastmod": "2023-10-17 15:28:55", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Cai-Desmond-W-H", "name": { "family": "Cai", "given": "Desmond W. H." }, "orcid": "0000-0001-9207-1890" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Inefficiency in forward markets with supply friction", "ispublished": "unpub", "full_text_status": "restricted", "keywords": "Production, Electricity, Nash equilibrium, Generators, Games, Friction, Electricity supply industry", "note": "\u00a9 2013 IEEE.", "abstract": "The growth of renewable resources will introduce significant variability and uncertainty into the grid. It is likely that \"peaker\" plants will be a crucial dispatchable resource for compensating for the variations in renewable supply. Thus, it is important to understand the strategic incentives of peaker plants and their potential for exploiting market power due to having responsive supply. To this end, we study an oligopolistic two-settlement market comprising of two types of generation (baseloads and peakers) where there is perfect foresight. We characterize symmetric equilibria in this context via closed-form expressions. However, we also show that, when the system is capacity-constrained, there may not exist equilibria in which baseloads and peakers play symmetric strategies. This happens because of opportunities for both types of generation to exploit market power to increase prices.", "date": "2013-12", "date_type": "published", "publisher": "IEEE", "place_of_pub": "Piscataway, NJ", "pagerange": "5594-5599", "id_number": "CaltechAUTHORS:20170810-101519456", "isbn": "978-1-4673-5714-2", "book_title": "52nd IEEE Conference on Decision and Control", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170810-101519456", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1109/CDC.2013.6760771", "resource_type": "book_section", "pub_year": "2013", "author_list": "Cai, Desmond W. H. and Wierman, Adam" }, { "id": "https://authors.library.caltech.edu/records/1dhgx-3ge03", "eprint_id": 41779, "eprint_status": "archive", "datestamp": "2023-08-19 20:12:47", "lastmod": "2023-10-25 14:45:47", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Andrew-L-L-H", "name": { "family": "Andrew", "given": "Lachlan" } }, { "id": "Barman-S", "name": { "family": "Barman", "given": "Siddharth" } }, { "id": "Ligett-K", "name": { "family": "Ligett", "given": "Katrina" }, "orcid": "0000-0003-2780-6656" }, { "id": "Lin-Minghong", "name": { "family": "Lin", "given": "Minghong" } }, { "id": "Meyerson-A", "name": { "family": "Meyerson", "given": "Adam" } }, { "id": "Roytman-A", "name": { "family": "Roytman", "given": "Alan" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "A Tale of Two Metrics: Simultaneous Bounds on Competitiveness and Regret", "ispublished": "unpub", "full_text_status": "public", "note": "Copyright is held by the author/owner(s). \n\nThis work was supported by NSF grants CCF 0830511, and CNS 0846025, Microsoft Research, the Lee Center for Advanced Networking, and ARC grants FT0991594 and DP130101378.\n\nSubmitted - 1508.03769.pdf
", "abstract": "We consider algorithms for \"smoothed online convex optimization\"\n(SOCO) problems, which are a hybrid between online convex optimization (OCO) and metrical task system (MTS) problems. Historically, the performance metric for OCO was regret and that for MTS was competitive ratio (CR). There are algorithms with either sublinear regret or constant CR, but no known algorithm achieves both simultaneously. We show that this is a fundamental limitation \u2013 no algorithm (deterministic or randomized) can achieve sublinear regret and a constant CR, even when the objective functions are linear and the decision space is one dimensional. However, we present an algorithm that, for the important one dimensional case, provides sublinear regret and a CR that grows arbitrarily slowly.", "date": "2013-06", "date_type": "published", "publisher": "ACM", "place_of_pub": "New York, NY", "pagerange": "329-330", "id_number": "CaltechAUTHORS:20131008-164143666", "isbn": "978-1-4503-1900-3", "book_title": "Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems (SIGMETRICS '13)", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20131008-164143666", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CCF-0830511" }, { "agency": "NSF", "grant_number": "CNS-0846025" }, { "agency": "Microsoft Research" }, { "agency": "Caltech Lee Center for Advanced Networking" }, { "agency": "Australian Research Council", "grant_number": "FT0991594" }, { "agency": "Australian Research Council", "grant_number": "DP130101378" } ] }, "doi": "10.1145/2465529.2465533", "primary_object": { "basename": "1508.03769.pdf", "url": "https://authors.library.caltech.edu/records/1dhgx-3ge03/files/1508.03769.pdf" }, "resource_type": "book_section", "pub_year": "2013", "author_list": "Andrew, Lachlan; Barman, Siddharth; et el." }, { "id": "https://authors.library.caltech.edu/records/ncfw3-zg456", "eprint_id": 41084, "eprint_status": "archive", "datestamp": "2023-08-19 20:11:00", "lastmod": "2023-10-24 23:26:40", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Liu-Zhenhua", "name": { "family": "Liu", "given": "Zhenhua" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Cheng-Yuan", "name": { "family": "Cheng", "given": "Yuan" } }, { "id": "Razon-B", "name": { "family": "Razon", "given": "Benjamin" } }, { "id": "Chen-Niangjun", "name": { "family": "Chen", "given": "Niangjun" }, "orcid": "0000-0002-2289-9737" } ] }, "title": "Data Center Demand Response: Avoiding the Coincident\n Peak via Workload Shifting and Local Generation", "ispublished": "unpub", "full_text_status": "restricted", "keywords": "Demand response, coincident peak pricing, data center, work-\nload shifting, online algorithm", "note": "Copyright is held by the author/owner(s).\n\nThis work was supported by NSF grants CNS 0846025, DoE\ngrant DE-EE0002890, and HP Labs.", "abstract": "Demand response is a crucial aspect of the future smart grid.\nIt has the potential to provide significant peak demand reduction and to ease the incorporation of renewable energy\ninto the grid. Data centers' participation in demand response is becoming increasingly important given the high\nand increasing energy consumption and the flexibility in demand management in data centers compared to conventional\nindustrial facilities. In this extended abstract we briefly describe recent work in [1] on two demand response schemes to\nreduce a data center's peak loads and energy expenditure:\nworkload shifting and the use of local power generations. In\n[1], we conduct a detailed characterization study of coincident peak data over two decades from Fort Collins Utilities,\nColorado and then develop two algorithms for data centers\nby combining workload scheduling and local power generation to avoid the coincident peak and reduce the energy expenditure. The first algorithm optimizes the expected cost\nand the second one provides a good worst-case guarantee for\nany coincident peak pattern. We evaluate these algorithms\nvia numerical simulations based on real world traces from\nproduction systems. The results show that using workload\nshifting in combination with local generation can provide significant cost savings (up to 40% in the Fort Collins Utilities'\ncase) compared to either alone.", "date": "2013-06", "date_type": "published", "publisher": "ACM", "place_of_pub": "New York, NY", "pagerange": "341-342", "id_number": "CaltechAUTHORS:20130904-124117730", "isbn": "978-1-4503-1900-3", "book_title": "SIGMETRICS '13 Proceedings of the ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20130904-124117730", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CNS-0846025" }, { "agency": "Department of Energy (DOE)", "grant_number": "DE-EE0002890" }, { "agency": "HP Labs" } ] }, "doi": "10.1145/2465529.2465740", "resource_type": "book_section", "pub_year": "2013", "author_list": "Liu, Zhenhua; Wierman, Adam; et el." }, { "id": "https://authors.library.caltech.edu/records/5hkyz-net48", "eprint_id": 41780, "eprint_status": "archive", "datestamp": "2023-08-22 09:33:08", "lastmod": "2023-10-25 14:45:50", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Gopalakrishnan-R", "name": { "family": "Gopalakrishnan", "given": "Ragavendran" } }, { "id": "Marden-J-R", "name": { "family": "Marden", "given": "Jason R." } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Potential Games are Necessary to Ensure Pure Nash Equilibria in Cost Sharing Games", "ispublished": "unpub", "full_text_status": "public", "keywords": "Cost sharing; game theory; marginal contribution; Nash equilibrium; potential game; Shapley value", "note": "Copyright is held by the author/owner(s).\n\nThis research was supported by AFOSR grants #FA9550-09-1-0538 and #FA9550-12-1-0359, ONR grant\n#N00014-12-1-0643, and NSF grants #CNS-0846025 and #CCF-1101470.\n\nSubmitted - 2013_costsharing.pdf
", "abstract": "Cost sharing games, traditionally studied in economics in the context of cooperative game theory, has garnered\nrecent interest in the computer science community in the noncooperative setting, where individually\nstrategic agents choose resources based on how the welfare (cost or revenue) generated at each resource\n(which depends on the set of agents that choose the resource) is distributed. The focus is on finding distribution\nrules that lead to stable allocations, which is formalized by the concept of Nash equilibrium.", "date": "2013-06", "date_type": "published", "publisher": "ACM", "place_of_pub": "New York, NY", "pagerange": "563-564", "id_number": "CaltechAUTHORS:20131008-165347311", "isbn": "978-1-4503-1962-1", "book_title": "EC '13 Proceedings of the fourteenth ACM conference on Electronic commerce", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20131008-165347311", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "AFOSR", "grant_number": "FA9550-09-1-0538" }, { "agency": "AFOSR", "grant_number": "FA9550-12-1-0359" }, { "agency": "ONR", "grant_number": "N00014-12-1-0643" }, { "agency": "NSF", "grant_number": "CNS-0846025" }, { "agency": "NSF", "grant_number": "CCF-1101470" } ] }, "doi": "10.1145/2482540.2482553", "primary_object": { "basename": "2013_costsharing.pdf", "url": "https://authors.library.caltech.edu/records/5hkyz-net48/files/2013_costsharing.pdf" }, "resource_type": "book_section", "pub_year": "2013", "author_list": "Gopalakrishnan, Ragavendran; Marden, Jason R.; et el." }, { "id": "https://authors.library.caltech.edu/records/nd3cv-16n60", "eprint_id": 41760, "eprint_status": "archive", "datestamp": "2023-08-22 09:32:58", "lastmod": "2023-10-25 14:44:30", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Barman-S", "name": { "family": "Barman", "given": "Siddharth" } }, { "id": "Bhaskar-U", "name": { "family": "Bhaskar", "given": "Umang" } }, { "id": "Echenique-F", "name": { "family": "Echenique", "given": "Federico" }, "orcid": "0000-0002-1567-6770" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "The Empirical Implications of Rank in Bimatrix Games", "ispublished": "unpub", "full_text_status": "public", "keywords": "Theory, Algorithms, Economics, Game Theory; Nash Equilibrium; Revealed Preference; Matrix Rank", "note": "\u00a9 2013 ACM. \n\nThis research was supported by NSF grants CNS-0846025 and CCF-1101470.\n\nSubmitted - 1305.3336.pdf
", "abstract": "We study the structural complexity of bimatrix games, formalized via rank, from an empirical perspective. We consider a setting where we have data on player behavior in diverse strategic situations, but where we do not observe the relevant payoff functions. We prove that high complexity (high rank) has empirical consequences when arbitrary data is considered. Additionally, we prove that, in more restrictive classes of data (termed laminar), any observation is rationalizable using a low-rank game: specifically a zero-sum game. Hence complexity as a structural property of a game is not always testable. Finally, we prove a general result connecting the structure of the feasible data sets with the highest rank that may be needed to rationalize a set of observations.", "date": "2013-06", "date_type": "published", "publisher": "ACM", "place_of_pub": "New York, NY", "pagerange": "55-72", "id_number": "CaltechAUTHORS:20131008-155108539", "isbn": "978-1-4503-1962-1", "book_title": "EC '13 Proceedings of the fourteenth ACM conference on Electronic commerce", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20131008-155108539", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CNS-0846025" }, { "agency": "NSF", "grant_number": "CCF-1101470" } ] }, "doi": "10.1145/2492002.2482589", "primary_object": { "basename": "1305.3336.pdf", "url": "https://authors.library.caltech.edu/records/nd3cv-16n60/files/1305.3336.pdf" }, "resource_type": "book_section", "pub_year": "2013", "author_list": "Barman, Siddharth; Bhaskar, Umang; et el." }, { "id": "https://authors.library.caltech.edu/records/sz3sg-7pd45", "eprint_id": 40974, "eprint_status": "archive", "datestamp": "2023-08-22 09:32:01", "lastmod": "2023-10-24 23:20:46", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Nair-Jayakrishnan", "name": { "family": "Nair", "given": "Jayakrishnan" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Zwart-B", "name": { "family": "Zwart", "given": "Bert" } } ] }, "title": "The Fundamentals of Heavy-tails: Properties, Emergence, and Identification", "ispublished": "unpub", "full_text_status": "restricted", "keywords": "G.3 [Mathematics of computing]: Probability and Statistics; Heavy-tailed distributions", "note": "Copyright is held by the author/owner(s).", "abstract": "Heavy-tails are a continual source of excitement and confusion across disciplines as they are repeatedly \"discovered\" in\nnew contexts. This is especially true within computer systems, where heavy-tails seemingly pop up everywhere -- from\ndegree distributions in the internet and social networks to\nfile sizes and interarrival times of workloads. However, despite nearly a decade of work on heavy-tails they are still\ntreated as mysterious, surprising, and even controversial.\n\nThe goal of this tutorial is to show that heavy-tailed distributions need not be mysterious and should not be surprising or controversial. In particular, we will demystify heavy-tailed distributions by showing how to reason formally about\ntheir counter-intuitive properties; we will highlight that their\nemergence should be expected (not surprising) by showing\nthat a wide variety of general processes lead to heavy-tailed\ndistributions; and we will highlight that most of the controversy surrounding heavy-tails is the result of bad statistics,\nand can be avoided by using the proper tools.", "date": "2013-06", "date_type": "published", "publisher": "ACM", "place_of_pub": "New York, NY", "pagerange": "387-388", "id_number": "CaltechAUTHORS:20130828-104051418", "isbn": "978-1-4503-1900-3", "book_title": "SIGMETRICS '13 Proceedings of the ACM SIGMETRICS/international conference on Measurement and modeling of computer systems", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20130828-104051418", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/2465529.2466587", "resource_type": "book_section", "pub_year": "2013", "author_list": "Nair, Jayakrishnan; Wierman, Adam; et el." }, { "id": "https://authors.library.caltech.edu/records/m4gqe-7j072", "eprint_id": 71479, "eprint_status": "archive", "datestamp": "2023-08-19 19:49:04", "lastmod": "2023-10-23 15:48:47", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Gan-Lingwen", "name": { "family": "Gan", "given": "Lingwen" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Topcu-U", "name": { "family": "Topcu", "given": "Ufuk" } }, { "id": "Chen-Niangjun", "name": { "family": "Chen", "given": "Niangjun" }, "orcid": "0000-0002-2289-9737" }, { "id": "Low-S-H", "name": { "family": "Low", "given": "Steven H." }, "orcid": "0000-0001-6476-3048" } ] }, "title": "Real-time deferrable load control: handling the uncertainties of renewable generation", "ispublished": "unpub", "full_text_status": "restricted", "keywords": "smart grid, deferrable load control, demand response, model predictive control", "note": "\u00a9 2013 ACM. \n\nThis work was supported by NSF NetSE grant CNS 0911041, ARPA-E grant DE-AR0000226, Southern California Edison, National Science Council of Taiwan, R.O.C, grant NSC 101-3113-P-008-001, Resnick Institute, Okawa Foundation, NSF CNS 1312390, NSF grant CNS 0846025, and DoE grant DE-EE000289.", "abstract": "Real-time demand response is essential for handling the uncertainties of renewable generation. Traditionally, demand response has been focused on large industrial and commercial loads, however it is expected that a large number of small residential loads such as air conditioners, dish washers, and electric vehicles will also participate in the coming years. The electricity consumption of these smaller loads, which we call deferrable loads, can be shifted over time, and thus be used (in aggregate) to compensate for the random fluctuations in renewable generation. In this paper, we propose a real-time distributed deferrable load control algorithm to reduce the variance of aggregate load (load minus renewable generation) by shifting the power consumption of deferrable loads to periods with high renewable generation. At every time step, the algorithm minimizes the expected variance to go with updated predictions. We prove that suboptimality of the algorithm vanishes as time horizon expands. Further, we evaluate the algorithm via trace-based simulations.", "date": "2013-05", "date_type": "published", "publisher": "ACM", "place_of_pub": "New York, NY", "pagerange": "113-124", "id_number": "CaltechAUTHORS:20161025-161438752", "isbn": "978-1-4503-2052-8", "book_title": "e-Energy '13 Proceedings of the fourth international conference on Future energy systems", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20161025-161438752", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF NetSE", "grant_number": "CNS-0911041" }, { "agency": "ARPA-E", "grant_number": "DE-AR0000226" }, { "agency": "Southern California Edison" }, { "agency": "National Science Council (Taipei)", "grant_number": "101-3113-P-008-001" }, { "agency": "Resnick Sustainability Institute" }, { "agency": "Okawa Foundation" }, { "agency": "NSF", "grant_number": "CNS-1312390" }, { "agency": "NSF", "grant_number": "CNS-0846025" }, { "agency": "Department of Energy (DOE)", "grant_number": "DE-EE0002890" } ] }, "local_group": { "items": [ { "id": "Resnick-Sustainability-Institute" } ] }, "contributors": { "items": [ { "id": "Culler-D", "name": { "family": "Culler", "given": "David" } }, { "id": "Rosenberg-C", "name": { "family": "Rosenberg", "given": "Catherine" } } ] }, "doi": "10.1145/2487166.2487179", "resource_type": "book_section", "pub_year": "2013", "author_list": "Gan, Lingwen; Wierman, Adam; et el." }, { "id": "https://authors.library.caltech.edu/records/yxhp3-2c586", "eprint_id": 73736, "eprint_status": "archive", "datestamp": "2023-08-19 19:27:37", "lastmod": "2023-10-20 22:11:36", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Wang-Kai", "name": { "family": "Wang", "given": "Kai" } }, { "id": "Lin-Minghong", "name": { "family": "Lin", "given": "Minghong" } }, { "id": "Ciucu-F", "name": { "family": "Ciucua", "given": "Florin" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Lin-Chuang", "name": { "family": "Lin", "given": "Chuang" } } ] }, "title": "Characterizing the impact of the workload on the value of dynamic resizing in data centers", "ispublished": "unpub", "full_text_status": "public", "note": "\u00a9 2013 IEEE. \n\nThis research is supported by the Strategic Priority Research Program of the Chinese Academy of Sciences (No. XDA06010600), the 973 Program of China (No. 2010CB328105), the NSF grant of China (No. 61020106002), and NSF grant CNS 0846025 and DoE grant DE-EE0002890.\n\nAccepted Version - 1207.6295.pdf
", "abstract": "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. Resultantly, there has recently been interest in developing designs that allow the service capacity to be dynamically resized to match the current workload. However, there is still much debate about the value of such approaches in real settings. In this paper, we show that the value of dynamic resizing is highly dependent on statistics of the workload process. In particular, both slow timescale non-stationarities of the workload (e.g., the peak-to-mean ratio) and the fast time-scale stochasticity (e.g., the burstiness of arrivals) play key roles. To illustrate the impact of these factors, we combine optimization-based modeling of the slow time-scale with stochastic modeling of the fast time scale.", "date": "2013-04", "date_type": "published", "publisher": "IEEE", "place_of_pub": "Piscataway, NJ", "pagerange": "515-519", "id_number": "CaltechAUTHORS:20170125-151457013", "isbn": "978-1-4673-5946-7", "book_title": "2013 Proceedings IEEE INFOCOM", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170125-151457013", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Chinese Academy of Sciences", "grant_number": "XDA06010600" }, { "agency": "973 Program of China", "grant_number": "2010CB328105" }, { "agency": "National Natural Scientific Foundation of China", "grant_number": "61020106002" }, { "agency": "NSF", "grant_number": "CNS-0846025" }, { "agency": "Department of Energy (DOE)", "grant_number": "DE-EE0002890" } ] }, "doi": "10.1109/INFCOM.2013.6566826", "primary_object": { "basename": "1207.6295.pdf", "url": "https://authors.library.caltech.edu/records/yxhp3-2c586/files/1207.6295.pdf" }, "resource_type": "book_section", "pub_year": "2013", "author_list": "Wang, Kai; Lin, Minghong; et el." }, { "id": "https://authors.library.caltech.edu/records/nadrt-3yq35", "eprint_id": 43003, "eprint_status": "archive", "datestamp": "2023-08-19 14:01:18", "lastmod": "2024-01-13 06:05:32", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Nair-J", "name": { "family": "Nair", "given": "Jayakrishnan" } }, { "id": "Jagannathan-K", "name": { "family": "Jagannathan", "given": "Krishna" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "When Heavy-Tailed and Light-Tailed Flows Compete: The Response Time Tail Under Generalized Max-Weight Scheduling", "ispublished": "unpub", "full_text_status": "restricted", "note": "\u00a9 2013 IEEE. Date of Conference: 14-19 April 2013. Jayakrishnan Nair and Adam Wierman acknowledge the support of\nthe NSF through grant CNS 0846025 and NetSE grant CNS 0911041, the ARO through MURI grant W911NF-08-1-0233, and Bell Labs, Alcatel-Lucent. Krishna Jagannathan's work was funded in part by ARO MURI grant W911NF-08-1-0238 and the Indo UK Advanced Technology Center (IUATC).", "abstract": "This paper focuses on the design and analysis of scheduling policies for multi-class queues, such as those found in wireless networks and high-speed switches. In this context, we study the response time tail under generalized max-weight policies in settings where the traffic flows are highly asymmetric. Specifically, we study an extreme setting with two traffic flows, one heavy-tailed, and one light-tailed. In this setting, we prove that classical max-weight scheduling, which is known to be throughput optimal, results in the light-tailed flow having heavy-tailed response times. However, we show that via a careful design of inter-queue scheduling policy (from the class of generalized max-weight policies) and intra-queue scheduling policies, it is possible to maintain throughput optimality, and guarantee light-tailed delays for the light-tailed flow, without affecting the response time tail for the heavy-tailed flow.", "date": "2013", "date_type": "published", "publisher": "IEEE", "place_of_pub": "New York, NY", "pagerange": "2976-2984", "id_number": "CaltechAUTHORS:20131213-143050923", "isbn": "978-1-4673-5944-3", "book_title": "Infocom, 2013 Proceedings IEEE", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20131213-143050923", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CNS 0846025" }, { "agency": "NetSE", "grant_number": "CNS 0911041" }, { "agency": "Bell Labs" }, { "agency": "Army Research Office (ARO) Multidisciplinary University Research Initiative (MURI)", "grant_number": "W911NF-08-1-0238" }, { "agency": "Indo UK Advanced Technology Center (IUATC)" } ] }, "other_numbering_system": { "items": [ { "id": "13682295", "name": "INSPEC Accession Number:" } ] }, "doi": "10.1109/INFCOM.2013.6567109", "resource_type": "book_section", "pub_year": "2013", "author_list": "Nair, Jayakrishnan; Jagannathan, Krishna; et el." }, { "id": "https://authors.library.caltech.edu/records/p43ht-74y33", "eprint_id": 80188, "eprint_status": "archive", "datestamp": "2023-08-19 13:04:02", "lastmod": "2023-10-17 15:47:36", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Ramaswamy-V", "name": { "family": "Ramaswamy", "given": "Vinod" } }, { "id": "Adlakha-S", "name": { "family": "Adlakha", "given": "Sachin" } }, { "id": "Shakkottai-S", "name": { "family": "Shakkottai", "given": "Srinivas" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Incentives for P2P-assisted content distribution: If you can't beat 'em, join 'em", "ispublished": "unpub", "full_text_status": "public", "keywords": "Law, Analytical models, Mathematical model, Peer-to-peer computing, Sociology, Statistics", "note": "\u00a9 2012 IEEE.\n\nSubmitted - 1212.3853.pdf
", "abstract": "The rapid growth of content distribution on the Internet has brought with it proportional increases in the costs of distributing content. Adding to distribution costs is the fact that digital content is easily duplicable, and hence can be shared in an illicit peer-to-peer (P2P) manner that generates no revenue for the content provider. In this paper, we study whether the content provider can recover lost revenue through a more innovative approach to distribution. In particular, we evaluate the benefits of a hybrid revenue-sharing system that combines a legitimate P2P swarm and a centralized client-server approach. We show how the revenue recovered by the content provider using a server-supported legitimate P2P swarm can exceed that of the monopolistic scheme by an order of magnitude. Our analytical results are obtained in a fluid model, and supported by stochastic simulations.", "date": "2012-10", "date_type": "published", "publisher": "IEEE", "place_of_pub": "Piscataway, NJ", "pagerange": "1409-1416", "id_number": "CaltechAUTHORS:20170810-131935147", "isbn": "978-1-4673-4537-8", "book_title": "2012 50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170810-131935147", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1109/Allerton.2012.6483383", "primary_object": { "basename": "1212.3853.pdf", "url": "https://authors.library.caltech.edu/records/p43ht-74y33/files/1212.3853.pdf" }, "resource_type": "book_section", "pub_year": "2012", "author_list": "Ramaswamy, Vinod; Adlakha, Sachin; et el." }, { "id": "https://authors.library.caltech.edu/records/ca6jy-b1x35", "eprint_id": 73241, "eprint_status": "archive", "datestamp": "2023-08-19 11:13:34", "lastmod": "2023-10-23 15:42:08", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Wang-Kai", "name": { "family": "Wang", "given": "Kai" } }, { "id": "Lin-Minghong", "name": { "family": "Lin", "given": "Minghong" } }, { "id": "Ciucu-F", "name": { "family": "Ciucu", "given": "Florin" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Lin-Chuang", "name": { "family": "Lin", "given": "Chuang" } } ] }, "title": "Characterizing the impact of the workload on the value of dynamic resizing in data centers", "ispublished": "unpub", "full_text_status": "public", "keywords": "Data Centers, Dynamic Resizing, Energy Efficient IT", "note": "Copyright is held by the author/owner(s). \n\nThis research is supported by the 973 Program of China (No. 2010CB328105), the National Natural Scientific Foundation of China (No. 61020106002 and No.60973107), and NSF grant CNS 0846025 and DoE grant DE-EE0002890.\n\nPublished - p405-wang.pdf
Submitted - 1207.6295.pdf
", "abstract": "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. Resultantly, there has recently been interest in developing designs that allow the service capacity to be dynamically resized to match the current workload. However, there is still much debate about the value of such approaches in real settings. In this paper, we show that the value of dynamic resizing is highly dependent on statistics of the workload process. In particular, both slow time-scale non-stationarities of the workload (e.g., the peak-to-mean ratio) and the fast time-scale stochasticity (e.g., the burstiness of arrivals) play key roles. To illustrate the impact of these factors, we combine optimization-based modeling of the slow time-scale with stochastic modeling of the fast time scale. Within this framework, we provide both analytic and numerical results characterizing when dynamic resizing does (and does not) provide benefits.", "date": "2012-06", "date_type": "published", "publisher": "ACM", "place_of_pub": "New York, NY", "pagerange": "405-406", "id_number": "CaltechAUTHORS:20170104-160858241", "isbn": "978-1-4503-1097-0", "book_title": "SIGMETRICS '12 Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170104-160858241", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "973 Program of China", "grant_number": "2010CB328105" }, { "agency": "National Natural Scientific Foundation of China", "grant_number": "61020106002" }, { "agency": "National Natural Scientific Foundation of China", "grant_number": "60973107" }, { "agency": "NSF", "grant_number": "CNS-0846025" }, { "agency": "Department of Energy (DOE)", "grant_number": "DE-EE0002890" } ] }, "contributors": { "items": [ { "id": "Harrison-P", "name": { "family": "Harrison", "given": "Peter" } } ] }, "doi": "10.1145/2254756.2254815", "primary_object": { "basename": "1207.6295.pdf", "url": "https://authors.library.caltech.edu/records/ca6jy-b1x35/files/1207.6295.pdf" }, "related_objects": [ { "basename": "p405-wang.pdf", "url": "https://authors.library.caltech.edu/records/ca6jy-b1x35/files/p405-wang.pdf" } ], "resource_type": "book_section", "pub_year": "2012", "author_list": "Wang, Kai; Lin, Minghong; et el." }, { "id": "https://authors.library.caltech.edu/records/s94hs-bb881", "eprint_id": 70982, "eprint_status": "archive", "datestamp": "2023-08-19 11:13:19", "lastmod": "2023-10-23 15:14:29", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Echenique-F", "name": { "family": "Echenique", "given": "Federico" }, "orcid": "0000-0002-1567-6770" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Finding a Walrasian Equilibrium is Easy for a Fixed Number of Agents", "ispublished": "unpub", "full_text_status": "public", "keywords": "Algorithms, Economics, Theory, Computational Complexity, Walrasian Equilibria, Fisher Equilibria", "note": "Copyright is held by the author/owner(s). \n\nThis work is supported by the National Science Foundation, under grant CCF-1101470. We thank Chris Umans, Jeremy Hurwitz, Daniel Golovin, and Ilya Segal for their advice and comments on this work.\n\nPublished - p495-echenique.pdf
", "abstract": "In this work, we study the complexity of finding a Walrasian equilibrium. Our main result gives an algorithm which can compute an approximate Walrasian equilibrium in an exchange economy with general, but well-behaved, utility functions in time that is polynomial in the number of goods when the number of agents is held constant. This result has applications to macroeconomics and finance, where applications of Walrasian equilibrium theory tend to deal with many goods but a fixed number of agents.", "date": "2012-06", "date_type": "published", "publisher": "ACM", "place_of_pub": "New York, NY", "pagerange": "495", "id_number": "CaltechAUTHORS:20161010-171918212", "isbn": "978-1-4503-1415-2", "book_title": "EC '12 Proceedings of the 13th ACM Conference on Electronic Commerce", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20161010-171918212", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CCF-1101470" } ] }, "contributors": { "items": [ { "id": "Faltings-B", "name": { "family": "Faltings", "given": "Boi" } }, { "id": "Leyton-Brown-K", "name": { "family": "Leyton-Brown", "given": "Kevin" } }, { "id": "Ipeirotis-P", "name": { "family": "Ipeirotis", "given": "Panos" } } ] }, "doi": "10.1145/2229012.2229049", "primary_object": { "basename": "p495-echenique.pdf", "url": "https://authors.library.caltech.edu/records/s94hs-bb881/files/p495-echenique.pdf" }, "resource_type": "book_section", "pub_year": "2012", "author_list": "Echenique, Federico and Wierman, Adam" }, { "id": "https://authors.library.caltech.edu/records/g2vx0-gee67", "eprint_id": 31886, "eprint_status": "archive", "datestamp": "2023-08-19 11:04:47", "lastmod": "2023-10-17 21:40:28", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Lin-Minghong", "name": { "family": "Lin", "given": "Minghong" } }, { "id": "Liu-Zhenhua", "name": { "family": "Liu", "given": "Zhenhua" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Andrew-L-L-H", "name": { "family": "Andrew", "given": "Lachlan L. H." } } ] }, "title": "Online Algorithms for Geographical Load Balancing", "ispublished": "unpub", "full_text_status": "public", "note": "\u00a9 2012 IEEE. \n\nThis work was supported by NSF grants CCF 0830511, CNS 0911041, and CNS 0846025 MURI grant W911NF-08-1-0233, Microsoft Research, the Lee Center for Advanced Networking, and ARC grant FT099159.\n\nAccepted Version - igcc12.pdf
", "abstract": "It has recently been proposed that Internet energy costs, both monetary and environmental, can be reduced by exploiting temporal variations and shifting processing to data centers located in regions where energy currently has low cost. Lightly loaded data centers can then turn off surplus servers. This paper studies online algorithms for determining the number of servers to leave on in each data center, and then uses these algorithms to study the environmental potential of geographical load balancing (GLB). A commonly suggested algorithm for this setting is \"receding horizon control\" (RHC), which computes the provisioning for the current time by optimizing over a window of predicted future loads. We show that RHC performs well in a homogeneous setting, in which all servers can serve all jobs equally well; however, we also prove that differences in propagation delays, servers, and electricity prices can cause RHC perform badly, So, we introduce variants of RHC that are guaranteed to perform as well in the face of such heterogeneity. These algorithms are then used to study the feasibility of powering a continent-wide set of data centers mostly by renewable sources, and to understand what portfolio of renewable energy is most effective.", "date": "2012-06", "date_type": "published", "publisher": "IEEE", "place_of_pub": "Piscataway, NJ", "pagerange": "1-10", "id_number": "CaltechAUTHORS:20120612-143750915", "isbn": "978-1-4673-2154-9", "book_title": "2012 International Green Computing Conference (IGCC)", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20120612-143750915", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CCF-0830511" }, { "agency": "NSF", "grant_number": "CNS-0911041" }, { "agency": "NSF", "grant_number": "CNS-0846025" }, { "agency": "Army Research Office (ARO)", "grant_number": "W911NF-08-1-0233" }, { "agency": "Microsoft Research" }, { "agency": "Caltech Lee Center for Advanced Networking" }, { "agency": "Australian Research Council", "grant_number": "FT0991594" } ] }, "doi": "10.1109/IGCC.2012.6322266", "primary_object": { "basename": "igcc12.pdf", "url": "https://authors.library.caltech.edu/records/g2vx0-gee67/files/igcc12.pdf" }, "resource_type": "book_section", "pub_year": "2012", "author_list": "Lin, Minghong; Liu, Zhenhua; et el." }, { "id": "https://authors.library.caltech.edu/records/jhgm1-c3d20", "eprint_id": 104658, "eprint_status": "archive", "datestamp": "2023-08-19 11:15:35", "lastmod": "2023-10-20 20:42:21", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Liu-Zhenhua", "name": { "family": "Liu", "given": "Zhenhua" } }, { "id": "Cheng-Yuan", "name": { "family": "Cheng", "given": "Yuan" } }, { "id": "Bash-C", "name": { "family": "Bash", "given": "Cullen" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Gmach-D", "name": { "family": "Gmach", "given": "Daniel" } }, { "id": "Wang-Zhikui", "name": { "family": "Wang", "given": "Zhikui" } }, { "id": "Marwah-M", "name": { "family": "Marwah", "given": "Manish" } }, { "id": "Hyser-C", "name": { "family": "Hyser", "given": "Chris" } } ] }, "title": "Renewable and cooling aware workload management for sustainable data centers", "ispublished": "unpub", "full_text_status": "restricted", "keywords": "sustainable data center, renewable energy, demand shaping, scheduling, cooling optimization", "note": "\u00a9 2012 ACM. \n\nThis work is done during Zhenhua Liu's internship at HP Labs. Zhenhua Liu and Adam Wierman are partly supported by NSF grant CNS 0846025 and DoE grant DE-EE0002890.\n\nWe are grateful to many members of Sustainable Ecosystem\nResearch Group at HP Labs. Chandrakant Patel has\nprovided great support and guidance at various stages of\nthis work. Niru Kumari provided valuable information on\nchiller cooling models. Martin Arlitt, Amip Shah, Sergey\nBlagodurov and Alan McReynolds offered helpful feedback.\nWe also thank the anonymous reviewers and our shepherd,\nChristopher Stewart, for their valuable comments and help.", "abstract": "Recently, the demand for data center computing has surged, increasing the total energy footprint of data centers worldwide. Data centers typically comprise three subsystems: IT equipment provides services to customers; power infrastructure supports the IT and cooling equipment; and the cooling infrastructure removes heat generated by these subsystems. This work presents a novel approach to model the energy flows in a data center and optimize its operation. Traditionally, supply-side constraints such as energy or cooling availability were treated independently from IT workload management. This work reduces electricity cost and environmental impact using a holistic approach that integrates renewable supply, dynamic pricing, and cooling supply including chiller and outside air cooling, with IT workload planning to improve the overall sustainability of data center operations. Specifically, we first predict renewable energy as well as IT demand. Then we use these predictions to generate an IT workload management plan that schedules IT workload and allocates IT resources within a data center according to time varying power supply and cooling efficiency. We have implemented and evaluated our approach using traces from real data centers and production systems. The results demonstrate that our approach can reduce both the recurring power costs and the use of non-renewable energy by as much as 60% compared to existing techniques, while still meeting the Service Level Agreements.", "date": "2012-06", "date_type": "published", "publisher": "Association for Computing Machinery", "place_of_pub": "New York, NY", "pagerange": "175-186", "id_number": "CaltechAUTHORS:20200730-142215620", "isbn": "9781450310970", "book_title": "SIGMETRICS '12: Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20200730-142215620", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CNS-0846025" }, { "agency": "Department of Energy (DOE)", "grant_number": "DE-EE0002890" } ] }, "doi": "10.1145/2254756.2254779", "resource_type": "book_section", "pub_year": "2012", "author_list": "Liu, Zhenhua; Cheng, Yuan; et el." }, { "id": "https://authors.library.caltech.edu/records/s0r46-bt824", "eprint_id": 93004, "eprint_status": "archive", "datestamp": "2023-08-19 10:52:09", "lastmod": "2023-10-20 16:43:37", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Andrew-L-L-H", "name": { "family": "Andrew", "given": "Lachlan L. H." } }, { "id": "Lin-Minghong", "name": { "family": "Lin", "given": "Minghong" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Liu-Zhenhua", "name": { "family": "Liu", "given": "Zhenhua" } } ] }, "title": "Algorithms for dynamic capacity provisioning", "ispublished": "unpub", "full_text_status": "restricted", "note": "\u00a9 2012 IEICE. \n\nThis work was supported by NSF grants CCF 0830511, CNS 0911041, and CNS 0846025, MURI grant W911NF-08-1-0233, Microsoft Research, the Lee Center for Advanced Networking, and Australian Research Council grant FT0991594.", "abstract": "Data centre power consumption can be reduced by switching off servers during low load. However, excess switching is wasteful. This paper reviews online algorithms for optimizing this tradeoff, including the benefits of shifting load between geographically distant data centres. These algorithms can also adjust a link's number of parallel lightpaths.", "date": "2012-05", "date_type": "published", "publisher": "IEEE", "place_of_pub": "Piscataway, NJ", "pagerange": "73-74", "id_number": "CaltechAUTHORS:20190220-104312716", "isbn": "978-4-88552-263-5", "book_title": "10th International Conference on Optical Internet (COIN2012)", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190220-104312716", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CCF-0830511" }, { "agency": "NSF", "grant_number": "CNS-0911041" }, { "agency": "NSF", "grant_number": "CNS-0846025" }, { "agency": "Army Research Office (ARO)", "grant_number": "W911NF-08-1-0233" }, { "agency": "Microsoft Research" }, { "agency": "Caltech Lee Center for Advanced Networking" }, { "agency": "Australian Research Council", "grant_number": "FT0991594" } ] }, "resource_type": "book_section", "pub_year": "2012", "author_list": "Andrew, Lachlan L. H.; Lin, Minghong; et el." }, { "id": "https://authors.library.caltech.edu/records/4tkj3-wjj20", "eprint_id": 55086, "eprint_status": "archive", "datestamp": "2023-08-19 10:33:33", "lastmod": "2024-01-13 16:16:06", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Bodine-Baron-E", "name": { "family": "Bodine-Baron", "given": "Elizabeth" } }, { "id": "Bose-Subhonmesh", "name": { "family": "Bose", "given": "Subhonmesh" }, "orcid": "0000-0002-3445-4479" }, { "id": "Hassibi-B", "name": { "family": "Hassibi", "given": "Babak" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Minimizing the social cost of an epidemic", "ispublished": "unpub", "full_text_status": "public", "keywords": "Epidemic, immunization, information cascade, random\nmatrix theory, generalized random graphs", "note": "\u00a9 2012 Springer.\n\nThe authors would like to thank Professor K. Mani Chandy for his useful comments and suggestions for this paper. This work was supported in part by the National Science Foundation under grants NSF CNS-0846025, CCF-0729203, CNS-0932428 and CCF-1018927, by the Office of Naval Research under the MURI grant N00014-08-1-0747, and by Caltech's Lee Center for Advanced Networking.\n\nSubmitted - Minimizing_the_social_cost_of_an_epidemic.pdf
", "abstract": "In this paper we quantify the total cost of an epidemic spreading through a social network, accounting for both the immunization and disease costs. Previous research has typically focused on determining the optimal strategy to limit the lifetime of a disease, without considering the cost of such strategies. In the large graph limit, we calculate the exact expected disease cost for a general random graph, and we illustrate it for the specific example of an Erd\u00f6s-R\u00e9nyi network. We also give an upper bound on the expected disease cost for finite-size graphs, and show through simulation that the upper bound is tight for Erd\u00f6s-R\u00e9nyi networks and graphs with exponential degree distributions. Finally, we study how to optimally perform a one-shot immunization to minimize the social cost of a disease, including both the cost of the disease and the cost of immunization.", "date": "2012-04", "date_type": "published", "publisher": "Springer", "place_of_pub": "Berlin", "pagerange": "594-607", "id_number": "CaltechAUTHORS:20150223-074754304", "isbn": "978-3-642-30372-2", "book_title": "Game Theory for Networks: 2nd International ICST Conference, GAMENETS 2011, Shanghai, China, April 16-18, 2011, Revised Selected Papers", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20150223-074754304", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CNS-0846025" }, { "agency": "NSF", "grant_number": "CCF-0729203" }, { "agency": "NSF", "grant_number": "CNS-0932428" }, { "agency": "NSF", "grant_number": "CCF-1018927" }, { "agency": "Office of Naval Research (ONR)", "grant_number": "N00014-08-1-0747" }, { "agency": "Caltech Lee Center for Advanced Networking" } ] }, "contributors": { "items": [ { "id": "Jain-R", "name": { "family": "Jain", "given": "Rahul" } }, { "id": "Kannan-R", "name": { "family": "Kannan", "given": "Rajgopal" } } ] }, "doi": "10.1007/978-3-642-30373-9_41", "primary_object": { "basename": "Minimizing_the_social_cost_of_an_epidemic.pdf", "url": "https://authors.library.caltech.edu/records/4tkj3-wjj20/files/Minimizing_the_social_cost_of_an_epidemic.pdf" }, "resource_type": "book_section", "pub_year": "2012", "author_list": "Bodine-Baron, Elizabeth; Bose, Subhonmesh; et el." }, { "id": "https://authors.library.caltech.edu/records/810tg-qzy75", "eprint_id": 104719, "eprint_status": "archive", "datestamp": "2023-08-19 09:40:09", "lastmod": "2023-10-20 20:46:47", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Andrew-L-L-H", "name": { "family": "Andrew", "given": "Lachlan L. H." } }, { "id": "Lin-Minghong", "name": { "family": "Lin", "given": "Minghong" } } ] }, "title": "Speed Scaling: An Algorithmic Perspective", "ispublished": "unpub", "full_text_status": "public", "note": "\u00a9 2012 CRC Press.", "abstract": "Computer systems must make a fundamental trade-off between performance and energy usage. The days of \"faster is better\" are gone-energy usage can no longer be ignored in designs, from chips to mobile devices to data centers. This has led speed scaling, a technique once only applied in microprocessors, to become an important technique at all levels of systems. At this point, speed scaling is quickly being adopted across systems from chips [32] to disks [51] and data centers [50] to wireless devices [35].", "date": "2012-01-24", "date_type": "published", "publisher": "Chapman and Hall/CRC", "pagerange": "403-424", "id_number": "CaltechAUTHORS:20200804-094448146", "isbn": "9780429107818", "book_title": "Handbook of Energy-Aware and Green Computing", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20200804-094448146", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "contributors": { "items": [ { "id": "Ahmad-I", "name": { "family": "Ahmad", "given": "Ishfag" } }, { "id": "Ranka-S", "name": { "family": "Ranka", "given": "Sanjay" } } ] }, "doi": "10.1201/b11643-25", "resource_type": "book_section", "pub_year": "2012", "author_list": "Wierman, Adam; Andrew, Lachlan L. H.; et el." }, { "id": "https://authors.library.caltech.edu/records/1e8p2-v0v64", "eprint_id": 93234, "eprint_status": "archive", "datestamp": "2023-08-19 08:17:56", "lastmod": "2023-10-20 16:57:54", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Gopalakrishnan-R", "name": { "family": "Gopalakrishnan", "given": "Ragavendran" } }, { "id": "Marden-J-R", "name": { "family": "Marden", "given": "Jason R." } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Characterizing distribution rules for cost sharing games", "ispublished": "unpub", "full_text_status": "restricted", "note": "\u00a9 2011 IEEE.", "abstract": "We consider the problem of designing the distribution rule used to share \"welfare\" (cost or revenue) among individually strategic agents. There are many distribution rules known to guarantee the existence of a (pure Nash) equilibrium in this setting, e.g., the Shapley value and its weighted variants; however a characterization of the space of distribution rules that yield the existence of a Nash equilibrium is unknown. Our work provides a step towards such a characterization. We prove that when the welfare function is strictly submodular, a budget-balanced distribution rule guarantees equilibrium existence for all games (i.e., all possible sets of resources, agent action sets, etc.) if and only if it is a weighted Shapley value.", "date": "2011-10", "date_type": "published", "publisher": "IEEE", "id_number": "CaltechAUTHORS:20190225-142117482", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190225-142117482", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "resource_type": "book_section", "pub_year": "2011", "author_list": "Gopalakrishnan, Ragavendran; Marden, Jason R.; et el." }, { "id": "https://authors.library.caltech.edu/records/1fq8g-0cn35", "eprint_id": 74878, "eprint_status": "archive", "datestamp": "2023-08-19 07:57:13", "lastmod": "2023-10-24 23:45:35", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Lin-Minghong", "name": { "family": "Lin", "given": "Minghong" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Andrew-L-L-H", "name": { "family": "Andrew", "given": "Lachlan L. H." } }, { "id": "Thereska-E", "name": { "family": "Thereska", "given": "Eno" } } ] }, "title": "Online dynamic capacity provisioning in data centers", "ispublished": "unpub", "full_text_status": "restricted", "note": "\u00a9 2011 IEEE.", "abstract": "Power consumption imposes a significant cost for implementing cloud services, yet much of that power is used to maintain excess service capacity during periods of low load. In this work, we study how to avoid such waste via an on-line dynamic capacity provisioning. We overview recent results showing that the optimal offline algorithm for dynamic capacity provisioning has a simple structure when viewed in reverse time, and this structure can be exploited to develop a new 'lazy' online algorithm which is 3-competitive. Additionally, we analyze the performance of the more traditional approach of receding horizon control and introduce a new variant with a significantly improved worst-case performance guarantee.", "date": "2011-09", "date_type": "published", "publisher": "IEEE", "place_of_pub": "Piscataway, NJ", "pagerange": "1159-1163", "id_number": "CaltechAUTHORS:20170307-165520398", "isbn": "978-1-4577-1818-2", "book_title": "49th Annual Allerton Conference on Communication, Control, and Computing", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170307-165520398", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1109/Allerton.2011.6120298", "resource_type": "book_section", "pub_year": "2011", "author_list": "Lin, Minghong; Wierman, Adam; et el." }, { "id": "https://authors.library.caltech.edu/records/9dfmp-vd612", "eprint_id": 31570, "eprint_status": "archive", "datestamp": "2023-08-19 06:57:46", "lastmod": "2023-10-17 18:40:55", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Echenique-F", "name": { "family": "Echenique", "given": "Federico" }, "orcid": "0000-0002-1567-6770" }, { "id": "Golovin-D", "name": { "family": "Golovin", "given": "Daniel" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "A revealed preference approach to computational complexity in economics", "ispublished": "unpub", "full_text_status": "restricted", "keywords": "Computational Complexity, Rationalization, Revealed Preference,\nTheory of the Consumer", "note": "\u00a9 2011 ACM. The authors wish to thank Vincent Conitzer for helpful discussions and the anonymous reviewers for their valuable feedback. This work was supported in part by the Center for the Mathematics of Information at Caltech and by the NSF through grants SES-0751980 and CNS-0846025.\n\nFormerly SSWP 1333.", "abstract": "Recent results in complexity theory suggest that various economic theories require agents to solve computationally intractable problems. However, such results assume the agents are optimizing explicit utility functions, whereas the economic theories merely assume the agents behave rationally, where rational behavior is defined via some optimization problem. Might making rational choices be easier than solving the corresponding optimization problem? For at least one major economic theory, the theory of the consumer (which simply postulates that consumers are utility maximizing), we find this is indeed the case. In other words, we prove the possibly surprising result that computational constraints have no empirical consequences for consumer choice theory.\n\nOur result motivates a general approach for posing questions about the empirical content of computational constraints: the revealed preference approach to computational complexity. This approach complements the conventional worst-case view of computational complexity in important ways, and is methodologically close to mainstream economics.", "date": "2011-06", "date_type": "published", "publisher": "Association for Computing Machinery (ACM)", "place_of_pub": "New York, NY", "pagerange": "101-110", "id_number": "CaltechAUTHORS:20120521-110926358", "isbn": "978-1-4503-0261-6", "book_title": "Proceedings of the 12th ACM conference on Electronic commerce", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20120521-110926358", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Caltech Center for Mathematics of Information" }, { "agency": "NSF", "grant_number": "SES-0751980" }, { "agency": "NSF", "grant_number": "CNS-0846025" } ] }, "doi": "10.1145/1993574.1993591", "resource_type": "book_section", "pub_year": "2011", "author_list": "Echenique, Federico; Golovin, Daniel; et el." }, { "id": "https://authors.library.caltech.edu/records/14c3j-8my38", "eprint_id": 31580, "eprint_status": "archive", "datestamp": "2023-08-19 06:58:09", "lastmod": "2023-10-17 18:41:31", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Liu-Zhenhua", "name": { "family": "Liu", "given": "Zhenhua" } }, { "id": "Lin-Minghong", "name": { "family": "Lin", "given": "Minghong" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Low-S-H", "name": { "family": "Low", "given": "Steven H." }, "orcid": "0000-0001-6476-3048" }, { "id": "Andrew-L-L-H", "name": { "family": "Andrew", "given": "Lachlan L. H." } } ] }, "title": "Greening geographical load balancing", "ispublished": "unpub", "full_text_status": "restricted", "keywords": "Algorithms, Performance", "note": "\u00a9 2012 ACM. This work was supported by NSF grants CCF 0830511, CNS 0911041, and CNS 0846025, DoE grant DE-EE0002890, ARO MURI grant W911NF-08-1-0233, Microsoft Research, Bell Labs, the Lee Center for Advanced Networking, and ARC grant FT0991594.", "abstract": "Energy expenditure has become a significant fraction of data center operating costs. Recently, \"geographical load balancing\" has been suggested to reduce energy cost by exploiting the electricity price differences across regions. However, this reduction of cost can paradoxically increase total energy use.\n\nThis paper explores whether the geographical diversity of Internet-scale systems can additionally be used to provide environmental gains. Specifically, we explore whether geographical load balancing can encourage use of \"green\" renewable energy and reduce use of \"brown\" fossil fuel energy. We make two contributions. First, we derive two distributed algorithms for achieving optimal geographical load balancing. Second, we show that if electricity is dynamically priced in proportion to the instantaneous fraction of the total energy that is brown, then geographical load balancing provides significant reductions in brown energy use. However, the benefits depend strongly on the degree to which systems accept dynamic energy pricing and the form of pricing used.", "date": "2011-06", "date_type": "published", "publisher": "Association for Computing Machinery", "place_of_pub": "New York, NY", "pagerange": "233-244", "id_number": "CaltechAUTHORS:20120522-080032032", "isbn": "978-1-4503-0814-4", "book_title": "Proceedings of the ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20120522-080032032", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CCF 0830511" }, { "agency": "NSF", "grant_number": "CNS 0911041" }, { "agency": "NSF", "grant_number": "CNS 0846025" }, { "agency": "Department of Energy (DOE)", "grant_number": "DE-EE0002890" }, { "agency": "Army Research Office (ARO) Multidisciplinary University Research Initiative (MURI)", "grant_number": "W911NF-08-1-0233" }, { "agency": "Microsoft Research" }, { "agency": "Bell Labs" }, { "agency": "Caltech Lee Center for Advanced Networking" }, { "agency": "ARC", "grant_number": "FT0991594" } ] }, "doi": "10.1145/1993744.1993767", "resource_type": "book_section", "pub_year": "2011", "author_list": "Liu, Zhenhua; Lin, Minghong; et el." }, { "id": "https://authors.library.caltech.edu/records/0vq16-z1h72", "eprint_id": 29989, "eprint_status": "archive", "datestamp": "2023-08-19 06:03:42", "lastmod": "2024-01-13 05:51:33", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Lin-Minghong", "name": { "family": "Lin", "given": "Minghong" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Andrew-L-L-H", "name": { "family": "Andrew", "given": "Lachlan L. H." } }, { "id": "Thereska-E", "name": { "family": "Thereska", "given": "Eno" } } ] }, "title": "Dynamic right-sizing for power-proportional data centers", "ispublished": "unpub", "full_text_status": "restricted", "note": "\u00a9 2011 IEEE. Date of Current Version: 30 June 2011.", "abstract": "Power consumption imposes a significant cost for data centers implementing cloud services, yet much of that power is used to maintain excess service capacity during periods of predictably low load. This paper investigates how much can be saved by dynamically `right-sizing' the data center by turning off servers during such periods, and how to achieve that saving via an online algorithm. We prove that the optimal offline algorithm for dynamic right-sizing has a simple structure when viewed in reverse time, and this structure is exploited to develop a new `lazy' online algorithm, which is proven to be 3-competitive. We validate the algorithm using traces from two real data center workloads and show that significant cost-savings are possible.", "date": "2011-04", "date_type": "published", "publisher": "IEEE", "place_of_pub": "Piscataway, NJ", "pagerange": "1098-1106", "id_number": "CaltechAUTHORS:20120405-090850105", "isbn": "978-1-4244-9919-9", "book_title": "2011 IEEE INFOCOM Proceedings", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20120405-090850105", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1109/INFCOM.2011.5934885", "resource_type": "book_section", "pub_year": "2011", "author_list": "Lin, Minghong; Wierman, Adam; et el." }, { "id": "https://authors.library.caltech.edu/records/7gx5t-f8h88", "eprint_id": 54115, "eprint_status": "archive", "datestamp": "2023-08-19 05:00:31", "lastmod": "2024-01-13 16:14:10", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Bodine-Baron-E", "name": { "family": "Bodine-Baron", "given": "Elizabeth" } }, { "id": "Lee-Christina", "name": { "family": "Lee", "given": "Christina" } }, { "id": "Chong-Anthony", "name": { "family": "Chong", "given": "Anthony" } }, { "id": "Hassibi-B", "name": { "family": "Hassibi", "given": "Babak" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Peer Effects and Stability in Matching Markets", "ispublished": "unpub", "full_text_status": "public", "note": "\u00a9 Springer 2011. \n\nThis work was supported in part by the National Science Foundation under grants CCF-0729203, CNS-0932428 and CCF-1018927, by the Office of Naval Research under the MURI grant N00014-08-1-0747, and by Caltech's Lee Center for Advanced Networking.\n\nSubmitted - 1104.0052.pdf
", "abstract": "Many-to-one matching markets exist in numerous different forms, such as college admissions, matching medical interns to hospitals for residencies, assigning housing to college students, and the classic firms and workers market. In all these markets, externalities such as complementarities and peer effects severely complicate the preference ordering of each agent. Further, research has shown that externalities lead to serious problems for market stability and for developing efficient algorithms to find stable matchings. In this paper we make the observation that peer effects are often the result of underlying social connections, and we explore a formulation of the many-to-one matching market where peer effects are derived from an underlying social network. The key feature of our model is that it captures peer effects and complementarities using utility functions, rather than traditional preference ordering. With this model and considering a weaker notion of stability, namely\ntwo-sided exchange stability, we prove that stable matchings always exist and characterize the set of stable matchings in terms of social welfare. We also give distributed algorithms that are guaranteed to converge to a two-sided exchange stable matching. To assess the competitive ratio of these algorithms and to more generally characterize the efficiency of matching markets with externalities, we provide general bounds on how far the welfare of the worst-case stable matching can be from the welfare of the optimal matching, and find that the structure of the social network (e.g. how well clustered the network is) plays a large role.", "date": "2011", "date_type": "published", "publisher": "Springer", "place_of_pub": "Berlin", "pagerange": "117-129", "id_number": "CaltechAUTHORS:20150127-074255645", "isbn": "978-3-642-24828-3", "book_title": "Algorithmic Game Theory", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20150127-074255645", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CCF-0729203" }, { "agency": "NSF", "grant_number": "CNS-0932428" }, { "agency": "NSF", "grant_number": "CCF-1018927" }, { "agency": "Office of Naval Research (ONR)", "grant_number": "N00014-08-1-0747" }, { "agency": "Caltech Lee Center for Advanced Networking" } ] }, "contributors": { "items": [ { "id": "Persiano-G", "name": { "family": "Persiano", "given": "Giuseppe" } } ] }, "doi": "10.1007/978-3-642-24829-0_12", "primary_object": { "basename": "1104.0052.pdf", "url": "https://authors.library.caltech.edu/records/7gx5t-f8h88/files/1104.0052.pdf" }, "resource_type": "book_section", "pub_year": "2011", "author_list": "Bodine-Baron, Elizabeth; Lee, Christina; et el." }, { "id": "https://authors.library.caltech.edu/records/gmw2w-6f497", "eprint_id": 80209, "eprint_status": "archive", "datestamp": "2023-08-19 04:00:33", "lastmod": "2023-10-17 15:48:10", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Nair-J", "name": { "family": "Nair", "given": "Jayakrishnan" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Zwart-B", "name": { "family": "Zwart", "given": "Bert" } } ] }, "title": "Scheduling for the tail: Robustness versus optimality", "ispublished": "unpub", "full_text_status": "public", "keywords": "Robustness, Indexes, Random variables, Queueing analysis, Size measurement, Servers, Scheduling", "note": "\u00a9 2010 IEEE.\n\nPublished - 05707014.pdf
", "abstract": "When scheduling to minimize the sojourn time tail, the goals of optimality and robustness are seemingly at odds. Over the last decade, results have emerged which show that scheduling disciplines that are near-optimal under light (exponential) tailed workload distributions do not perform well under heavy (power) tailed workload distributions, and vice-versa. Very recently, it has been shown that this conflict between optimality and robustness is fundamental, i.e., no policy that does not learn information about the workload can be optimal across both light-tailed and heavy-tailed workloads. In this paper we show that one can exploit very limited workload information (the system load) in order to design a scheduler that provides robust performance across heavy-tailed and light-tailed workloads.", "date": "2010-10", "date_type": "published", "publisher": "IEEE", "place_of_pub": "Piscataway, NJ", "pagerange": "969-976", "id_number": "CaltechAUTHORS:20170810-133904497", "isbn": "978-1-4244-8215-3", "book_title": "48th Annual Allerton Conference on Communication, Control, and Computing (Allerton)", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170810-133904497", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1109/ALLERTON.2010.5707014", "primary_object": { "basename": "05707014.pdf", "url": "https://authors.library.caltech.edu/records/gmw2w-6f497/files/05707014.pdf" }, "resource_type": "book_section", "pub_year": "2010", "author_list": "Nair, Jayakrishnan; Wierman, Adam; et el." }, { "id": "https://authors.library.caltech.edu/records/bn1rt-khy89", "eprint_id": 66318, "eprint_status": "archive", "datestamp": "2023-08-19 02:43:43", "lastmod": "2023-10-18 17:58:24", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Andrew-L-L-H", "name": { "family": "Andrew", "given": "Lachlan L. H." } }, { "id": "Lin-Minghong", "name": { "family": "Lin", "given": "Minghong" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Optimality, fairness, and robustness in speed scaling designs", "ispublished": "unpub", "full_text_status": "restricted", "keywords": "Performance, Theory", "note": "\u00a9 2010 ACM. \n\nThis work was supported by NSF CCF 0830511 and CNS 0435520, Microsoft Research, the Lee Center for Advanced Networking and ARC grant FT0991594. We thank Jeremy Hurwitz for comments on the proof of Theorem 4.", "abstract": "This work examines fundamental tradeoffs incurred by a\nspeed scaler seeking to minimize the sum of expected response\ntime and energy use per job. We prove that a popular\nspeed scaler is 2-competitive for this objective and no\n\"natural\" speed scaler can do better. Additionally, we prove\nthat energy-proportional speed scaling works well for both\nShortest Remaining Processing Time (SRPT) and Processor\nSharing (PS) and we show that under both SRPT and PS,\ngated-static speed scaling is nearly optimal when the mean\nworkload is known, but that dynamic speed scaling provides\nrobustness against uncertain workloads. Finally, we prove\nthat speed scaling magnifies unfairness under SRPT but that\nPS remains fair under speed scaling. These results show that\nthese speed scalers can achieve any two, but only two, of optimality,\nfairness, and robustness.", "date": "2010-06", "date_type": "published", "publisher": "ACM", "place_of_pub": "New York, NY", "pagerange": "37-48", "id_number": "CaltechAUTHORS:20160420-131334344", "isbn": "978-1-4503-0038-4", "book_title": "Proceedings of the ACM SIGMETRICS international conference on Measurement and modeling of computer systems - SIGMETRICS '10", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20160420-131334344", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CCF 0830511" }, { "agency": "NSF", "grant_number": "CNS 0435520" }, { "agency": "Microsoft Research" }, { "agency": "Caltech Lee Center for Advanced Networking" }, { "agency": "Australian Research Council", "grant_number": "FT0991594" } ] }, "doi": "10.1145/1811039.1811044", "resource_type": "book_section", "pub_year": "2010", "author_list": "Andrew, Lachlan L. H.; Lin, Minghong; et el." }, { "id": "https://authors.library.caltech.edu/records/8vc1p-qc649", "eprint_id": 93261, "eprint_status": "archive", "datestamp": "2023-08-19 00:45:03", "lastmod": "2023-10-20 16:59:02", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Chen-Wei", "name": { "family": "Chen", "given": "Wei" } }, { "id": "Huang-Dayu", "name": { "family": "Huang", "given": "Dayu" } }, { "id": "Kulkarni-A-A", "name": { "family": "Kulkarni", "given": "Ankur A." } }, { "id": "Unnikrishnan-J", "name": { "family": "Unnikrishnan", "given": "Jayakrishnan" } }, { "id": "Zhu-Quanyan", "name": { "family": "Zhu", "given": "Quanyan" } }, { "id": "Mehta-P", "name": { "family": "Mehta", "given": "Prashant" } }, { "id": "Meyn-S", "name": { "family": "Meyn", "given": "Sean" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Approximate dynamic programming using fluid and diffusion approximations with applications to power management", "ispublished": "unpub", "full_text_status": "public", "note": "\u00a9 2009 IEEE. \n\nFinancial support from the National Science Foundation (ECS-0523620 and CCF-0830511), ITMANET DARPA RK 2006-07284, and Microsoft Research is gratefully acknowledged.\n\nPublished - 05399685.pdf
Submitted - 1307.1759.pdf
", "abstract": "TD learning and its refinements are powerful tools for approximating the solution to dynamic programming problems. However, the techniques provide the approximate solution only within a prescribed finite-dimensional function class. Thus, the question that always arises is how should the function class be chosen? The goal of this paper is to propose an approach for TD learning based on choosing the function class using the solutions to associated fluid and diffusion approximations. In order to illustrate this new approach, the paper focuses on an application to dynamic speed scaling for power management.", "date": "2009-12", "date_type": "published", "publisher": "IEEE", "place_of_pub": "Piscataway, NJ", "pagerange": "3575-3580", "id_number": "CaltechAUTHORS:20190226-095816638", "isbn": "978-1-4244-3872-3", "book_title": "Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190226-095816638", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "ECS-0523620" }, { "agency": "NSF", "grant_number": "CCF-0830511" }, { "agency": "Defense Advanced Research Projects Agency (DARPA)", "grant_number": "RK 2006-07284" }, { "agency": "Microsoft Research" } ] }, "collection": "CaltechAUTHORS", "doi": "10.1109/CDC.2009.5399685", "primary_object": { "basename": "1307.1759.pdf", "url": "https://authors.library.caltech.edu/records/8vc1p-qc649/files/1307.1759.pdf" }, "related_objects": [ { "basename": "05399685.pdf", "url": "https://authors.library.caltech.edu/records/8vc1p-qc649/files/05399685.pdf" } ], "resource_type": "book_section", "pub_year": "2009", "author_list": "Chen, Wei; Huang, Dayu; et el." }, { "id": "https://authors.library.caltech.edu/records/6q2ge-ykg12", "eprint_id": 93248, "eprint_status": "archive", "datestamp": "2023-08-19 00:44:42", "lastmod": "2023-10-20 16:58:46", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Marden-J-R", "name": { "family": "Marden", "given": "Jason R." } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Overcoming limitations of game-theoretic distributed control", "ispublished": "unpub", "full_text_status": "public", "note": "\u00a9 2009 IEEE.\n\nPublished - 05400550.pdf
Submitted - price_of_BB.pdf
", "abstract": "Recently, game theory has been proposed as a tool for cooperative control. Specifically, the interactions of a multi-agent distributed system are modeled as a non-cooperative game where agents are self-interested. In this work, we prove that this approach of non-cooperative control has limitations with respect to engineering multi-agent systems. In particular, we prove that it is not possible to design budget balanced agent utilities that also guarantee that the optimal control is a Nash equilibrium. However, it is important to realize that game-theoretic designs are not restricted to the framework of non-cooperative games. In particular, we demonstrate that these limitations can be overcome by conditioning each player's utility on additional information, i.e., a state. This utility design fits into the framework of a particular form of stochastic games termed state-based games and is applicable in many application domains.", "date": "2009-12", "date_type": "published", "publisher": "IEEE", "place_of_pub": "Piscataway, NJ", "pagerange": "6466-6471", "id_number": "CaltechAUTHORS:20190226-090707604", "isbn": "978-1-4244-3872-3", "book_title": "Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190226-090707604", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "collection": "CaltechAUTHORS", "doi": "10.1109/CDC.2009.5400550", "primary_object": { "basename": "05400550.pdf", "url": "https://authors.library.caltech.edu/records/6q2ge-ykg12/files/05400550.pdf" }, "related_objects": [ { "basename": "price_of_BB.pdf", "url": "https://authors.library.caltech.edu/records/6q2ge-ykg12/files/price_of_BB.pdf" } ], "resource_type": "book_section", "pub_year": "2009", "author_list": "Marden, Jason R. and Wierman, Adam" }, { "id": "https://authors.library.caltech.edu/records/byfkb-qck76", "eprint_id": 19283, "eprint_status": "archive", "datestamp": "2023-08-19 00:14:02", "lastmod": "2023-10-20 20:30:17", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Bodine-E", "name": { "family": "Bodine", "given": "Elizabeth" } }, { "id": "Hassibi-B", "name": { "family": "Hassibi", "given": "Babak" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Generalizing Kronecker graphs in order to model searchable networks", "ispublished": "unpub", "full_text_status": "public", "note": "\u00a9 2009 IEEE.\n\nPublished - Bodine2009p109232009_47Th_Annual_Allerton_Conference_On_Communication_Control_And_Computing_Vols_1_And_2.pdf
", "abstract": "This paper describes an extension to stochastic\nKronecker graphs that provides the special structure required\nfor searchability, by defining a \"distance\"-dependent Kronecker\noperator. We show how this extension of Kronecker graphs\ncan generate several existing social network models, such as\nthe Watts-Strogatz small-world model and Kleinberg's latticebased\nmodel. We focus on a specific example of an expanding\nhypercube, reminiscent of recently proposed social network\nmodels based on a hidden hyperbolic metric space, and prove\nthat a greedy forwarding algorithm can find very short paths\nof length O((log log n)^2) for graphs with n nodes.", "date": "2009-10", "date_type": "published", "pagerange": "194-201", "id_number": "CaltechAUTHORS:20100805-080815717", "isbn": "978-1-4244-5870-7", "book_title": "47th Annual Allerton Conference on Communication, Control and Computing", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20100805-080815717", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1109/ALLERTON.2009.5394816", "primary_object": { "basename": "Bodine2009p109232009_47Th_Annual_Allerton_Conference_On_Communication_Control_And_Computing_Vols_1_And_2.pdf", "url": "https://authors.library.caltech.edu/records/byfkb-qck76/files/Bodine2009p109232009_47Th_Annual_Allerton_Conference_On_Communication_Control_And_Computing_Vols_1_And_2.pdf" }, "resource_type": "book_section", "pub_year": "2009", "author_list": "Bodine, Elizabeth; Hassibi, Babak; et el." }, { "id": "https://authors.library.caltech.edu/records/n53q4-xnh44", "eprint_id": 18244, "eprint_status": "archive", "datestamp": "2023-08-21 21:36:36", "lastmod": "2023-10-20 15:53:43", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Andrew-L-L-H", "name": { "family": "Andrew", "given": "Lachlan L. H." } }, { "id": "Tang-Ao", "name": { "family": "Tang", "given": "Ao" }, "orcid": "0000-0001-6296-644X" } ] }, "title": "Power-Aware Speed Scaling in Processor Sharing Systems", "ispublished": "unpub", "full_text_status": "public", "keywords": "energy consumption; power aware computing; processor scheduling; telecommunication traffic", "note": "\u00a9 2009 IEEE.\n\nIssue Date: 19-25 April 2009; Date of Current Version: 02 June 2009.\n\nThis work was supported by grants from NSF CCF 0830511 and CNS 0435520, Microsoft Research, the Lee Center for Advanced Networking and the Australian Research Council. We are grateful for the feedback we received at the Allerton 2008 workshop [31] on our preliminary work on this topic.\n\nPublished - Wierman2009p8304Ieee_Infocom_2009_-_Ieee_Conference_On_Computer_Communications_Vols_1-5.pdf
", "abstract": "Energy use of computer communication systems has quickly become a vital design consideration. One effective method for reducing energy consumption is dynamic speed scaling, which adapts the processing speed to the current load. This paper studies how to optimally scale speed to balance mean response time and mean energy consumption under processor sharing scheduling. Both bounds and asymptotics for the optimal speed scaling scheme are provided. These results show that a simple scheme that halts when the system is idle and uses a static rate while the system is busy provides nearly the same performance as the optimal dynamic speed scaling. However, the results also highlight that dynamic speed scaling provides at least one key benefit - significantly improved robustness to bursty traffic and mis-estimation of workload parameters.", "date": "2009-06-02", "date_type": "published", "publisher": "IEEE", "pagerange": "2007-2015", "id_number": "CaltechAUTHORS:20100511-151310788", "isbn": "978-1-4244-3512-8", "book_title": "INFOCOM 2009, IEEE", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20100511-151310788", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CCF-0830511" }, { "agency": "NSF", "grant_number": "CNS-0435520" }, { "agency": "Microsoft Research" }, { "agency": "Caltech Lee Center for Advanced Networking" }, { "agency": "Australian Research Council" } ] }, "doi": "10.1109/INFCOM.2009.5062123", "primary_object": { "basename": "Wierman2009p8304Ieee_Infocom_2009_-_Ieee_Conference_On_Computer_Communications_Vols_1-5.pdf", "url": "https://authors.library.caltech.edu/records/n53q4-xnh44/files/Wierman2009p8304Ieee_Infocom_2009_-_Ieee_Conference_On_Computer_Communications_Vols_1-5.pdf" }, "resource_type": "book_section", "pub_year": "2009", "author_list": "Wierman, Adam; Andrew, Lachlan L. H.; et el." }, { "id": "https://authors.library.caltech.edu/records/g9k13-z1c77", "eprint_id": 19182, "eprint_status": "archive", "datestamp": "2023-08-20 01:08:29", "lastmod": "2023-10-20 20:05:51", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Andrew-L-L-H", "name": { "family": "Andrew", "given": "Lachlan L. H." } }, { "id": "Tang-Ao", "name": { "family": "Tang", "given": "Ao" }, "orcid": "0000-0001-6296-644X" } ] }, "title": "Stochastic Analysis of Power-Aware Scheduling", "ispublished": "unpub", "full_text_status": "public", "note": "\u00a9 2008 IEEE.\n\nIssue Date: 23-26 Sept. 2008; Date of Current Version: 04 March 2009.\n\nThis work was supported by grants from NSF CCF 0830511\nand CNS 0435520, Microsoft Research and the Lee Center for\nAdvanced Networking.\n\nPublished - Wierman2008p81842008_46Th_Annual_Allerton_Conference_On_Communication_Control_And_Computing_Vols_1-3.pdf
", "abstract": "Energy consumption in a computer system can be reduced by dynamic speed scaling, which adapts the processing speed to the current load. This paper studies the optimal way to adjust speed to balance mean response time and mean energy consumption, when jobs arrive as a Poisson process and processor sharing scheduling is used. Both bounds and asymptotics for the optimal speeds are provided. Interestingly, a simple scheme that halts when the system is idle and uses a static rate while the system is busy provides nearly the same performance as the optimal dynamic speed scaling. However, dynamic speed scaling which allocates a higher speed when more jobs are present significantly improves robustness to bursty traffic and mis-estimation of workload parameters.", "date": "2009-03-04", "date_type": "published", "publisher": "IEEE", "pagerange": "1278-1283", "id_number": "CaltechAUTHORS:20100726-104119459", "isbn": "978-1-4244-2925-7", "book_title": "46th Annual Allerton Conference on Communication, Control, and Computing, 2008", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20100726-104119459", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CCF 0830511" }, { "agency": "NSF", "grant_number": "CNS 0435520" }, { "agency": "Microsoft Research" }, { "agency": "Lee Center for Advanced Networking, Caltech" } ] }, "other_numbering_system": { "items": [ { "id": "10501207", "name": "INSPEC Accession Number" } ] }, "doi": "10.1109/ALLERTON.2008.4797707", "primary_object": { "basename": "Wierman2008p81842008_46Th_Annual_Allerton_Conference_On_Communication_Control_And_Computing_Vols_1-3.pdf", "url": "https://authors.library.caltech.edu/records/g9k13-z1c77/files/Wierman2008p81842008_46Th_Annual_Allerton_Conference_On_Communication_Control_And_Computing_Vols_1-3.pdf" }, "resource_type": "book_section", "pub_year": "2009", "author_list": "Wierman, Adam; Andrew, Lachlan L. H.; et el." }, { "id": "https://authors.library.caltech.edu/records/ehmt0-jh965", "eprint_id": 18211, "eprint_status": "archive", "datestamp": "2023-08-20 00:19:04", "lastmod": "2023-10-20 15:52:08", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Chen-H-L", "name": { "family": "Chen", "given": "Ho-Lin" } }, { "id": "Marden-J-R", "name": { "family": "Marden", "given": "Jason R." } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "On the impact of heterogeneity and back-end scheduling in load balancing designs", "ispublished": "unpub", "full_text_status": "public", "note": "\u00a9 2009 IEEE.\nThis work was supported by NSF CCF 0830511, Microsoft Research, and\nthe Lee Center for Advanced Networking.\n\nPublished - Chen2009p8164Ieee_Infocom_2009_-_Ieee_Conference_On_Computer_Communications_Vols_1-5.pdf
", "abstract": "Load balancing is a common approach for task\nassignment in distributed architectures. In this paper, we show\nthat the degree of inefficiency in load balancing designs is highly\ndependent on the scheduling discipline used at each of the backend\nservers. Traditionally, the back-end scheduler can be modeled\nas Processor Sharing (PS), in which case the degree of inefficiency\ngrows linearly with the number of servers. However, if the back-end\nscheduler is changed to Shortest Remaining Processing Time\n(SRPT), the degree of inefficiency can be independent of the\nnumber of servers, instead depending only on the heterogeneity\nof the speeds of the servers. Further, switching the back-end\nscheduler to SRPT can provide significant improvements in\nthe overall mean response time of the system as long as the\nheterogeneity of the server speeds is small.", "date": "2009", "date_type": "published", "publisher": "IEEE", "pagerange": "2267-2275", "id_number": "CaltechAUTHORS:20100510-110115895", "isbn": "978-1-4244-3512-8", "book_title": "INFOCOM 2009, IEEE", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20100510-110115895", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CCF 0830511" }, { "agency": "Microsoft Research" }, { "agency": "Lee Center for Advanced Networking" } ] }, "doi": "10.1109/INFCOM.2009.5062152", "primary_object": { "basename": "Chen2009p8164Ieee_Infocom_2009_-_Ieee_Conference_On_Computer_Communications_Vols_1-5.pdf", "url": "https://authors.library.caltech.edu/records/ehmt0-jh965/files/Chen2009p8164Ieee_Infocom_2009_-_Ieee_Conference_On_Computer_Communications_Vols_1-5.pdf" }, "resource_type": "book_section", "pub_year": "2009", "author_list": "Chen, Ho-Lin; Marden, Jason R.; et el." }, { "id": "https://authors.library.caltech.edu/records/g4wy1-rem52", "eprint_id": 93396, "eprint_status": "archive", "datestamp": "2023-08-20 00:07:37", "lastmod": "2023-10-20 17:06:37", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Marden-J-R", "name": { "family": "Marden", "given": "Jason R." } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Distributed welfare games with applications to sensor coverage", "ispublished": "unpub", "full_text_status": "public", "note": "\u00a9 2008 IEEE. \n\nThe journal version of this paper is [1]. All omitted proofs can be found in [1]. This work was supported by Microsoft Research and both the Social and Information Sciences Laboratory and the Lee Center for Advanced Networking at California Institute of Technology. Additionally, we would like to acknowledge the insights that came from many discussions with Sherwin Doroudi and Kenneth McKell.\n\nPublished - 04738800.pdf
Submitted - distributedwelfaregames.pdf
", "abstract": "Traditionally resource allocation problems are approached in a centralized manner; however, often centralized control is impossible. We consider a distributed, non-cooperative approach to resource allocation. In particular, we consider the situation where the global planner does not have the authority to assign players to resources; rather, players are self-interested. The question that emerges is how can the global planner entice the players to settle on a desirable allocation with respect to the global welfare? To study this question, we focus on a class of games that we refer to as distributed welfare games. Within this context, we investigate how the global planner should distribute the global welfare to the players. We measure the efficacy of a distribution rule in two ways: (i) Does a pure Nash equilibrium exist? (ii) How efficient are the Nash equilibria as compared with the global optimum? We derive sufficient conditions on the distribution rule that ensures the existence of a pure Nash equilibrium in any single-selection distributed welfare game. Furthermore, we derive bounds on the efficiency of these distribution rules in a variety of settings. Lastly, we highlight the implications of these results in the context of the sensor coverage problem.", "date": "2008-12", "date_type": "published", "publisher": "IEEE", "place_of_pub": "Piscataway, NJ", "pagerange": "1708-1713", "id_number": "CaltechAUTHORS:20190301-134129242", "isbn": "978-1-4244-3124-3", "book_title": "47th IEEE Conference on Decision and Control", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190301-134129242", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Microsoft Research" }, { "agency": "Caltech Social and Information Sciences Laboratory" }, { "agency": "Caltech Lee Center for Advanced Networking" } ] }, "doi": "10.1109/CDC.2008.4738800", "primary_object": { "basename": "04738800.pdf", "url": "https://authors.library.caltech.edu/records/g4wy1-rem52/files/04738800.pdf" }, "related_objects": [ { "basename": "distributedwelfaregames.pdf", "url": "https://authors.library.caltech.edu/records/g4wy1-rem52/files/distributedwelfaregames.pdf" } ], "resource_type": "book_section", "pub_year": "2008", "author_list": "Marden, Jason R. and Wierman, Adam" }, { "id": "https://authors.library.caltech.edu/records/t954c-rg485", "eprint_id": 73265, "eprint_status": "archive", "datestamp": "2023-08-22 11:54:33", "lastmod": "2023-10-24 15:10:24", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Nuyens-M", "name": { "family": "Nuyens", "given": "Misja" } } ] }, "title": "Scheduling despite inexact job-size information", "ispublished": "unpub", "full_text_status": "restricted", "keywords": "Performance, Algorithms, Scheduling; Queueing; Response time; M/G/1; SRPT; Shortest remaining processing time; SMART; Job size estimates", "note": "\u00a9 2008 ACM.", "abstract": "Motivated by the optimality of Shortest Remaining Processing Time (SRPT) for mean response time, in recent years many computer systems have used the heuristic of \"favoring small jobs\" in order to dramatically reduce user response times. However, rarely do computer systems have knowledge of exact remaining sizes. In this paper, we introduce the class of \u03b5-SMART policies, which formalizes the heuristic of \"favoring small jobs\" in a way that includes a wide range of policies that schedule using inexact job-size information. Examples of \u03b5-SMART policies include (i) policies that use exact size information, e.g., SRPT and PSJF, (ii) policies that use job-size estimates, and (iii) policies that use a finite number of size-based priority levels.\n\nFor many \u03b5-SMART policies, e.g., SRPT with inexact job-size information, there are no analytic results available in the literature. In this work, we prove four main results: we derive upper and lower bounds on the mean response time, the mean slowdown, the response-time tail, and the conditional response time of \u03b5-SMART policies. In each case, the results explicitly characterize the tradeoff between the accuracy of the job-size information used to prioritize and the performance of the resulting policy. Thus, the results provide designers insight into how accurate job-size information must be in order to achieve desired performance guarantees.", "date": "2008-06", "date_type": "published", "publisher": "ACM", "place_of_pub": "New York, NY", "pagerange": "25-36", "id_number": "CaltechAUTHORS:20170105-110341670", "isbn": "978-1-60558-005-0", "book_title": "SIGMETRICS '08 Proceedings of the 2008 ACM SIGMETRICS international conference on Measurement and modeling of computer systems", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170105-110341670", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "contributors": { "items": [ { "id": "Liu-Zhen", "name": { "family": "Liu", "given": "Zhen" } } ] }, "doi": "10.1145/1375457.1375461", "resource_type": "book_section", "pub_year": "2008", "author_list": "Wierman, Adam and Nuyens, Misja" }, { "id": "https://authors.library.caltech.edu/records/x82kf-xgr63", "eprint_id": 106877, "eprint_status": "archive", "datestamp": "2023-08-19 17:58:54", "lastmod": "2023-10-23 15:08:27", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Yang-Chang-Woo", "name": { "family": "Yang", "given": "Chang-Woo" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Shakkottai-Sanjay", "name": { "family": "Shakkottai", "given": "Sanjay" } }, { "id": "Harchol-Balter-Mor", "name": { "family": "Harchol-Balter", "given": "Mor" } } ] }, "title": "Tail asymptotics for policies favoring short jobs in a many-flows regime", "ispublished": "unpub", "full_text_status": "restricted", "keywords": "Scheduling, Large\u2013Deviations, Many\u2013sources, Rate Function, SMART, LAS, SRPT", "note": "\u00a9 2006 ACM.", "abstract": "Scheduling policies that prioritize short jobs have received growing attention in recent years. The class of SMART policies includes many such disciplines, e.g. Shortest-Remaining-Processing-Time (SRPT) and Preemptive-Shortest-Job-First (PSJF). In this work, we study the delay distribution of SMART policies and contrast this distribution with that of the Least-Attained-Service (LAS) policy, which indirectly favors short jobs by prioritizing jobs with the least attained service (age). We study the delay distribution (rate function) of LAS and the SMART class in a discrete-time queueing system under the many sources regime. Our analysis in this regime (large capacity and large number of flows) hinges on a novel two dimensional queue representation, which creates tie-break rules. These additional rules do not alter the policies, but greatly simplify their analysis. We demonstrate that the queue evolution of all the above policies can be described under this single two dimensional framework.We prove that all SMART policies have the same delay distribution as SRPT and illustrate the improvements SMART policies make over First-Come-First-Served (FCFS). Furthermore, we show that the delay distribution of SMART policies stochastically improves upon the delay distribution of LAS. However, the delay distribution under LAS is not too bad -- the distribution of delay under LAS for most jobs sizes still provides improvement over FCFS. Our results are complementary to prior work that studies delay-tail behavior in the large buffer regime under a single flow.", "date": "2006-06", "date_type": "published", "publisher": "ACM Press", "place_of_pub": "New York, NY", "pagerange": "97-108", "id_number": "CaltechAUTHORS:20201202-141807987", "isbn": "1595933190", "book_title": "SIGMETRICS '06/Performance '06: Proceedings of the joint international conference on Measurement and modeling of computer systems", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20201202-141807987", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/1140277.1140290", "resource_type": "book_section", "pub_year": "2006", "author_list": "Yang, Chang-Woo; Wierman, Adam; et el." }, { "id": "https://authors.library.caltech.edu/records/fjvcg-e2n08", "eprint_id": 108366, "eprint_status": "archive", "datestamp": "2023-08-19 17:48:44", "lastmod": "2023-10-23 16:58:39", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Schroeder-Bianca", "name": { "family": "Schroeder", "given": "Bianca" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Harchol-Balter-Mor", "name": { "family": "Harchol-Balter", "given": "Mor" } } ] }, "title": "Open versus closed: a cautionary tale", "ispublished": "unpub", "full_text_status": "restricted", "note": "\u00a9 2006 USENIX Association. \n\nWe would like to thank Arun Iyengar, Erich Nahum, Paul Dantzig, Luis von Ahn, and Chad Vizino for providing access to the logs we used in Section 4.3 and Section 7. \n\nThis work was supported by an IBM PhD fellowship, NSF grants CCR-0133077, CCR-0311383, and CCR-0313148, and by IBM via TTC grant 2005-2006.", "abstract": "Workload generators may be classified as based on a closed system model, where new job arrivals are only triggered by job completions (followed by think time), or an open system model, where new jobs arrive independently of job completions. In general, system designers pay little attention to whether a workload generator is closed or open. \n\nUsing a combination of implementation and simulation experiments, we illustrate that there is a vast difference in behavior between open and closed models in real-world settings. We synthesize these differences into eight simple guiding principles, which serve three purposes. First, the principles specify how scheduling policies are impacted by closed and open models, and explain the differences in user level performance. Second, the principles motivate the use of partly open system models, whose behavior we show to lie between that of closed and open models. Finally, the principles provide guidelines to system designers for determining which system model is most appropriate for a given workload.", "date": "2006-05", "date_type": "published", "publisher": "USENIX Association", "place_of_pub": "Berkeley, CA", "pagerange": "239-252", "id_number": "CaltechAUTHORS:20210309-113621297", "isbn": "9781931971430", "book_title": "Proceedings of the 3rd conference on Networked Systems Design & Implementation", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20210309-113621297", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "IBM", "grant_number": "2005-2006" }, { "agency": "NSF", "grant_number": "CCR-0133077" }, { "agency": "NSF", "grant_number": "CCR-0311383" }, { "agency": "NSF", "grant_number": "CCR-0313148" } ] }, "resource_type": "book_section", "pub_year": "2006", "author_list": "Schroeder, Bianca; Wierman, Adam; et el." }, { "id": "https://authors.library.caltech.edu/records/mneef-twe42", "eprint_id": 93597, "eprint_status": "archive", "datestamp": "2023-08-19 17:38:17", "lastmod": "2023-10-20 17:16:13", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Schroeder-B", "name": { "family": "Schroeder", "given": "Bianca" } }, { "id": "Harchol-Balter-M", "name": { "family": "Harchol-Balter", "given": "Mor" } }, { "id": "Iyengar-A", "name": { "family": "Iyengar", "given": "Arun" } }, { "id": "Nahum-E", "name": { "family": "Nahum", "given": "Erich" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "How to Determine a Good Multi-Programming Level for External Scheduling", "ispublished": "unpub", "full_text_status": "public", "note": "\u00a9 2006 IEEE.\n\nSupported by NSF grants CCR-0133077, CCR-0311383, 0313148, and a 2005 Pittsburgh Digital Greenhouse Grant.\n\nPublished - 01617428.pdf
", "abstract": "Scheduling/prioritization of DBMS transactions is important for many applications that rely on database backends. A convenient way to achieve scheduling is to limit the number of transactions within the database, maintaining most of the transactions in an external queue, which can be ordered as desired by the application. While external scheduling has many advantages in that it doesn't require changes to internal resources, it is also difficult to get right in that its performance depends critically on the particular multiprogramming limit used (the MPL), i.e. the number of transactions allowed into the database. If the MPL is too low, throughput will suffer, since not all DBMS resources will be utilized. On the other hand, if the MPL is too high, there is insufficient control on scheduling. The question of how to adjust theMPL to achieve both goals simultaneously is an open problem, not just for databases but in system design in general. Herein we study this problem in the context of transactional workloads, both via extensive experimentation and queueing theoretic analysis. We find that the two most critical factors in adjusting the MPL are the number of resources that the workload utilizes and the variability of the transactions' service demands. We develop a feedback based controller, augmented by queueing theoretic models for automatically adjusting the MPL. Finally, we apply our methods to the specific problem of external prioritization of transactions. We find that external prioritization can be nearly as effective as internal prioritization, without any negative consequences, when the MPL is set appropriately.", "date": "2006-04", "date_type": "published", "publisher": "IEEE", "place_of_pub": "Piscataway, NJ", "pagerange": "Art. No. 60", "id_number": "CaltechAUTHORS:20190306-130910057", "isbn": "0769525709", "book_title": "22nd International Conference on Data Engineering (ICDE'06)", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190306-130910057", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CCR-0133077" }, { "agency": "NSF", "grant_number": "CCR-0311383" }, { "agency": "NSF", "grant_number": "CCF-0313148" }, { "agency": "2005 Pittsburgh Digital Greenhouse Grant" } ] }, "doi": "10.1109/icde.2006.78", "primary_object": { "basename": "01617428.pdf", "url": "https://authors.library.caltech.edu/records/mneef-twe42/files/01617428.pdf" }, "resource_type": "book_section", "pub_year": "2006", "author_list": "Schroeder, Bianca; Harchol-Balter, Mor; et el." }, { "id": "https://authors.library.caltech.edu/records/7wfr3-csy24", "eprint_id": 104883, "eprint_status": "archive", "datestamp": "2023-09-15 06:48:13", "lastmod": "2023-10-23 21:31:41", "type": "book_section", "metadata_visibility": "show", "creators": { "items": [ { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Osogami-Takayuki", "name": { "family": "Osogami", "given": "Takayuki" } }, { "id": "J\u00f6rgen-Ols\u00e9n", "name": { "family": "J\u00f6rgen", "given": "Ols\u00e9n" } } ] }, "title": "A unified framework for modeling TCP-Vegas, TCP-SACK, and TCP-Reno", "ispublished": "unpub", "full_text_status": "restricted", "keywords": "Analytical models, Protocols, Delay, Computer science, Traffic control, Queueing analysis, Mathematics, Mathematical model, Telecommunication traffic, Performance evaluation", "note": "\u00a9 2003 IEEE. \n\nThis work was supported by NSF Career Grant CCR-0133077, NSF ITR Grant 99-167 ANI-0081396, Cisco Systems, Spinnaker Networks via Pittsburgh Digital Greenhouse Grant 01-1, and the Swedish Foundation for Strategic Research.", "abstract": "A general analytical framework for the modeling and analysis of TCP variations is presented. The framework allows the modeling of multiple variations of TCP, including TCP-Vegas, TCP-SACK, and TCP-Reno, under general network situations. In particular, the framework allows us to propose the first analytical model of TCP-Vegas for arbitrary on-off traffic that is able to predict the operating point of the network. The analysis provided by our framework leads to many interesting observations with respect to both the behavior of bottleneck links that are shared by TCP sources and the effectiveness of the design decisions in TCP-SACK and TCP-Vegas.", "date": "2003-10", "date_type": "published", "publisher": "IEEE", "place_of_pub": "Piscataway, NJ", "pagerange": "269-278", "id_number": "CaltechAUTHORS:20200810-134515207", "isbn": "0769520391", "book_title": "Proceedings of the 11TH IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer Telecommunications Systems", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20200810-134515207", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CCR-0133077" }, { "agency": "NSF", "grant_number": "CNS-0081396" }, { "agency": "Cisco Systems" }, { "agency": "Pittsburgh Digital Greenhouse", "grant_number": "01-1" }, { "agency": "Swedish Foundation for Strategic Research" } ] }, "doi": "10.1109/mascot.2003.1240671", "resource_type": "book_section", "pub_year": "2003", "author_list": "Wierman, Adam; Osogami, Takayuki; et el." } ]