[ { "id": "https://authors.library.caltech.edu/records/00as5-6gj35", "eprint_status": "archive", "datestamp": "2023-12-13 22:32:48", "lastmod": "2023-12-13 22:32:48", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Lechowicz-Adam", "name": { "family": "Lechowicz", "given": "Adam" }, "orcid": "0000-0002-7774-9939" }, { "id": "Christianson-Nicolas", "name": { "family": "Christianson", "given": "Nicolas" }, "orcid": "0000-0001-8330-8964" }, { "id": "Zuo-Jinhang", "name": { "family": "Zuo", "given": "Jinhang" }, "orcid": "0000-0002-9557-3551" }, { "id": "Bashir-Noman", "name": { "family": "Bashir", "given": "Noman" }, "orcid": "0000-0001-9304-910X" }, { "id": "Hajiesmaili-Mohammad", "name": { "family": "Hajiesmaili", "given": "Mohammad" }, "orcid": "0000-0001-9278-2254" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" }, "orcid": "0000-0002-5923-0199" }, { "id": "Shenoy-Prashant", "name": { "family": "Shenoy", "given": "Prashant" }, "orcid": "0000-0002-5435-1901" } ] }, "title": "The Online Pause and Resume Problem: Optimal Algorithms and An Application to Carbon-Aware Load Shifting", "ispublished": "pub", "full_text_status": "public", "keywords": "Computer Networks and Communications; Hardware and Architecture; Safety, Risk, Reliability and Quality; Computer Science (miscellaneous)", "note": "
\u00a9 2023 ACM.
\n\nWe thank our shepherd Issac Grosof and the anonymous SIGMETRICS reviewers for their valuable insight and feedback.+
This research is supported by National Science Foundation grants CAREER-2045641, CNS2102963, CNS-2106299, CNS-2146814, CNS-1518941, CPS-2136197, CPS-2136199, NGSDI-2105494, NGSDI-2105648, 1908298, 2020888, 2021693, 2045641, 2213636, and 2211888.
This material is based upon work supported by the U.S. Department of Energy, Office of Science, Office of Advanced Scientific Computing Research, Department of Energy Computational Science Graduate Fellowship, and an NSF Graduate Research Fellowship (DGE-1745301).
\n\nThis report was prepared as an account of work sponsored by an agency of the United States Government. Neither the United States Government nor any agency thereof, nor any of their employees, makes any warranty, express or implied, or assumes any legal liability or responsibility for the accuracy, completeness, or usefulness of any information, apparatus, product, or process disclosed, or represents that its use would not infringe privately owned rights. Reference herein to any specific commercial product, process, or service by trade name, trademark, manufacturer, or otherwise does not necessarily constitute or imply its endorsement, recommendation, or favoring by the United States Government or any agency thereof. The views and opinions of authors expressed herein do not necessarily state or reflect those of the United States Government or any agency thereof.
", "abstract": "We introduce and study the online pause and resume problem. In this problem, a player attempts to find the k lowest (alternatively, highest) prices in a sequence of fixed length T, which is revealed sequentially. At each time step, the player is presented with a price and decides whether to accept or reject it. The player incurs a switching cost whenever their decision changes in consecutive time steps, i.e., whenever they pause or resume purchasing. This online problem is motivated by the goal of carbon-aware load shifting, where a workload may be paused during periods of high carbon intensity and resumed during periods of low carbon intensity and incurs a cost when saving or restoring its state. It has strong connections to existing problems studied in the literature on online optimization, though it introduces unique technical challenges that prevent the direct application of existing algorithms. Extending prior work on threshold-based algorithms, we introduce double-threshold algorithms for both the minimization and maximization variants of this problem. We further show that the competitive ratios achieved by these algorithms are the best achievable by any deterministic online algorithm. Finally, we empirically validate our proposed algorithm through case studies on the application of carbon-aware load shifting using real carbon trace data and existing baseline algorithms.
", "date": "2023-12", "date_type": "published", "publication": "Proceedings of the ACM on Measurement and Analysis of Computing Systems", "volume": "7", "number": "3", "publisher": "Association for Computing Machinery", "pagerange": "45", "issn": "2476-1249", "official_url": "https://authors.library.caltech.edu/records/00as5-6gj35", "funders": { "items": [ { "grant_number": "CNS-2045641" }, { "grant_number": "CNS-2102963" }, { "grant_number": "CNS-2106299" }, { "grant_number": "CNS-2146814" }, { "grant_number": "CNS-1518941" }, { "grant_number": "ECCS-2136197" }, { "grant_number": "ECCS-2136199" }, { "grant_number": "CNS-2105494" }, { "grant_number": "CNS-2105648" }, { "grant_number": "CNS-1908298" }, { "grant_number": "SES-2020888" }, { "grant_number": "DGE-2021693" }, { "grant_number": "CNS-2045641" }, { "grant_number": "CNS-2213636" }, { "grant_number": "CNS-2211888" }, { "grant_number": "Computational Science Graduate Fellowship" }, { "grant_number": "(DGE-1745301)" } ] }, "doi": "10.1145/3626776", "resource_type": "article", "pub_year": "2023", "author_list": "Lechowicz, Adam; Christianson, Nicolas; et el." }, { "id": "https://authors.library.caltech.edu/records/twb2b-x7v50", "eprint_id": 122212, "eprint_status": "archive", "datestamp": "2023-08-22 21:07:11", "lastmod": "2023-10-20 19:06:37", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Qin-Junjie", "name": { "family": "Qin", "given": "Junjie" }, "orcid": "0000-0002-9597-1138" }, { "id": "Vardi-Shai", "name": { "family": "Vardi", "given": "Shai" }, "orcid": "0000-0003-4720-6826" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" }, "orcid": "0000-0002-5923-0199" } ] }, "title": "Minimization Fractional Prophet Inequalities for Sequential Procurement", "ispublished": "pub", "full_text_status": "public", "keywords": "Management Science and Operations Research; Computer Science Applications; General Mathematics", "note": "\u00a9 2023 INFORMS.\n\nThe authors thank the anonymous reviewers for their careful reading and useful comments. The part of this work was done while the authors were visiting the Simons Institute for the Theory of Computing. \n\nThis work was supported by NSF Grants [CNS-2146814, CPS-2136197, CNS-2106403, NGSDI-2105648].", "abstract": "We consider a minimization variant on the classical prophet inequality with monomial cost functions. A firm would like to procure some fixed amount of a divisible commodity from sellers that arrive sequentially. Whenever a seller arrives, the seller's cost function is revealed, and the firm chooses how much of the commodity to buy. We first show that if one restricts the set of distributions for the coefficients to a family of natural distributions that include, for example, the uniform and truncated normal distributions, then there is a thresholding policy that is asymptotically optimal in the number of sellers. We then compare two scenarios based on whether the firm has in-house production capabilities or not. We precisely compute the optimal algorithm's competitive ratio when in-house production capabilities exist and for a special case when they do not. We show that the main advantage of the ability to produce the commodity in house is that it shields the firm from price spikes in worst-case scenarios.", "date": "2023-07-12", "date_type": "published", "publication": "Mathematics of Operations Research", "publisher": "INFORMS", "id_number": "CaltechAUTHORS:20230710-599244800.27", "issn": "0364-765X", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20230710-599244800.27", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CNS-2146814" }, { "agency": "NSF", "grant_number": "ECCS-2136197" }, { "agency": "NSF", "grant_number": "CNS-2106403" }, { "agency": "NSF", "grant_number": "CNS-2105648" } ] }, "doi": "10.1287/moor.2021.173", "resource_type": "article", "pub_year": "2023", "author_list": "Qin, Junjie; Vardi, Shai; et el." }, { "id": "https://authors.library.caltech.edu/records/j47b6-s0z07", "eprint_id": 121808, "eprint_status": "archive", "datestamp": "2023-08-22 21:17:29", "lastmod": "2023-10-20 15:51:02", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Shin-Sungho", "name": { "family": "Shin", "given": "Sungho" }, "orcid": "0000-0002-9889-3278" }, { "id": "Lin-Yiheng", "name": { "family": "Lin", "given": "Yiheng" }, "orcid": "0000-0001-6524-2877" }, { "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" }, { "id": "Anitescu-Mihai", "name": { "family": "Anitescu", "given": "Mihai" } } ] }, "title": "Near-Optimal Distributed Linear-Quadratic Regulator for Networked Systems", "ispublished": "pub", "full_text_status": "public", "keywords": "Applied Mathematics; Control and Optimization", "note": "\u00a9 2023 Society for Industrial and Applied Mathematics. \n\nThe submitted manuscript has been created by UChicago Argonne, LLC, Operator of Argonne National Laboratory (\"Argonne\"). Argonne, a U.S. Department of Energy Office of Science laboratory, is operated under Contract No. DE-AC02-06CH11357. The U.S. Governmnent retains for itself, and others acting on its behalf, a paid-up nonexclusive, irrevocable worldwide license in said article to reproduce, prepare derivative works, distribute copies to the public, and perform publicly and display publicly, by or on behalf of the Government. \n\nThis material is based upon work supported by the U.S. Department of Energy, Office of Science, Office of Advanced Scientific Computing Research (ASCR) under Contract DEAC02-06CH11347. \n\nWe are grateful to the anonymous referees, whose comments greatly improved the paper.\n\nPublished - 22m1489836.pdf
", "abstract": "This paper studies the trade-off between the degree of decentralization and the performance of a distributed controller in a linear-quadratic control setting. We study a system of interconnected agents over a graph and a distributed controller, called \u03ba-distributed control, which lets the agents make control decisions based on the state information within distance \u03ba on the underlying graph. This controller can tune its degree of decentralization using the parameter \u03ba and thus allows a characterization of the relationship between decentralization and performance. We show that under mild assumptions, including stabilizability, detectability, and a subexponentially growing graph condition, the performance difference between \u03ba-distributed control and centralized optimal control becomes exponentially small in \u03ba. This result reveals that distributed control can achieve near-optimal performance with a moderate degree of decentralization, and thus it is an effective controller architecture for large-scale networked systems.", "date": "2023-06-30", "date_type": "published", "publication": "SIAM Journal on Control and Optimization", "volume": "61", "number": "3", "publisher": "Society for Industrial and Applied Mathematics", "pagerange": "1113-1135", "id_number": "CaltechAUTHORS:20230613-731307200.40", "issn": "0363-0129", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20230613-731307200.40", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Department of Energy (DOE)", "grant_number": "DE-AC02-06CH11347" } ] }, "doi": "10.1137/22m1489836", "primary_object": { "basename": "22m1489836.pdf", "url": "https://authors.library.caltech.edu/records/j47b6-s0z07/files/22m1489836.pdf" }, "resource_type": "article", "pub_year": "2023", "author_list": "Shin, Sungho; Lin, Yiheng; et el." }, { "id": "https://authors.library.caltech.edu/records/axjfk-9s189", "eprint_id": 120428, "eprint_status": "archive", "datestamp": "2023-08-22 21:01:34", "lastmod": "2023-10-18 16:09:48", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Tseng-Shih-Hao", "name": { "family": "Tseng", "given": "Shih-hao" }, "orcid": "0000-0003-2376-9333" }, { "id": "Han-SooJean", "name": { "family": "Han", "given": "SooJean" }, "orcid": "0000-0003-1195-6465" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" }, "orcid": "0000-0002-5923-0199" } ] }, "title": "Trading Throughput for Freshness: Freshness-aware Traffic Engineering and In-Network Freshness Control", "ispublished": "pub", "full_text_status": "restricted", "keywords": "Computer Networks and Communications; Hardware and Architecture; Safety, Risk, Reliability and Quality; Media Technology; Information Systems; Software; Computer Science (miscellaneous)", "note": "\u00a9 2023 Association for Computing Machinery.\n\nSooJean Han was supported by the National Science Foundation Graduate Research Fellowship under Grant No. DGE\u20131745301. The work of Adam Wierman was supported in part by NSF grants CNS-2146814, CPS-2136197, CNS-2106403, and NGSDI-2105648.", "abstract": "With the advent of the Internet of Things (IoT), applications are becoming increasingly dependent on networks to not only transmit content at high throughput but also deliver it when it is fresh, i.e., synchronized between source and destination. Existing studies have proposed the metric age of information (AoI) to quantify freshness and have system designs that achieve low AoI. However, despite active research in this area, existing results are not applicable to general wired networks for two reasons. First, they focus on wireless settings, where AoI is mostly affected by interference and collision, while queueing issues are more prevalent in wired settings. Second, traditional high-throughput/low-latency legacy drop-adverse (LDA) flows are not taken into account in most system designs; hence, the problem of scheduling mixed flows with distinct performance objectives is not addressed. \n\nIn this article, we propose a hierarchical system design to treat wired networks shared by mixed flow traffic, specifically LDA and AoI flows, and study the characteristics of achieving a good tradeoff between throughput and AoI. Our approach to the problem consists of two layers: freshness-aware traffic engineering (FATE) and in-network freshness control (IFC). The centralized FATE solution studies the characteristics of the source flow to derive the sending rate/update frequency for flows via the optimization problem LDA-AoI Coscheduling. The parameters specified by FATE are then distributed to IFC, which is implemented at each outport of the network's nodes and used for efficient scheduling between LDA and AoI flows. We present a Linux implementation of IFC and demonstrate the effectiveness of FATE/IFC through extensive emulations. Our results show that it is possible to trade a little throughput (5% lower) for much shorter AoI (49% to 71% shorter) compared to state-of-the-art traffic engineering.", "date": "2023-06", "date_type": "published", "publication": "ACM Transactions on Modeling and Performance Evaluation of Computing Systems", "volume": "8", "number": "1-2", "publisher": "Association for Computing Machinery", "pagerange": "Art. No. 4", "id_number": "CaltechAUTHORS:20230327-854076000.4", "issn": "2376-3639", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20230327-854076000.4", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF Graduate Research Fellowship", "grant_number": "DGE-1745301" }, { "agency": "NSF", "grant_number": "CNS-2146814" }, { "agency": "NSF", "grant_number": "ECCS-2136197" }, { "agency": "NSF", "grant_number": "CNS-2106403" }, { "agency": "NSF", "grant_number": "NGSDI-2105648" } ] }, "doi": "10.1145/3576919", "resource_type": "article", "pub_year": "2023", "author_list": "Tseng, Shih-hao; Han, SooJean; et el." }, { "id": "https://authors.library.caltech.edu/records/npwrx-d8m85", "eprint_id": 121273, "eprint_status": "archive", "datestamp": "2023-08-22 20:16:33", "lastmod": "2023-10-23 20:30:14", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Chen-Yue", "name": { "family": "Chen", "given": "Yue" }, "orcid": "0000-0002-7594-7587" }, { "id": "Zhao-Changhong", "name": { "family": "Zhao", "given": "Changhong" }, "orcid": "0000-0003-0539-8591" }, { "id": "Low-S-H", "name": { "family": "Low", "given": "Steven H." }, "orcid": "0000-0001-6476-3048" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" }, "orcid": "0000-0002-5923-0199" } ] }, "title": "An Energy Sharing Mechanism Considering Network Constraints and Market Power Limitation", "ispublished": "pub", "full_text_status": "public", "keywords": "General Computer Science", "note": "\u00a9 2023 IEEE. \n\nThis work was supported by the Chinese University of Hong Kong (CUHK) Direct Grant for Research under Grant 4055169. The work of Changhong Zhao was supported by the Hong Kong Research Grants Council ECS Award under Grant 24210220. The work of Steven H. Low was supported in part by NSF through ECCS under Grant 1931662, and in part by the Caltech Resnick and S2I Funds.", "abstract": "As the number of prosumers with distributed energy resources (DERs) grows, the conventional centralized operation scheme may suffer from conflicting interests, privacy concerns, and incentive inadequacy. In this paper, we propose an energy sharing mechanism to address the above challenges. It takes into account network constraints and fairness among prosumers. In the proposed energy sharing market, all prosumers play a generalized Nash game. The market equilibrium is proved to have nice features in a large market or when it is a variational equilibrium. To deal with the possible market failure, inefficiency, or instability in general cases, we introduce a price regulation policy to avoid market power exploitation. The improved energy sharing mechanism with price regulation can guarantee the existence and uniqueness of a socially near-optimal market equilibrium. Some advantageous properties are proved, such as the prosumer's individual rationality, a sharing price structure similar to the locational marginal price, and the tendency towards social optimum with an increasing number of prosumers. For implementation, a practical bidding algorithm is developed with a convergence condition. Experimental results validate the theoretical outcomes and show the practicability of our model and method.", "date": "2023-03", "date_type": "published", "publication": "IEEE Transactions on Smart Grid", "volume": "14", "number": "2", "publisher": "IEEE", "pagerange": "1027-1041", "id_number": "CaltechAUTHORS:20230502-727238500.2", "issn": "1949-3053", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20230502-727238500.2", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Chinese University of Hong Kong", "grant_number": "4055169" }, { "agency": "Research Grants Council of Hong Kong", "grant_number": "24210220" }, { "agency": "NSF", "grant_number": "ECCS-1931662" }, { "agency": "Resnick Sustainability Institute" }, { "agency": "Caltech Center for Sensing to Intelligence (S2I)" } ] }, "local_group": { "items": [ { "id": "Resnick-Sustainability-Institute" }, { "id": "Caltech-Center-for-Sensing-to-Intelligence-(S2I)" } ] }, "doi": "10.1109/tsg.2022.3198721", "resource_type": "article", "pub_year": "2023", "author_list": "Chen, Yue; Zhao, Changhong; et el." }, { "id": "https://authors.library.caltech.edu/records/hrq0x-5xz83", "eprint_id": 120112, "eprint_status": "archive", "datestamp": "2023-08-22 20:13:17", "lastmod": "2023-10-25 16:52:59", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Zhang-Yizhou", "name": { "family": "Zhang", "given": "Yizhou" }, "orcid": "0000-0002-5677-4748" }, { "id": "Qu-Guannan", "name": { "family": "Qu", "given": "Guannan" }, "orcid": "0000-0002-5466-3550" }, { "id": "Xu-Pan", "name": { "family": "Xu", "given": "Pan" }, "orcid": "0000-0002-2559-8622" }, { "id": "Lin-Yiheng", "name": { "family": "Lin", "given": "Yiheng" }, "orcid": "0000-0001-6524-2877" }, { "id": "Chen-Zaiwei", "name": { "family": "Chen", "given": "Zaiwei" }, "orcid": "0000-0001-9915-5595" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" }, "orcid": "0000-0002-5923-0199" } ] }, "title": "Global Convergence of Localized Policy Iteration in Networked Multi-Agent Reinforcement Learning", "ispublished": "pub", "full_text_status": "public", "keywords": "Computer Networks and Communications; Hardware and Architecture; Safety, Risk, Reliability and Quality; Computer Science (miscellaneous)", "note": "\u00a9 2023 held by the owner/author(s). This work is licensed under a Creative Commons Attribution International 4.0 License. \n\nYizhou Zhang, Guannan Qu, Pan Xu contributed equally to this work. \n\nGuannan Qu is supported by NSF Grant EPCN-2154171 and C3 AI Institute. Pan Xu is supported by the startup funding at the Department of Biostatistics and Bioinformatics at Duke University. Yiheng Lin is supported by PIMCO Graduate Fellowship. Zaiwei Chen is supported by PIMCO Postdoc Fellowship and Simoudis Discovery Prize. Adam Wierman is supported by NSF Grants CNS-2146814, CPS-2136197, CNS-2106403, NGSDI-2105648, with additional support from Amazon AWS.\n\nPublished - 3579443.pdf
", "abstract": "We study a multi-agent reinforcement learning (MARL) problem where the agents interact over a given network. The goal of the agents is to cooperatively maximize the average of their entropy-regularized long-term rewards. To overcome the curse of dimensionality and to reduce communication, we propose a Localized Policy Iteration (LPI) algorithm that provably learns a near-globally-optimal policy using only local information. In particular, we show that, despite restricting each agent's attention to only its \u03ba-hop neighborhood, the agents are able to learn a policy with an optimality gap that decays polynomially in \u03ba. In addition, we show the finite-sample convergence of LPI to the global optimal policy, which explicitly captures the trade-off between optimality and computational complexity in choosing \u03ba. Numerical simulations demonstrate the effectiveness of LPI.", "date": "2023-03", "date_type": "published", "publication": "Proceedings of the ACM on Measurement and Analysis of Computing Systems", "volume": "7", "number": "1", "publisher": "ACM", "pagerange": "Art. No. 13", "id_number": "CaltechAUTHORS:20230316-87864000.2", "issn": "2476-1249", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20230316-87864000.2", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CNS-2154171" }, { "agency": "C3 AI Institute" }, { "agency": "Duke University" }, { "agency": "PIMCO" }, { "agency": "Simoudis Discovery Prize" }, { "agency": "NSF", "grant_number": "CNS-2146814" }, { "agency": "NSF", "grant_number": "ECCS-2136197" }, { "agency": "NSF", "grant_number": "CNS-2106403" }, { "agency": "NSF", "grant_number": "CNS-2105648" }, { "agency": "Amazon Web Services" } ] }, "doi": "10.1145/3579443", "primary_object": { "basename": "3579443.pdf", "url": "https://authors.library.caltech.edu/records/hrq0x-5xz83/files/3579443.pdf" }, "resource_type": "article", "pub_year": "2023", "author_list": "Zhang, Yizhou; Qu, Guannan; et el." }, { "id": "https://authors.library.caltech.edu/records/qfnc6-w7606", "eprint_id": 120431, "eprint_status": "archive", "datestamp": "2023-08-22 20:14:43", "lastmod": "2023-11-08 20:34:43", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Yu-Jing", "name": { "family": "Yu", "given": "Jing" }, "orcid": "0000-0003-1318-0189" }, { "id": "Ho-Dimitar", "name": { "family": "Ho", "given": "Dimitar" }, "orcid": "0000-0002-7856-985X" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" }, "orcid": "0000-0002-5923-0199" } ] }, "title": "Online Adversarial Stabilization of Unknown Networked Systems", "ispublished": "pub", "full_text_status": "public", "keywords": "Computer Networks and Communications; Hardware and Architecture; Safety, Risk, Reliability and Quality; Computer Science (miscellaneous)", "note": "\u00a9 2023 Copyright held by the owner/author(s). Attribution 4.0 International (CC BY 4.0).\n\nThe authors thank Varun Gupta and Yingying Li for helpful discussions as well as the anonymous reviewers for their careful reading of this paper and insightful suggestions. This work was supported by the National Science Foundation under grants CNS-2146814, CPS-2136197, CNS-2106403, NGSDI-2105648.\n\nPublished - 3579452.pdf
", "abstract": "We investigate the problem of stabilizing an unknown networked linear system under communication constraints and adversarial disturbances. We propose the first provably stabilizing algorithm for the problem. The algorithm uses a distributed version of nested convex body chasing to maintain a consistent estimate of the network dynamics and applies system level synthesis to determine a distributed controller based on this estimated model. Our approach avoids the need for system identification and accommodates a broad class of communication delay while being fully distributed and scaling favorably with the number of subsystems.", "date": "2023-03", "date_type": "published", "publication": "Proceedings of the ACM on Measurement and Analysis of Computing Systems", "volume": "7", "number": "1", "publisher": "Association for Computing Machinery", "pagerange": "Art. No. 26", "id_number": "CaltechAUTHORS:20230327-854092000.9", "issn": "2476-1249", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20230327-854092000.9", "funders": { "items": [ { "agency": "NSF", "grant_number": "CNS-2146814" }, { "agency": "NSF", "grant_number": "ECCS-2136197" }, { "agency": "NSF", "grant_number": "CNS-2106403" }, { "agency": "NSF", "grant_number": "NGSDI-2105648" } ] }, "doi": "10.1145/3579452", "primary_object": { "basename": "3579452.pdf", "url": "https://authors.library.caltech.edu/records/qfnc6-w7606/files/3579452.pdf" }, "resource_type": "article", "pub_year": "2023", "author_list": "Yu, Jing; Ho, Dimitar; et el." }, { "id": "https://authors.library.caltech.edu/records/hkfzt-avb28", "eprint_id": 120111, "eprint_status": "archive", "datestamp": "2023-08-22 20:13:13", "lastmod": "2023-10-25 16:52:56", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Rutten-Daan", "name": { "family": "Rutten", "given": "Daan" }, "orcid": "0000-0002-4742-4201" }, { "id": "Christianson-Nicolas-H", "name": { "family": "Christianson", "given": "Nicolas" }, "orcid": "0000-0001-8330-8964" }, { "id": "Mukherjee-Debankur", "name": { "family": "Mukherjee", "given": "Debankur" }, "orcid": "0000-0003-1678-4893" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" }, "orcid": "0000-0002-5923-0199" } ] }, "title": "Smoothed Online Optimization with Unreliable Predictions", "ispublished": "pub", "full_text_status": "public", "keywords": "Computer Networks and Communications; Hardware and Architecture; Safety, Risk, Reliability and Quality; Computer Science (miscellaneous)", "note": "\u00a9 2023 Copyright held by the owner/author(s). \n\nThe work was partially supported by the NSF grant CIF-2113027.\n\nPublished - 3579442.pdf
", "abstract": "We examine the problem of smoothed online optimization, where a decision maker must sequentially choose points in a normed vector space to minimize the sum of per-round, non-convex hitting costs and the costs of switching decisions between rounds. The decision maker has access to a black-box oracle, such as a machine learning model, that provides untrusted and potentially inaccurate predictions of the optimal decision in each round. The goal of the decision maker is to exploit the predictions if they are accurate, while guaranteeing performance that is not much worse than the hindsight optimal sequence of decisions, even when predictions are inaccurate. We impose the standard assumption that hitting costs are globally \u03b1-polyhedral. We propose a novel algorithm, Adaptive Online Switching (AOS), and prove that, for a large set of feasible \u03b4 > 0, it is (1+\u03b4)-competitive if predictions are perfect, while also maintaining a uniformly bounded competitive ratio of 2^(O\u0305(1/(\u03b1\u03b4))) even when predictions are adversarial. Further, we prove that this trade-off is necessary and nearly optimal in the sense that any deterministic algorithm which is (1 + \u03b4)-competitive if predictions are perfect must be at least 2^(O\u0305(1/(\u03b1\u03b4)))-competitive when predictions are inaccurate. In fact, we observe a unique threshold-type behavior in this trade-off: if \u03b4 is not in the set of feasible options, then no algorithm is simultaneously (1 + \u03b4)-competitive if predictions are perfect and \u03b6-competitive when predictions are inaccurate for any \u03b6 < \u221e. Furthermore, we discuss that memory is crucial in AOS by proving that any algorithm that does not use memory cannot benefit from predictions. We complement our theoretical results by a numerical study on a microgrid application.", "date": "2023-03", "date_type": "published", "publication": "Proceedings of the ACM on Measurement and Analysis of Computing Systems", "volume": "7", "number": "1", "publisher": "ACM", "pagerange": "Art. No. 12", "id_number": "CaltechAUTHORS:20230316-86070000.1", "issn": "2476-1249", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20230316-86070000.1", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CCF-2113027" } ] }, "doi": "10.1145/3579442", "primary_object": { "basename": "3579442.pdf", "url": "https://authors.library.caltech.edu/records/hkfzt-avb28/files/3579442.pdf" }, "resource_type": "article", "pub_year": "2023", "author_list": "Rutten, Daan; Christianson, Nicolas; et el." }, { "id": "https://authors.library.caltech.edu/records/8zcg9-swy47", "eprint_id": 118625, "eprint_status": "archive", "datestamp": "2023-08-22 18:19:37", "lastmod": "2023-11-08 19:13:03", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Sun-Bo", "name": { "family": "Sun", "given": "Bo" }, "orcid": "0000-0003-3172-7811" }, { "id": "Yang-Lin", "name": { "family": "Yang", "given": "Lin" }, "orcid": "0000-0001-9056-0500" }, { "id": "Hajiesmaili-Mohammad-H", "name": { "family": "Hajiesmaili", "given": "Mohammad" }, "orcid": "0000-0001-9278-2254" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" }, "orcid": "0000-0002-5923-0199" }, { "id": "Lui-John-C-S", "name": { "family": "Lui", "given": "John C. S." }, "orcid": "0000-0001-7466-0384" }, { "id": "Towsley-Don", "name": { "family": "Towsley", "given": "Don" }, "orcid": "0000-0002-7808-7375" }, { "id": "Tsang-Danny-Hin-Kwok", "name": { "family": "Tsang", "given": "Danny H. K." }, "orcid": "0000-0003-0135-7098" } ] }, "title": "The Online Knapsack Problem with Departures", "ispublished": "pub", "full_text_status": "public", "keywords": "Computer Networks and Communications; Hardware and Architecture; Safety, Risk, Reliability and Quality; Computer Science (miscellaneous)", "note": "\u00a9 2022 Copyright held by the owner/author(s). Publication rights licensed to ACM. \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). Adam Wierman acknowledges the support received from NSF grants (CNS-2146814, CPS-2136197, CNS-2106403, and NGSDI-210564) and the additional support from Amazon AWS. Mohammad Hajiesmaili's research is supported by NSF grants (CNS-2106299, CNS-2102963, CPS-2136199, NGSDI-2105494, and CAREER-2045641). The work of John C.S. Lui is supported in part by the RGC's SRFS2122-4S02.", "abstract": "The online knapsack problem is a classic online resource allocation problem in networking and operations research. Its basic version studies how to pack online arriving items of different sizes and values into a capacity-limited knapsack. In this paper, we study a general version that includes item departures, while also considering multiple knapsacks and multi-dimensional item sizes. We design a threshold-based online algorithm and prove that the algorithm can achieve order-optimal competitive ratios. Beyond worst-case performance guarantees, we also aim to achieve near-optimal average performance under typical instances. Towards this goal, we propose a data-driven online algorithm that learns within a policy-class that guarantees a worst-case performance bound. In trace-driven experiments, we show that our data-driven algorithm outperforms other benchmark algorithms in an application of online knapsack to job scheduling for cloud computing.", "date": "2022-12", "date_type": "published", "publication": "Proceedings of the ACM on Measurement and Analysis of Computing Systems", "volume": "6", "number": "3", "publisher": "Association for Computing Machinery", "pagerange": "1-32", "id_number": "CaltechAUTHORS:20230103-817548100.24", "issn": "2476-1249", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20230103-817548100.24", "funders": { "items": [ { "agency": "Research Grants Council of Hong Kong", "grant_number": "16202619" }, { "agency": "Research Grants Council of Hong Kong", "grant_number": "16211220" }, { "agency": "NSF", "grant_number": "CNS-2146814" }, { "agency": "NSF", "grant_number": "ECCS-2136197" }, { "agency": "NSF", "grant_number": "CNS-2106403" }, { "agency": "NSF", "grant_number": "NGSDI-210564" }, { "agency": "Amazon Web Services" }, { "agency": "NSF", "grant_number": "CNS-2106299" }, { "agency": "NSF", "grant_number": "CNS-2102963" }, { "agency": "NSF", "grant_number": "ECCS-2136199" }, { "agency": "NSF", "grant_number": "NGSDI-2105494" }, { "agency": "NSF", "grant_number": "CNS-2045641" }, { "agency": "Research Grants Council of Hong Kong", "grant_number": "SRFS2122-4S02" } ] }, "doi": "10.1145/3570618", "resource_type": "article", "pub_year": "2022", "author_list": "Sun, Bo; Yang, Lin; et el." }, { "id": "https://authors.library.caltech.edu/records/tmnrt-9y586", "eprint_id": 117352, "eprint_status": "archive", "datestamp": "2023-08-22 18:02:34", "lastmod": "2023-10-24 22:29:31", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Christianson-Nicolas-H", "name": { "family": "Christianson", "given": "Nicolas" }, "orcid": "0000-0001-8330-8964" }, { "id": "Werner-Lucien-D", "name": { "family": "Werner", "given": "Lucien" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" }, "orcid": "0000-0002-5923-0199" }, { "id": "Low-S-H", "name": { "family": "Low", "given": "Steven H." }, "orcid": "0000-0001-6476-3048" } ] }, "title": "Dispatch-aware planning for feasible power system operation", "ispublished": "pub", "full_text_status": "public", "keywords": "Electrical and Electronic Engineering; Energy Engineering and Power Technology", "note": "The authors are supported by the NSF Graduate Research Fellowship, USA (DGE-1745301), Resnick Sustainability Institute Graduate Fellowship, USA, Pimco Graduate Fellowship in Data Science, USA, NSF, USA grants CNS-2106403, NGSDI-2105648, ECCS 1931662, and CPS ECCS 1932611, and Amazon AWS, USA.", "abstract": "Maintaining stable energy production with increasing penetration of variable renewable energy requires sufficient flexible generation resources and dispatch algorithms that accommodate renewables' uncertainty. In this work, we study the feasibility properties of real-time economic dispatch (RTED) algorithms and establish fundamental limits on their performance. We propose a joint methodology for resource procurement and online economic dispatch with guaranteed feasibility. Our algorithm, Feasible Fixed Horizon Control (FFHC) is a regularized form of Receding Horizon Control (RHC) that balances exploitation of good near-term demand predictions with feasibility requirements. Empirical evaluation of FFHC in comparison to the standard RHC on realistic load profiles highlights that FFHC achieves near-optimal performance while ensuring feasibility in high-ramp scenarios where RHC becomes infeasible.", "date": "2022-11", "date_type": "published", "publication": "Electric Power Systems Research", "volume": "212", "publisher": "Elsevier", "pagerange": "Art. No. 108597", "id_number": "CaltechAUTHORS:20221011-128968500.6", "issn": "0378-7796", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20221011-128968500.6", "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": "ECCS-1932611" }, { "agency": "NSF Graduate Research Fellowship", "grant_number": "DGE-1745301" }, { "agency": "NSF", "grant_number": "ECCS-1931662" }, { "agency": "NSF", "grant_number": "CNS-2105648" }, { "agency": "Resnick Sustainability Institute" }, { "agency": "Amazon Web Services" } ] }, "local_group": { "items": [ { "id": "Resnick-Sustainability-Institute" } ] }, "doi": "10.1016/j.epsr.2022.108597", "resource_type": "article", "pub_year": "2022", "author_list": "Christianson, Nicolas; Werner, Lucien; et el." }, { "id": "https://authors.library.caltech.edu/records/kqyv8-7wr15", "eprint_id": 116912, "eprint_status": "archive", "datestamp": "2023-08-22 14:07:03", "lastmod": "2023-10-24 21:10:59", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "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" }, { "id": "Li-Na", "name": { "family": "Li", "given": "Na" }, "orcid": "0000-0001-9545-3050" } ] }, "title": "Scalable Reinforcement Learning for Multiagent Networked Systems", "ispublished": "pub", "full_text_status": "public", "keywords": "Management Science and Operations Research; Computer Science Applications", "abstract": "We study reinforcement learning (RL) in a setting with a network of agents whose states and actions interact in a local manner where the objective is to find localized policies such that the (discounted) global reward is maximized. A fundamental challenge in this setting is that the state-action space size scales exponentially in the number of agents, rendering the problem intractable for large networks. In this paper, we propose a scalable actor critic (SAC) framework that exploits the network structure and finds a localized policy that is an O(\u03c1\u03ba+1)-approximation of a stationary point of the objective for some \u03c1\u2208(0,1), with complexity that scales with the local state-action space size of the largest \u03ba-hop neighborhood of the network. We illustrate our model and approach using examples from wireless communication, epidemics, and traffic.", "date": "2022-09-22", "date_type": "published", "publication": "Operations Research", "publisher": "Institute for Operations Research and Management Sciences", "id_number": "CaltechAUTHORS:20220914-591652300", "issn": "0030-364X", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20220914-591652300", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1287/opre.2021.2226", "resource_type": "article", "pub_year": "2022", "author_list": "Qu, Guannan; Wierman, Adam; et el." }, { "id": "https://authors.library.caltech.edu/records/e7pjw-x5n20", "eprint_id": 120120, "eprint_status": "archive", "datestamp": "2023-08-20 08:08:20", "lastmod": "2023-10-25 16:53:14", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Christianson-Nicolas-H", "name": { "family": "Christianson", "given": "Nicolas" }, "orcid": "0000-0001-8330-8964" }, { "id": "Handina-Tinashe", "name": { "family": "Handina", "given": "Tinashe" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" }, "orcid": "0000-0002-5923-0199" } ] }, "title": "Chasing Convex Bodies and Functions with Black-Box Advice", "ispublished": "pub", "full_text_status": "public", "note": "\u00a9 2022 N. Christianson, T. Handina & A. Wierman. \n\nThe authors thank Eitan Levin for several helpful discussions. The authors acknowledge support from an NSF Graduate Research Fellowship (DGE-1745301), NSF grants CNS-2146814, CPS2136197, CNS-2106403, and NGSDI-2105648, and Amazon AWS.\n\nPublished - christianson22a.pdf
", "abstract": "We consider the problem of convex function chasing with black-box advice, where an online decision-maker aims to minimize the total cost of making and switching between decisions in a normed vector space, aided by black-box advice such as the decisions of a machine-learned algorithm. The decision-maker seeks cost comparable to the advice when it performs well, known as consistency, while also ensuring worst-case robustness even when the advice is adversarial. We first consider the common paradigm of algorithms that switch between the decisions of the advice and a competitive algorithm, showing that no algorithm in this class can improve upon 3-consistency while staying robust. We then propose two novel algorithms that bypass this limitation by exploiting the problem's convexity. The first, INTERP, achieves (\u221a2\u0305 + \u03f5)-consistency and 2\u0305(C/\u03f5\u00b2)-robustness for any \u03f5 > 0, where C is the competitive ratio of an algorithm for convex function chasing or a subclass thereof. The second, BDINTERP, achieves (1 + \u03f5)-consistency and O(CD/\u03f5)-robustness when the problem has bounded diameter D. Further, we show that BDINTERP achieves near-optimal consistency-robustness trade-off for the special case where cost functions are \u03b1-polyhedral.", "date": "2022-07", "date_type": "published", "publication": "Proceedings of Machine Learning Research", "volume": "178", "publisher": "ML Research Press", "pagerange": "867-908", "id_number": "CaltechAUTHORS:20230316-231309617", "issn": "2640-3498", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20230316-231309617", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF Graduate Research Fellowship", "grant_number": "DGE-1745301" }, { "agency": "NSF", "grant_number": "CNS-2146814" }, { "agency": "NSF", "grant_number": "ECCS-2136197" }, { "agency": "NSF", "grant_number": "CNS-2106403" }, { "agency": "NSF", "grant_number": "CNS-2105648" }, { "agency": "Amazon Web Services" } ] }, "primary_object": { "basename": "christianson22a.pdf", "url": "https://authors.library.caltech.edu/records/e7pjw-x5n20/files/christianson22a.pdf" }, "resource_type": "article", "pub_year": "2022", "author_list": "Christianson, Nicolas; Handina, Tinashe; et el." }, { "id": "https://authors.library.caltech.edu/records/gqza3-7mm59", "eprint_id": 96735, "eprint_status": "archive", "datestamp": "2023-08-22 15:15:41", "lastmod": "2023-10-20 21:28:43", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Pang-John-Z-F", "name": { "family": "Pang", "given": "John" }, "orcid": "0000-0002-6485-7922" }, { "id": "Lin-Weixuan", "name": { "family": "Lin", "given": "Weixuan" }, "orcid": "0000-0002-8988-8573" }, { "id": "Fu-Hu", "name": { "family": "Fu", "given": "Hu" } }, { "id": "Kleeman-Jack", "name": { "family": "Kleeman", "given": "Jack" } }, { "id": "Bitar-Eilyan-Y", "name": { "family": "Bitar", "given": "Eilyan" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" }, "orcid": "0000-0002-5923-0199" } ] }, "title": "Transparency and Control in Platforms for Networked Markets", "ispublished": "pub", "full_text_status": "public", "keywords": "Market Analytics and Revenue Management; games/group decisions; networks/graphs", "note": "\u00a9 2022, INFORMS. \n\nReceived:March 06, 2019; Accepted:October 14, 2021; Published Online:March 07, 2022.\n\nSubmitted - 1903.04574.pdf
", "abstract": "In this paper, we analyze the worst-case efficiency loss of online platform designs under a networked Cournot competition model. Inspired by some of the largest platforms in operation today, we study a variety of platform designs to examine the impacts of market transparency and control on the worst-case efficiency loss of Nash equilibria in networked Cournot games. Our results show that open access designs incentivize increased production toward perfectly competitive levels and limit efficiency loss, while controlled allocation designs lead to producer-platform incentive misalignment, resulting in low participation rates and unbounded efficiency loss. We also show that discriminatory access designs balance transparency and control, achieving the best of both worlds by maintaining high participation rates while limiting efficiency loss.", "date": "2022-05", "date_type": "published", "publication": "Operations Research", "volume": "70", "number": "3", "publisher": "INFORMS", "pagerange": "1665-1690", "id_number": "CaltechAUTHORS:20190626-105727708", "issn": "0030-364X", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190626-105727708", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1287/opre.2021.2244", "primary_object": { "basename": "1903.04574.pdf", "url": "https://authors.library.caltech.edu/records/gqza3-7mm59/files/1903.04574.pdf" }, "resource_type": "article", "pub_year": "2022", "author_list": "Pang, John; Lin, Weixuan; et el." }, { "id": "https://authors.library.caltech.edu/records/epc2z-fcx12", "eprint_id": 113677, "eprint_status": "archive", "datestamp": "2023-08-22 14:19:28", "lastmod": "2023-10-23 23:10:47", "type": "article", "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": "pub", "full_text_status": "public", "keywords": "online learning; online optimization; online control; Computer Networks and Communications; Hardware and Architecture; Safety, Risk, Reliability and Quality; Computer Science (miscellaneous)", "note": "\u00a9 2022 Owner/Author. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the owner/author(s).\n\nPublished - 3508037.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 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.", "date": "2022-03", "date_type": "published", "publication": "Proceedings of the ACM on Measurement and Analysis of Computing Systems", "volume": "6", "number": "1", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "Art. No. 17", "id_number": "CaltechAUTHORS:20220302-699021182", "issn": "2476-1249", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20220302-699021182", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/3508037", "primary_object": { "basename": "2111.00095.pdf", "url": "https://authors.library.caltech.edu/records/epc2z-fcx12/files/2111.00095.pdf" }, "related_objects": [ { "basename": "3508037.pdf", "url": "https://authors.library.caltech.edu/records/epc2z-fcx12/files/3508037.pdf" } ], "resource_type": "article", "pub_year": "2022", "author_list": "Pan, Weici; Shi, Guanya; et el." }, { "id": "https://authors.library.caltech.edu/records/p10m3-kqj37", "eprint_id": 109906, "eprint_status": "archive", "datestamp": "2023-08-22 14:11:58", "lastmod": "2023-10-23 18:12:41", "type": "article", "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": "pub", "full_text_status": "public", "keywords": "online control; model predictive control; online learning; competitive analysis", "note": "\u00a9 2022 held by the owner/author(s). \n\nReceived October 2021; revised December 2021; accepted January 2022. \n\nThis work is supported by the National Science Foundation, under grants ECCS1931662, CCF 1637598, ECCS 1619352, CPS\n1739355, AitF-1637598, CNS-1518941, PIMCO and Amazon Web Services. Tongxin Li and Ruixiao Yang contributed equally\nto the paper.\n\nPublished - 3508038.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.", "date": "2022-03", "date_type": "published", "publication": "Proceedings of the ACM on Measurement and Analysis of Computing System", "volume": "6", "number": "1", "publisher": "Association for Computing Machinery", "pagerange": "Art. No. 18", "id_number": "CaltechAUTHORS:20210716-225846876", "issn": "2476-1249", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20210716-225846876", "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/3508038", "primary_object": { "basename": "2106.09659.pdf", "url": "https://authors.library.caltech.edu/records/p10m3-kqj37/files/2106.09659.pdf" }, "related_objects": [ { "basename": "3508038.pdf", "url": "https://authors.library.caltech.edu/records/p10m3-kqj37/files/3508038.pdf" } ], "resource_type": "article", "pub_year": "2022", "author_list": "Li, Tongxin; Yang, Ruixiao; et el." }, { "id": "https://authors.library.caltech.edu/records/xjhj6-hft50", "eprint_id": 96779, "eprint_status": "archive", "datestamp": "2023-09-22 22:34:55", "lastmod": "2023-10-23 23:24:33", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Murray-Riley", "name": { "family": "Murray", "given": "Riley" }, "orcid": "0000-0003-1461-6458" }, { "id": "Chandrasekaran-Venkat", "name": { "family": "Chandrasekaran", "given": "Venkat" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" }, "orcid": "0000-0002-5923-0199" } ] }, "title": "Newton Polytopes and Relative Entropy Optimization", "ispublished": "pub", "full_text_status": "public", "keywords": "Arithmetic-geometric-mean inequality; Certifying nonnegativity; Fewnomials; SAGE; Signomials; Sparse polynomials", "note": "\u00a9 SFoCM 2021. \n\nReceived 08 October 2018; Revised 12 May 2020; Accepted 20 December 2020; Published 05 March 2021. \n\nThe authors are thankful for the detailed suggestions of anonymous referees, which have led to a much-improved revision of our original manuscript. V.C. would like to acknowledge helpful conversations with Parikshit Shah, particularly on the connections between SAGE and SDSOS polynomials. R.M. was supported in part by NSF grant CCF-1637598 and by an NSF Graduate Research Fellowship. V.C. was supported in part by NSF grants CCF-1350590 and CCF-1637598, AFOSR grant FA9550-16-1-0210, and a Sloan Research Fellowship. A.W. was supported in part by NSF grant CCF-1637598.\n\nSubmitted - 1810.01614.pdf
", "abstract": "Certifying function nonnegativity is a ubiquitous problem in computational mathematics, with especially notable applications in optimization. We study the question of certifying nonnegativity of signomials based on the recently proposed approach of Sums-of-AM/GM-Exponentials (SAGE) decomposition due to the second author and Shah. The existence of a SAGE decomposition is a sufficient condition for nonnegativity of a signomial, and it can be verified by solving a tractable convex relative entropy program. We present new structural properties of SAGE certificates such as a characterization of the extreme rays of the cones associated to these decompositions as well as an appealing form of sparsity preservation. These lead to a number of important consequences such as conditions under which signomial nonnegativity is equivalent to the existence of a SAGE decomposition; our results represent the broadest-known class of nonconvex signomial optimization problems that can be solved efficiently via convex relaxation. The analysis in this paper proceeds by leveraging the interaction between the convex duality underlying SAGE certificates and the face structure of Newton polytopes. After proving our main signomial results, we direct our machinery toward the topic of globally nonnegative polynomials. This leads to (among other things) efficient methods for certifying polynomial nonnegativity, with complexity independent of the degree of a polynomial.", "date": "2021-12", "date_type": "published", "publication": "Foundations of Computational Mathematics", "volume": "21", "number": "6", "publisher": "Springer", "pagerange": "1703-1737", "id_number": "CaltechAUTHORS:20190627-102049940", "issn": "1615-3375", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190627-102049940", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CCF-1637598" }, { "agency": "NSF Graduate Research Fellowship" }, { "agency": "NSF", "grant_number": "CCF-1350590" }, { "agency": "NSF", "grant_number": "CCF-1637598" }, { "agency": "Air Force Office of Scientific Research (AFOSR)", "grant_number": "FA9550-16-1-0210" }, { "agency": "Alfred P. Sloan Foundation" }, { "agency": "NSF", "grant_number": "CCF-1637598" } ] }, "doi": "10.1007/s10208-021-09497-w", "primary_object": { "basename": "1810.01614.pdf", "url": "https://authors.library.caltech.edu/records/xjhj6-hft50/files/1810.01614.pdf" }, "resource_type": "article", "pub_year": "2021", "author_list": "Murray, Riley; Chandrasekaran, Venkat; et el." }, { "id": "https://authors.library.caltech.edu/records/j0s8j-1aa33", "eprint_id": 109022, "eprint_status": "archive", "datestamp": "2023-08-20 05:46:42", "lastmod": "2023-10-23 17:31:03", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Li-Tongxin", "name": { "family": "Li", "given": "Tongxin" }, "orcid": "0000-0002-9806-8964" }, { "id": "Sun-Bo", "name": { "family": "Sun", "given": "Bo" }, "orcid": "0000-0003-3172-7811" }, { "id": "Chen-Yue", "name": { "family": "Chen", "given": "Yue" }, "orcid": "0000-0002-7594-7587" }, { "id": "Ye-Zixin", "name": { "family": "Ye", "given": "Zixin" } }, { "id": "Low-S-H", "name": { "family": "Low", "given": "Steven H." }, "orcid": "0000-0001-6476-3048" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Learning-based Predictive Control via Real-time Aggregate Flexibility", "ispublished": "pub", "full_text_status": "public", "keywords": "Aggregate flexibility, closed-loop control systems,\nonline optimization, model predictive control, reinforcement\nlearning, electric vehicle charging", "note": "\u00a9 2021 IEEE. \n\nManuscript received December 22, 2020; revised April 5, 2021 and June 1, 2021; accepted June 21, 2021. Date of publication July 5, 2021; date of current version October 21, 2021. \n\nThe work of Tongxin Li and Steven H. Low was supported by the National Science Foundation (NSF) under Grant CCF 1637598, Grant ECCS 1931662, and Grant CPS ECCS 1932611. The work of Bo Sun was supported by the Hong Kong Research Grant Council (RGC) General Research Fund under Project 16207318. The work of Adam Wierman was supported in part by NSF under Grant AitF-1637598 and Grant CNS-1518941; in part by Amazon AWS; and in part by VMware. Paper no. TSG-01893-2020.\n\nAccepted Version - Learning-based_Predictive_Control_via_Real-time_Aggregate_Flexibility.pdf
Submitted - 2012.11261.pdf
", "abstract": "Aggregators have emerged as crucial tools for the coordination of distributed, controllable loads. To be used effectively, an aggregator must be able to communicate the available flexibility of the loads they control, as known as the aggregate flexibility to a system operator. However, most of existing aggregate flexibility measures often are slow-timescale estimations and much less attention has been paid to real-time coordination between an aggregator and an operator. In this paper, we consider solving an online optimization in a closed-loop system and present a design of real-time aggregate flexibility feedback, termed the maximum entropy feedback (MEF). In addition to deriving analytic properties of the MEF, combining learning and control, we show that it can be approximated using reinforcement learning and used as a penalty term in a novel control algorithm \u2013 the penalized predictive control (PPC), which modifies vanilla model predictive control (MPC). The benefits of our scheme are (1). Efficient Communication . An operator running PPC does not need to know the exact states and constraints of the loads, but only the MEF. (2). Fast Computation . The PPC often has much less number of variables than an MPC formulation. (3). Lower Costs We show that under certain regularity assumptions, the PPC is optimal. We illustrate the efficacy of the PPC using a dataset from an adaptive electric vehicle charging network and show that PPC outperforms classical MPC.", "date": "2021-11", "date_type": "published", "publication": "IEEE Transactions on Smart Grid", "volume": "12", "number": "6", "publisher": "IEEE", "pagerange": "4897-4913", "id_number": "CaltechAUTHORS:20210510-084600512", "issn": "1949-3053", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20210510-084600512", "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": "ECCS-1931662" }, { "agency": "NSF", "grant_number": "ECCS-1932611" }, { "agency": "Hong Kong Research Grant Council", "grant_number": "16207318" }, { "agency": "NSF", "grant_number": "CCF-1637598" }, { "agency": "NSF", "grant_number": "CNS-1518941" }, { "agency": "Amazon Web Services" }, { "agency": "VMware" } ] }, "doi": "10.1109/TSG.2021.3094719", "primary_object": { "basename": "Learning-based_Predictive_Control_via_Real-time_Aggregate_Flexibility.pdf", "url": "https://authors.library.caltech.edu/records/j0s8j-1aa33/files/Learning-based_Predictive_Control_via_Real-time_Aggregate_Flexibility.pdf" }, "related_objects": [ { "basename": "2012.11261.pdf", "url": "https://authors.library.caltech.edu/records/j0s8j-1aa33/files/2012.11261.pdf" } ], "resource_type": "article", "pub_year": "2021", "author_list": "Li, Tongxin; Sun, Bo; et el." }, { "id": "https://authors.library.caltech.edu/records/xtnd5-5ye52", "eprint_id": 104242, "eprint_status": "archive", "datestamp": "2023-08-20 04:50:12", "lastmod": "2023-10-20 19:12:22", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Guo-Linqi", "name": { "family": "Guo", "given": "Linqi" }, "orcid": "0000-0001-5771-2752" }, { "id": "Liang-Chen", "name": { "family": "Liang", "given": "Chen" }, "orcid": "0000-0002-0015-7206" }, { "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": "Line Failure Localization of Power Networks Part I: Non-Cut Outages", "ispublished": "pub", "full_text_status": "public", "keywords": "Cascading failure, Laplacian matrix, contingency analysis, spanning forests", "note": "\u00a9 2021 IEEE. This work is licensed under a Creative Commons Attribution 4.0 License. \n\nManuscript received May 27, 2020; revised November 1, 2020 and January 19, 2021; accepted March 1, 2021. Date of publication March 17, 2021; date of current version August 19, 2021. \n\nThis work has been supported by Resnick Fellowship, Linde Institute Research Award, NWO Rubicon under Grant 680.50.1529, NSF through Grants CCF 1637598, ECCS 1619352, ECCS 1931662, CNS 1545096, CNS 1518941, CPS ECCS 1739355, CPS 154471. \n\nPaper no. TPWRS-00882-2020.\n\nPublished - Line_Failure_Localization_of_Power_Networks_Part_I_Non-Cut_Outages.pdf
Submitted - 2005.10199.pdf
", "abstract": "Transmission line failures in power systems propagate non-locally, making the control of the resulting outages extremely difficult. In this work, we establish a mathematical theory that characterizes the patterns of line failure propagation and localization in terms of network graph structure. It provides a novel perspective on distribution factors that precisely captures Kirchhoff's Law in terms of topological structures. Our results show that the distribution of specific collections of subtrees of the transmission network plays a critical role on the patterns of power redistribution, and motivates the block decomposition of the transmission network as a structure to understand long-distance propagation of disturbances. In Part I of this paper, we present the case when the post-contingency network remains connected after an initial set of lines are disconnected simultaneously. In Part II, we present the case when an outage separates the network into multiple islands.", "date": "2021-09", "date_type": "published", "publication": "IEEE Transactions on Power Systems", "volume": "36", "number": "5", "publisher": "IEEE", "pagerange": "4140-4151", "id_number": "CaltechAUTHORS:20200707-101019648", "issn": "0885-8950", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20200707-101019648", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Resnick Sustainability Institute" }, { "agency": "Ronald And Maxine Linde Center for Global Environmental Science" }, { "agency": "Nederlandse Organisatie voor Wetenschappelijk Onderzoek (NWO)", "grant_number": "680.50.1529" }, { "agency": "NSF", "grant_number": "CCF-1637598" }, { "agency": "NSF", "grant_number": "ECCS-1619352" }, { "agency": "NSF", "grant_number": "ECCS-1931662" }, { "agency": "NSF", "grant_number": "CNS-1545096" }, { "agency": "NSF", "grant_number": "CNS-1518941" }, { "agency": "NSF", "grant_number": "ECCS-1739355" }, { "agency": "NSF", "grant_number": "CPS-154471" } ] }, "local_group": { "items": [ { "id": "Resnick-Sustainability-Institute" } ] }, "doi": "10.1109/tpwrs.2021.3066336", "primary_object": { "basename": "2005.10199.pdf", "url": "https://authors.library.caltech.edu/records/xtnd5-5ye52/files/2005.10199.pdf" }, "related_objects": [ { "basename": "Line_Failure_Localization_of_Power_Networks_Part_I_Non-Cut_Outages.pdf", "url": "https://authors.library.caltech.edu/records/xtnd5-5ye52/files/Line_Failure_Localization_of_Power_Networks_Part_I_Non-Cut_Outages.pdf" } ], "resource_type": "article", "pub_year": "2021", "author_list": "Guo, Linqi; Liang, Chen; et el." }, { "id": "https://authors.library.caltech.edu/records/5epx3-x6t87", "eprint_id": 104240, "eprint_status": "archive", "datestamp": "2023-08-20 04:50:02", "lastmod": "2023-10-20 19:12:15", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Guo-Linqi", "name": { "family": "Guo", "given": "Linqi" }, "orcid": "0000-0001-5771-2752" }, { "id": "Liang-Chen", "name": { "family": "Liang", "given": "Chen" }, "orcid": "0000-0002-0015-7206" }, { "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": "Line Failure Localization of Power Networks Part II: Cut Set Outages", "ispublished": "pub", "full_text_status": "public", "keywords": "Cascading failure, Laplacian matrix, contingency analysis, spanning forests", "note": "\u00a9 2021 IEEE. This work is licensed under a Creative Commons Attribution 4.0 License. \n\nManuscript received May 27, 2020; revised November 1, 2020 and January 19, 2021; accepted March 1, 2021. Date of publication April 13, 2021; date of current version August 19, 2021. \n\nThis work was supported by Resnick Fellowship, Linde Institute Research Award, NWO Rubicon under Grant 680.50.1529, and by NSF under Grants CCF 1637598, ECCS 1619352, ECCS 1931662, CNS 1545096, CNS 1518941, CPS ECCS 1739355, and CPS 154471. \n\nPaper no. TPWRS-00762-2020.\n\nPublished - Line_Failure_Localization_of_Power_Networks_Part_II_Cut_Set_Outages.pdf
Submitted - 2005.11320.pdf
", "abstract": "Transmission line failure in power systems prop-agate non-locally, making the control of the resulting outages extremely difficult. In Part II of this paper, we continue the study of line failure localizability in transmission networks and characterize the impact of cut set outages. We establish a Simple Path Criterion, showing that the propagation pattern due to bridge outages, a special case of cut set failures, are fully determined by the positions in the network of the buses that participate in load balancing. We then extend our results to general cut set outages. In contrast to non-cut outages discussed in Part I whose subsequent line failures are contained within the original blocks, cut set outages typically impact the whole network, affecting the power flows on all remaining lines. We corroborate our analytical results in both parts using the IEEE 118-bus test system, in which the failure propagation patterns exhibit a clear block-diagonal structure predicted by our theory, even when using full AC power flow equations.", "date": "2021-09", "date_type": "published", "publication": "IEEE Transactions on Power Systems", "volume": "36", "number": "5", "publisher": "IEEE", "pagerange": "4152-4160", "id_number": "CaltechAUTHORS:20200707-095927831", "issn": "0885-8950", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20200707-095927831", "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": "CCF-1637598" }, { "agency": "NSF", "grant_number": "ECCS-1619352" }, { "agency": "NSF", "grant_number": "ECCS-1931662" }, { "agency": "NSF", "grant_number": "CNS-1545096" }, { "agency": "NSF", "grant_number": "CNS-1518941" }, { "agency": "NSF", "grant_number": "ECCS-1739355" }, { "agency": "NSF", "grant_number": "CPS-154471" } ] }, "local_group": { "items": [ { "id": "Resnick-Sustainability-Institute" } ] }, "doi": "10.1109/TPWRS.2021.3068048", "primary_object": { "basename": "2005.11320.pdf", "url": "https://authors.library.caltech.edu/records/5epx3-x6t87/files/2005.11320.pdf" }, "related_objects": [ { "basename": "Line_Failure_Localization_of_Power_Networks_Part_II_Cut_Set_Outages.pdf", "url": "https://authors.library.caltech.edu/records/5epx3-x6t87/files/Line_Failure_Localization_of_Power_Networks_Part_II_Cut_Set_Outages.pdf" } ], "resource_type": "article", "pub_year": "2021", "author_list": "Guo, Linqi; Liang, Chen; et el." }, { "id": "https://authors.library.caltech.edu/records/st3vj-7pt88", "eprint_id": 113051, "eprint_status": "archive", "datestamp": "2023-08-22 11:06:21", "lastmod": "2023-10-23 22:54:15", "type": "article", "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": "pub", "full_text_status": "public", "keywords": "Computer Networks and Communications; Hardware and Architecture; Software", "note": "Copyright is held by author/owner(s). \n\nOnline: 20 January 2022. Published: 20 January 2022.\n\nPublished - 3512798.3512802.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 extended abstract, we discuss the design of mechanisms for data acquisition in settings with information leakage and verifiable data. We summarize work designing an incentive compatible mechanism that optimizes the worst-case tradeoff 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-09", "date_type": "published", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "49", "number": "2", "publisher": "ACM", "pagerange": "6-8", "id_number": "CaltechAUTHORS:20220121-870642000", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20220121-870642000", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/3512798.3512802", "primary_object": { "basename": "3512798.3512802.pdf", "url": "https://authors.library.caltech.edu/records/st3vj-7pt88/files/3512798.3512802.pdf" }, "resource_type": "article", "pub_year": "2021", "author_list": "Liao, Guocheng; Su, Yu; et el." }, { "id": "https://authors.library.caltech.edu/records/nha5m-d8388", "eprint_id": 109387, "eprint_status": "archive", "datestamp": "2023-08-22 10:04:15", "lastmod": "2023-10-23 17:54:16", "type": "article", "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": "pub", "full_text_status": "public", "keywords": "online control; closed-loop control; model predictive control; regret analysis; electric vehicle charging", "note": "\u00a9 2021 Copyright held by the owner/author. This work is licensed under a Creative Commons Attribution International 4.0 License. \n\nTongxin Li and Steven Low acknowledge the support received from National Science Foundation (NSF) through grants CCF 1637598, ECCS 1931662 and CPS ECCS 1932611. Bo Sun is supported by Hong Kong Research Grant Council (RGC) General Research Fund (Project 16207318). Adam Wierman's research is funded by NSF (AitF-1637598 and CNS-1518941), PIMCO, and Amazon AWS.\n\nPublished - 3460085.pdf
", "abstract": "This paper considers an online control problem involving two controllers. 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) and demonstrate that aggregated information can be efficiently learned using reinforcement learning algorithms. The effectiveness of our approach for closed-loop coordination between central and local controllers is validated via an electric vehicle charging application in power systems.", "date": "2021-06", "date_type": "published", "publication": "Proceedings of the ACM on Measurement and Analysis of Computing Systems", "volume": "5", "number": "2", "publisher": "ACM", "pagerange": "Art. No. 18", "id_number": "CaltechAUTHORS:20210604-111535691", "issn": "2476-1249", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20210604-111535691", "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": "ECCS-1931662" }, { "agency": "NSF", "grant_number": "ECCS-1932611" }, { "agency": "Hong Kong Research Grant Council", "grant_number": "16207318" }, { "agency": "NSF", "grant_number": "CNS-1518941" }, { "agency": "PIMCO" }, { "agency": "Amazon Web Services" } ] }, "doi": "10.1145/3460085", "primary_object": { "basename": "3460085.pdf", "url": "https://authors.library.caltech.edu/records/nha5m-d8388/files/3460085.pdf" }, "resource_type": "article", "pub_year": "2021", "author_list": "Li, Tongxin; Chen, Yue; et el." }, { "id": "https://authors.library.caltech.edu/records/747jj-7q094", "eprint_id": 106063, "eprint_status": "archive", "datestamp": "2023-08-22 09:57:51", "lastmod": "2023-10-23 16:55:52", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Murray-Riley", "name": { "family": "Murray", "given": "Riley" } }, { "id": "Chandrasekaran-Venkat", "name": { "family": "Chandrasekaran", "given": "Venkat" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Signomial and polynomial optimization via relative entropy and partial dualization", "ispublished": "pub", "full_text_status": "restricted", "keywords": "Global optimization; Exponential cone programs; SAGE certificates; SOS certificates; Signomial programming", "note": "\u00a9 Springer-Verlag GmbH Germany, part of Springer Nature and Mathematical Optimization Society 2020. \n\nReceived 21 July 2019; Accepted 11 August 2020; Published 14 October 2020. \n\nThe authors thank Fangzhou Xiao and two anonymous referees for helpful feedback. R.M. was supported in part by an NSF Graduate Research Fellowship, NSF grants CCF-1350590 and CCF-1637598, and AFOSR grant FA9550-16-1-0210. V.C. was supported in part by NSF grants CCF-1350590 and CCF-1637598, AFOSR grant FA9550-16-1-0210, and a Sloan Research Fellowship. A.W. was supported in part by NSF grant CCF-1637598.\n\nMurray, R., Chandrasekaran, V. & Wierman, A. Publisher Correction to: Signomial and polynomial optimization via relative entropy and partial dualization. Math. Prog. Comp. 13, 297\u2013299 (2021). https://doi.org/10.1007/s12532-021-00201-1", "abstract": "We describe a generalization of the Sums-of-AM/GM-Exponential (SAGE) methodology for relative entropy relaxations of constrained signomial and polynomial optimization problems. Our approach leverages the fact that SAGE certificates conveniently and transparently blend with convex duality, in a way which enables partial dualization of certain structured constraints. This more general approach retains key properties of ordinary SAGE relaxations (e.g. sparsity preservation), and inspires a projective method of solution recovery which respects partial dualization. We illustrate the utility of our methodology with a range of examples from the global optimization literature, along with a publicly available software package.", "date": "2021-06", "date_type": "published", "publication": "Mathematical Programming Computation", "volume": "13", "number": "2", "publisher": "Springer", "pagerange": "257-295", "id_number": "CaltechAUTHORS:20201014-133741550", "issn": "1867-2949", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20201014-133741550", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF Graduate Research Fellowship" }, { "agency": "NSF", "grant_number": "CCF-1350590" }, { "agency": "NSF", "grant_number": "CCF-1637598" }, { "agency": "Air Force Office of Scientific Research (AFOSR)", "grant_number": "FA9550-16-1-0210" }, { "agency": "Alfred P. Sloan Foundation" } ] }, "doi": "10.1007/s12532-020-00193-4", "resource_type": "article", "pub_year": "2021", "author_list": "Murray, Riley; Chandrasekaran, Venkat; et el." }, { "id": "https://authors.library.caltech.edu/records/bz7g6-w7j65", "eprint_id": 109025, "eprint_status": "archive", "datestamp": "2023-08-20 03:26:56", "lastmod": "2023-10-23 17:31:06", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Qu-Guannan", "name": { "family": "Qu", "given": "Guannan" }, "orcid": "0000-0002-5466-3550" }, { "id": "Shi-Yuanyuan", "name": { "family": "Shi", "given": "Yuanyuan" }, "orcid": "0000-0002-6182-7664" }, { "id": "Lale-Sahin", "name": { "family": "Lale", "given": "Sahin" }, "orcid": "0000-0002-7191-346X" }, { "id": "Anandkumar-A", "name": { "family": "Anandkumar", "given": "Animashree" }, "orcid": "0000-0002-6974-6797" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" }, "orcid": "0000-0002-5923-0199" } ] }, "title": "Stable Online Control of Linear Time-Varying Systems", "ispublished": "pub", "full_text_status": "public", "keywords": "Time-varying systems, online linear quadratic control, stability guarantee", "note": "\u00a9 2021 G. Qu, Y. Shi, S. Lale, A. Anandkumar & A. Wierman.\n\nPublished - qu21a.pdf
Submitted - 2104.14134.pdf
", "abstract": "Linear time-varying (LTV) systems are widely used for modeling real-world dynamical systems due to their generality and simplicity. Providing stability guarantees for LTV systems is one of the central problems in control theory. However, existing approaches that guarantee stability typically lead to significantly sub-optimal cumulative control cost in online settings where only current or short-term system information is available. In this work, we propose an efficient online control algorithm, COvariance Constrained Online Linear Quadratic (COCO-LQ) control, that guarantees input-to-state stability for a large class of LTV systems while also minimizing the control cost. The proposed method incorporates a state covariance constraint into the semi-definite programming (SDP) formulation of the LQ optimal controller. We empirically demonstrate the performance of COCO-LQ in both synthetic experiments and a power system frequency control example.", "date": "2021-06", "date_type": "published", "publication": "Proceedings of Machine Learning Research", "volume": "144", "publisher": "PMLR", "pagerange": "742-753", "id_number": "CaltechAUTHORS:20210510-092451106", "issn": "2640-3498", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20210510-092451106", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.48550/arXiv.2104.14134", "primary_object": { "basename": "2104.14134.pdf", "url": "https://authors.library.caltech.edu/records/bz7g6-w7j65/files/2104.14134.pdf" }, "related_objects": [ { "basename": "qu21a.pdf", "url": "https://authors.library.caltech.edu/records/bz7g6-w7j65/files/qu21a.pdf" } ], "resource_type": "article", "pub_year": "2021", "author_list": "Qu, Guannan; Shi, Yuanyuan; et el." }, { "id": "https://authors.library.caltech.edu/records/0hpmn-9pp50", "eprint_id": 104243, "eprint_status": "archive", "datestamp": "2023-08-22 08:08:16", "lastmod": "2023-10-20 19:12:31", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Liang-Chen", "name": { "family": "Liang", "given": "Chen" } }, { "id": "Guo-Linqi", "name": { "family": "Guo", "given": "Linqi" } }, { "id": "Zocca-Alessandro", "name": { "family": "Zocca", "given": "Alessandro" }, "orcid": "0000-0001-6585-4785" }, { "id": "Yu-Shuyue", "name": { "family": "Yu", "given": "Shuyue" } }, { "id": "Low-S-H", "name": { "family": "Low", "given": "Steven H." }, "orcid": "0000-0001-6476-3048" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "An integrated approach for failure mitigation & localization in power systems", "ispublished": "pub", "full_text_status": "public", "keywords": "Cascading failure; Failure mitigation; Frequency control; Power system reliability; Topology design", "note": "\u00a9 2020 Elsevier B.V. \n\nReceived 5 October 2019, Revised 20 April 2020, Accepted 31 July 2020, Available online 8 August 2020. \n\nThis work has been supported by Resnick Fellowship, Linde Institute Research Award, 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 DE-AR0000699 (NODES), and DTRA through award HDTRA 1-15-1-0003. \n\nThe authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.\n\nSubmitted - 2004.10401.pdf
", "abstract": "The transmission grid is often comprised of several control areas that are connected by multiple tie lines in a mesh structure for reliability. It is also well-known that line failures can propagate non-locally and redundancy can exacerbate cascading. In this paper, we propose an integrated approach to grid reliability that (i) judiciously switches off a small number of tie lines so that the control areas are connected in a tree structure; and (ii) leverages a unified frequency control paradigm to provide congestion management in real time. Even though the proposed topology reduces redundancy, the integration of tree structure at regional level and real-time congestion management can provide stronger guarantees on failure localization and mitigation. We illustrate our approach on the IEEE 39-bus network and evaluate its performance on the IEEE 118-bus, 179-bus, 200-bus and 240-bus networks with various network congestion conditions. Simulations show that, compared with the traditional approach, our approach not only prevents load shedding in more failure scenarios, but also incurs smaller amounts of load loss in scenarios where load shedding is inevitable. Moreover, generators under our approach adjust their operations more actively and efficiently in a local manner.", "date": "2021-01", "date_type": "published", "publication": "Electric Power Systems Research", "volume": "190", "publisher": "Elsevier", "pagerange": "Art. No. 106613", "id_number": "CaltechAUTHORS:20200707-103725840", "issn": "0378-7796", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20200707-103725840", "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": "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": "Advanced Research Projects Agency-Energy (ARPA-E)", "grant_number": "DE-AR0000699" }, { "agency": "Defense Threat Reduction Agency (DTRA)", "grant_number": "HDTRA 1-15-1-0003" } ] }, "local_group": { "items": [ { "id": "Resnick-Sustainability-Institute" } ] }, "doi": "10.48550/arXiv.2004.10401", "primary_object": { "basename": "2004.10401.pdf", "url": "https://authors.library.caltech.edu/records/0hpmn-9pp50/files/2004.10401.pdf" }, "resource_type": "article", "pub_year": "2021", "author_list": "Liang, Chen; Guo, Linqi; et el." }, { "id": "https://authors.library.caltech.edu/records/9hh61-rmd91", "eprint_id": 103477, "eprint_status": "archive", "datestamp": "2023-08-22 08:07:34", "lastmod": "2023-10-20 16:24:29", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Zhou-Xingyu", "name": { "family": "Zhou", "given": "Xingyu" } }, { "id": "Shroff-Ness-B", "name": { "family": "Shroff", "given": "Ness" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Asymptotically optimal load balancing in large-scale heterogeneous systems with multiple dispatchers", "ispublished": "pub", "full_text_status": "public", "keywords": "Asymptotically optimal; Load balancing; Heterogeneous systems; Multiple dispatchers; Delayed information", "note": "\u00a9 2020 Elsevier B.V. \n\nReceived 24 September 2020, Accepted 25 September 2020, Available online 8 October 2020. \n\nThis project has been funded in part through NSF, USA grants: CNS-2007231, CNS-1719371, and CNS-1717060 and NSF, USA grants AitF-1637598 and CNS-1518941. \n\nDeclaration of Competing Interest: The authors declare the following financial interests/personal relationships which may be considered as potential competing interests: S. Theja Maguluri, Georgia Institute of Technology, Atlanta, Georgia, United States C.H. Xia, OHIO STATE UNIVERSITY, Columbus, Ohio, United States.\n\nSubmitted - 2002.08908.pdf
Supplemental Material - 1-s2.0-S0166531620300663-mmc1.pdf
", "abstract": "We consider the load balancing problem in large-scale heterogeneous systems with multiple dispatchers. We introduce a general framework called Local-Estimation-Driven (LED). Under this framework, each dispatcher keeps local (possibly outdated) estimates of the queue lengths for all the servers, and the dispatching decision is made purely based on these local estimates. The local estimates are updated via infrequent communications between dispatchers and servers. We derive sufficient conditions for LED policies to achieve throughput optimality and delay optimality in heavy-traffic, respectively. These conditions directly imply delay optimality for many previous local-memory based policies in heavy traffic. Moreover, the results enable us to design new delay optimal policies for heterogeneous systems with multiple dispatchers. Finally, the heavy-traffic delay optimality of the LED framework also sheds light on a recent open question on how to design optimal load balancing schemes using delayed information.", "date": "2021-01", "date_type": "published", "publication": "Performance Evaluation", "volume": "145", "publisher": "Elsevier", "pagerange": "Art. No. 102146", "id_number": "CaltechAUTHORS:20200526-152856053", "issn": "0166-5316", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20200526-152856053", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CNS-2007231" }, { "agency": "NSF", "grant_number": "CNS-1719371" }, { "agency": "NSF", "grant_number": "CNS-1717060" }, { "agency": "NSF", "grant_number": "CCF-1637598" }, { "agency": "NSF", "grant_number": "CNS-1518941" } ] }, "doi": "10.1016/j.peva.2020.102146", "primary_object": { "basename": "1-s2.0-S0166531620300663-mmc1.pdf", "url": "https://authors.library.caltech.edu/records/9hh61-rmd91/files/1-s2.0-S0166531620300663-mmc1.pdf" }, "related_objects": [ { "basename": "2002.08908.pdf", "url": "https://authors.library.caltech.edu/records/9hh61-rmd91/files/2002.08908.pdf" } ], "resource_type": "article", "pub_year": "2021", "author_list": "Zhou, Xingyu; Shroff, Ness; et el." }, { "id": "https://authors.library.caltech.edu/records/3f55j-9r130", "eprint_id": 108346, "eprint_status": "archive", "datestamp": "2023-08-22 07:53:21", "lastmod": "2023-10-23 16:57:40", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Zhou-Xingyu", "name": { "family": "Zhou", "given": "Xingyu" } }, { "id": "Shroff-Ness-B", "name": { "family": "Shroff", "given": "Ness" }, "orcid": "0000-0002-4606-6879" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Asymptotically Optimal Load Balancing in Large-scale Heterogeneous Systems with Multiple Dispatchers", "ispublished": "pub", "full_text_status": "public", "keywords": "Asymptotically optimal; Load balancing; Heterogeneous systems, Multiple dispatchers, Delayed information", "note": "\u00a9 2020 is held by author/owner(s). \n\nThis project has been funded in part through NSF grants: CNS-2007231, CNS-1719371, and CNS-1717060 and NSF grants AitF-1637598 and CNS-1518941.\n\nPublished - 3453953.3453965.pdf
Submitted - 2002.08908.pdf
", "abstract": "We consider the load balancing problem in large-scale heterogeneous systems with multiple dispatchers. We introduce a general framework called Local-Estimation-Driven (LED). Under this framework, each dispatcher keeps local (possibly outdated) estimates of the queue lengths for all the servers, and the dispatching decision is made purely based on these local estimates. The local estimates are updated via infrequent communications between dispatchers and servers. We derive sufficient conditions for LED policies to achieve throughput optimality and delay optimality in heavy-traffic, respectively. These conditions directly imply delay optimality for many previous local-memory based policies in heavy traffic. Moreover, the results enable us to design new delay optimal policies for heterogeneous systems with multiple dispatchers. Finally, the heavy-traffic delay optimality of the LED framework also sheds light on a recent open question on how to design optimal load balancing schemes using delayed information.", "date": "2020-12", "date_type": "published", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "48", "number": "3", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "57-58", "id_number": "CaltechAUTHORS:20210308-133521968", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20210308-133521968", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CNS-2007231" }, { "agency": "NSF", "grant_number": "CNS-1719371" }, { "agency": "NSF", "grant_number": "CNS-1717060" }, { "agency": "NSF", "grant_number": "CCF-1637598" }, { "agency": "NSF", "grant_number": "CNS-1518941" } ] }, "doi": "10.1145/3453953.3453965", "primary_object": { "basename": "2002.08908.pdf", "url": "https://authors.library.caltech.edu/records/3f55j-9r130/files/2002.08908.pdf" }, "related_objects": [ { "basename": "3453953.3453965.pdf", "url": "https://authors.library.caltech.edu/records/3f55j-9r130/files/3453953.3453965.pdf" } ], "resource_type": "article", "pub_year": "2020", "author_list": "Zhou, Xingyu; Shroff, Ness; et el." }, { "id": "https://authors.library.caltech.edu/records/4kef2-qk578", "eprint_id": 106066, "eprint_status": "archive", "datestamp": "2023-08-22 07:06:22", "lastmod": "2023-10-20 23:03:34", "type": "article", "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": "pub", "full_text_status": "public", "keywords": "online knapsack problems; one-way trading; online algorithms; electric\nvehicle charging; online primal dual analysis", "note": "\u00a9 2020 Copyright held by the owner/author(s). Publication rights licensed to ACM.\n\nBo Sun and Danny H.K. Tsang acknowledge the support received from the Hong Kong Research\nGrant Council (RGC) General Research Fund (Project 16202619 and Project 16211220). Ali Zeynali\nand Mohammad Hajiesmaili's research is supported by NSF CNS-1908298. Tongxin Li's research is supported by NSF grants (CPS ECCS 1932611 and CPS ECCS 1739355). Adam Wierman acknowledges\nthe support received from NSF grants (AitF-1637598 and CNS-1518941). Bo Sun would also\nlike to thank Dr. Xiaoqi Tan (University of Toronto) for insightful and useful discussions.\n\nPublished - 3428336.pdf
Submitted - 2010.00412.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 one 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, we illustrate the proposed algorithm via trace-based experiments of EV charging.", "date": "2020-11", "date_type": "published", "publication": "Proceedings of the ACM on Measurement and Analysis of Computing Systems", "volume": "4", "number": "3", "publisher": "ACM", "pagerange": "Art. No. 51", "id_number": "CaltechAUTHORS:20201014-142839691", "issn": "2476-1249", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20201014-142839691", "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": "ECCS-1932611" }, { "agency": "NSF", "grant_number": "ECCS-1739355" }, { "agency": "NSF", "grant_number": "CCF-1637598" }, { "agency": "NSF", "grant_number": "CNS-1518941" } ] }, "doi": "10.1145/3428336", "primary_object": { "basename": "2010.00412.pdf", "url": "https://authors.library.caltech.edu/records/4kef2-qk578/files/2010.00412.pdf" }, "related_objects": [ { "basename": "3428336.pdf", "url": "https://authors.library.caltech.edu/records/4kef2-qk578/files/3428336.pdf" } ], "resource_type": "article", "pub_year": "2020", "author_list": "Sun, Bo; Zeynali, Ali; et el." }, { "id": "https://authors.library.caltech.edu/records/vhrgg-qkf57", "eprint_id": 103105, "eprint_status": "archive", "datestamp": "2023-08-22 07:03:56", "lastmod": "2023-10-20 15:39:13", "type": "article", "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": "pub", "full_text_status": "restricted", "keywords": "Sharing economy; Network economics; Game theory", "note": "\u00a9 2020 Published by Elsevier B.V. \n\nReceived 5 September 2019, Revised 5 March 2020, Accepted 20 April 2020, Available online 11 May 2020. \n\nThe work of Zhixuan Fang and Longbo Huang was supported in part by the National Natural Science Foundation of China Grant 61672316. The work of Adam Wierman is supported by National Science Foundation, United States Grant AitF-1637598, CNS-1518941. \n\nThe authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.", "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": "2020-11", "date_type": "published", "publication": "Performance Evaluation", "volume": "143", "publisher": "Elsevier", "pagerange": "Art. No. 102105", "id_number": "CaltechAUTHORS:20200511-124909341", "issn": "0166-5316", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20200511-124909341", "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": "NSF", "grant_number": "CCF-1637598" }, { "agency": "NSF", "grant_number": "CNS-1518941" } ] }, "doi": "10.1016/j.peva.2020.102105", "resource_type": "article", "pub_year": "2020", "author_list": "Fang, Zhixuan; Huang, Longbo; et el." }, { "id": "https://authors.library.caltech.edu/records/hsj32-5en09", "eprint_id": 106068, "eprint_status": "archive", "datestamp": "2023-08-22 14:01:38", "lastmod": "2023-10-20 23:03:40", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Nakahira-Yorie", "name": { "family": "Nakahira", "given": "Yorie" }, "orcid": "0000-0003-3324-4602" }, { "id": "Ferragut-Andres", "name": { "family": "Ferragut", "given": "Andres" }, "orcid": "0000-0003-0134-5548" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" }, "orcid": "0000-0002-5923-0199" } ] }, "title": "Generalized Exact Scheduling: A Minimal-Variance Distributed Deadline Scheduler", "ispublished": "pub", "full_text_status": "public", "keywords": "Stochastic Models; deadline scheduling; service capacity control; exact scheduling; online distributed algorithm; optimal control; optimization", "note": "\u00a9 2022 INFORMS. \n\nReceived: January 01, 2019; Accepted: October 14, 2021; Published Online: February 17, 2022.\n\nSubmitted - 2004.12280.pdf
", "abstract": "Many modern schedulers can dynamically adjust their service capacity to match the incoming workload. At the same time, however, unpredictability and instability in service capacity often incur operational and infrastructural costs. In this paper, we seek to characterize optimal distributed algorithms that maximize the predictability, stability, or both when scheduling jobs with deadlines. Specifically, we show that Exact Scheduling minimizes both the stationary mean and variance of the service capacity subject to strict demand and deadline requirements. For more general settings, we characterize the minimal-variance distributed policies with soft demand requirements, soft deadline requirements, or both. The performance of the optimal distributed policies is compared with that of the optimal centralized policy by deriving closed-form bounds and by testing centralized and distributed algorithms using real data from the Caltech electrical vehicle charging facility and many pieces of synthetic data from different arrival distributions. Moreover, we derive the Pareto-optimality condition for distributed policies that balance the variance and mean square of the service capacity. Finally, we discuss a scalable partially centralized algorithm that uses centralized information to boost performance and a method to deal with missing information on service requirements.", "date": "2020-10-14", "date_type": "published", "publication": "Operations Research", "publisher": "INFORMS", "id_number": "CaltechAUTHORS:20201014-143948343", "issn": "0030-364X", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20201014-143948343", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1287/opre.2021.2232", "primary_object": { "basename": "2004.12280.pdf", "url": "https://authors.library.caltech.edu/records/hsj32-5en09/files/2004.12280.pdf" }, "resource_type": "article", "pub_year": "2020", "author_list": "Nakahira, Yorie; Ferragut, Andres; et el." }, { "id": "https://authors.library.caltech.edu/records/db8db-0yw83", "eprint_id": 103094, "eprint_status": "archive", "datestamp": "2023-08-22 05:12:32", "lastmod": "2023-10-20 00:46:30", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Scully-Z", "name": { "family": "Scully", "given": "Ziv" } }, { "id": "van-Kreveld-L", "name": { "family": "van Kreveld", "given": "Lucas" } }, { "id": "Boxma-O-J", "name": { "family": "Boxma", "given": "Onno" } }, { "id": "Dorsman-J-P", "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": "pub", "full_text_status": "public", "keywords": "response time; sojourn time; tail latency; tail optimality; Gittins policy; shortest expected processing time (SERPT); randomized multi-level feedback (RMLF); M/G/1", "note": "\u00a9 2020 Association for Computing Machinery. ACM OPEN.\n\nReceived January 2020; revised February 2020; accepted March 2020. \n\nThe authors are grateful to Bert Zwart for providing some useful references. Ziv 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 - 3392148.pdf
Submitted - 003-report.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", "date_type": "published", "publication": "Proceedings of the ACM on Measurement and Analysis of Computing Systems", "volume": "4", "number": "2", "publisher": "Association for Computing Machinery", "pagerange": "Art. No. 30", "id_number": "CaltechAUTHORS:20200511-093940097", "issn": "2476-1249", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20200511-093940097", "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/3392148", "primary_object": { "basename": "003-report.pdf", "url": "https://authors.library.caltech.edu/records/db8db-0yw83/files/003-report.pdf" }, "related_objects": [ { "basename": "3392148.pdf", "url": "https://authors.library.caltech.edu/records/db8db-0yw83/files/3392148.pdf" } ], "resource_type": "article", "pub_year": "2020", "author_list": "Scully, Ziv; van Kreveld, Lucas; et el." }, { "id": "https://authors.library.caltech.edu/records/jbez3-8ds67", "eprint_id": 108287, "eprint_status": "archive", "datestamp": "2023-08-22 05:16:00", "lastmod": "2023-10-23 16:54:54", "type": "article", "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": "pub", "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 - 3410048.3410069.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", "date_type": "published", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "48", "number": "1", "publisher": "Association for Computing Machinery", "place_of_pub": "New York, NY", "pagerange": "35-36", "id_number": "CaltechAUTHORS:20210303-094800346", "isbn": "9781450379854", "issn": "0163-5999", "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-094800346", "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": "3410048.3410069.pdf", "url": "https://authors.library.caltech.edu/records/jbez3-8ds67/files/3410048.3410069.pdf" }, "resource_type": "article", "pub_year": "2020", "author_list": "Scully, Ziv; van Kreveld, Lucas; et el." }, { "id": "https://authors.library.caltech.edu/records/93py3-c5629", "eprint_id": 104314, "eprint_status": "archive", "datestamp": "2023-08-22 05:15:07", "lastmod": "2023-10-20 19:17:33", "type": "article", "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" } } ] }, "title": "Logarithmic Communication for Distributed Optimization in Multi-Agent Systems", "ispublished": "pub", "full_text_status": "public", "keywords": "distributed algorithms; distributed optimization; multi-agent systems", "note": "\u00a9 2020 Copyright held by the owner/author(s).\n\nThis work was supported in part by NSF grants AitF-1637598, CNS-1518941, CPS-154471, the Linde Institute, and an Amazon Fellowship in Artificial Intelligence.\n\nPublished - 3410048.3410105.pdf
", "abstract": "Classically, the design of multi-agent systems is approached using techniques from distributed optimization such as dual descent and consensus algorithms. Such algorithms depend on convergence to global consensus before any individual agent can determine its local action. This leads to challenges with respect to communication overhead and robustness, and improving algorithms with respect to these measures has been a focus of the community for decades. \n\nThis paper presents a new approach for multi-agent system design based on ideas from the emerging field of local computation algorithms. The framework we develop, LOcal Convex Optimization (LOCO), is the first local computation algorithm for convex optimization problems and can be applied in a wide-variety of settings. We demonstrate the generality of the framework via applications to Network Utility Maximization (NUM) and the distributed training of Support Vector Machines (SVMs), providing numerical results illustrating the improvement compared to classical distributed optimization approaches in each case.", "date": "2020-06", "date_type": "published", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "48", "number": "1", "publisher": "Association for Computing Machinery (ACM)", "place_of_pub": "New York, NY, USA", "pagerange": "97-98", "id_number": "CaltechAUTHORS:20200709-141943501", "isbn": "9781450379854", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20200709-141943501", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "AitF-1637598" }, { "agency": "NSF", "grant_number": "CNS-1518941" }, { "agency": "NSF", "grant_number": "CPS-154471" }, { "agency": "Linde Institute of Economic and Management Science" }, { "agency": "Amazon" } ] }, "doi": "10.1145/3393691.3394197", "primary_object": { "basename": "3410048.3410105.pdf", "url": "https://authors.library.caltech.edu/records/93py3-c5629/files/3410048.3410105.pdf" }, "resource_type": "article", "pub_year": "2020", "author_list": "London, Palma; Vardi, Shai; et el." }, { "id": "https://authors.library.caltech.edu/records/366p2-gfa42", "eprint_id": 104313, "eprint_status": "archive", "datestamp": "2023-08-19 21:40:29", "lastmod": "2023-10-20 19:17:31", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Lin-Yiheng", "name": { "family": "Lin", "given": "Yiheng" }, "orcid": "0000-0001-6524-2877" }, { "id": "Goel-Gautam", "name": { "family": "Goel", "given": "Gautam" }, "orcid": "0000-0002-7054-7218" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" }, "orcid": "0000-0002-5923-0199" } ] }, "title": "Online Optimization with Predictions and Non-convex Losses", "ispublished": "pub", "full_text_status": "public", "keywords": "Online non-convex optimization, online convex optimization (OCO), non-convex optimization, competitive analysis", "note": "\u00a9 2020 Copyright held by the owner/author(s).\n\nThis work was done when Yiheng Lin was visiting California Institute of Technology. This 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 - 3410048.3410054.pdf
", "abstract": "We study online optimization in a setting where an online learner seeks to optimize a per-round hitting cost, which may be non-convex, while incurring a movement cost when changing actions between rounds. We ask: under what general conditions is it possible for an online learner to leverage predictions of future cost functions in order to achieve near-optimal costs? Prior work has provided near-optimal online algorithms for specific combinations of assumptions about hitting and switching costs, but no general results are known. In this work, we give two general sufficient conditions that specify a relationship between the hitting and movement costs which guarantees that a new algorithm, Synchronized Fixed Horizon Control (SFHC), achieves a 1+O(1/w) competitive ratio, where w is the number of predictions available to the learner. Our conditions do not require the cost functions to be convex, and we also derive competitive ratio results for non-convex hitting and movement costs. Our results provide the first constant, dimension-free competitive ratio for online non-convex optimization with movement costs. We also give an example of a natural problem, Convex Body Chasing (CBC), where the sufficient conditions are not satisfied and prove that no online algorithm can have a competitive ratio that converges to 1.", "date": "2020-06", "date_type": "published", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "48", "number": "1", "publisher": "Association for Computing Machinery (ACM)", "place_of_pub": "New York, NY, USA", "pagerange": "9-10", "id_number": "CaltechAUTHORS:20200709-141107614", "isbn": "9781450379854", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20200709-141107614", "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.1145/3393691.3394208", "primary_object": { "basename": "3410048.3410054.pdf", "url": "https://authors.library.caltech.edu/records/366p2-gfa42/files/3410048.3410054.pdf" }, "resource_type": "article", "pub_year": "2020", "author_list": "Lin, Yiheng; Goel, Gautam; et el." }, { "id": "https://authors.library.caltech.edu/records/hdp6f-c2s32", "eprint_id": 104308, "eprint_status": "archive", "datestamp": "2023-08-22 05:15:03", "lastmod": "2023-10-20 19:17:18", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Cai-Yang", "name": { "family": "Cai", "given": "Yang" } }, { "id": "Echenique-F", "name": { "family": "Echenique", "given": "Federico" }, "orcid": "0000-0002-1567-6770" }, { "id": "Fu-Hu", "name": { "family": "Fu", "given": "Hu" } }, { "id": "Ligett-K", "name": { "family": "Ligett", "given": "Katrina" }, "orcid": "0000-0003-2780-6656" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Ziani-Juba", "name": { "family": "Ziani", "given": "Juba" }, "orcid": "0000-0002-3324-4349" } ] }, "title": "Third-Party Data Providers Ruin Simple Mechanisms", "ispublished": "pub", "full_text_status": "public", "keywords": "mechanism design; ad auctions; simple mechanisms; information\nasymmetries; signaling", "note": "\u00a9 2020 Copyright held by the owner/author(s).\n\nCai thanks the Sloan Foundation for its support through a Sloan Foundation Research Fellowship. Part of Cai's work was done under the support of the NSERC Discovery grant RGPIN-2015-06127 and the FRQNT grant 2017-NC-198956. Echenique thanks the National Science Foundation for its support through grants SES-1558757 and CNS-1518941. Fu thanks the NSERC for its support through Discovery grant RGPAS-2017-507934 and Accelerator grant RGPAS-2017-507934. Ligett's work was supported in part by NSF grants CNS-1254169 and CNS-1518941, US-Israel Binational Science Foundation grant 2012348, Israeli Science Foundation (ISF) grant 1044/16, the United States Air Force and DARPA under contracts FA8750-16-C-0022 and FA8750-19-2-0222, and the HUJI Cyber Security Research Center in conjunction with the Israel National Cyber Directorate (INCD) in the Prime Ministers Office. Wierman thanks the National Science Foundation for its support through grants NSF AitF-1637598, CNS-1518941, as well as the Linde Institute of Economic and Management Science at Caltech. Ziani thanks the National Science Foundation for its support through grants CNS-1331343 and CNS-1518941, the US-Israel Binational Science Foundation through grant 2012348, and the Linde Graduate Fellowship at Caltech. We thank Noam Nisan for extremely useful comments and discussions.\n\nPublished - 3410048.3410108.pdf
", "abstract": "Motivated by the growing prominence of third-party data providers in online marketplaces, this paper studies the impact of the presence of third-party data providers on mechanism design. When no data provider is present, it has been shown that simple mechanisms are \"good enough\" -they can achieve a constant fraction of the revenue of optimal mechanisms. The results in this paper demonstrate that this is no longer true in the presence of a third-party data provider who can provide the bidder with a signal that is correlated with the item type. Specifically, even with a single seller, a single bidder, and a single item of uncertain type for sale, the strategies of pricing each item-type separately (the analog of item pricing for multiitem auctions) and bundling all item-types under a single price (the analog of grand bundling) can both simultaneously be a logarithmic factor worse than the optimal revenue. Further, in the presence of a data provider, item-type partitioning mechanisms-a more general class of mechanisms which divide item-types into disjoint groups and offer prices for each group-still cannot achieve within a log log factor of the optimal revenue. Thus, our results highlight that the presence of a data-provider forces the use of more complicated mechanisms in order to achieve a constant fraction of the optimal revenue.", "date": "2020-06", "date_type": "published", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "48", "number": "1", "publisher": "Association for Computing Machinery (ACM)", "place_of_pub": "New York, NY", "pagerange": "103", "id_number": "CaltechAUTHORS:20200709-084932341", "isbn": "9781450379854", "issn": "0163-5999", "book_title": "SIGMETRICS '20 Abstracts", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20200709-084932341", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Alfred P. Sloan Foundation" }, { "agency": "Natural Sciences and Engineering Research Council of Canada (NSERC)", "grant_number": "RGPIN-2015-06127" }, { "agency": "Fonds de recherche du Qu\u00e9bec \u2013 Nature et technologies (FRQNT)", "grant_number": "2017-NC-198956" }, { "agency": "NSF", "grant_number": "SES-1558757" }, { "agency": "NSF", "grant_number": "CNS-1518941" }, { "agency": "Natural Sciences and Engineering Research Council of Canada (NSERC)", "grant_number": "RGPAS-2017-507934" }, { "agency": "NSF", "grant_number": "CNS-1254169" }, { "agency": "NSF", "grant_number": "CNS-1518941" }, { "agency": "Binational Science Foundation (USA-Israel)", "grant_number": "2012348" }, { "agency": "Israel Science Foundation", "grant_number": "1044/16" }, { "agency": "Air Force Office of Scientific Research (AFOSR)", "grant_number": "FA8750-16-C-0022" }, { "agency": "Air Force Office of Scientific Research (AFOSR)", "grant_number": "FA8750-19-2-0222" }, { "agency": "HUJI Cyber Security Research Center" }, { "agency": "Israel National Cyber Directorate (INCD)" }, { "agency": "NSF", "grant_number": "AitF-1637598" }, { "agency": "NSF", "grant_number": "CNS-1518941" }, { "agency": "Linde Institute of Economic and Management Science" }, { "agency": "NSF", "grant_number": "CNS-1331343" }, { "agency": "NSF", "grant_number": "CNS-1518941" }, { "agency": "Binational Science Foundation (USA-Israel)", "grant_number": "2012348" } ] }, "doi": "10.1145/3410048.3410108", "primary_object": { "basename": "3410048.3410108.pdf", "url": "https://authors.library.caltech.edu/records/hdp6f-c2s32/files/3410048.3410108.pdf" }, "resource_type": "article", "pub_year": "2020", "author_list": "Cai, Yang; Echenique, Federico; et el." }, { "id": "https://authors.library.caltech.edu/records/7m3ym-vmm22", "eprint_id": 101298, "eprint_status": "archive", "datestamp": "2023-08-19 21:09:52", "lastmod": "2023-10-19 22:36:27", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Lin-Yiheng", "name": { "family": "Lin", "given": "Yiheng" }, "orcid": "0000-0001-6524-2877" }, { "id": "Goel-Gautam", "name": { "family": "Goel", "given": "Gautam" }, "orcid": "0000-0002-7054-7218" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" }, "orcid": "0000-0002-5923-0199" } ] }, "title": "Online Optimization with Predictions and Non-convex Losses", "ispublished": "pub", "full_text_status": "public", "note": "\u00a9 2020 Copyright held by the owner/author(s). Publication rights licensed to ACM. \n\nReceived October 2019; revised December 2019; accepted January 2020. \n\nThis work was done when Yiheng Lin was visiting California Institute of Technology. \n\nThis work was supported by NSF grants AitF-1637598 and CNS-1518941, with additional support for Gautam Goel provided\nby an Amazon AWS AI Fellowship.\n\nPublished - 3379484.pdf
Submitted - 1911.03827.pdf
", "abstract": "We study online optimization in a setting where an online learner seeks to optimize a per-round hitting cost, which may be non-convex, while incurring a movement cost when changing actions between rounds. We ask: under what general conditions is it possible for an online learner to leverage predictions of future cost functions in order to achieve near-optimal costs? Prior work has provided near-optimal online algorithms for specific combinations of assumptions about hitting and switching costs, but no general results are known. In this work, we give two general sufficient conditions that specify a relationship between the hitting and movement costs which guarantees that a new algorithm, Synchronized Fixed Horizon Control (SFHC), achieves a 1+O(1/w) competitive ratio, where w is the number of predictions available to the learner. Our conditions do not require the cost functions to be convex, and we also derive competitive ratio results for non-convex hitting and movement costs. Our results provide the first constant, dimension-free competitive ratio for online non-convex optimization with movement costs. We also give an example of a natural problem, Convex Body Chasing (CBC), where the sufficient conditions are not satisfied and prove that no online algorithm can have a competitive ratio that converges to 1.", "date": "2020-05", "date_type": "published", "publication": "Proceedings of the ACM on Measurement and Analysis of Computing Systems", "volume": "4", "number": "1", "publisher": "Association for Computing Machinery", "pagerange": "Art. No. 18", "id_number": "CaltechAUTHORS:20200214-105548481", "issn": "2476-1249", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20200214-105548481", "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.1145/3379484", "primary_object": { "basename": "1911.03827.pdf", "url": "https://authors.library.caltech.edu/records/7m3ym-vmm22/files/1911.03827.pdf" }, "related_objects": [ { "basename": "3379484.pdf", "url": "https://authors.library.caltech.edu/records/7m3ym-vmm22/files/3379484.pdf" } ], "resource_type": "article", "pub_year": "2020", "author_list": "Lin, Yiheng; Goel, Gautam; et el." }, { "id": "https://authors.library.caltech.edu/records/r67cj-d4544", "eprint_id": 96757, "eprint_status": "archive", "datestamp": "2023-08-22 04:46:18", "lastmod": "2023-10-20 21:29:55", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Cai-Yang", "name": { "family": "Cai", "given": "Yang" } }, { "id": "Echenique-F", "name": { "family": "Echenique", "given": "Federico" }, "orcid": "0000-0002-1567-6770" }, { "id": "Fu-Hu", "name": { "family": "Fu", "given": "Hu" } }, { "id": "Ligett-K", "name": { "family": "Ligett", "given": "Katrina" }, "orcid": "0000-0003-2780-6656" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Ziani-Juba", "name": { "family": "Ziani", "given": "Juba" }, "orcid": "0000-0002-3324-4349" } ] }, "title": "Third-Party Data Providers Ruin Simple Mechanisms", "ispublished": "pub", "full_text_status": "public", "keywords": "mechanism design; ad auctions; simple mechanisms; information\nasymmetries; signaling", "note": "\u00a9 2020 Copyright held by the owner/author(s). Publication rights licensed to ACM. \n\nReceived October 2019; revised December 2019; accepted January 2020. \n\nCai thanks the Sloan Foundation for its support through a Sloan Foundation Research Fellowship. Part of Cai's work was done under the support of the NSERC Discovery grant RGPIN-2015-06127 and the FRQNT grant 2017-NC-198956. Echenique thanks the National Science Foundation for its support through grants SES-1558757 and CNS-1518941. Fu thanks the NSERC for its support through Discovery grant RGPAS-2017-507934 and Accelerator grant RGPAS-2017-507934. Ligett's work was supported in part by NSF grants CNS-1254169 and CNS-1518941, US-Israel Binational Science Foundation grant 2012348, Israeli Science Foundation (ISF) grant 1044/16, the United States Air Force and DARPA under contracts FA8750-16-C-0022 and FA8750-19-2-0222, and the HUJI Cyber Security Research Center in conjunction with the Israel National Cyber Directorate (INCD) in the Prime Ministers Office. Wierman thanks the National Science Foundation for its support through grants NSF AitF-1637598, CNS-1518941, as well as the Linde Institute of Economic and Management Science at Caltech. Ziani thanks the National Science Foundation for its support through grants CNS-1331343 and CNS-1518941, the US-Israel Binational Science Foundation through grant 2012348, and the Linde Graduate Fellowship at Caltech.We thank Noam Nisan for extremely useful comments\nand discussions.\n\nPublished - 3379478.pdf
Submitted - 1802.07407.pdf
", "abstract": "Motivated by the growing prominence of third-party data providers in online marketplaces, this paper studies the impact of the presence of third-party data providers on mechanism design. When no data provider is present, it has been shown that simple mechanisms are \"good enough'' -- they can achieve a constant fraction of the revenue of optimal mechanisms. The results in this paper demonstrate that this is no longer true in the presence of a third-party data provider who can provide the bidder with a signal that is correlated with the item type. Specifically, even with a single seller, a single bidder, and a single item of uncertain type for sale, the strategies of pricing each item-type separately (the analog of item pricing for multi-item auctions) and bundling all item-types under a single price (the analog of grand bundling) can both simultaneously be a logarithmic factor worse than the optimal revenue. Further, in the presence of a data provider, item-type partitioning mechanisms---a more general class of mechanisms which divide item-types into disjoint groups and offer prices for each group---still cannot achieve within a $\u0142og \u0142og$ factor of the optimal revenue. Thus, our results highlight that the presence of a data-provider forces the use of more complicated mechanisms in order to achieve a constant fraction of the optimal revenue.", "date": "2020-05", "date_type": "published", "publication": "Proceedings of the ACM on Measurement and Analysis of Computing Systems", "volume": "4", "number": "1", "publisher": "Association for Computing Machinery", "pagerange": "Art. No. 12", "id_number": "CaltechAUTHORS:20190626-155536214", "issn": "2476-1249", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190626-155536214", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Alfred P. Sloan Foundation" }, { "agency": "Natural Sciences and Engineering Research Council of Canada (NSERC)", "grant_number": "RGPIN-2015-06127" }, { "agency": "Fonds de recherche du Qu\u00e9bec \u2013 Nature et technologies (FRQNT)", "grant_number": "2017-NC-198956" }, { "agency": "NSF", "grant_number": "SES-1558757" }, { "agency": "NSF", "grant_number": "CNS-1518941" }, { "agency": "Natural Sciences and Engineering Research Council of Canada (NSERC)", "grant_number": "RGPAS-2017-507934" }, { "agency": "NSF", "grant_number": "CNS-1254169" }, { "agency": "NSF", "grant_number": "CNS-1518941" }, { "agency": "Binational Science Foundation (USA-Israel)", "grant_number": "2012348" }, { "agency": "Israel Science Foundation", "grant_number": "1044/16" }, { "agency": "Defense Advanced Research Projects Agency (DARPA)" }, { "agency": "Air Force Office of Scientific Research (AFOSR)", "grant_number": "FA8750-16-C-0022" }, { "agency": "Air Force Office of Scientific Research (AFOSR)", "grant_number": "FA8750-19-2-0222" }, { "agency": "Hebrew University of Jerusalem" }, { "agency": "Israel National Cyber Directorate (INCD)" }, { "agency": "NSF", "grant_number": "CCF-1637598" }, { "agency": "Linde Institute of Economic and Management Science" }, { "agency": "NSF", "grant_number": "CNS-1331343" } ] }, "doi": "10.1145/3379478", "primary_object": { "basename": "1802.07407.pdf", "url": "https://authors.library.caltech.edu/records/r67cj-d4544/files/1802.07407.pdf" }, "related_objects": [ { "basename": "3379478.pdf", "url": "https://authors.library.caltech.edu/records/r67cj-d4544/files/3379478.pdf" } ], "resource_type": "article", "pub_year": "2020", "author_list": "Cai, Yang; Echenique, Federico; et el." }, { "id": "https://authors.library.caltech.edu/records/ekja4-av334", "eprint_id": 96747, "eprint_status": "archive", "datestamp": "2023-08-22 04:07:13", "lastmod": "2023-10-20 21:29:18", "type": "article", "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": "pub", "full_text_status": "public", "keywords": "Online linear optimization; inventory management; competitive online\nalgorithms; energy procurement; data center", "note": "\u00a9 2020 Association for Computing Machinery. \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 grants, and ARO: W911NF-17-1-0092, DoE: ENERGISE-DE-EE0008006 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 - V4pomacs16-yangA.pdf
Submitted - 1901.04372.pdf
", "abstract": "This paper considers the problem of online linear optimization with inventory management constraints.\nSpecifically, we consider an online scenario where a decision maker needs to satisfy her time-varying demand\nfor some units of an asset, either from a market with a time-varying price or from her own inventory. In\neach time slot, the decision maker is presented a (linear) price and must immediately decide the amount to\npurchase for covering the demand and/or for storing in the inventory for future use. The inventory has a\nlimited capacity and can be used to buy and store assets at low price and cover the demand when the price is\nhigh. The ultimate goal of the decision maker is to cover the demand at each time slot while minimizing the\ncost of buying assets from the market. We propose ARP, an online algorithm for linear programming with\ninventory constraints, and ARPRate, an extended version that handles rate constraints to/from the inventory.\nBoth ARP and ARPRate achieve optimal competitive ratios, meaning that no other online algorithm can achieve\na better theoretical guarantee. To illustrate the results, we use the proposed algorithms in a case study focused\non energy procurement and storage management strategies for data centers.", "date": "2020-03", "date_type": "published", "publication": "Proceedings of the ACM on Measurement and Analysis of Computing Systems", "volume": "4", "number": "1", "publisher": "ACM", "pagerange": "Art. No. 16", "id_number": "CaltechAUTHORS:20190626-143029409", "issn": "2476-1249", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190626-143029409", "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": "CNS-1544771" }, { "agency": "NSF", "grant_number": "EPCN-1711188" }, { "agency": "NSF", "grant_number": "ECCS-1752362" }, { "agency": "NSF", "grant_number": "AMPS-1736448" }, { "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/3379482", "primary_object": { "basename": "1901.04372.pdf", "url": "https://authors.library.caltech.edu/records/ekja4-av334/files/1901.04372.pdf" }, "related_objects": [ { "basename": "V4pomacs16-yangA.pdf", "url": "https://authors.library.caltech.edu/records/ekja4-av334/files/V4pomacs16-yangA.pdf" } ], "resource_type": "article", "pub_year": "2020", "author_list": "Yang, Lin; Hajiesmaili, Mohammad H.; et el." }, { "id": "https://authors.library.caltech.edu/records/9hj2j-e7793", "eprint_id": 102417, "eprint_status": "archive", "datestamp": "2023-08-19 20:20:37", "lastmod": "2023-10-20 00:11:15", "type": "article", "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 Nonconvex Costs", "ispublished": "pub", "full_text_status": "public", "note": "\u00a9 2020 INFORMS. \n\nReceived: May 03, 2018; Accepted: May 31, 2019; Published Online: March 04, 2020. \n\nThe authors thank Benjamin Hobbs, Federico Echenique, Hu Fu, and John Pang for valuable discussions during the progress of this work. \n\nThis work was supported by the Division of Computing and Communication Foundations [Grant 1637598], by the National Science Foundation [Grants EPAS-1307794, CPS-154471, NeTS-1518941, and AitF-1637598], and by PIMCO through a fellowship.\n\nSupplemental Material - opre.2019.1900.sm1.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 nonconvex 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, in order to maximize its own profit. The key question is how to design the price functions. To that end, we propose a new pricing scheme, which is applicable to general nonconvex costs, and allows using general parametric pricing functions. Optimizing for the quantities and the price parameters simultaneously, and the ability to use general parametric pricing functions allows our scheme to find prices that are typically economically more efficient and less discriminatory than those of the existing schemes. In addition, we supplement the proposed method with a polynomial-time approximation algorithm, which can be used to approximate the optimal quantities and prices. Our framework extends to the case of networked markets, which, to the best of our knowledge, has not been considered in previous work.", "date": "2020-03", "date_type": "published", "publication": "Operations Research", "volume": "68", "number": "2", "publisher": "Institute for Operations Research and Management Sciences", "pagerange": "480-496", "id_number": "CaltechAUTHORS:20200409-070410121", "issn": "0030-364X", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20200409-070410121", "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": "ECCS-1307794" }, { "agency": "NSF", "grant_number": "CPS-154471" }, { "agency": "NSF", "grant_number": "CNS-1518941" }, { "agency": "NSF", "grant_number": "CCF-1637598" }, { "agency": "PIMCO" } ] }, "doi": "10.1287/opre.2019.1900", "primary_object": { "basename": "opre.2019.1900.sm1.pdf", "url": "https://authors.library.caltech.edu/records/9hj2j-e7793/files/opre.2019.1900.sm1.pdf" }, "resource_type": "article", "pub_year": "2020", "author_list": "Azizan, Navid; Su, Yu; et el." }, { "id": "https://authors.library.caltech.edu/records/w36zy-76n50", "eprint_id": 96793, "eprint_status": "archive", "datestamp": "2023-08-19 19:19:41", "lastmod": "2023-10-20 21:31:32", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Cai-Desmond-W-H", "name": { "family": "Cai", "given": "Desmond" }, "orcid": "0000-0001-9207-1890" }, { "id": "Agarwal-A", "name": { "family": "Agarwal", "given": "Anish" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "On the Inefficiency of Forward Markets in Leader-Follower Competition", "ispublished": "pub", "full_text_status": "public", "note": "\u00a9 2020 Institute for Operations Research and Management Sciences.\n\nPublished Online: 2 Jan 2020.\n\nSubmitted - 1606.08604.pdf
Supplemental Material - opre.2019.1863.sm1.pdf
", "abstract": "Motivated by electricity markets, this paper studies the impact of forward contracting in situations where firms have capacity constraints and heterogeneous production lead times. We consider a model with two types of firms\u2014leaders and followers\u2014that choose production at two different times. Followers choose productions in the second stage but can sell forward contracts in the first stage. Our main result is an explicit characterization of the equilibrium outcomes. Classic results on forward contracting suggest that it can mitigate market power in simple settings; however, the results in this paper show that the impact of forward markets in this setting is delicate\u2014forward contracting can enhance or mitigate market power. In particular, our results show that leader\u2013follower interactions created by heterogeneous production lead times may cause forward markets to be inefficient, even when there are a large number of followers. In fact, symmetric equilibria do not necessarily exist due to differences in market power among the leaders and followers.", "date": "2020-01", "date_type": "published", "publication": "Operations Research", "volume": "68", "number": "1", "publisher": "Institute for Operations Research and Management Sciences", "pagerange": "35-52", "id_number": "CaltechAUTHORS:20190627-131545662", "issn": "0030-364X", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190627-131545662", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1287/opre.2019.1863", "primary_object": { "basename": "opre.2019.1863.sm1.pdf", "url": "https://authors.library.caltech.edu/records/w36zy-76n50/files/opre.2019.1863.sm1.pdf" }, "related_objects": [ { "basename": "1606.08604.pdf", "url": "https://authors.library.caltech.edu/records/w36zy-76n50/files/1606.08604.pdf" } ], "resource_type": "article", "pub_year": "2020", "author_list": "Cai, Desmond; Agarwal, Anish; et el." }, { "id": "https://authors.library.caltech.edu/records/k3e07-xqv14", "eprint_id": 100368, "eprint_status": "archive", "datestamp": "2023-08-22 03:10:38", "lastmod": "2023-10-18 19:53:58", "type": "article", "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" } } ] }, "title": "Logarithmic Communication for Distributed Optimization in Multi-Agent Systems", "ispublished": "pub", "full_text_status": "public", "keywords": "distributed algorithms; distributed optimization; multi-agent systems", "note": "\u00a9 2019 Association for Computing Machinery. OPen Access. \n\nReceived August 2019; revised September 2019; accepted October 2019.\n\nThis work was funded by the National Research Foundation through the AitF-1637598, CNS-1518941, and CNS-1254169 grants, along with the Linde Foundation and an Amazon AWS Artificial Intelligence Fellowship.\n\nPublished - pomacs48-london.pdf
", "abstract": "Classically, the design of multi-agent systems is approached using techniques from distributed optimization such as dual descent and consensus algorithms. Such algorithms depend on convergence to global consensus before any individual agent can determine its local action. This leads to challenges with respect to communication overhead and robustness, and improving algorithms with respect to these measures has been a focus of the community for decades.\n\nThis paper presents a new approach for multi-agent system design based on ideas from the emerging field of local computation algorithms. The framework we develop, LOcal Convex Optimization (LOCO), is the first local computation algorithm for convex optimization problems and can be applied in a wide-variety of settings. We demonstrate the generality of the framework via applications to Network Utility Maximization (NUM) and the distributed training of Support Vector Machines (SVMs), providing numerical results illustrating the improvement compared to classical distributed optimization approaches in each case.", "date": "2019-12", "date_type": "published", "publication": "Proceedings of the ACM on Measurement and Analysis of Computing Systems", "volume": "3", "number": "3", "publisher": "ACM", "pagerange": "Art. No. 48", "id_number": "CaltechAUTHORS:20191218-160307829", "issn": "2476-1249", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20191218-160307829", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "AitF-1637598" }, { "agency": "NSF", "grant_number": "CNS-1518941" }, { "agency": "NSF", "grant_number": "CNS-1254169" }, { "agency": "Linde Institute of Economic and Management Science" }, { "agency": "Amazon Web Services" } ] }, "doi": "10.1145/3366696", "primary_object": { "basename": "pomacs48-london.pdf", "url": "https://authors.library.caltech.edu/records/k3e07-xqv14/files/pomacs48-london.pdf" }, "resource_type": "article", "pub_year": "2019", "author_list": "London, Palma; Vardi, Shai; et el." }, { "id": "https://authors.library.caltech.edu/records/rv4nq-h7x54", "eprint_id": 98224, "eprint_status": "archive", "datestamp": "2023-08-22 03:06:19", "lastmod": "2023-10-18 17:09:58", "type": "article", "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": "pub", "full_text_status": "public", "keywords": "Sharing economy; Network economics; Game theory", "note": "\u00a9 2019 Elsevier. \n\nReceived 8 November 2018, Revised 7 April 2019, Accepted 15 August 2019, Available online 26 August 2019.\n\nSubmitted - 1604.01627.pdf
", "abstract": "The growth of the sharing economy is driven by the emergence of 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 shortages; 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 our results and insights using data from Didi Chuxing, the largest ridesharing platform in China.", "date": "2019-12", "date_type": "published", "publication": "Performance Evaluation", "volume": "136", "publisher": "Elsevier", "pagerange": "Art. No. 102037", "id_number": "CaltechAUTHORS:20190826-092413079", "issn": "0166-5316", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190826-092413079", "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": "Tsinghua Initiative" }, { "agency": "China Youth 1000-Talent" }, { "agency": "NSF", "grant_number": "CCF-1637598" } ] }, "doi": "10.1016/j.peva.2019.102037", "primary_object": { "basename": "1604.01627.pdf", "url": "https://authors.library.caltech.edu/records/rv4nq-h7x54/files/1604.01627.pdf" }, "resource_type": "article", "pub_year": "2019", "author_list": "Fang, Zhixuan; Huang, Longbo; et el." }, { "id": "https://authors.library.caltech.edu/records/g0hxe-nw304", "eprint_id": 100210, "eprint_status": "archive", "datestamp": "2023-08-19 17:41:03", "lastmod": "2023-10-18 19:10:54", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Goel-Gautam", "name": { "family": "Goel", "given": "Gautam" }, "orcid": "0000-0002-7054-7218" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" }, "orcid": "0000-0002-5923-0199" } ] }, "title": "An Online Algorithm for Smoothed Online Convex Optimization", "ispublished": "pub", "full_text_status": "public", "note": "\u00a9 2019 is held by author/owner(s).\n\nPublished - p6-goel.pdf
", "abstract": "We consider Online Convex Optimization (OCO) in the setting where the costs are m-strongly convex and the online learner pays a switching cost for changing decisions between rounds. We show that the recently proposed Online Balanced Descent (OBD) algorithm is constant competitive in this setting, with competitive ratio 3+O(1/m), irrespective of the ambient dimension. We demonstrate the generality of our approach by showing that the OBD framework can be used to construct competitive a algorithm for LQR control.", "date": "2019-09", "date_type": "published", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "47", "number": "2", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "6-8", "id_number": "CaltechAUTHORS:20191205-111324876", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20191205-111324876", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/3374888.3374892", "primary_object": { "basename": "p6-goel.pdf", "url": "https://authors.library.caltech.edu/records/g0hxe-nw304/files/p6-goel.pdf" }, "resource_type": "article", "pub_year": "2019", "author_list": "Goel, Gautam and Wierman, Adam" }, { "id": "https://authors.library.caltech.edu/records/zp2g5-e1f20", "eprint_id": 100209, "eprint_status": "archive", "datestamp": "2023-08-19 17:40:58", "lastmod": "2023-10-18 19:10:51", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Su-Yu", "name": { "family": "Su", "given": "Yu" } }, { "id": "Ren-Xiaoqi", "name": { "family": "Ren", "given": "Xiaoqi" }, "orcid": "0000-0002-1121-9046" }, { "id": "Vardi-S", "name": { "family": "Vardi", "given": "Shai" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "He-Yuxiong", "name": { "family": "He", "given": "Yuxiong" } } ] }, "title": "Communication-Aware Scheduling of Precedence-Constrained Tasks", "ispublished": "pub", "full_text_status": "public", "note": "\u00a9 2019 is held by author/owner(s).\n\nPublished - p21-su.pdf
", "abstract": "Jobs in large-scale machine learning platforms are expressed using a computational graph of tasks with precedence constraints. To handle such precedence-constrained tasks that have machine-dependent communication demands in settings with heterogeneous service rates and communication times, we propose a new scheduling framework, Generalized Earliest Time First (GETF), that improves upon stateof- the-art results in the area. Specifically, we provide the first provable, worst-case approximation guarantee for the goal of minimizing the makespan of tasks with precedence constraints on related machines with machine-dependent communication times.", "date": "2019-09", "date_type": "published", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "47", "number": "2", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "21-23", "id_number": "CaltechAUTHORS:20191205-110845019", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20191205-110845019", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/3374888.3374897", "primary_object": { "basename": "p21-su.pdf", "url": "https://authors.library.caltech.edu/records/zp2g5-e1f20/files/p21-su.pdf" }, "resource_type": "article", "pub_year": "2019", "author_list": "Su, Yu; Ren, Xiaoqi; et el." }, { "id": "https://authors.library.caltech.edu/records/rxvjs-y9y86", "eprint_id": 98428, "eprint_status": "archive", "datestamp": "2023-08-22 02:10:49", "lastmod": "2023-10-18 17:21:14", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "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 Role of a Market Maker in Networked Cournot Competition", "ispublished": "pub", "full_text_status": "restricted", "keywords": "game theory; networked Cournot; Nash equilibrium; market maker; market design", "note": "\u00a9 2019 INFORMS. \n\nReceived: July 13, 2016; Revised: September 4, 2017; May 23, 2018; Accepted: June 16, 2018; Published Online in Articles in Advance: May 8, 2019. \n\nThis research was supported in part by the International Institute of Carbon-Neutral Energy Research (I2CNER) and the National Science Foundation (NSF) [Grant 1544771 as a part of the NSF/DHS/DOT/NASA/NIH Cyber-Physical Systems Program and Grants NETS-1518941, AitF-1637598, and EPAS-1307794].", "abstract": "We study Cournot competition among firms in a networked marketplace that is centrally managed by a market maker. In particular, we study a situation in which a market maker facilitates trade between geographically separate markets via a constrained transport network. Our focus is on understanding the consequences of the design of the market maker and providing tools for optimal design. To that end, we provide a characterization of the equilibrium outcomes of the game between the firms and the market maker. Our results highlight that the equilibrium structure is impacted dramatically by the market maker's objective\u2014depending on the objective, there may be a unique equilibrium, multiple equilibria, or no equilibria. Furthermore, the game may be a potential game (as in the case of classical Cournot competition) or not. Beyond characterizing the equilibria of the game, we provide an approach for designing the market maker to optimize a design objective (e.g., social welfare) at the equilibrium of the game. Additionally, we use our results to explore the value of transport (trade) and the efficiency of the market maker (compared with a single aggregate market).", "date": "2019-08", "date_type": "published", "publication": "Mathematics of Operations Research", "volume": "44", "number": "3", "publisher": "INFORMS", "pagerange": "1122-1144", "id_number": "CaltechAUTHORS:20190905-100922515", "issn": "0364-765X", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190905-100922515", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "International Institute of Carbon-Neutral Energy Research (I2CNER)" }, { "agency": "NSF", "grant_number": "CNS-1544771" }, { "agency": "NSF", "grant_number": "CNS-1518941" }, { "agency": "NSF", "grant_number": "CCF-1637598" }, { "agency": "NSF", "grant_number": "ECCS-1307794" } ] }, "doi": "10.1287/moor.2018.0961", "resource_type": "article", "pub_year": "2019", "author_list": "Cai, Desmond; Bose, Subhonmesh; et el." }, { "id": "https://authors.library.caltech.edu/records/e7n6z-bn283", "eprint_id": 100369, "eprint_status": "archive", "datestamp": "2023-08-22 01:45:48", "lastmod": "2023-10-23 16:10:59", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Lin-Qiulin", "name": { "family": "Lin", "given": "Qiulin" } }, { "id": "Yi-Hanling", "name": { "family": "Yi", "given": "Hanling" } }, { "id": "Pang-John-Z-F", "name": { "family": "Pang", "given": "John" }, "orcid": "0000-0002-6485-7922" }, { "id": "Chen-Minghua", "name": { "family": "Chen", "given": "Minghua" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Honig-Michael", "name": { "family": "Honig", "given": "Michael" } }, { "id": "Xiao-Yuanzhang", "name": { "family": "Xiao", "given": "Yuanzhang" } } ] }, "title": "Competitive Online Optimization under Inventory Constraints", "ispublished": "pub", "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", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "47", "number": "1", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "35-36", "id_number": "CaltechAUTHORS:20191218-160755746", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20191218-160755746", "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/e7n6z-bn283/files/p35-lin.pdf" }, "resource_type": "article", "pub_year": "2019", "author_list": "Lin, Qiulin; Yi, Hanling; et el." }, { "id": "https://authors.library.caltech.edu/records/1w8b7-9m514", "eprint_id": 96758, "eprint_status": "archive", "datestamp": "2023-08-19 15:14:31", "lastmod": "2023-10-20 21:29:58", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Goel-Gautam", "name": { "family": "Goel", "given": "Gautam" }, "orcid": "0000-0002-7054-7218" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" }, "orcid": "0000-0002-5923-0199" } ] }, "title": "An Online Algorithm for Smoothed Regression and LQR Control", "ispublished": "pub", "full_text_status": "public", "note": "\u00a9 2019 by the author(s).\n\nPublished - goel19a.pdf
Submitted - 1810.10132.pdf
", "abstract": "We consider Online Convex Optimization (OCO) in the setting where the costs are mm-strongly convex and the online learner pays a switching cost for changing decisions between rounds. We show that the recently proposed Online Balanced Descent (OBD) algorithm is constant competitive in this setting, with competitive ratio 3+O(1/m), irrespective of the ambient dimension. Additionally, we show that when the sequence of cost functions is \u03f5\u03f5-smooth, OBD has near-optimal dynamic regret and maintains strong per-round accuracy. We demonstrate the generality of our approach by showing that the OBD framework can be used to construct competitive algorithms for a variety of online problems across learning and control, including online variants of ridge regression, logistic regression, maximum likelihood estimation, and LQR control.", "date": "2019-04", "date_type": "published", "publication": "Proceedings of Machine Learning Research", "volume": "89", "publisher": "PMLR", "pagerange": "2504-2513", "id_number": "CaltechAUTHORS:20190626-160602759", "issn": "2640-3498", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190626-160602759", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.48550/arXiv.1810.10132", "primary_object": { "basename": "1810.10132.pdf", "url": "https://authors.library.caltech.edu/records/1w8b7-9m514/files/1810.10132.pdf" }, "related_objects": [ { "basename": "goel19a.pdf", "url": "https://authors.library.caltech.edu/records/1w8b7-9m514/files/goel19a.pdf" } ], "resource_type": "article", "pub_year": "2019", "author_list": "Goel, Gautam and Wierman, Adam" }, { "id": "https://authors.library.caltech.edu/records/808wm-kzj19", "eprint_id": 94141, "eprint_status": "archive", "datestamp": "2023-08-22 01:01:32", "lastmod": "2023-10-23 16:08:59", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Lin-Qiulin", "name": { "family": "Lin", "given": "Qiulin" } }, { "id": "Yi-Hanling", "name": { "family": "Yi", "given": "Hanling" } }, { "id": "Pang-John-Z-F", "name": { "family": "Pang", "given": "John" }, "orcid": "0000-0002-6485-7922" }, { "id": "Chen-Minghua", "name": { "family": "Chen", "given": "Minghua" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Honig-Michael", "name": { "family": "Honig", "given": "Michael" } }, { "id": "Xiao-Yuanzhang", "name": { "family": "Xiao", "given": "Yuanzhang" } } ] }, "title": "Competitive Online Optimization under Inventory Constraints", "ispublished": "pub", "full_text_status": "public", "keywords": "Inventory Constraints; Revenue Maximization; Online Algorithms; One-way Trading; Price Elasticity", "note": "\u00a9 2019 Association for Computing Machinery. \n\nWe acknowledge the support received from Hong Kong University Grants Committee Theme-based Research Scheme Project No. T23-407/13-N and Collaborative Research Fund No. C7036-15G, NSF grant AST-134338, NSF AitF-1637598, NSF CNS-1518941, and NSF CPS-154471. In particular, John Pang wants to acknowledge the support from ASTAR, Singapore.\n\nSubmitted - 1901.09161.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 minimal 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, the CR-Pursuit algorithm achieves a competitive ratio that is within a small additive constant (i.e., 1/3) to the lower bound of ln 0+1, where 0 is the ratio between the maximum and minimum base prices.", "date": "2019-03", "date_type": "published", "publication": "Proceedings of the ACM on Measurement and Analysis of Computing Systems", "volume": "3", "number": "1", "publisher": "ACM", "pagerange": "Art. No. 10", "id_number": "CaltechAUTHORS:20190326-093440485", "issn": "2476-1249", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190326-093440485", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Hong Kong University Grants Committee", "grant_number": "T23-407/13-N" }, { "agency": "Hong Kong University Grants Committee", "grant_number": "C7036-15G" }, { "agency": "NSF", "grant_number": "AST-134338" }, { "agency": "NSF", "grant_number": "AitF-1637598" }, { "agency": "NSF", "grant_number": "CNS-1518941" }, { "agency": "NSF", "grant_number": "CPS-154471" }, { "agency": "Agency for Science, Technology and Research (A*STAR)" } ] }, "doi": "10.1145/3322205.3311081", "primary_object": { "basename": "1901.09161.pdf", "url": "https://authors.library.caltech.edu/records/808wm-kzj19/files/1901.09161.pdf" }, "resource_type": "article", "pub_year": "2019", "author_list": "Lin, Qiulin; Yi, Hanling; et el." }, { "id": "https://authors.library.caltech.edu/records/6db43-e2w16", "eprint_id": 92489, "eprint_status": "archive", "datestamp": "2023-08-19 13:03:42", "lastmod": "2023-10-20 15:45:25", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Nakahira-Yorie", "name": { "family": "Nakahira", "given": "Yorie" }, "orcid": "0000-0003-3324-4602" }, { "id": "Ferragut-A", "name": { "family": "Ferragut", "given": "Andres" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Minimal-Variance Distributed Deadline Scheduling in a Stationary Environment", "ispublished": "pub", "full_text_status": "public", "keywords": "Deadline scheduling, Service capacity control, Exact Scheduling, Online algorithms", "note": "\u00a9 2018 is held by author/owner(s).\n\nPublished - p56-nakahira.pdf
", "abstract": "Many modern schedulers can dynamically adjust their service capacity to match the incoming workload. At the same time, however, variability in service capacity often incurs operational and infrastructure costs. In this paper, we propose distributed algorithms that minimize service capacity variability when scheduling jobs with deadlines. Specifically, we show that Exact Scheduling minimizes service capacity variance subject to strict demand and deadline requirements under stationary Poisson arrivals. We also characterize the optimal distributed policies for more general settings with soft demand requirements, soft deadline requirements, or both. Additionally, we show how close the performance of the optimal distributed policy is to that of the optimal centralized policy by deriving a competitive-ratio-like bound.", "date": "2018-12", "date_type": "published", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "46", "number": "3", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "56-61", "id_number": "CaltechAUTHORS:20190128-091502098", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190128-091502098", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/3308897.3308925", "primary_object": { "basename": "p56-nakahira.pdf", "url": "https://authors.library.caltech.edu/records/6db43-e2w16/files/p56-nakahira.pdf" }, "resource_type": "article", "pub_year": "2018", "author_list": "Nakahira, Yorie; Ferragut, Andres; et el." }, { "id": "https://authors.library.caltech.edu/records/ng1rq-1d650", "eprint_id": 77742, "eprint_status": "archive", "datestamp": "2023-09-22 22:38:47", "lastmod": "2023-10-23 23:25:50", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Azizan-Ruhi-N", "name": { "family": "Azizan Ruhi", "given": "Navid" }, "orcid": "0000-0002-4299-2963" }, { "id": "Dvijotham-K", "name": { "family": "Dvijotham", "given": "Krishnamurthy" }, "orcid": "0000-0002-1328-4677" }, { "id": "Chen-Niangjun", "name": { "family": "Chen", "given": "Niangjun" }, "orcid": "0000-0002-2289-9737" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Opportunities for Price Manipulation by Aggregators in Electricity Markets", "ispublished": "pub", "full_text_status": "public", "keywords": "Aggregators, renewables, optimal curtailment, market power, locational marginal price (LMP)", "note": "\u00a9 2017 IEEE. \n\nManuscript received June 28, 2016; revised November 21, 2016\nand February 28, 2017; accepted April 5, 2017. Date of publication April 13, 2017; date of current version October 19, 2018. \n\nThis work was supported in part by NSF under Grant 1545096 (as part of the NSF/DHS/DOT/NASA/NIH Cyber-Physical Systems Program), Grant NeTS-1518941, Grant AitF-1637598, and Grant EPAS-1307794. Paper no. TSG-00866-2016. (Navid Azizan Ruhi and Krishnamurthy Dvijotham contributed equally to this work.)\n\nSubmitted - 1606.06510.pdf
", "abstract": "Aggregators of distributed generation are playing an increasingly crucial role in the integration of renewable energy in power systems. However, the intermittent nature of renewable generation makes market interactions of aggregators difficult to monitor and regulate, raising concerns about potential market manipulation by aggregators. In this paper, we study this issue by quantifying the profit an aggregator can obtain through strategic curtailment of generation in an electricity market. We show that, while the problem of maximizing the benefit from curtailment is hard in general, efficient algorithms exist when the topology of the network is radial (acyclic). Further, we highlight that significant increases in profit are possible via strategic curtailment in practical settings.", "date": "2018-11", "date_type": "published", "publication": "IEEE Transactions on Smart Grid", "volume": "9", "number": "6", "publisher": "IEEE", "pagerange": "5687-5698", "id_number": "CaltechAUTHORS:20170524-171255595", "issn": "1949-3053", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170524-171255595", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "ACI-1545096" }, { "agency": "NSF", "grant_number": "CNS-1518941" }, { "agency": "NSF", "grant_number": "CCF-1637598" }, { "agency": "NSF", "grant_number": "ECCS-1307794" } ] }, "doi": "10.1109/TSG.2017.2694043", "primary_object": { "basename": "1606.06510.pdf", "url": "https://authors.library.caltech.edu/records/ng1rq-1d650/files/1606.06510.pdf" }, "resource_type": "article", "pub_year": "2018", "author_list": "Azizan Ruhi, Navid; Dvijotham, Krishnamurthy; et el." }, { "id": "https://authors.library.caltech.edu/records/sa4ns-rpz74", "eprint_id": 92487, "eprint_status": "archive", "datestamp": "2023-08-19 11:21:21", "lastmod": "2023-10-20 15:45:13", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Qin-Junjie", "name": { "family": "Qin", "given": "Junjie" } }, { "id": "Rajagopal-R", "name": { "family": "Rajagopal", "given": "Ram" } }, { "id": "Vardi-S", "name": { "family": "Vardi", "given": "Shai" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Convex Prophet Inequalities", "ispublished": "pub", "full_text_status": "public", "keywords": "Prophet inequality, online algorithms, resource allocation, stochastic control", "note": "\u00a9 2018 is held by author/owner(s).\n\nPublished - p39-qin.pdf
", "abstract": "We introduce a new class of prophet inequalities-convex prophet inequalities-where a gambler observes a sequence of convex cost functions c_i(x_i) and is required to assign some fraction 0 \u2264 x_i \u2264 1 to each, such that the sum of assigned values is exactly 1. The goal of the gambler is to minimize the sum of the costs. We provide an optimal algorithm for this problem, a dynamic program, and show that it can be implemented in polynomial time when the cost functions are polynomial. We also precisely characterize the competitive ratio of the optimal algorithm in the case where the gambler has an outside option and there are polynomial costs, showing that it grows as \u0398(n^(p-1)/l), where n is the number of stages, p is the degree of the polynomial costs and the coefficients of the cost functions are bounded by [l, u].", "date": "2018-09", "date_type": "published", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "46", "number": "2", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "39-41", "id_number": "CaltechAUTHORS:20190128-080449154", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190128-080449154", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/3305218.3305233", "primary_object": { "basename": "p39-qin.pdf", "url": "https://authors.library.caltech.edu/records/sa4ns-rpz74/files/p39-qin.pdf" }, "resource_type": "article", "pub_year": "2018", "author_list": "Qin, Junjie; Rajagopal, Ram; et el." }, { "id": "https://authors.library.caltech.edu/records/haaq6-faa02", "eprint_id": 92492, "eprint_status": "archive", "datestamp": "2023-08-19 11:21:39", "lastmod": "2023-10-20 15:45:57", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Qin-Junjie", "name": { "family": "Qin", "given": "Junjie" } }, { "id": "Rajagopal-R", "name": { "family": "Rajagopal", "given": "Ram" } }, { "id": "Vardi-S", "name": { "family": "Vardi", "given": "Shai" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Convex Prophet Inequalities", "ispublished": "pub", "full_text_status": "public", "keywords": "Prophet inequality, online algorithms, resource allocation, stochastic control", "note": "\u00a9 2018 held by the owner/author(s).\n\nPublished - p85-qin.pdf
", "abstract": "We introduce a new class of prophet inequalities-convex prophet inequalities-where a gambler observes a sequence of convex cost functions ci (xi ) and is required to assign some fraction 0 \u2264 x_i \u2264 1 to each, such that the sum of assigned values is exactly 1. The goal of the gambler is to minimize the sum of the costs. We provide an optimal algorithm for this problem, a dynamic program, and show that it can be implemented in polynomial time when the cost functions are polynomial. We also precisely characterize the competitive ratio of the optimal algorithm in the case where the gambler has an outside option and there are polynomial costs, showing that it grows as \u03b8(n^(p-1)/\u2113), where n is the number of stages, p is the degree of the polynomial costs and the coefficients of the cost functions are bounded by [\u2113,u].", "date": "2018-09", "date_type": "published", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "46", "number": "2", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "85-86", "id_number": "CaltechAUTHORS:20190128-125707935", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190128-125707935", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/3305218.3305250", "primary_object": { "basename": "p85-qin.pdf", "url": "https://authors.library.caltech.edu/records/haaq6-faa02/files/p85-qin.pdf" }, "resource_type": "article", "pub_year": "2018", "author_list": "Qin, Junjie; Rajagopal, Ram; et el." }, { "id": "https://authors.library.caltech.edu/records/hfpa5-89z53", "eprint_id": 92490, "eprint_status": "archive", "datestamp": "2023-08-19 11:21:28", "lastmod": "2023-10-20 15:45:29", "type": "article", "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": "pub", "full_text_status": "public", "note": "\u00a9 2018 is held by author/owner(s). \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\nPublished - p57-guo.pdf
Submitted - 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-09", "date_type": "published", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "46", "number": "2", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "57-61", "id_number": "CaltechAUTHORS:20190128-094206311", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190128-094206311", "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": "EPCN-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.1145/3305218.3305240", "primary_object": { "basename": "1803.08551.pdf", "url": "https://authors.library.caltech.edu/records/hfpa5-89z53/files/1803.08551.pdf" }, "related_objects": [ { "basename": "p57-guo.pdf", "url": "https://authors.library.caltech.edu/records/hfpa5-89z53/files/p57-guo.pdf" } ], "resource_type": "article", "pub_year": "2018", "author_list": "Guo, Linqi; Liang, Chen; et el." }, { "id": "https://authors.library.caltech.edu/records/pk4s9-k5586", "eprint_id": 92491, "eprint_status": "archive", "datestamp": "2023-08-19 11:21:35", "lastmod": "2023-10-20 15:45:53", "type": "article", "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": "pub", "full_text_status": "public", "note": "\u00a9 2018 held by the owner/author(s).\n\nPublished - p79-guo.pdf
Submitted - 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 formalize the well-known intuition that failures cannot cross bridges, and reveal a finer-grained concept that encodes more precise information on failure propagation within tree-partition regions. Specifically, when a non-bridge line is tripped, the impact of this failure only propagates within components 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 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 outages.", "date": "2018-09", "date_type": "published", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "46", "number": "2", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "79-80", "id_number": "CaltechAUTHORS:20190128-124902110", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190128-124902110", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/3305218.3305247", "primary_object": { "basename": "1803.08551.pdf", "url": "https://authors.library.caltech.edu/records/pk4s9-k5586/files/1803.08551.pdf" }, "related_objects": [ { "basename": "p79-guo.pdf", "url": "https://authors.library.caltech.edu/records/pk4s9-k5586/files/p79-guo.pdf" } ], "resource_type": "article", "pub_year": "2018", "author_list": "Guo, Linqi; Liang, Chen; et el." }, { "id": "https://authors.library.caltech.edu/records/r5nwn-55b22", "eprint_id": 92485, "eprint_status": "archive", "datestamp": "2023-08-19 11:21:17", "lastmod": "2023-10-20 15:45:05", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Nakahira-Yorie", "name": { "family": "Nakahira", "given": "Yorie" }, "orcid": "0000-0003-3324-4602" }, { "id": "Ferragut-A", "name": { "family": "Ferragut", "given": "Andres" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Minimal-variance distributed scheduling under strict demands and deadlines", "ispublished": "pub", "full_text_status": "public", "keywords": "Deadline scheduling, Service capacity control, Exact Scheduling, Online distributed algorithm", "note": "\u00a9 2018 is held by author/owner(s).\n\nPublished - p12-nakahira.pdf
", "abstract": "Many modern schedulers can dynamically adjust their service capacity to match the incoming workload. At the same time, however, variability in service capacity often incurs operational and infrastructure costs. In this abstract, we characterize an optimal distributed algorithm that minimizes service capacity variability when scheduling jobs with deadlines. Specifically, we show that Exact Scheduling minimizes service capacity variance subject to strict demand and deadline requirements under stationary Poisson arrivals. Moreover, we show how close the performance of the optimal distributed algorithm is to that of the optimal centralized algorithm by deriving a competitive-ratio-like bound.", "date": "2018-09", "date_type": "published", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "46", "number": "2", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "12-14", "id_number": "CaltechAUTHORS:20190125-161222101", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20190125-161222101", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/3305218.3305224", "primary_object": { "basename": "p12-nakahira.pdf", "url": "https://authors.library.caltech.edu/records/r5nwn-55b22/files/p12-nakahira.pdf" }, "resource_type": "article", "pub_year": "2018", "author_list": "Nakahira, Yorie; Ferragut, Andres; et el." }, { "id": "https://authors.library.caltech.edu/records/q3p4d-wx792", "eprint_id": 87204, "eprint_status": "archive", "datestamp": "2023-08-19 09:28:41", "lastmod": "2023-10-18 20:56:43", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Akella-A", "name": { "family": "Akella", "given": "Aditya" } } ] }, "title": "Message from the Editors", "ispublished": "pub", "full_text_status": "restricted", "note": "\u00a9 2018 ACM.", "abstract": "This issue marks the completion of the first year of the Proceedings of the ACM on Measurement and Analysis of Computing Systems (POMACS). POMACS was among the first three journals joining the recently launched Proceedings of the ACM (PACM) series, and with this issue POMACS has now published over 80 papers. \n\nThe goal of the PACM series is to showcase the highest quality research conducted in diverse areas of computer science, as represented by the ACM Special Interest Groups (SIGs). ACM POMACS focuses on the computer systems measurement and performance evaluation community and operates in close collaboration with the Special Interest Group SIGMETRICS. In fact, all the papers in the last three issues of POMACS will be presented during the SIGMETRICS annual conference this summer.", "date": "2018-06", "date_type": "published", "publication": "Proceedings of the ACM on Measurement and Analysis of Computing Systems", "volume": "2", "number": "2", "publisher": "ACM", "pagerange": "Art. No. 23", "id_number": "CaltechAUTHORS:20180618-151602165", "issn": "2476-1249", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20180618-151602165", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/3224418", "resource_type": "article", "pub_year": "2018", "author_list": "Wierman, Adam and Akella, Aditya" }, { "id": "https://authors.library.caltech.edu/records/3vsjv-73n39", "eprint_id": 85426, "eprint_status": "archive", "datestamp": "2023-08-19 08:30:51", "lastmod": "2023-10-18 18:13:05", "type": "article", "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": "Datum: Managing Data Purchasing and Data Placement in a Geo-Distributed Data Market", "ispublished": "pub", "full_text_status": "restricted", "keywords": "Data market, geo-distributed analytics", "note": "\u00a9 2018 IEEE. \n\nManuscript received April 13, 2017; revised October 14, 2017 and February 2, 2018; accepted February 3, 2018; approved by IEEE/ACM TRANSACTIONS ON NETWORKING Editor M. Mellia. \n\nThis work was supported in part by the National Science Foundation under Grant 1254169, Grant 1518941, Grant 1331343, and Grant 1637598, in part by the National Science Foundation Graduate Fellowship, and in part by the Resnick Sustainability Institute Fellowship.", "abstract": "This paper studies two design tasks faced by a geo-distributed cloud data market: which data to purchase (data purchasing) and where to place/replicate the data for delivery (data placement). We show that the joint problem of data purchasing and data placement within a cloud data market can be viewed as a facility location problem and is thus NP-hard. 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 in order to develop a near-optimal, polynomial-time algorithm for a geo-distributed data market. The resulting design, Datum, decomposes the joint purchasing and placement problem into two subproblems, one for data purchasing and one for data placement, using a transformation of the underlying bandwidth costs. We show, via a case study, that Datum is near optimal (within 1.6%) in practical settings.", "date": "2018-04", "date_type": "published", "publication": "IEEE/ACM Transactions on Networking", "volume": "26", "number": "2", "publisher": "IEEE", "pagerange": "893-905", "id_number": "CaltechAUTHORS:20180323-104121108", "issn": "1063-6692", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20180323-104121108", "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-1518941" }, { "agency": "NSF", "grant_number": "CCF-1331343" }, { "agency": "NSF", "grant_number": "CCF-1637598" }, { "agency": "NSF Graduate Research Fellowship" }, { "agency": "Resnick Sustainability Institute" } ] }, "local_group": { "items": [ { "id": "Resnick-Sustainability-Institute" } ] }, "doi": "10.1109/TNET.2018.2811374", "resource_type": "article", "pub_year": "2018", "author_list": "Ren, Xiaoqi; London, Palma; et el." }, { "id": "https://authors.library.caltech.edu/records/db7ba-78h03", "eprint_id": 85592, "eprint_status": "archive", "datestamp": "2023-08-21 23:03:49", "lastmod": "2023-10-18 18:21:16", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Nair-J", "name": { "family": "Nair", "given": "Jayakrishnan" } }, { "id": "Subramanian-V-G", "name": { "family": "Subramanian", "given": "Vijay" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Provisioning of ad-supported cloud services: The role of competition", "ispublished": "pub", "full_text_status": "public", "keywords": "Capacity provisioning; Network effects; Competition; Congestion; Cloud services; Monopoly", "note": "\u00a9 2018 Elsevier B.V. \n\nReceived 27 February 2017, Revised 19 August 2017, Accepted 8 January 2018, Available online 16 January 2018.", "abstract": "Motivated by cloud services, we consider the interplay of network effects, congestion, and competition in ad-supported services. We study the strategic interactions between competing service providers and a user base, modeling congestion sensitivity and two forms of positive network effects: network effects that are either \"firm-specific\" or \"industry-wide.\" Our analysis reveals that users are generally no better off due to the competition in a marketplace of ad-supported services. Further, our analysis highlights an important contrast between firm-specific and industry-wide network effects: 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": "2018-04", "date_type": "published", "publication": "Performance Evaluation", "volume": "120", "publisher": "Elsevier", "pagerange": "36-48", "id_number": "CaltechAUTHORS:20180404-093242290", "issn": "0166-5316", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20180404-093242290", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1016/j.peva.2018.01.001", "resource_type": "article", "pub_year": "2018", "author_list": "Nair, Jayakrishnan; Subramanian, Vijay; et el." }, { "id": "https://authors.library.caltech.edu/records/hsy5n-8f067", "eprint_id": 85711, "eprint_status": "archive", "datestamp": "2023-08-19 06:24:16", "lastmod": "2023-10-18 18:42:19", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Anselmi-J", "name": { "family": "Anselmi", "given": "Jonatha" } }, { "id": "Ardagna-D", "name": { "family": "Ardagna", "given": "Danilo" } }, { "id": "Lui-John-C-S", "name": { "family": "Lui", "given": "John C. S." } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Xu-Yunjian", "name": { "family": "Xu", "given": "Yunjian" } }, { "id": "Yang-Zichao", "name": { "family": "Yang", "given": "Zichao" } } ] }, "title": "The Economics of the Cloud", "ispublished": "pub", "full_text_status": "restricted", "note": "\u00a9 2017 ACM. \n\nReceived March 2017; accepted April 2017. \n\nThis work was supported in part by NSF grants CNS-1518941, CNS-1319820, EPAS-1307794, CNS-0846025, and the Hong Kong RGC GRF 14205114.", "abstract": "This article proposes a model to study the interaction of price competition and congestion in the cloud computing marketplace. Specifically, we propose a three-tier market model that captures a marketplace with users purchasing services from Software-as-a-Service (SaaS) providers, which in turn purchase computing resources from either Provider-as-a-Service (PaaS) or Infrastructure-as-a-Service (IaaS) providers. Within each level, we define and characterize market equilibria. Further, we use these characterizations to understand the relative profitability of SaaSs and PaaSs/IaaSs and to understand the impact of price competition on the user experienced performance, that is, the \"price of anarchy\" of the cloud marketplace. Our results highlight that both of these depend fundamentally on the degree to which congestion results from shared or dedicated resources in the cloud.", "date": "2017-12", "date_type": "published", "publication": "ACM Transactions on Modeling and Performance Evaluation of Computing Systems", "volume": "2", "number": "4", "publisher": "ACM", "pagerange": "Art. No. 18", "id_number": "CaltechAUTHORS:20180409-162521250", "issn": "2376-3639", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20180409-162521250", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CNS-1518941" }, { "agency": "NSF", "grant_number": "CNS-1319820" }, { "agency": "NSF", "grant_number": "EPAS-1307794" }, { "agency": "NSF", "grant_number": "CNS-0846025" }, { "agency": "Hong Kong Research Grant Council", "grant_number": "GRF 14205114" } ] }, "doi": "10.1145/3086574", "resource_type": "article", "pub_year": "2017", "author_list": "Anselmi, Jonatha; Ardagna, Danilo; et el." }, { "id": "https://authors.library.caltech.edu/records/vrv3s-mv932", "eprint_id": 75159, "eprint_status": "archive", "datestamp": "2023-08-19 05:46:05", "lastmod": "2023-10-23 15:07:10", "type": "article", "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": "pub", "full_text_status": "public", "keywords": "Economic dispatch, frequency regulation, optimization decomposition, markets", "note": "\u00a9 2017 IEEE. \n\nManuscript received May 6, 2016; revised September 28, 2016 and January 25, 2017; accepted February 25, 2017. Date of publication March 14, 2017; date of current version October 18, 2017. \n\nThis work was supported in part by ARPA-E Grant DE-AR0000226, in part by Los Alamos National Lab through an DoE Grant DE-AC52-06NA25396, in part by DTRA through Grant HDTRA 1-15-1-0003, in part by Skoltech, in part by NSF Grant 1545096 as a part of the NSF/DHS/DOT/NASA/NIH Cyber-Physical Systems Program, in part by NSF Grant NETS-1518941, in part by NSF Grant EPAS-1307794, in part by NSF CPS Grant CNS 1544771, in part by Johns Hopkins E2SHI Seed Grant, and in part by Johns Hopkins WSE startup funds. A preliminary and abridged version of this paper was presented at the 54th IEEE Conference on Decision and Control, Osaka, Japan, December 2015 [1]. Paper no. TPWRS-00700-2016. \n\nThe authors would like to thank Ben Hobbs from Johns Hopkins and Steven H. Low from Caltech for insightful discussions.\n\nSubmitted - 1605.07910.pdf
", "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 co-optimizes both slow timescale economic dispatch resources and fast timescale frequency regulation resources. We show how the joint problem can be decomposed without loss of optimality into slow and fast timescale sub-problems that have appealing interpretations as the economic dispatch and frequency regulation problems respectively. We solve the fast timescale sub-problem using a distributed frequency control algorithm that preserves network stability during transients. We solve the slow timescale subproblem using an efficient market mechanism that coordinates with the fast timescale sub-problem. We investigate the performance of our approach on the IEEE 24-bus reliability test system.", "date": "2017-11", "date_type": "published", "publication": "IEEE Transactions on Power Systems", "volume": "32", "number": "6", "publisher": "IEEE", "pagerange": "4370-4385", "id_number": "CaltechAUTHORS:20170315-153413222", "issn": "0885-8950", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170315-153413222", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Department of Energy (DOE) 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": "CNS-1545096" }, { "agency": "NSF", "grant_number": "CNS-1518941" }, { "agency": "NSF", "grant_number": "ECCS-1307794" }, { "agency": "NSF", "grant_number": "CNS-1544771" }, { "agency": "Johns Hopkins University" } ] }, "doi": "10.1109/TPWRS.2017.2682235", "primary_object": { "basename": "1605.07910.pdf", "url": "https://authors.library.caltech.edu/records/vrv3s-mv932/files/1605.07910.pdf" }, "resource_type": "article", "pub_year": "2017", "author_list": "Cai, Desmond; Mallada, Enrique; et el." }, { "id": "https://authors.library.caltech.edu/records/1t9q5-vns23", "eprint_id": 85707, "eprint_status": "archive", "datestamp": "2023-08-19 04:58:10", "lastmod": "2023-10-18 18:42:00", "type": "article", "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": "A First Look at Power Attacks in Multi-Tenant Data Centers", "ispublished": "pub", "full_text_status": "restricted", "note": "Copyright is held by author/owner(s). \n\nThis work was supported in part by the U.S. NSF under grants CNS-1551661, CNS-1565474, and ECCS-1610471.", "abstract": "Oversubscription increases the utilization of expensive power infrastructure in multi-tenant data centers, but it can create dangerous emergencies and outages if the designed power capacity is exceeded. Despite the safeguards in place today to prevent power outages, this extended abstract demonstrates that multi-tenant data centers are vulnerable to well-timed power attacks launched by a malicious tenant (i.e., attacker). Further, we show 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. We develop a state-augmented Kalman filter that guides an attacker to precisely time its power attacks at moments that coincide with the benign tenants' high power demand, thus overloading the designed power capacity. Our experimental results show that an attacker can capture 53% of all attack opportunities, significantly compromising the data center availability.", "date": "2017-09", "date_type": "published", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "45", "number": "2", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "91-93", "id_number": "CaltechAUTHORS:20180409-162520179", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20180409-162520179", "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" } ] }, "doi": "10.1145/3152042.3152070", "resource_type": "article", "pub_year": "2017", "author_list": "Islam, Mohammad A.; Ren, Shaolei; et el." }, { "id": "https://authors.library.caltech.edu/records/rgy54-vfv22", "eprint_id": 85706, "eprint_status": "archive", "datestamp": "2023-08-19 04:58:03", "lastmod": "2023-10-18 18:41:55", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "London-P", "name": { "family": "London", "given": "Palma" } }, { "id": "Chen-Niangjun", "name": { "family": "Chen", "given": "Niangjun" }, "orcid": "0000-0002-2289-9737" }, { "id": "Vardi-S", "name": { "family": "Vardi", "given": "Shai" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Distributed Optimization via Local Computation Algorithms", "ispublished": "pub", "full_text_status": "public", "note": "Copyright is held by author/owner(s).\n\nPublished - p30-london.pdf
", "abstract": "We propose a new approach for distributed optimization based on an emerging area of theoretical computer science -- local computation algorithms. The approach is fundamentally different from existing methodologies and provides a number of benefits, such as robustness to link failure and adaptivity in dynamic settings. Specifically, we develop an algorithm, LOCO, that given a convex optimization problem P with n variables and a \"sparse\" linear constraint matrix with m constraints, provably finds a solution as good as that of the best online algorithm for P using only O(log(n+m)) messages with high probability. The approach is not iterative and communication is restricted to a localized neighborhood. In addition to analytic results, we show numerically that the performance improvements over classical approaches for distributed optimization are significant, e.g., it uses orders of magnitude less communication than ADMM.", "date": "2017-09", "date_type": "published", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "45", "number": "2", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "30-32", "id_number": "CaltechAUTHORS:20180409-162519917", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20180409-162519917", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/3152042.3152053", "primary_object": { "basename": "p30-london.pdf", "url": "https://authors.library.caltech.edu/records/rgy54-vfv22/files/p30-london.pdf" }, "resource_type": "article", "pub_year": "2017", "author_list": "London, Palma; Chen, Niangjun; et el." }, { "id": "https://authors.library.caltech.edu/records/3xqpx-cza86", "eprint_id": 85708, "eprint_status": "archive", "datestamp": "2023-08-19 04:58:15", "lastmod": "2023-10-18 18:42:04", "type": "article", "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": "pub", "full_text_status": "public", "note": "Copyright is held by author/owner(s).\n\nPublished - p15-lin.pdf
", "abstract": "This paper studies network design and efficiency loss in open and discriminatory access platforms under networked Cournot competition. In open platforms, every firm connects to every market, while discriminatory platforms limit connections between firms and markets to improve social welfare. We provide tight bounds on the efficiency loss of both platforms; (i) that the efficiency loss at a Nash equilibrium under open access is bounded by 3/2, and (ii) for discriminatory access platforms, we provide a greedy algorithm for optimizing network connections that guarantees efficiency loss at a Nash equilibrium is bounded by 4/3, under an assumption on the linearity of cost functions.", "date": "2017-09", "date_type": "published", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "45", "number": "2", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "15-17", "id_number": "CaltechAUTHORS:20180409-162520446", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20180409-162520446", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/3152042.3152048", "primary_object": { "basename": "p15-lin.pdf", "url": "https://authors.library.caltech.edu/records/3xqpx-cza86/files/p15-lin.pdf" }, "resource_type": "article", "pub_year": "2017", "author_list": "Lin, Weixuan; Pang, John Z. F.; et el." }, { "id": "https://authors.library.caltech.edu/records/fvkzs-7f132", "eprint_id": 85709, "eprint_status": "archive", "datestamp": "2023-08-19 04:58:24", "lastmod": "2023-10-18 18:42:07", "type": "article", "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": "pub", "full_text_status": "public", "note": "Copyright is held by author/owner(s).\n\nSubmitted - 1704.07785.pdf
", "abstract": "Many real-world control systems, such as the smart grid and software defined networks, have decentralized components that react quickly using local information and centralized components that react slowly using a more global view. This work 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 per-timestep cost within a constant factor of the offline optimal in an adversarial setting.", "date": "2017-09", "date_type": "published", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "45", "number": "2", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "27-29", "id_number": "CaltechAUTHORS:20180409-162520743", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20180409-162520743", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/3152042.3152052", "primary_object": { "basename": "1704.07785.pdf", "url": "https://authors.library.caltech.edu/records/fvkzs-7f132/files/1704.07785.pdf" }, "resource_type": "article", "pub_year": "2017", "author_list": "Goel, Gautam; Chen, Niangjun; et el." }, { "id": "https://authors.library.caltech.edu/records/ztspb-8jn76", "eprint_id": 80379, "eprint_status": "archive", "datestamp": "2023-08-21 21:31:02", "lastmod": "2023-10-17 15:57:53", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Ferragut-A", "name": { "family": "Ferragut", "given": "Andres" } }, { "id": "Paganini-F", "name": { "family": "Paganini", "given": "Fernando" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Controlling the Variability of Capacity Allocations Using Service Deferrals", "ispublished": "pub", "full_text_status": "restricted", "keywords": "Mathematics of computing \u2192 Queueing theory; Information systems \u2192 Data centers; Hardware \u2192 Smart grid; Scheduling, deadlines, service variability, incentives", "note": "\u00a9 2017 IEEE. \n\nReceived November 2016; accepted April 2017. \n\nThe research in this paper has been partially supported by IADB\u2013Ministerio de Industria y Energ\u0131a\u2013Uruguay ATN/KF 13883 UR (Component 3) and ANII\u2013Uruguay under grant FSE_1_2014_1_102426. Additional funding for this work was provided by the NSF through grants CNS-1319820, CNS-1518941, and CPS-1545096 as part of the NSF/DHS/DOT/NASA/NIH Cyber-Physical Systems Program.", "abstract": "Ensuring predictability is a crucial goal for service systems. Traditionally, research has focused on designing systems that ensure predictable performance for service requests. Motivated by applications in cloud computing and electricity markets, this article focuses on a different form of predictability: predictable allocations of service capacity. The focus of the article is a new model where service capacity can be scaled dynamically and service deferrals (subject to deadline constraints) can be used to control the variability of the active service capacity. Four natural policies for the joint problem of scheduling and managing the active service capacity are considered. For each, the variability of service capacity and the likelihood of deadline misses are derived. Further, the paper illustrates how pricing can be used to provide incentives for jobs to reveal deadlines and thus enable the possibility of service deferral in systems where the flexibility of jobs is not known to the system a priori.", "date": "2017-08", "date_type": "published", "publication": "ACM Transactions on Modeling and Performance Evaluation of Computing Systems", "volume": "2", "number": "3", "publisher": "ACM", "pagerange": "Art. No. 15", "id_number": "CaltechAUTHORS:20170814-150846810", "issn": "2376-3639", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170814-150846810", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Ministerio de Industria y Energ\u0131a", "grant_number": "ATN/KF 13883 UR (Component 3)" }, { "agency": "Agencia Nacional de Investigaci\u00f3n e Innovaci\u00f3n (ANII)", "grant_number": "FSE_1_2014_1_102426" }, { "agency": "NSF", "grant_number": "CNS-1319820" }, { "agency": "NSF", "grant_number": "CNS-1518941" }, { "agency": "NSF", "grant_number": "CPS-1545096" } ] }, "doi": "10.1145/3086506", "resource_type": "article", "pub_year": "2017", "author_list": "Ferragut, Andres; Paganini, Fernando; et el." }, { "id": "https://authors.library.caltech.edu/records/pq6yx-7py56", "eprint_id": 70174, "eprint_status": "archive", "datestamp": "2023-08-19 04:03:43", "lastmod": "2023-10-20 21:54:50", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Ghamkhari-M", "name": { "family": "Ghamkhari", "given": "Mahdi" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Mohsenian-Rad-H", "name": { "family": "Mohsenian-Rad", "given": "Hamed" } } ] }, "title": "Energy Portfolio Optimization of Data Centers", "ispublished": "pub", "full_text_status": "public", "keywords": "Data centers, energy portfolio, day-ahead\nand real-time markets, reserve, renewable generation, energy\nstorage.", "note": "\u00a9 2016 IEEE. \n\nManuscript received April 16, 2015; revised August 19, 2015 and October 21, 2015; accepted November 23, 2015. \n\nThis work was supported by the National Science Foundation under Grant CNS 1319798 and Grant CNS 1319820. Paper no. TSG-00430-2015.", "abstract": "Data centers have diverse options to procure electricity. However, the current literature on exploiting these options is very fractured. Specifically, it is still not clear how utilizing one energy option may affect selecting other energy options. To address this open problem, we propose a unified energy portfolio optimization framework that takes into consideration a broad range of energy choices for data centers. Despite the complexity and nonlinearity of the original models, the proposed analysis boils down to solving tractable linear mixed-integer stochastic programs. Using experimental electricity market and Internet workload data, various insightful numerical observations are reported. It is shown that the key to link different energy options with different short- and long-term profit characteristics is to conduct risk management at different time horizons. Also, there is a direct relationship between data centers' service-level agreement parameters and their ability to exploit certain energy options. The use of on-site storage and the deployment of geographical workload distribution can particularly help data centers in utilizing high-risk energy choices, such as offering ancillary services or participating in wholesale electricity markets.", "date": "2017-07-06", "date_type": "published", "publication": "IEEE Transactions on Smart Grid", "volume": "8", "number": "4", "publisher": "IEEE", "pagerange": "1898-1910", "id_number": "CaltechAUTHORS:20160906-111711386", "issn": "1949-3053", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20160906-111711386", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CNS-1319798" }, { "agency": "NSF", "grant_number": "CNS-1319820" } ] }, "doi": "10.1109/TSG.2015.2510428", "primary_object": { "basename": "07373667.pdf", "url": "https://authors.library.caltech.edu/records/pq6yx-7py56/files/07373667.pdf" }, "resource_type": "article", "pub_year": "2017", "author_list": "Ghamkhari, Mahdi; Wierman, Adam; et el." }, { "id": "https://authors.library.caltech.edu/records/3q9pa-2am72", "eprint_id": 68789, "eprint_status": "archive", "datestamp": "2023-08-20 13:33:25", "lastmod": "2023-10-20 15:44:01", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Azizan-Ruhi-N", "name": { "family": "Azizan Ruhi", "given": "Navid" }, "orcid": "0000-0002-4299-2963" }, { "id": "Chen-Niangjun", "name": { "family": "Chen", "given": "Niangjun" }, "orcid": "0000-0002-2289-9737" }, { "id": "Dvijotham-K", "name": { "family": "Dvijotham", "given": "Krishnamurthy" }, "orcid": "0000-0002-1328-4677" }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Opportunities for Price Manipulation by Aggregators in Electricity Markets", "ispublished": "pub", "full_text_status": "public", "keywords": "Aggregators, renewables, optimal curtailment, market power, locational marginal price (LMP)", "note": "Copyright is held by author/owner(s).\n\nPublished - p49-ruhi.pdf
Submitted - 1606.06510v1.pdf
", "abstract": "Aggregators are playing an increasingly crucial role for integrating renewable generation into power systems. However, the intermittent nature of renewable generation makes market interactions of aggregators difficult to monitor and regulate, raising concerns about potential market manipulations. In this paper, we address this issue by quantifying the profit an aggregator can obtain through strategic curtailment of generation in an electricity market. We show that, while the problem of maximizing the benefit from curtailment is hard in general, efficient algorithms exist when the topology of the network is radial (acyclic). Further, we highlight that significant increases in profit can be obtained through strategic curtailment in practical settings.", "date": "2016-09", "date_type": "published", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "44", "number": "2", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "49-51", "id_number": "CaltechAUTHORS:20160630-135555342", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20160630-135555342", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/3003977.3003995", "primary_object": { "basename": "p49-ruhi.pdf", "url": "https://authors.library.caltech.edu/records/3q9pa-2am72/files/p49-ruhi.pdf" }, "related_objects": [ { "basename": "1606.06510v1.pdf", "url": "https://authors.library.caltech.edu/records/3q9pa-2am72/files/1606.06510v1.pdf" } ], "resource_type": "article", "pub_year": "2016", "author_list": "Azizan Ruhi, Navid; Chen, Niangjun; et el." }, { "id": "https://authors.library.caltech.edu/records/shbgk-j4w55", "eprint_id": 70361, "eprint_status": "archive", "datestamp": "2023-08-22 18:13:22", "lastmod": "2023-10-20 22:52:33", "type": "article", "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": "pub", "full_text_status": "public", "keywords": "service systems; staffing; routing; scheduling; strategic servers", "note": "\u00a9 2016 Institute for Operations Research and Management Sciences.\n\nReceived: January 27, 2014;\n\nAccepted: March 4, 2016;\n\nPublished Online: June 17, 2016.\n\nSubmitted - 1402.3606v4.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 the system's routing and staffing 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 to maximize a trade-off between an \"effort cost,\" which captures the idea that servers exert more effort when working at a faster rate, and a \"value of idleness,\" which assumes that servers value having 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). We find that the system must operate in a quality-driven regime, in which servers have idle time, for an equilibrium to exist. The implication is that to have an equilibrium solution the staffing must have a first-order term that strictly exceeds that of the common square-root staffing policy. Then, within the class of policies that admit an equilibrium, we (asymptotically) solve the problem of minimizing the total cost, when there are linear staffing costs and linear waiting costs. 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": "2016-07", "date_type": "published", "publication": "Operations Research", "volume": "64", "number": "4", "publisher": "Institute for Operations Research and Management Sciences", "pagerange": "1033-1050", "id_number": "CaltechAUTHORS:20160915-085435818", "issn": "0030-364X", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20160915-085435818", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1287/opre.2016.1506", "primary_object": { "basename": "1402.3606v4.pdf", "url": "https://authors.library.caltech.edu/records/shbgk-j4w55/files/1402.3606v4.pdf" }, "resource_type": "article", "pub_year": "2016", "author_list": "Gopalakrishnan, Ragavendran; Doroudi, Sherwin; et el." }, { "id": "https://authors.library.caltech.edu/records/scptd-gyp92", "eprint_id": 68799, "eprint_status": "archive", "datestamp": "2023-08-22 18:04:28", "lastmod": "2023-10-20 15:44:33", "type": "article", "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": "Provisioning of Large-Scale Systems: The Interplay Between Network Effects and Strategic Behavior in the User Base", "ispublished": "pub", "full_text_status": "restricted", "keywords": "online services; capacity provisioning; network effects; large-scale queueing systems", "note": "\u00a9 2016 INFORMS.\n\nReceived: August 7, 2012. Accepted: February 8, 2015. Published Online: November 20, 2015.", "abstract": "In this paper, we consider the problem of capacity provisioning for an online service supported by advertising. We analyse the strategic interaction between the service provider and the user base in this setting, modeling positive network effects, as well as congestion sensitivity in the user base. We focus specifically on the influence of positive network effects, as well as the impact of noncooperative behavior in the user base on the firm's capacity provisioning decision and its profit. Our analysis reveals that stronger positive network effects, as well as noncooperation in the user base, drive the service into a more congested state and lead to increased profit for the service provider. However, the impact of noncooperation, or \"anarchy\" in the user base strongly dominates the impact of network effects.", "date": "2016-06", "date_type": "published", "publication": "Management Science", "volume": "62", "number": "6", "publisher": "INFORMS", "pagerange": "1830-1841", "id_number": "CaltechAUTHORS:20160701-073920780", "issn": "0025-1909", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20160701-073920780", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1287/mnsc.2015.2210", "resource_type": "article", "pub_year": "2016", "author_list": "Nair, Jayakrishnan; Wierman, Adam; et el." }, { "id": "https://authors.library.caltech.edu/records/jgxjc-j3z92", "eprint_id": 73400, "eprint_status": "archive", "datestamp": "2023-08-20 11:55:44", "lastmod": "2023-10-24 15:19:26", "type": "article", "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": "pub", "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", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "44", "number": "1", "publisher": "Association for Computing Machinery (ACM)", "place_of_pub": "New York, NY", "pagerange": "193-206", "id_number": "CaltechAUTHORS:20170110-154433095", "isbn": "978-1-4503-4266-7", "issn": "0163-5999", "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-154433095", "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/2964791.2901464", "resource_type": "article", "pub_year": "2016", "author_list": "Chen, Niangjun; Comden, Joshua; et el." }, { "id": "https://authors.library.caltech.edu/records/bgcpn-h6e98", "eprint_id": 67464, "eprint_status": "archive", "datestamp": "2023-08-20 11:07:03", "lastmod": "2023-10-18 21:12:35", "type": "article", "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": "pub", "full_text_status": "restricted", "keywords": "First come first served, heavy-tailed traffic, large deviations, last come first served, light-tailed traffic, maximum weight scheduling, response time tail, stability", "note": "\u00a9 2015 IEEE. \n\nManuscript received March 17, 2013; revised February 19, 2014; accepted January 19, 2015; approved by IEEE/ACM TRANSACTIONS ON NETWORKING Editor I. Keslassy. Date of publication March 30, 2015; date of current version April 14, 2016. \n\nThe work of J. Nair and A. Wierman was supported in part by the NSF through grant CNS 0846025 and NetSE grant CNS 0911041, in part by the ARO through MURI grant W911NF-08-1-0233, and in part by Bell Labs, Alcatel-Lucent. The work of J. Nair was also supported in part by an NWO VIDI grant. The work of K. Jagannathan was supported in part by ARO MURI grant W911NF-08-1-0238 and in part by 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 consider a setting where a bursty flow, modeled using heavy-tailed statistics, competes with a more benign, light-tailed flow. 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": "2016-04", "date_type": "published", "publication": "IEEE/ACM Transactions on Networking", "volume": "24", "number": "2", "publisher": "IEEE", "pagerange": "982-995", "id_number": "CaltechAUTHORS:20160527-135934012", "issn": "1063-6692", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20160527-135934012", "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" }, { "agency": "Alcatel-Lucent" }, { "agency": "Nederlandse Organisatie voor Wetenschappelijk Onderzoek (NWO)" }, { "agency": "Army Research Office (ARO)", "grant_number": "W911NF-08-1-0238" }, { "agency": "UK Advanced Technology Center (IUATC)" } ] }, "doi": "10.1109/TNET.2015.2415874", "resource_type": "article", "pub_year": "2016", "author_list": "Nair, Jayakrishnan; Jagannathan, Krishna; et el." }, { "id": "https://authors.library.caltech.edu/records/60xaz-bkz11", "eprint_id": 67570, "eprint_status": "archive", "datestamp": "2023-08-22 17:09:19", "lastmod": "2023-10-18 21:17:47", "type": "article", "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": "pub", "full_text_status": "public", "keywords": "privacy; revealed preference", "note": "\u00a9 2015 INFORMS. \n \nReceived: January 2014; Accepted: September 2015; Published Online: January 12, 2016.\n\nSubmitted - 1401.0336v1.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 end, we introduce an additive model for privacy preferences that has testable implications.", "date": "2016-01", "date_type": "published", "publication": "Operations Research", "volume": "64", "number": "1", "publisher": "Institute for Operations Research and Management Sciences", "pagerange": "67-78", "id_number": "CaltechAUTHORS:20160602-090011567", "issn": "0030-364X", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20160602-090011567", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1287/opre.2015.1458", "primary_object": { "basename": "1401.0336v1.pdf", "url": "https://authors.library.caltech.edu/records/60xaz-bkz11/files/1401.0336v1.pdf" }, "resource_type": "article", "pub_year": "2016", "author_list": "Cummings, Rachel; Echenique, Federico; et el." }, { "id": "https://authors.library.caltech.edu/records/gs16m-2qx02", "eprint_id": 72788, "eprint_status": "archive", "datestamp": "2023-08-22 16:28:15", "lastmod": "2023-10-23 22:56:56", "type": "article", "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": "pub", "full_text_status": "restricted", "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).", "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-10", "date_type": "published", "publication": "ACM SIGCOMM Computer Communication Review", "volume": "45", "number": "4", "publisher": "ACM", "pagerange": "379-392", "id_number": "CaltechAUTHORS:20161213-150643278", "issn": "0146-4833", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20161213-150643278", "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/2829988.2787481", "resource_type": "article", "pub_year": "2015", "author_list": "Ren, Xiaoqi; Ananthanarayanan, Ganesh; et el." }, { "id": "https://authors.library.caltech.edu/records/9ayqz-pdm47", "eprint_id": 59808, "eprint_status": "archive", "datestamp": "2023-08-20 07:56:54", "lastmod": "2023-10-23 22:44:28", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Bose-Subhonmesh", "name": { "family": "Bose", "given": "Subhonmesh" }, "orcid": "0000-0002-3445-4479" }, { "id": "Wu-Chenye", "name": { "family": "Wu", "given": "Chenye" } }, { "id": "Xu-Yunjian", "name": { "family": "Xu", "given": "Yunjian" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Mohsenian-Rad-H", "name": { "family": "Mohsenian-Rad", "given": "Hamed" } } ] }, "title": "A Unifying Market Power Measure for Deregulated Transmission-Constrained Electricity Markets", "ispublished": "pub", "full_text_status": "restricted", "keywords": "Electricity markets, market power", "note": "\u00a9 2015 IEEE.\n\nManuscript received November 28, 2013; revised April 25, 2014 and August\n01, 2014; accepted September 09, 2014. Date of publication October 23,\n2014; date of current version July 17, 2015. \n\nThis work was supported in part by\nNSF through EPAS 1307794, ECCS 1307756, NetSE CNS 0911041, ARPA-E\nthrough GENI DE-AR0000226, Southern California Edison, the National Science\nCouncil of Taiwan through NSC 103- 3113-P-008-001, the Los Alamos\nNational Lab (DoE), and Caltech's Resnick Institute. Paper no. TPWRS-01531-\n2013.\n\nThe authors would like to thank Dr. N. Fromer and Mr.\nP. DeMartini from Resnick Institute at Caltech for their helpful\ncomments. The authors also would like to thank Prof. A. Conejo\n(Editor-in-Chief) and the anonymous reviewers for their inputs.", "abstract": "Market power assessment is a prime concern when designing a deregulated electricity market. In this paper, we propose a new functional market power measure, termed transmission constrained network flow (TCNF), that unifies three large classes of transmission constrained structural market power indices in the literature: residual supply based, network flow based, and minimal generation based. Furthermore, it is suitable for demand-response and renewable integration and hence more amenable to identifying market power in the future smart grid. The measure is defined abstractly, and allows incorporation of power flow equations in multiple ways; we investigate the current market operations using a DC approximation and further explore the possibility of including detailed AC power flow models through semidefinite relaxation, and interior-point algorithms from Matpower. Finally, we provide extensive simulations on IEEE benchmark systems and highlight the complex interaction of engineering constraints with market power assessment.", "date": "2015-09", "date_type": "published", "publication": "IEEE Transactions on Power Systems", "volume": "30", "number": "5", "publisher": "IEEE", "pagerange": "2338-2348", "id_number": "CaltechAUTHORS:20150821-103411487", "issn": "0885-8950", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20150821-103411487", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "EPAS 1307794" }, { "agency": "NSF", "grant_number": "ECCS 1307756" }, { "agency": "NetSE", "grant_number": "CNS 0911041" }, { "agency": "ARPA-E", "grant_number": "GENI DE-AR0000226" }, { "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/TPWRS.2014.2360216", "resource_type": "article", "pub_year": "2015", "author_list": "Bose, Subhonmesh; Wu, Chenye; et el." }, { "id": "https://authors.library.caltech.edu/records/q0619-qb556", "eprint_id": 61135, "eprint_status": "archive", "datestamp": "2023-08-22 16:15:08", "lastmod": "2023-10-24 23:44:09", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Chen-Niangjun", "name": { "family": "Chen", "given": "Niangjun" }, "orcid": "0000-0002-2289-9737" }, { "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": "Greening multi-tenant data center demand response", "ispublished": "pub", "full_text_status": "public", "keywords": "Demand response; Mechanism design; Multi-tenant data center; Supply function bidding", "note": "\u00a9 2015 Copyright is held by author/owner(s).\n\nPublished - p36-chen.pdf
Submitted - 1504.07308.pdf
", "abstract": "Data centers have become critical resources for emergency\ndemand response (EDR). However, currently, data centers\ntypically participate in EDR by turning on backup (diesel)\ngenerators, which are both expensive and environmentally\nunfriendly. In this paper, we focus on \"greening\" demand\nresponse in multi-tenant data centers by incentivizing tenants' load reduction and reducing on-site diesel generation. Our proposed mechanism, ColoEDR, which is based on parameterized supply function mechanism, provides provably near-optimal efficiency guarantees, both when tenants are price-taking and when they are price-anticipating.", "date": "2015-09", "date_type": "published", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "43", "number": "2", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "36-38", "id_number": "CaltechAUTHORS:20151015-080757078", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20151015-080757078", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/2825236.2825252", "primary_object": { "basename": "p36-chen.pdf", "url": "https://authors.library.caltech.edu/records/q0619-qb556/files/p36-chen.pdf" }, "related_objects": [ { "basename": "1504.07308.pdf", "url": "https://authors.library.caltech.edu/records/q0619-qb556/files/1504.07308.pdf" } ], "resource_type": "article", "pub_year": "2015", "author_list": "Chen, Niangjun; Ren, Xiaoqi; et el." }, { "id": "https://authors.library.caltech.edu/records/wdn4g-a4g56", "eprint_id": 60480, "eprint_status": "archive", "datestamp": "2023-08-22 16:14:52", "lastmod": "2023-10-24 16:35:26", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Chen-Niangjun", "name": { "family": "Chen", "given": "Niangjun" }, "orcid": "0000-0002-2289-9737" }, { "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": "Greening multi-tenant data center demand response", "ispublished": "pub", "full_text_status": "public", "keywords": "Demand response; Mechanism design; Multi-tenant data center; Supply function bidding", "note": "\u00a9 2015 Elsevier B.V.\n\nAvailable online 4 July 2015.\n\nThis work is supported in part by the US NSF CNS-1319820, EPAS-1307794, CNS-1423137, and CNS-1453491.\n\nSubmitted - 1504.07308v1.pdf
", "abstract": "Data centers have emerged as promising resources for demand response, particularly for emergency demand response (EDR), which saves the power grid from incurring blackouts during emergency situations. However, currently, data centers typically participate in EDR by turning on backup (diesel) generators, which is both expensive and environmentally unfriendly. In this paper, we focus on \"greening\" demand response in multi-tenant data centers, i.e., colocation data centers, by designing a pricing mechanism through which the data center operator can efficiently extract load reductions from tenants during emergency periods for EDR. In particular, we propose a pricing mechanism for both mandatory and voluntary EDR programs, ColoEDR, that is based on parameterized supply function bidding and provides provably near-optimal efficiency guarantees, both when tenants are price-taking and when they are price-anticipating. In addition to analytic results, we extend the literature on supply function mechanism design, and evaluate ColoEDR using trace-based simulation studies. These validate the efficiency analysis and conclude that the pricing mechanism is both beneficial to the environment and to the data center operator (by decreasing the need for backup diesel generation), while also aiding tenants (by providing payments for load reductions).", "date": "2015-09", "date_type": "published", "publication": "Performance Evaluation", "volume": "91", "publisher": "Elsevier", "pagerange": "229-254", "id_number": "CaltechAUTHORS:20150924-103805864", "issn": "0166-5316", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20150924-103805864", "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-1423137" }, { "agency": "NSF", "grant_number": "CNS-1453491" } ] }, "doi": "10.1016/j.peva.2015.06.014", "primary_object": { "basename": "1504.07308v1.pdf", "url": "https://authors.library.caltech.edu/records/wdn4g-a4g56/files/1504.07308v1.pdf" }, "resource_type": "article", "pub_year": "2015", "author_list": "Chen, Niangjun; Ren, Xiaoqi; et el." }, { "id": "https://authors.library.caltech.edu/records/13w39-9b151", "eprint_id": 61132, "eprint_status": "archive", "datestamp": "2023-08-20 07:59:33", "lastmod": "2023-10-24 23:44:04", "type": "article", "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": "Speculation-aware Cluster Scheduling", "ispublished": "pub", "full_text_status": "public", "note": "\u00a9 2015 Copyright is held by author/owner(s).\n\nPublished - p42-ren.pdf
", "abstract": "Stragglers are a crucial roadblock to achieving predictable performance in today's clusters. Speculation has been widely adopted in order 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, based on a simple model and its analysis, we design Hopper, a job scheduler that is speculation-aware, i.e., that integrates the tradeoffs associated with speculation into job scheduling decisions.", "date": "2015-09", "date_type": "published", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "43", "number": "2", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "42-44", "id_number": "CaltechAUTHORS:20151015-074525793", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20151015-074525793", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/2825236.2825254", "primary_object": { "basename": "p42-ren.pdf", "url": "https://authors.library.caltech.edu/records/13w39-9b151/files/p42-ren.pdf" }, "resource_type": "article", "pub_year": "2015", "author_list": "Ren, Xiaoqi; Ananthanarayanan, Ganesh; et el." }, { "id": "https://authors.library.caltech.edu/records/k9exb-x2241", "eprint_id": 69849, "eprint_status": "archive", "datestamp": "2023-09-22 22:37:46", "lastmod": "2023-10-23 23:25:18", "type": "article", "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": "pub", "full_text_status": "public", "keywords": "Algorithms, Performance, Theory", "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.06681.pdf
", "abstract": "Making use of predictions is a crucial, but under-explored, area of online algorithms. This paper studies a class of on-line 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", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "43", "number": "1", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "191-204", "id_number": "CaltechAUTHORS:20160823-104652452", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20160823-104652452", "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/2796314.2745854", "primary_object": { "basename": "1504.06681.pdf", "url": "https://authors.library.caltech.edu/records/k9exb-x2241/files/1504.06681.pdf" }, "resource_type": "article", "pub_year": "2015", "author_list": "Chen, Niangjun; Agarwal, Anish; et el." }, { "id": "https://authors.library.caltech.edu/records/39n1e-c6366", "eprint_id": 56929, "eprint_status": "archive", "datestamp": "2023-08-22 15:04:04", "lastmod": "2023-10-23 16:08:48", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Wang-Kai-ComputerScience", "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\n dynamic resizing in data centers", "ispublished": "pub", "full_text_status": "restricted", "keywords": "Data centers; Dynamic resizing; Energy efficient IT; Stochastic network calculus", "note": "\u00a9 2014 Elsevier B.V. Received 18 May 2013, Revised 6 October 2014, Accepted 15 December 2014, Available online 23 December 2014.\n\nThis research is supported by the NSF grant of China (No. 61303058), the Strategic Priority Research Program of the\nChinese Academy of Sciences (No. XDA06010600), the 973 Program of China (No. 2010CB328105), and NSF grant Computer\nand Network Systems 0846025 and DoE grant DE-EE0002890.", "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": "2015-03", "date_type": "published", "publication": "Performance Evaluation", "volume": "85-86", "publisher": "Elsevier", "pagerange": "1-18", "id_number": "CaltechAUTHORS:20150423-142020594", "issn": "0166-5316", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20150423-142020594", "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": "61303058" }, { "agency": "Chinese Academy of Sciences", "grant_number": "XDA06010600" }, { "agency": "973 Program of China", "grant_number": "2010CB328105" }, { "agency": "NSF", "grant_number": "CNS-0846025" }, { "agency": "Department of Energy (DOE)", "grant_number": "DE-EE0002890" } ] }, "doi": "10.1016/j.peva.2014.12.001", "resource_type": "article", "pub_year": "2015", "author_list": "Wang, Kai; Lin, Minghong; et el." }, { "id": "https://authors.library.caltech.edu/records/3sgh0-qn985", "eprint_id": 53336, "eprint_status": "archive", "datestamp": "2023-08-22 14:05:17", "lastmod": "2023-10-19 14:46:55", "type": "article", "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": "pub", "full_text_status": "public", "keywords": "cost sharing; game theory; marginal contribution; Nash equilibrium; Shapley value", "note": "\u00a9 2014 INFORMS. \n\nReceived: April 12, 2013; Published Online: May 27, 2014.\n\nThis research was supported by AFOSR [Grants FA9550-09-1-0538, FA9550-12-1-0359], ONR [Grant N00014-12-1-0643], and NSF [Grants CNS-0846025, CCF-1101470].\n\nSubmitted - 1402.3610.pdf
", "abstract": "We consider the problem of designing distribution rules to share \"welfare\" (cost or revenue) among individually strategic agents. There are many known distribution rules that 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 guarantees the existence of a Nash equilibrium is unknown. Our work provides an exact characterization of this space for a specific class of scalable and separable games that includes a variety of applications such as facility location, routing, network formation, and coverage games. Given arbitrary local welfare functions.", "date": "2014-11", "date_type": "published", "publication": "Mathematics of Operations Research", "volume": "39", "number": "4", "publisher": "INFORMS", "pagerange": "1252-1296", "id_number": "CaltechAUTHORS:20150108-102735345", "issn": "0364-765X", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20150108-102735345", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Air Force Office of Scientific Research (AFOSR)", "grant_number": "FA9550-09-1-0538" }, { "agency": "Air Force Office of Scientific Research (AFOSR)", "grant_number": "FA9550-12-1-0359" }, { "agency": "Office of Naval Research (ONR)", "grant_number": "N00014-12-1-0643" }, { "agency": "NSF", "grant_number": "CNS-0846025" }, { "agency": "NSF", "grant_number": "CCF-1101470" } ] }, "doi": "10.1287/moor.2014.0651", "primary_object": { "basename": "1402.3610.pdf", "url": "https://authors.library.caltech.edu/records/3sgh0-qn985/files/1402.3610.pdf" }, "resource_type": "article", "pub_year": "2014", "author_list": "Gopalakrishnan, Ragavendran; Marden, Jason R.; et el." }, { "id": "https://authors.library.caltech.edu/records/5d2yb-5b959", "eprint_id": 52415, "eprint_status": "archive", "datestamp": "2023-08-20 03:07:16", "lastmod": "2023-10-18 19:50:40", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Courcoubetis-C", "name": { "family": "Courcoubetis", "given": "Costas" } }, { "id": "Gu\u00e9rin-R", "name": { "family": "Gu\u00e9rin", "given": "Roch" } }, { "id": "Loiseau-P", "name": { "family": "Loiseau", "given": "Patrick" } }, { "id": "Parkes-D", "name": { "family": "Parkes", "given": "David" } }, { "id": "Walrand-J", "name": { "family": "Walrand", "given": "Jean" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Special Issue on Pricing and Incentives in Networks and Systems: Guest Editors' Introduction", "ispublished": "pub", "full_text_status": "restricted", "note": "\u00a9 2014 ACM.\n\nPublication date: October 2014.", "abstract": "Today's communication networks and networked systems are highly complex and heterogeneous\nand are often owned by profit-making entities. For new technologies or\ninfrastructure designs to be adopted, they must not only be based on sound engineering\nperformance considerations but also present the right economic incentives. Recent\nchanges in regulations of the telecommunication industry make such economic considerations\neven more urgent. For instance, new concerns such as network neutrality\nhave a significant impact on the evolution of communication networks.\nAt the same time, communication networks and networked systems support increasing\neconomic activity based on applications and services such as cloud computing,\nsocial networks, and peer-to-peer networks. These applications pose new challenges\nincluding the development of good pricing and incentive mechanisms to promote effective\nsystem-wide behavior. Similarly, the security and privacy of these applications are\nthemselves heavily dependent on economic considerations, which therefore need to be\nfully understood.\nTo address these questions, this special issue brings together a relevant set of state-of-the-art research contributions on complementary topics including communication\nnetworks, wireless networks, web content and security, and the use of multidisciplinary\napproaches ranging from game theory and economic modeling to algorithms\nand mechanism design, and including empirical studies.", "date": "2014-10", "date_type": "published", "publication": "ACM Transactions on Internet Technology", "volume": "14", "number": "2-3", "publisher": "Association for Computing Machinery", "pagerange": "Art. No. 8", "id_number": "CaltechAUTHORS:20141204-160518575", "issn": "1533-5399", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20141204-160518575", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/2665064", "resource_type": "article", "pub_year": "2014", "author_list": "Courcoubetis, Costas; Gu\u00e9rin, Roch; et el." }, { "id": "https://authors.library.caltech.edu/records/cg4a0-30b78", "eprint_id": 49765, "eprint_status": "archive", "datestamp": "2023-08-20 02:43:45", "lastmod": "2023-10-17 22:10:39", "type": "article", "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 cloud services", "ispublished": "pub", "full_text_status": "restricted", "note": "\u00a9 2014 ACM.", "abstract": "Motivated by cloud services, we consider the interplay of network effects, congestion, and competition in ad-supported services. 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 the competition in a marketplace of ad-supported services. Further, our analysis highlights an important contrast between firm-specific and industry-wide network effects: 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", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "42", "number": "2", "publisher": "Association for Computing Machinery", "pagerange": "30-32", "id_number": "CaltechAUTHORS:20140917-082453194", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20140917-082453194", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/2667522.2667531", "resource_type": "article", "pub_year": "2014", "author_list": "Nair, Jayakrishnan; Subramanian, Vijay G.; et el." }, { "id": "https://authors.library.caltech.edu/records/2cmpe-xt313", "eprint_id": 47910, "eprint_status": "archive", "datestamp": "2023-08-20 01:09:36", "lastmod": "2023-10-26 21:20:47", "type": "article", "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": "pub", "full_text_status": "public", "note": "\u00a9 2014 ACM. The authors gratefully acknowledge the support of the NSF\nthrough grant CNS 0846025 and NetSE grant CNS 0911041,\nthe ARO through MURI grant W911NF-08-1-0233, and Bell\nLabs, Alcatel-Lucent. The first author also acknowledges\nsupport from an NWO VIDI grant.\n\nAccepted Version - nair_wind.pdf
", "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", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "42", "number": "1", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "85-97", "id_number": "CaltechAUTHORS:20140804-132430669", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20140804-132430669", "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) Multidisciplinary University Research Initiative (MURI)", "grant_number": "W911NF-08-1-0233" }, { "agency": "Nederlandse Organisatie voor Wetenschappelijk Onderzoek (NWO)" } ] }, "doi": "10.1145/2591971.2591982", "primary_object": { "basename": "nair_wind.pdf", "url": "https://authors.library.caltech.edu/records/2cmpe-xt313/files/nair_wind.pdf" }, "resource_type": "article", "pub_year": "2014", "author_list": "Nair, Jayakrishnan; Adlakha, Sachin; et el." }, { "id": "https://authors.library.caltech.edu/records/8vqy3-0p575", "eprint_id": 47912, "eprint_status": "archive", "datestamp": "2023-08-20 01:09:45", "lastmod": "2023-10-26 21:20:55", "type": "article", "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": "pub", "full_text_status": "public", "keywords": "data center, demand response, prediction based pricing, power\nnetwork", "note": "\u00a9 ACM, Inc. This work was supported by NSF grants CCF 0830511, CNS\n0911041, and CNS 0846025, DoE grant DE-EE0002890, ARO\nMURI grant W911NF-08-1-0233, Microsoft Research, Bell\nLabs, the Lee Center for Advanced Networking, and ARC\ngrant FT0991594.\n\nAccepted Version - DCDRpricing.pdf
", "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", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "42", "number": "1", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "111-123", "id_number": "CaltechAUTHORS:20140804-133949957", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20140804-133949957", "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": "Lee Center for Advanced Networking, Caltech" }, { "agency": "ARC", "grant_number": "FT0991594" } ] }, "doi": "10.1145/2591971.2592004", "primary_object": { "basename": "DCDRpricing.pdf", "url": "https://authors.library.caltech.edu/records/8vqy3-0p575/files/DCDRpricing.pdf" }, "resource_type": "article", "pub_year": "2014", "author_list": "Liu, Zhenhua; Liu, Iris; et el." }, { "id": "https://authors.library.caltech.edu/records/hh5kz-zmf44", "eprint_id": 53449, "eprint_status": "archive", "datestamp": "2023-08-20 01:11:28", "lastmod": "2023-10-19 21:45:49", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Anselmi-J", "name": { "family": "Anselmi", "given": "Jonatha" } }, { "id": "Ardagna-D", "name": { "family": "Ardagna", "given": "Danilo" } }, { "id": "Lui-John-C-S", "name": { "family": "Lui", "given": "John C. S." } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Xu-Yunjian", "name": { "family": "Xu", "given": "Yunjian" } }, { "id": "Yang-Zichao", "name": { "family": "Yang", "given": "Zichao" } } ] }, "title": "The Economics of the Cloud: Price Competition and Congestion", "ispublished": "pub", "full_text_status": "restricted", "keywords": "Cloud computing, pricing, network economics, congestion", "note": "\u00a9 2015 ACM, Inc.", "abstract": "This letter provides an overview of our recent work studying the impacts of price competition and congestion in the cloud marketplace. Specifically, we discuss a three-tier market model that studies a vertical marketplace where users purchase services from Software-as-a-Service (SaaS) providers, which in turn purchase computing resources from either Provider-as-a-Service (PaaS) or Infrastructure-as-a-Service (IaaS) providers.", "date": "2014-06", "date_type": "published", "publication": "ACM SIGecom Exchanges", "volume": "13", "number": "1", "publisher": "Association for Computing Machinery", "pagerange": "58-63", "id_number": "CaltechAUTHORS:20150109-074030107", "issn": "1551-9031", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20150109-074030107", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/2692375.2692380", "resource_type": "article", "pub_year": "2014", "author_list": "Anselmi, Jonatha; Ardagna, Danilo; et el." }, { "id": "https://authors.library.caltech.edu/records/nqgqj-djm27", "eprint_id": 53549, "eprint_status": "archive", "datestamp": "2023-08-19 23:57:20", "lastmod": "2023-10-19 21:51:20", "type": "article", "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" }, "orcid": "0000-0001-6476-3048" }, { "id": "Andrew-L-L-H", "name": { "family": "Andrew", "given": "Lachlan L. H." } } ] }, "title": "Greening Geographical Load Balancing", "ispublished": "pub", "full_text_status": "restricted", "keywords": "Data centers, demand response, distributed algorithms, geographical load balancing, renewable energy", "note": "\u00a9 2014 IEEE.\n\nManuscript received March 25, 2013; revised December 16, 2013; accepted January 23, 2014; approved by IEEE/ACM TRANSACTIONS ON NETWORKING Editor A. Capone. This work was supported by the NSF under Grants CCF 0830511, CNS 0911041, and CNS 0846025; the DoE under Grant DE-EE0002890; the ARO MURI under Grant W911NF-08-1-0233; Microsoft Research; Bell Labs; the Lee Center for Advanced Networking; and the ARC under Grants FT0991594 and DP130101378.\n\nThis is an extension of a conference paper in the ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS), San Jose, CA, USA, June 7\u201311, 2011.", "abstract": "Energy expenditure has become a significant fraction of data center operating costs. Recently, \"geographical load balancing\" has been proposed to reduce energy cost by exploiting the electricity price differences across regions. However, this reduction of cost can paradoxically increase total energy use. We explore whether the geographical diversity of Internet-scale systems can also 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 three distributed algorithms for achieving optimal geographical load balancing. Second, we show that if the price of electricity is proportional to the instantaneous fraction of the total energy that is brown, then geographical load balancing significantly reduces brown energy use. However, the benefits depend strongly on dynamic energy pricing and the form of pricing used.", "date": "2014-03-12", "date_type": "published", "publication": "IEEE/ACM Transactions on Networking", "volume": "23", "number": "2", "publisher": "IEEE", "pagerange": "657-671", "id_number": "CaltechAUTHORS:20150112-084413455", "issn": "1063-6692", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20150112-084413455", "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 (ARC)", "grant_number": "FT0991594" }, { "agency": "Australian Research Council (ARC)", "grant_number": "DP130101378" } ] }, "doi": "10.1109/TNET.2014.2308295", "resource_type": "article", "pub_year": "2014", "author_list": "Liu, Zhenhua; Lin, Minghong; et el." }, { "id": "https://authors.library.caltech.edu/records/6g543-08780", "eprint_id": 47683, "eprint_status": "archive", "datestamp": "2023-08-19 22:25:24", "lastmod": "2023-10-26 21:09:49", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Lin-Minghong", "name": { "family": "Lin", "given": "Minghong" } }, { "id": "Zhang-Li", "name": { "family": "Zhang", "given": "Li" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Tan-Jian", "name": { "family": "Tan", "given": "Jian" } } ] }, "title": "Joint Optimization of Overlapping Phases in MapReduce", "ispublished": "pub", "full_text_status": "restricted", "note": "Copyright is held by author/owner(s).\n\nThis work was supported by NSF grants CNS 0846025, DoE\ngrant DE-EE0002890 and IBM Research.", "abstract": "MapReduce is a scalable parallel computing framework for\nbig data processing. It exhibits multiple processing phases,\nand thus an efficient job scheduling mechanism is crucial for ensuring efficient resource utilization. This work studies the scheduling challenge that results from the overlapping of the \"map\" and \"shuffle\" phases in MapReduce. We propose a new, general model for this scheduling problem. Further, we prove that scheduling to minimize average response time\nin this model is strongly NP-hard in the offline case and\nthat no online algorithm can be constant-competitive in the\nonline case. However, we provide two online algorithms that\nmatch the performance of the offline optimal when given a\nslightly faster service rate.", "date": "2013-12", "date_type": "published", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "41", "number": "3", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "16-18", "id_number": "CaltechAUTHORS:20140730-162927910", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20140730-162927910", "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": "IBM Research" } ] }, "doi": "10.1145/2567529.2567534", "resource_type": "article", "pub_year": "2013", "author_list": "Lin, Minghong; Zhang, Li; et el." }, { "id": "https://authors.library.caltech.edu/records/ck0zw-r0d05", "eprint_id": 43921, "eprint_status": "archive", "datestamp": "2023-08-22 10:37:45", "lastmod": "2023-10-26 00:00:44", "type": "article", "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": "pub", "full_text_status": "restricted", "keywords": "Capacity provisioning; data centers; energy efficiency; online algorithms", "note": "\u00a9 2012 IEEE.\n\nManuscript received February 20, 2012; revised July 27, 2012; accepted October 04, 2012; approved by IEEE/ACM TRANSACTIONS ON NETWORKING Editor Y. Bejerano. Date of publication November 22, 2012; date of current version October 11, 2013. \n\nThis work was supported by the NSF under Grants CCF\n0830511 and CNS 0846025, Microsoft Research, the Lee Center for Advanced Networking, and the ARC under Grant FT0991594.", "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 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 propose a very general model and 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. Additionally, we contrast this new algorithm with the more traditional approach of receding horizon control.", "date": "2013-10-17", "date_type": "published", "publication": "IEEE/ACM Transactions on Networking", "volume": "21", "number": "5", "publisher": "IEEE", "pagerange": "1378-1391", "id_number": "CaltechAUTHORS:20140221-092537914", "issn": "1063-6692", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20140221-092537914", "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" } ] }, "doi": "10.1109/TNET.2012.2226216", "resource_type": "article", "pub_year": "2013", "author_list": "Lin, Minghong; Wierman, Adam; et el." }, { "id": "https://authors.library.caltech.edu/records/2ma2b-6qk27", "eprint_id": 42458, "eprint_status": "archive", "datestamp": "2023-08-22 10:28:40", "lastmod": "2023-10-25 16:04:16", "type": "article", "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 peak via workload shifting and local generation", "ispublished": "pub", "full_text_status": "restricted", "keywords": "Demand response; Data center; Renewable penetration; Workload management; Online algorithm; Prediction error", "note": "\u00a9 2013 Elsevier B.V. All rights reserved. Available online 29 August 2013. This work was supported by NSF grants CNS-0846025, CNS-1319820, DoE grant DE-EE0002890, and HP Labs. We are also\ngrateful to Pablo Bauleo from Fort Collins Utilities for his comments and insights.", "abstract": "Demand response is a crucial aspect of the future smart grid. It has the potential to provide significant peak demand reduction and to ease the incorporation of renewable energy into the grid. Data centers' participation in demand response is becoming increasingly important given their high and increasing energy consumption and their flexibility in demand management compared to conventional industrial facilities. In this paper, we study two demand response schemes to reduce a data center's peak loads and energy expenditure: workload shifting and the use of local power generation. We conduct a detailed characterization study of coincident peak data over two decades from Fort Collins Utilities, Colorado and then develop two algorithms for data centers by combining workload scheduling and local power generation to avoid the coincident peak and reduce the energy expenditure. The first algorithm optimizes the expected cost and the second one provides a good worst-case guarantee for any coincident peak pattern, workload demand and renewable generation prediction error distributions. We evaluate these algorithms via numerical simulations based on real world traces from production systems. The results show that using workload shifting in combination with local generation can provide significant cost savings (up to 40% under the Fort Collins Utilities charging scheme) compared to either alone.", "date": "2013-10", "date_type": "published", "publication": "Performance Evaluation", "volume": "70", "number": "10", "publisher": "Elsevier", "pagerange": "770-791", "id_number": "CaltechAUTHORS:20131114-120720977", "issn": "0166-5316", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20131114-120720977", "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": "CNS-1319820" }, { "agency": "Department of Energy (DOE)", "grant_number": "DE-EE0002890" }, { "agency": "HP Labs" } ] }, "doi": "10.1016/j.peva.2013.08.014", "resource_type": "article", "pub_year": "2013", "author_list": "Liu, Zhenhua; Wierman, Adam; et el." }, { "id": "https://authors.library.caltech.edu/records/gxzj1-p9421", "eprint_id": 41556, "eprint_status": "archive", "datestamp": "2023-08-19 21:35:57", "lastmod": "2023-10-24 23:50:26", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Lin-Minghong", "name": { "family": "Lin", "given": "Minghong" } }, { "id": "Zhang-Li", "name": { "family": "Zhang", "given": "Li" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Tan-Jian", "name": { "family": "Tan", "given": "Jian" } } ] }, "title": "Joint Optimization of Overlapping Phases in MapReduce", "ispublished": "pub", "full_text_status": "public", "keywords": "MapReduce, Job scheduling, Overlapping tandem queues", "note": "\u00a9 2013 Elsevier B.V.\n\nAvailable online 28 August 2013.\n\nAccepted Version - performance-mapreduce.pdf
", "abstract": "MapReduce is a scalable parallel computing framework for big data processing. It exhibits multiple\nprocessing phases, and thus an efficient job scheduling mechanism is crucial for ensuring efficient resource\nutilization. There are a variety of scheduling challenges within the MapReduce architecture, and this paper\nstudies the challenges that result from the overlapping of the \"map\" and \"shuffle\" phases. We propose\na new, general model for this scheduling problem, and validate this model using cluster experiments.\nFurther, we prove that scheduling to minimize average response time in this model is strongly NP-hard\nin the offline case and that no online algorithm can be constant-competitive. However, we provide two\nonline algorithms that match the performance of the offline optimal when given a slightly faster service\nrate (i.e., in the resource augmentation framework). Finally, we validate the algorithms using a workload\ntrace from a Google cluster and show that the algorithms are near optimal in practical settings.", "date": "2013-10", "date_type": "published", "publication": "Performance Evaluation", "volume": "70", "number": "10", "publisher": "Elsevier", "pagerange": "720-735", "id_number": "CaltechAUTHORS:20130930-120231815", "issn": "0166-5316", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20130930-120231815", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1016/j.peva.2013.08.013", "primary_object": { "basename": "performance-mapreduce.pdf", "url": "https://authors.library.caltech.edu/records/gxzj1-p9421/files/performance-mapreduce.pdf" }, "resource_type": "article", "pub_year": "2013", "author_list": "Lin, Minghong; Zhang, Li; et el." }, { "id": "https://authors.library.caltech.edu/records/cbbaw-cqb13", "eprint_id": 66316, "eprint_status": "archive", "datestamp": "2023-08-19 20:17:46", "lastmod": "2023-10-18 17:58:18", "type": "article", "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": "pub", "full_text_status": "public", "note": "\u00a9 2013 ACM. \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\" (SOCO) problems, which are a hybrid between\nonline convex optimization (OCO) and metrical task system\n(MTS) problems. Historically, the performance metric\nfor OCO was regret and that for MTS was competitive ratio\n(CR). There are algorithms with either sublinear regret or\nconstant 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", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "41", "number": "1", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "329-330", "id_number": "CaltechAUTHORS:20160420-130614870", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20160420-130614870", "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/2494232.2465533", "primary_object": { "basename": "1508.03769.pdf", "url": "https://authors.library.caltech.edu/records/cbbaw-cqb13/files/1508.03769.pdf" }, "resource_type": "article", "pub_year": "2013", "author_list": "Andrew, Lachlan; Barman, Siddharth; et el." }, { "id": "https://authors.library.caltech.edu/records/t6bcv-qs782", "eprint_id": 72349, "eprint_status": "archive", "datestamp": "2023-08-19 20:18:18", "lastmod": "2023-10-23 21:39:39", "type": "article", "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 peak via workload shifting and local generation", "ispublished": "pub", "full_text_status": "public", "keywords": "Demand response, coincident peak pricing, data center, work-load shifting, online algorithm", "note": "Copyright is held by the author/owner(s). \n\nThis work was supported by NSF grants CNS 0846025, DoE grant DE-EE0002890, and HP Labs.\n\nPublished - p341-liu.pdf
", "abstract": "Demand response is a crucial aspect of the future smart grid. It has the potential to provide significant peak demand reduction and to ease the incorporation of renewable energy into the grid. Data centers' participation in demand response is becoming increasingly important given the high and increasing energy consumption and the flexibility in demand management in data centers compared to conventional industrial facilities. In this extended abstract we briefly describe recent work in our full paper on two demand response schemes to reduce a data center's peak loads and energy expenditure: workload shifting and the use of local power generations. In our full paper, we conduct a detailed characterization study of coincident peak data over two decades from Fort Collins Utilities, Colorado and then develop two algorithms for data centers by combining workload scheduling and local power generation to avoid the coincident peak and reduce the energy expenditure. The first algorithm optimizes the expected cost and the second one provides a good worst-case guarantee for any coincident peak pattern. We evaluate these algorithms via numerical simulations based on real world traces from production systems. The results show that using workload shifting in combination with local generation can provide significant cost savings (up to 40% in the Fort Collins Utilities' case) compared to either alone.", "date": "2013-06", "date_type": "published", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "41", "number": "4", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "341-342", "id_number": "CaltechAUTHORS:20161128-165016440", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20161128-165016440", "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/2494232.2465740", "primary_object": { "basename": "p341-liu.pdf", "url": "https://authors.library.caltech.edu/records/t6bcv-qs782/files/p341-liu.pdf" }, "resource_type": "article", "pub_year": "2013", "author_list": "Liu, Zhenhua; Wierman, Adam; et el." }, { "id": "https://authors.library.caltech.edu/records/ana1w-2z968", "eprint_id": 39444, "eprint_status": "archive", "datestamp": "2023-08-22 09:29:31", "lastmod": "2023-10-24 16:49:09", "type": "article", "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 the Limitations of Utility Design for Multiagent Systems", "ispublished": "pub", "full_text_status": "restricted", "keywords": "Cost sharing; distributed control; game theory; price of anarchy", "note": "\u00a9 2013 IEEE.\n\n\nManuscript received May 24, 2011; revised October 24, 2011; accepted May\n22, 2012. Date of publication January 04, 2013; date of current version May\n20, 2013. This work was supported by AFOSR grants #FA9550-09-1-0538 and\n#FA9550-12-1-0359, ONR grant #N00014-12-1-0643, and NSF grant #CCF-0830511. The conference version of this paper appeared in [1]. Recommended\nby Associate Editor H. S. Chang.", "abstract": "Cooperative control focuses on deriving desirable collective behavior in multiagent systems through the design of local control algorithms. Game theory is beginning to emerge as a valuable set of tools for achieving this objective. A central component of this game theoretic approach is the assignment of utility functions to the individual agents. Here, the goal is to assign utility functions within an \"admissible\" design space such that the resulting game possesses desirable properties. Our first set of results illustrates the complexity associated with such a task. In particular, we prove that if we restrict the class of utility functions to be local, scalable, and budget-balanced then 1) ensuring that the resulting game possesses a pure Nash equilibrium requires computing a Shapley value, which can be computationally prohibitive for large-scale systems, and 2) ensuring that the allocation which optimizes the system level objective is a pure Nash equilibrium is impossible. The last part of this paper demonstrates that both limitations can be overcome by introducing an underlying state space into the potential game structure.", "date": "2013-06", "date_type": "published", "publication": "IEEE Transactions on Automatic Control", "volume": "58", "number": "6", "publisher": "IEEE", "pagerange": "1402-1415", "id_number": "CaltechAUTHORS:20130718-111911401", "issn": "0018-9286", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20130718-111911401", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Air Force Office of Scientific Research (AFOSR)", "grant_number": "FA9550-09-1-0538" }, { "agency": "Air Force Office of Scientific Research (AFOSR)", "grant_number": "FA9550-12-1-0359" }, { "agency": "Office of Naval Research (ONR)", "grant_number": "N00014-12-1-0643" }, { "agency": "NSF", "grant_number": "CCF-0830511" } ] }, "doi": "10.1109/TAC.2013.2237831", "resource_type": "article", "pub_year": "2013", "author_list": "Marden, Jason R. and Wierman, Adam" }, { "id": "https://authors.library.caltech.edu/records/bwxtf-nbp83", "eprint_id": 72609, "eprint_status": "archive", "datestamp": "2023-08-19 20:18:23", "lastmod": "2023-10-23 22:46:11", "type": "article", "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": "The Fundamentals of Heavy-tails: Properties, Emergence, and Identification", "ispublished": "pub", "full_text_status": "public", "keywords": "Heavy-tailed distributions", "note": "Copyright is held by the author/owner(s).\n\nPublished - p387-nair.pdf
", "abstract": "Heavy-tails are a continual source of excitement and confusion across disciplines as they are repeatedly \"discovered\" in new contexts. This is especially true within computer systems, where heavy-tails seemingly pop up everywhere -- from degree distributions in the internet and social networks to file sizes and interarrival times of workloads. However, despite nearly a decade of work on heavy-tails they are still treated 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 their counter-intuitive properties; we will highlight that their emergence should be expected (not surprising) by showing that a wide variety of general processes lead to heavy-tailed distributions; and we will highlight that most of the controversy surrounding heavy-tails is the result of bad statistics, and can be avoided by using the proper tools.", "date": "2013-06", "date_type": "published", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "41", "number": "1", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "387", "id_number": "CaltechAUTHORS:20161206-160007274", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20161206-160007274", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/2494232.2466587", "primary_object": { "basename": "p387-nair.pdf", "url": "https://authors.library.caltech.edu/records/bwxtf-nbp83/files/p387-nair.pdf" }, "resource_type": "article", "pub_year": "2013", "author_list": "Nair, Jayakrishnan; Wierman, Adam; et el." }, { "id": "https://authors.library.caltech.edu/records/bc67q-z0253", "eprint_id": 37881, "eprint_status": "archive", "datestamp": "2023-08-22 08:07:06", "lastmod": "2023-10-23 19:05:12", "type": "article", "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", "ispublished": "pub", "full_text_status": "public", "keywords": "resource allocation; game theory; distributed control", "note": "\u00a9 2013 INFORMS.\n\nReceived July 2010; revisions received August 2011, August 2012; accepted September 2012. Published online\nin Articles in Advance February 8, 2013.\n\n\nThe authors thank the reviewers and editors of the paper for\ntheir valuable feedback, which improved the paper significantly.\nThis work was supported by Air Force Office of Scientific\nResearch [Grant FA9550-12-1-0359], Office of Naval Research\n[Grant N00014-12-1-0643], and the National Science Foundation\n[Grant CNS 0846025].\n\nPublished - 155.full.pdf
", "abstract": "Game-theoretic tools are becoming a popular design choice for distributed resource allocation algorithms. A central component of this design choice is the assignment of utility functions to the individual agents. The goal is to assign each agent an admissible utility function such that the resulting game possesses a host of desirable properties, including scalability, tractability, and existence and efficiency of pure Nash equilibria. In this paper we formally study this question of utility design on a class of games termed distributed welfare games. We identify several utility design methodologies that guarantee desirable game properties irrespective of the specific application domain. Lastly, we illustrate the results in this paper on two commonly studied classes of resource allocation problems: \"coverage\" problems and \"coloring\" problems.", "date": "2013-01", "date_type": "published", "publication": "Operations Research", "volume": "61", "number": "1", "publisher": "Institute for Operations Research and Management Sciences", "pagerange": "155-168", "id_number": "CaltechAUTHORS:20130411-094140621", "issn": "0030-364X", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20130411-094140621", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Air Force Office of Scientific Research (AFOSR)", "grant_number": "FA9550-12-1-0359" }, { "agency": "Office of Naval Research (ONR)", "grant_number": "N00014-12-1-0643" }, { "agency": "NSF", "grant_number": "CNS 0846025" } ] }, "doi": "10.1287/opre.1120.1137", "primary_object": { "basename": "155.full.pdf", "url": "https://authors.library.caltech.edu/records/bc67q-z0253/files/155.full.pdf" }, "resource_type": "article", "pub_year": "2013", "author_list": "Marden, Jason R. and Wierman, Adam" }, { "id": "https://authors.library.caltech.edu/records/96vkn-atn68", "eprint_id": 72263, "eprint_status": "archive", "datestamp": "2023-08-19 13:43:49", "lastmod": "2023-10-23 20:33:53", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Lin-Minghong", "name": { "family": "Lin", "given": "Minghong" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Roytman-A", "name": { "family": "Roytman", "given": "Alan" } }, { "id": "Meyerson-A", "name": { "family": "Meyerson", "given": "Adam" } }, { "id": "Andrew-L-L-H", "name": { "family": "Andrew", "given": "Lachlan L. H." } } ] }, "title": "Online optimization with switching cost", "ispublished": "pub", "full_text_status": "public", "note": "Copyright is held by author/owner(s).\n\nPublished - p98-lin.pdf
", "abstract": "We consider algorithms for \"smoothed online convex optimization (SOCO)\" problems. SOCO is a variant of the class of \"online convex optimization (OCO)\" problems that is strongly related to the class of \"metrical task systems\", each of which have been studied extensively. Prior literature on these problems has focused on two performance metrics: regret and competitive ratio. There exist known algorithms with sublinear regret and known algorithms with constant competitive ratios; however no known algorithms achieve both. In this paper, we show that this is due to a fundamental incompatibility between regret and the competitive ratio -- no algorithm (deterministic or randomized) can achieve sublinear regret and a constant competitive ratio, even in the case when the objective functions are linear.", "date": "2012-12", "date_type": "published", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "40", "number": "3", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "98-100", "id_number": "CaltechAUTHORS:20161122-155941033", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20161122-155941033", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/2425248.2425275", "primary_object": { "basename": "p98-lin.pdf", "url": "https://authors.library.caltech.edu/records/96vkn-atn68/files/p98-lin.pdf" }, "resource_type": "article", "pub_year": "2012", "author_list": "Lin, Minghong; Wierman, Adam; et el." }, { "id": "https://authors.library.caltech.edu/records/07ts9-6xm49", "eprint_id": 35996, "eprint_status": "archive", "datestamp": "2023-08-22 07:48:36", "lastmod": "2023-10-20 22:06:26", "type": "article", "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: Optimality and robustness", "ispublished": "pub", "full_text_status": "restricted", "keywords": "Energy efficiency; Variable service speed", "note": "\u00a9 2012 Elsevier B.V. \n\nReceived 9 July 2010. Received in revised form 11 July 2012. Accepted 16 July 2012. Available online 25 July 2012. \n\nThis work was supported by grants from the NSF CCF 0830511, CCS 0835706 and CNS 0435520, Microsoft Research, IBM Faculty Award, the Lee Center for Advanced Networking and the Australian Research Council grant FT0991594.", "abstract": "Adapting the speed of a processor is an effective method to reduce energy consumption. This paper studies the optimal way to scale speed to balance response time and energy consumption under processor sharing scheduling. It is shown that using a static rate while the system is busy provides nearly optimal performance, but having a wider range of available speeds increases robustness to different traffic loads. In particular, the dynamic speed scaling optimal for Poisson arrivals is also constant-competitive in the worst case. The scheme that equates power consumption with queue occupancy is shown to be 10-competitive when power is cubic in speed.", "date": "2012-12", "date_type": "published", "publication": "Performance Evaluation", "volume": "69", "number": "12", "publisher": "Elsevier", "pagerange": "601-622", "id_number": "CaltechAUTHORS:20121214-152442054", "issn": "0166-5316", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20121214-152442054", "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": "CCS-0835706" }, { "agency": "NSF", "grant_number": "CNS-0435520" }, { "agency": "Microsoft Research" }, { "agency": "IBM Faculty Award" }, { "agency": "Caltech Lee Center for Advanced Networking" }, { "agency": "Australian Research Council", "grant_number": "FT0991594" } ] }, "doi": "10.1016/j.peva.2012.07.002", "resource_type": "article", "pub_year": "2012", "author_list": "Wierman, Adam; Andrew, Lachlan L. H.; et el." }, { "id": "https://authors.library.caltech.edu/records/5jvpq-hyc27", "eprint_id": 36098, "eprint_status": "archive", "datestamp": "2023-08-22 06:29:09", "lastmod": "2023-10-20 22:14:36", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Zwart-B", "name": { "family": "Zwart", "given": "Bert" } } ] }, "title": "Is Tail-Optimal Scheduling Possible?", "ispublished": "pub", "full_text_status": "public", "keywords": "scheduling; queueing; large deviations; competitive analysis", "note": "\u00a9 2012 INFORMS.\n\nReceived August 2009; revisions received April 2011, February 2012; accepted April 2012. Published online in\nArticles in Advance October 9, 2012.\nAdam Wierman's research is partly supported by the National\nScience Foundation Computing and Communication Foundations\n[Grant 0830511], Microsoft Research, and the Okawa Foundation.\nBert Zwart's research is partly supported by the National\nScience Foundation [Grants 0727400 and 0805979], an IBM faculty\naward, and a VIDI grant from the Netherlands Organisation\nfor Scientific Research.\n\nPublished - 1249.full.pdf
", "abstract": "This paper focuses on the competitive analysis of scheduling disciplines in a large deviations setting. Although there are policies that are known to optimize the sojourn time tail under a large class of heavy-tailed job sizes (e.g., processor sharing and shortest remaining processing time) and there are policies known to optimize the sojourn time tail in the case of light-tailed job sizes (e.g., first come first served), no policies are known that can optimize the sojourn time tail across both light- and heavy-tailed job size distributions. We prove that no such work-conserving, nonanticipatory, nonlearning policy exists, and thus that a policy must learn (or know) the job size distribution in order to optimize the sojourn time tail.", "date": "2012-09", "date_type": "published", "publication": "Operations Research", "volume": "60", "number": "5", "publisher": "Institute for Operations Research and Management Sciences", "pagerange": "1249-1257", "id_number": "CaltechAUTHORS:20121221-104528945", "issn": "0030-364X", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20121221-104528945", "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": "Okawa Foundation" }, { "agency": "NSF", "grant_number": "CMMI-0727400" }, { "agency": "NSF", "grant_number": "DMS-0805979" }, { "agency": "IBM Faculty Award" }, { "agency": "Nederlandse Organisatie voor Wetenschappelijk Onderzoek (NWO)" } ] }, "doi": "10.1287/opre.1120.1086", "primary_object": { "basename": "1249.full.pdf", "url": "https://authors.library.caltech.edu/records/5jvpq-hyc27/files/1249.full.pdf" }, "resource_type": "article", "pub_year": "2012", "author_list": "Wierman, Adam and Zwart, Bert" }, { "id": "https://authors.library.caltech.edu/records/eme48-gz052", "eprint_id": 36260, "eprint_status": "archive", "datestamp": "2023-08-19 11:11:52", "lastmod": "2023-10-23 15:42:05", "type": "article", "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": "pub", "full_text_status": "public", "keywords": "Data Centers, Dynamic Resizing, Energy Efficient IT", "note": "\u00a9 is held by the author/owner(s).\nSIGMETRICS '12 Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems.\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\nSubmitted - 1207.6295.pdf
", "abstract": "Energy consumption imposes a significant cost for data centers;\nyet much of that energy is used to maintain excess\nservice capacity during periods of predictably low load. Resultantly,\nthere has recently been interest in developing designs\nthat allow the service capacity to be dynamically resized\nto match the current workload. However, there is still\nmuch debate about the value of such approaches in real settings.\nIn this paper, we show that the value of dynamic resizing\nis highly dependent on statistics of the workload process.\nIn particular, both slow time-scale non-stationarities\nof the workload (e.g., the peak-to-mean ratio) and the fast\ntime-scale stochasticity (e.g., the burstiness of arrivals) play\nkey roles. To illustrate the impact of these factors, we\ncombine optimization-based modeling of the slow time-scale\nwith stochastic modeling of the fast time scale. Within this\nframework, we provide both analytic and numerical results\ncharacterizing when dynamic resizing does (and does not)\nprovide benefits.", "date": "2012-06", "date_type": "published", "publication": "Performance Evaluation Review", "volume": "40", "number": "1", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "405-406", "id_number": "CaltechAUTHORS:20130109-085806826", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20130109-085806826", "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" } ] }, "doi": "10.1145/2318857.2254815", "primary_object": { "basename": "1207.6295.pdf", "url": "https://authors.library.caltech.edu/records/eme48-gz052/files/1207.6295.pdf" }, "resource_type": "article", "pub_year": "2012", "author_list": "Wang, Kai; Lin, Minghong; et el." }, { "id": "https://authors.library.caltech.edu/records/kh9x7-vhb91", "eprint_id": 32264, "eprint_status": "archive", "datestamp": "2023-08-22 05:47:42", "lastmod": "2023-10-17 23:05:15", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "van-Wijk-A-C-C", "name": { "family": "van Wijk", "given": "A. C. C." } }, { "id": "Adan-I-J-B-F", "name": { "family": "Adan", "given": "I. J. B. F." } }, { "id": "Boxma-O-J", "name": { "family": "Boxma", "given": "O. J." } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "A." } } ] }, "title": "Fairness and efficiency for polling models with the \u03ba-gated service discipline", "ispublished": "pub", "full_text_status": "restricted", "keywords": "Polling model; Waiting times; Fairness; Efficiency; Gated service discipline; Exhaustive service discipline; Optimization", "note": "\u00a9 2012 Elsevier B. V.\n\nReceived 14 December 2010. Revised 9 February 2012. Accepted 10 February 2012. Available online 13 March 2012.\n\nThe authors would like to thank Marko Boon for assistance with the Mathematica implementation used in the numerical analysis, and for comments on an earlier version of this manuscript. The authors would also like to thank Erik Winands for his fruitful suggestion to use fluid heuristics.", "abstract": "We study a polling model in which we want to achieve a balance between the fairness of the waiting times and the efficiency of the system. For this purpose, we introduce a novel service discipline: the \u03ba-gated service discipline. It is a hybrid of the classical gated and exhausted disciplines, and consists of using \u03ba_i consecutive gated service phases at queue i before the server switches to the next queue. The advantage of this discipline is that the parameters \u03ba_i can be used to balance fairness and efficiency. We derive the distributions and means of the waiting times, a pseudo conservation law for the weighted sum of the mean waiting times, and the fluid limits of the waiting times. Our goal is to optimize the \u03ba_i so as to minimize the differences in the mean waiting times, i.e. to achieve maximal fairness, without giving up too much on the efficiency of the system. From the fluid limits we derive a heuristic rule for setting the \u03ba_i. In a numerical study, the heuristic is shown to perform well in most cases.", "date": "2012-06", "date_type": "published", "publication": "Performance Evaluation", "volume": "69", "number": "6", "publisher": "Elsevier", "pagerange": "274-288", "id_number": "CaltechAUTHORS:20120705-102059217", "issn": "0166-5316", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20120705-102059217", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1016/j.peva.2012.02.003", "resource_type": "article", "pub_year": "2012", "author_list": "van Wijk, A. C. C.; Adan, I. J. B. F.; et el." }, { "id": "https://authors.library.caltech.edu/records/dykbv-5ec39", "eprint_id": 36237, "eprint_status": "archive", "datestamp": "2023-08-22 05:50:16", "lastmod": "2023-10-20 22:54:46", "type": "article", "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\n Sustainable Data Centers", "ispublished": "pub", "full_text_status": "restricted", "keywords": "sustainable data center; renewable energy; demand shaping; scheduling; cooling optimization", "note": "\u00a9 2012 ACM, Inc.\n\nSIGMETRICS '12. Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems, Pages 175-186. \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 Research Group at HP Labs. Chandrakant Patel has provided great support and guidance at various stages of this work. Niru Kumari provided valuable information on chiller cooling models. Martin Arlitt, Amip Shah, Sergey Blagodurov and Alan McReynolds offered helpful feedback. We also thank the anonymous reviewers and our shepherd, Christopher Stewart, for their valuable comments and help.", "abstract": "Recently, the demand for data center computing has surged,\nincreasing 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", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "40", "number": "1", "publisher": "Association for Computing Machinery (ACM)", "place_of_pub": "New York", "pagerange": "175-186", "id_number": "CaltechAUTHORS:20130108-115043744", "isbn": "978-1-4503-1097-0", "issn": "0163-5999", "book_title": "Proceedings of the 12th ACM Sigmetrics/Performance joint international conference on Measurement and Modeling of Computer Systems", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20130108-115043744", "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/2318857.2254779", "resource_type": "article", "pub_year": "2012", "author_list": "Liu, Zhenhua; Cheng, Yuan; et el." }, { "id": "https://authors.library.caltech.edu/records/4drev-wsa20", "eprint_id": 29836, "eprint_status": "archive", "datestamp": "2023-08-22 04:50:41", "lastmod": "2023-10-24 22:29:41", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Yang-Changwoo", "name": { "family": "Yang", "given": "Changwoo" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Shakkottai-S", "name": { "family": "Shakkottai", "given": "Sanjay" } }, { "id": "Harchol-Balter-M", "name": { "family": "Harchol-Balter", "given": "Mor" } } ] }, "title": "Many Flows Asymptotics for SMART Scheduling Policies", "ispublished": "pub", "full_text_status": "restricted", "keywords": "Foreground-background (FB); many sources large deviation; shortest remaining processing time (SRPT); two-dimensional (2-D) queueing", "note": "\u00a9 2011 IEEE.\n\nManuscript received March 31, 2010; accepted June 26, 2011. Date of publication October 25, 2011; date of current version January 27, 2012. \n\nThis paper was presented in part at the Proceedings of ACM Sigmetrics, June 2006. Recommended by Associate Editor S. Mascolo.", "abstract": "Scheduling policies that favor small jobs have received growing attention due to their superior performance with respect to mean delay, e.g., Shortest Remaining Processing Time (SRPT) and Preemptive Shortest Job First (PSJF). In this paper, we study the delay distribution of a generalization of the class of scheduling policies called SMART (because policies in it have \"SMAll Response Times\"), which includes SRPT, PSJF, and a range of practical variants, in a discrete-time queueing system under the many sources large deviations regime. Our analysis of SMART in this regime (large number of flows and large capacity) hinges on a novel two-dimensional (2-D) queueing framework that employs virtual queues and total ordering of jobs. We prove that all SMART policies have the same asymptotic delay distribution as SRPT, i.e., the delay distribution has the same decay rate. In addition, we illustrate the improvements SMART policies make over First Come First Serve (FCFS) and Processor Sharing (PS). Our 2-D queueing technique is generalizable to other policies as well. As an example, we show how the Foreground-Background (FB) policy can be analyzed using a 2-D queueing framework. FB is a policy, not contained in SMART, which manages to bias towards small jobs without knowing which jobs are small in advance.", "date": "2012-02", "date_type": "published", "publication": "IEEE Transactions on Automatic Control", "volume": "57", "number": "2", "publisher": "IEEE", "pagerange": "376-391", "id_number": "CaltechAUTHORS:20120326-084346980", "issn": "0018-9286", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20120326-084346980", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1109/TAC.2011.2173418", "resource_type": "article", "pub_year": "2012", "author_list": "Yang, Changwoo; Wierman, Adam; et el." }, { "id": "https://authors.library.caltech.edu/records/xeha6-r7x21", "eprint_id": 31565, "eprint_status": "archive", "datestamp": "2023-08-19 08:48:49", "lastmod": "2023-10-17 18:40:38", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Doroudi-S", "name": { "family": "Doroudi", "given": "Sherwin" } }, { "id": "Gopalakrishnan-R", "name": { "family": "Gopalakrishnan", "given": "Ragavendran" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Dispatching to incentivize fast service in multi-server queues", "ispublished": "pub", "full_text_status": "restricted", "note": "\u00a9 2011 ACM.", "abstract": "As a field, queueing theory predominantly assumes that\nthe arrival rate of jobs and the system parameters, e.g., service\nrates, are fixed exogenously, and then proceeds to design\nand analyze scheduling policies that provide efficient performance,\ne.g., small response time (sojourn time). However,\nin reality, the arrival rate and/or service rate may depend on\nthe scheduling and, more generally, the performance of the\nsystem. For example, if arrivals are strategic then a decrease\nin the mean response time due to improved scheduling may\nresult in an increase in the arrival rate.", "date": "2011-12", "date_type": "published", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "39", "number": "3", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "43-45", "id_number": "CaltechAUTHORS:20120521-101935284", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20120521-101935284", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/2160803.2160855", "resource_type": "article", "pub_year": "2011", "author_list": "Doroudi, Sherwin; Gopalakrishnan, Ragavendran; et el." }, { "id": "https://authors.library.caltech.edu/records/jz61t-zg441", "eprint_id": 72339, "eprint_status": "archive", "datestamp": "2023-08-19 08:50:01", "lastmod": "2023-10-23 21:39:02", "type": "article", "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": "Geographical load balancing with renewables", "ispublished": "pub", "full_text_status": "restricted", "note": "\u00a9 2011 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": "Given the significant energy consumption of data centers, improving their energy efficiency is an important social problem. However, energy efficiency is necessary but not sufficient for sustainability, which demands reduced usage of energy from fossil fuels. This paper investigates the feasibility of powering internet-scale systems using (nearly) entirely renewable energy. We perform a trace-based study to evaluate three issues related to achieving this goal: the impact of geographical load balancing, the role of storage, and the optimal mix of renewables. Our results highlight that geographical load balancing can significantly reduce the required capacity of renewable energy by using the energy more efficiently with \"follow the renewables\" routing. Further, our results show that small-scale storage can be useful, especially in combination with geographical load balancing, and that an optimal mix of renewables includes significantly more wind than photovoltaic solar.", "date": "2011-12", "date_type": "published", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "39", "number": "3", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "62-66", "id_number": "CaltechAUTHORS:20161128-151114708", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20161128-151114708", "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" } ] }, "doi": "10.1145/2160803.2160862", "resource_type": "article", "pub_year": "2011", "author_list": "Liu, Zhenhua; Lin, Minghong; et el." }, { "id": "https://authors.library.caltech.edu/records/gjcb5-cmb38", "eprint_id": 27969, "eprint_status": "archive", "datestamp": "2023-08-22 04:01:26", "lastmod": "2023-10-24 17:32:31", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Anselmi-J", "name": { "family": "Anselmi", "given": "Jonatha" } }, { "id": "Ayesta-U", "name": { "family": "Ayesta", "given": "Urtzi" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Competition yields efficiency in load balancing games", "ispublished": "pub", "full_text_status": "restricted", "keywords": "Queueing games; Oligopolistic price competition; Parallel providers; Price of anarchy", "note": "\u00a9 2011 Elsevier B.V. \n\nAvailable online 2 August 2011. \n\nResearch partially supported by grant MTM2010-17405 (Ministerio de Ciencia e Innovaci\u00f3n, Spain), grant PI2010-2 (Department of Education and Research, Basque Government), and NSF CNS-0846025. The authors are very grateful to Olivier Brun, Balakrishna Prabhu and the anonymous reviewers for their insightful comments that significantly increased the quality of this paper.", "abstract": "We study a nonatomic congestion game with N parallel links, with each link under the control of a profit maximizing provider. Within this 'load balancing game', each provider has the freedom to set a price, or toll, for access to the link and seeks to maximize its own profit. Given prices, a Wardrop equilibrium among users is assumed, under which users all choose paths of minimal and identical effective cost. Within this model we have oligopolistic price competition which, in equilibrium, gives rise to situations where neither providers nor users have incentives to adjust their prices or routes, respectively. In this context, we provide new results about the existence and efficiency of oligopolistic equilibria. Our main theorem shows that, when the number of providers is small, oligopolistic equilibria can be extremely inefficient; however as the number of providers N grows, the oligopolistic equilibria become increasingly efficient (at a rate of 1/N) and, as N\u2192\u221e, the oligopolistic equilibrium matches the socially optimal allocation.", "date": "2011-11", "date_type": "published", "publication": "Performance Evaluation", "volume": "68", "number": "11", "publisher": "Elsevier", "pagerange": "986-1001", "id_number": "CaltechAUTHORS:20111128-101928328", "issn": "0166-5316", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20111128-101928328", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "Ministerio de Ciencia e Innovaci\u03ccn (MICINN)", "grant_number": "MTM2010-17405" }, { "agency": "Department of Education and Resarch, Basque Government", "grant_number": "PI2010-2" }, { "agency": "NSF", "grant_number": "CNS-0846025" } ] }, "doi": "10.1016/j.peva.2011.07.005", "resource_type": "article", "pub_year": "2011", "author_list": "Anselmi, Jonatha; Ayesta, Urtzi; et el." }, { "id": "https://authors.library.caltech.edu/records/4hjx7-79x15", "eprint_id": 27394, "eprint_status": "archive", "datestamp": "2023-08-22 03:47:22", "lastmod": "2023-10-24 17:07:34", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Lin-Minghong", "name": { "family": "Lin", "given": "Minghong" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Zwart-B", "name": { "family": "Zwart", "given": "Bert" } } ] }, "title": "Heavy-traffic analysis of mean response time under Shortest Remaining Processing Time", "ispublished": "pub", "full_text_status": "restricted", "keywords": "Queuing; Scheduling; SRPT; Heavy-traffic; Response time; Sojourn time", "note": "\u00a9 2011 Elsevier B.V. \n\nReceived 22 March 2010. Received in revised form 20 January 2011. Accepted 10 June 2011. Available online 26 June 2011.", "abstract": "Shortest Remaining Processing time (SRPT) has long been known to optimize the queue length distribution and the mean response time (a.k.a. flow time, sojourn time). As such, it has been the focus of a wide body of analysis. However, results about the heavy-traffic behavior of SRPT have only recently started to emerge. In this work, we characterize the growth rate of the mean response time under SRPT in the M/GI/1 system under general job size distributions. Our results illustrate the relationship between the job size tail and the heavy traffic growth rate of mean response time. Further, we show that the heavy traffic growth rate can be used to provide an accurate approximation for mean response time outside of heavy traffic regime.", "date": "2011-10", "date_type": "published", "publication": "Performance Evaluation", "volume": "68", "number": "10", "publisher": "Elsevier", "pagerange": "955-966", "id_number": "CaltechAUTHORS:20111025-080010192", "issn": "0166-5316", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20111025-080010192", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1016/j.peva.2011.06.001", "resource_type": "article", "pub_year": "2011", "author_list": "Lin, Minghong; Wierman, Adam; et el." }, { "id": "https://authors.library.caltech.edu/records/916td-x7r71", "eprint_id": 31561, "eprint_status": "archive", "datestamp": "2023-08-19 07:55:10", "lastmod": "2023-10-17 18:40:24", "type": "article", "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": "Exploiting network effects in the provisioning of large scale systems", "ispublished": "pub", "full_text_status": "restricted", "note": "\u00a9 2011 ACM. \n\nThe first two authors acknowledge the support of NSF through grant CNS 0846025 and the NetSE grant CNS 0911041, ARO through MURI grant W911NF-08-1-0233, DoE through grant DE-EE0002890 and Bell Labs. Bert Zwart is also affiliated with VU University, Eurandom and Georgia Tech. His research is sponsored by an NWO VIDI grant and an IBM faculty award.", "abstract": "Online services today are characterized by a highly congestion sensitive user base, that also experiences strong positive network effects. A majority of these services are supported by advertising and are offered for free to the end user. We study the problem of optimal capacity provisioning for a profit maximizing firm operating such an online service in the asymptotic regime of a large market size. We show that network effects heavily influence the optimal capacity provisioning strategy, as well as the profit of the firm. In particular, strong positive network effects allow the firm to operate the service with fewer servers, which translates to increased profit.", "date": "2011-09", "date_type": "published", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "39", "number": "2", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "26-28", "id_number": "CaltechAUTHORS:20120521-092530952", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20120521-092530952", "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": "CNS-0911041" }, { "agency": "Army Research Office (ARO)", "grant_number": "W911NF-08-1-0233" }, { "agency": "Department of Energy (DOE)", "grant_number": "DE-EE0002890" }, { "agency": "Bell Labs" }, { "agency": "Nederlandse Organisatie voor Wetenschappelijk Onderzoek (NWO)" }, { "agency": "IBM Faculty Award" } ] }, "doi": "10.1145/2034832.2034837", "resource_type": "article", "pub_year": "2011", "author_list": "Nair, Jayakrishnan; Wierman, Adam; et el." }, { "id": "https://authors.library.caltech.edu/records/hww5w-9w763", "eprint_id": 72340, "eprint_status": "archive", "datestamp": "2023-08-19 06:59:23", "lastmod": "2023-10-23 21:39:09", "type": "article", "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": "pub", "full_text_status": "restricted", "keywords": "Algorithms, Performance", "note": "\u00a9 2011 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": "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", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "39", "number": "1", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "193-204", "id_number": "CaltechAUTHORS:20161128-151734850", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20161128-151734850", "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" } ] }, "resource_type": "article", "pub_year": "2011", "author_list": "Liu, Zhenhua; Lin, Minghong; et el." }, { "id": "https://authors.library.caltech.edu/records/gw8qh-3y569", "eprint_id": 65540, "eprint_status": "archive", "datestamp": "2023-08-19 05:45:57", "lastmod": "2024-01-13 16:44:59", "type": "article", "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": "Complexity and economics: computational constraints may not matter empirically", "ispublished": "pub", "full_text_status": "restricted", "keywords": "Rationalization, Bounded Rationality", "note": "\u00a9 2011 ACM.", "abstract": "Recent results in complexity theory suggest that various economic theories require agents to solve intractable problems. However, such results assume the agents are optimizing explicit utility functions, whereas the economic theories merely assume the agents' behavior is rationalizable by the optimization of some utility function. \n\nFor a major economic theory, the theory of the consumer, we show that behaving in a rationalizable way is easier than the corresponding optimization problem. Specifically, if an agent's behavior is at all rationalizable, then it is rationalizable using a utility function that is easy to maximize in every budget set.", "date": "2011-03", "date_type": "published", "publication": "ACM SIGecom Exchanges", "volume": "10", "number": "1", "publisher": "Association for Computing Machinery", "pagerange": "2-5", "id_number": "CaltechAUTHORS:20160321-131503486", "issn": "1551-9031", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20160321-131503486", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/1978721.1978722", "resource_type": "article", "pub_year": "2011", "author_list": "Echenique, Federico; Golovin, Daniel; et el." }, { "id": "https://authors.library.caltech.edu/records/9tjt7-95q03", "eprint_id": 31562, "eprint_status": "archive", "datestamp": "2023-08-19 04:35:28", "lastmod": "2023-10-17 18:40:31", "type": "article", "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": "An architectural view of game theoretic control", "ispublished": "pub", "full_text_status": "restricted", "note": "\u00a9 2010 ACM.", "abstract": "Game-theoretic control is a promising new approach for distributed resource allocation. In this paper, we describe how game-theoretic control can be viewed as having an intrinsic layered architecture, which provides a modularization that simplifies the control design. We illustrate this architectural view by presenting details about one particular instantiation using potential games as an interface. This example serves to highlight the strengths and limitations of the proposed architecture while also illustrating the relationship between game-theoretic control and other existing approaches to distributed resource allocation.", "date": "2010-12", "date_type": "published", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "38", "number": "3", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "31-36", "id_number": "CaltechAUTHORS:20120521-093604505", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20120521-093604505", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/1925019.1925026", "resource_type": "article", "pub_year": "2010", "author_list": "Gopalakrishnan, Ragavendran; Marden, Jason R.; et el." }, { "id": "https://authors.library.caltech.edu/records/jk64r-vm664", "eprint_id": 21019, "eprint_status": "archive", "datestamp": "2023-08-22 01:13:00", "lastmod": "2023-10-20 23:41:30", "type": "article", "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": "Tail-robust scheduling via limited processor sharing", "ispublished": "pub", "full_text_status": "restricted", "keywords": "GI/GI/1 queue; Scheduling; Limited processor sharing; Large deviations; Tail asymptotics; Heavy-tailed job size; Light-tailed job size; Tail-robustness", "note": "\u00a9 2010 Elsevier.\n\nAvailable online 16 August 2010.", "abstract": "From a rare events perspective, scheduling disciplines that work well under light (exponential) tailed workload distributions do not perform well under heavy (power) tailed workload distributions, and vice versa, leading to fundamental problems in designing schedulers that are robust to distributional assumptions on the job sizes. This paper shows how to exploit partial workload information (system load) to design a scheduler that provides robust performance across heavy-tailed and light-tailed workloads. Specifically, we derive new asymptotics for the tail of the stationary sojourn time under Limited Processor Sharing (LPS) scheduling for both heavy-tailed and light-tailed job size distributions, and show that LPS can be robust to the tail of the job size distribution if the multiprogramming level is chosen carefully as a function of the load.", "date": "2010-11", "date_type": "published", "publication": "Performance Evaluation", "volume": "67", "number": "11", "publisher": "Elsevier", "pagerange": "978-995", "id_number": "CaltechAUTHORS:20101124-110928510", "issn": "0166-5316", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20101124-110928510", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1016/j.peva.2010.08.012", "resource_type": "article", "pub_year": "2010", "author_list": "Nair, Jayakrishnan; Wierman, Adam; et el." }, { "id": "https://authors.library.caltech.edu/records/b0jnn-jp274", "eprint_id": 72264, "eprint_status": "archive", "datestamp": "2023-08-19 03:42:32", "lastmod": "2023-10-23 20:33:55", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Lin-Minghong", "name": { "family": "Lin", "given": "Minghong" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Zwart-B", "name": { "family": "Zwart", "given": "Bert" } } ] }, "title": "The Average Response Time in a Heavy-traffic SRPT Queue", "ispublished": "pub", "full_text_status": "restricted", "note": "\u00a9 2010 ACM.", "abstract": "Shortest Remaining Processing Time first (SRPT) has long been known to optimize the queue length distribution and the mean response time (a.k.a. flow time, sojourn time). As such, it has been the focus of a wide body of analysis. However, results about the heavy-traffic behavior of SRPT have only recently started to emerge. In this work, we characterize the growth rate of the mean response time under SRPT in the M/GI/1 system under general job size distributions. Our results illustrate the relationship between the job size tail and the heavy traffic growth rate of mean response time. Further, we show that the heavy traffic growth rate can be used to provide an accurate approximation for mean response time outside of heavy traffic.", "date": "2010-09", "date_type": "published", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "38", "number": "2", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "12-14", "id_number": "CaltechAUTHORS:20161122-162740344", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20161122-162740344", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/1870178.1870183", "resource_type": "article", "pub_year": "2010", "author_list": "Lin, Minghong; Wierman, Adam; et el." }, { "id": "https://authors.library.caltech.edu/records/b6mjq-7zh42", "eprint_id": 20495, "eprint_status": "archive", "datestamp": "2023-08-22 00:28:54", "lastmod": "2023-10-20 23:07:06", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Bodine-Baron-E", "name": { "family": "Bodine-Baron", "given": "Elizabeth" } }, { "id": "Hassibi-B", "name": { "family": "Hassibi", "given": "Babak" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Distance-Dependent Kronecker Graphs for Modeling Social Networks", "ispublished": "pub", "full_text_status": "public", "keywords": "Distributed algorithms; graph theory; networks; search methods; social factors", "note": "\u00a9 2010 IEEE.\n\nManuscript received November 16, 2009; revised March 26, 2010; accepted\nApril 09, 2010. Date of publication April 29, 2010; date of current version July\n16, 2010. The associate editor coordinating the review of this manuscript and\napproving it for publication was Prof. Vikram Krishnamurthy.\n\nPublished - BodineBaron2010p11653Ieee_J-Stsp.pdf
", "abstract": "This paper focuses on a generalization of stochastic\nKronecker graphs, introducing a Kronecker-like operator and\ndefining a family of generator matrices H dependent on distances\nbetween nodes in a specified graph embedding. We prove\nthat any lattice-based network model with sufficiently small\ndistance-dependent connection probability will have a Poisson\ndegree distribution and provide a general framework to prove\nsearchability for such a network. Using this framework, we focus\non a specific example of an expanding hypercube and discuss\nthe similarities and differences of such a model with recently\nproposed network models based on a hidden metric space. We\nalso prove that a greedy forwarding algorithm can find very short\npaths of length O((log log n)^2) on the hypercube with n nodes,\ndemonstrating that distance-dependent Kronecker graphs can\ngenerate searchable network models.", "date": "2010-08", "date_type": "published", "publication": "IEEE Journal of Selected Topics in Signal Processing", "volume": "4", "number": "4", "publisher": "IEEE", "pagerange": "718-731", "id_number": "CaltechAUTHORS:20101025-094230043", "issn": "1932-4553", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20101025-094230043", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1109/JSTSP.2010.2049412", "primary_object": { "basename": "BodineBaron2010p11653Ieee_J-Stsp.pdf", "url": "https://authors.library.caltech.edu/records/b6mjq-7zh42/files/BodineBaron2010p11653Ieee_J-Stsp.pdf" }, "resource_type": "article", "pub_year": "2010", "author_list": "Bodine-Baron, Elizabeth; Hassibi, Babak; et el." }, { "id": "https://authors.library.caltech.edu/records/krzav-s0a98", "eprint_id": 66319, "eprint_status": "archive", "datestamp": "2023-08-19 02:43:50", "lastmod": "2023-10-18 17:58:32", "type": "article", "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": "pub", "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", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "38", "number": "1", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "37-48", "id_number": "CaltechAUTHORS:20160420-131334648", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20160420-131334648", "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/1811099.1811044", "resource_type": "article", "pub_year": "2010", "author_list": "Andrew, Lachlan L. H.; Lin, Minghong; et el." }, { "id": "https://authors.library.caltech.edu/records/0g5qp-2pc47", "eprint_id": 66321, "eprint_status": "archive", "datestamp": "2023-08-18 23:58:59", "lastmod": "2023-10-18 17:58:35", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Andrew-L-L-H", "name": { "family": "Andrew", "given": "Lachlan L. H." } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Tang-Ao", "name": { "family": "Tang", "given": "Ao" }, "orcid": "0000-0001-6296-644X" } ] }, "title": "Optimal speed scaling under arbitrary power functions", "ispublished": "pub", "full_text_status": "restricted", "note": "\u00a9 2009 ACM.", "abstract": "This paper investigates the performance of online dynamic\nspeed scaling algorithms for the objective of minimizing a\nlinear combination of energy and response time. We prove\nthat (SRPT, P ^\u22121(n)), which uses Shortest Remaining Processing Time (SRPT) scheduling and processes at speed\nsuch that the power used is equal to the queue length, is\n2-competitive for a very wide class of power-speed tradeoff\nfunctions. Further, we prove that there exist tradeoff functions such that no online algorithm can attain a competitive ratio less than 2.", "date": "2009-09", "date_type": "published", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "37", "number": "2", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "39-41", "id_number": "CaltechAUTHORS:20160420-132610613", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20160420-132610613", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/1639562.1639576", "resource_type": "article", "pub_year": "2009", "author_list": "Andrew, Lachlan L. H.; Wierman, Adam; et el." }, { "id": "https://authors.library.caltech.edu/records/1z78m-xa045", "eprint_id": 69786, "eprint_status": "archive", "datestamp": "2023-08-19 23:35:09", "lastmod": "2023-10-20 20:36:47", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Chen-Ho-Lin", "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": "The effect of local scheduling in load balancing designs", "ispublished": "pub", "full_text_status": "restricted", "note": "\u00a9 2008 ACM.", "abstract": "Load balancing is a common approach to task assignment in distributed architectures such as web server farms, database systems, grid computing clusters, and others. In such designs there is a dispatcher that seeks to balance the assignment of service requests (jobs) across the servers in the system so that the response time of\njobs at each server is (nearly) the same. Such designs are popular due to the increased robustness they provide to bursts of traffic, server failures, etc., as well as the inherent scalability they provide. However, there is also a major drawback to load balancing designs \u2013 some performance is sacrificed. Specifically, it would be possible to reduce user response times by moving away from load balancing\ndesigns.\n\nOur goal in this paper is to study the degree of inefficiency in load balancing designs. Further, we will show that the degree of inefficiency depends on the scheduling discipline used locally at each of the servers, i.e. the local scheduler. \n\nOur results (see Section 3) show that the local scheduling policy has a significant impact on the degree of inefficiency in load balancing designs. In particular, the local scheduler in traditional designs is often modeled by Processor Sharing (PS), which shares the server evenly among all jobs in the system. When the local scheduler is PS, the degree of inefficiency grows linearly with the\nnumber of servers in the system. In contrast, if the local scheduler is changed to Shortest Remaining Processing Time first (SRPT), as has been suggested in a variety modern designs [7, 3, 10], the degree of inefficiency can be independent of the number of servers in the system and instead depend only on the heterogeneity of the\nspeed of the servers.", "date": "2008-09", "date_type": "published", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "36", "number": "2", "publisher": "Association for Computing Machinery", "pagerange": "110-112", "id_number": "CaltechAUTHORS:20160819-110902462", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20160819-110902462", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/1453175.1453200", "resource_type": "article", "pub_year": "2008", "author_list": "Chen, Ho-Lin; Marden, Jason R.; et el." }, { "id": "https://authors.library.caltech.edu/records/k6qfy-vsj29", "eprint_id": 73266, "eprint_status": "archive", "datestamp": "2023-08-22 11:54:41", "lastmod": "2023-10-24 15:10:29", "type": "article", "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": "pub", "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", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "36", "number": "1", "publisher": "Association for Computing Machinery (ACM)", "place_of_pub": "New York, NY", "pagerange": "25-36", "id_number": "CaltechAUTHORS:20170105-110703130", "isbn": "978-1-60558-005-0", "issn": "0163-5999", "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-110703130", "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/384529.1375461", "resource_type": "article", "pub_year": "2008", "author_list": "Wierman, Adam and Nuyens, Misja" }, { "id": "https://authors.library.caltech.edu/records/7y4w9-rsx11", "eprint_id": 76051, "eprint_status": "archive", "datestamp": "2023-08-22 10:54:28", "lastmod": "2023-10-25 15:29:50", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Nuyens-M", "name": { "family": "Nuyens", "given": "Misja" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Zwart-B", "name": { "family": "Zwart", "given": "Bert" } } ] }, "title": "Preventing Large Sojourn Times Using SMART Scheduling", "ispublished": "pub", "full_text_status": "public", "keywords": "queues; priority; limit theorems; probability; stochastic model applications", "note": "\u00a9 2008 INFORMS. \n\nReceived October 2005; revisions received June 2006, September 2006; accepted October 2006. Published Online: February 1, 2008. \n\nThe authors thank the referees for their suggestions and comments, which have improved the presentation and readability of the paper.\n\nAccepted Version - 5469d1200cf2f5eb18051e62.pdf
", "abstract": "Recently, the so-called class of SMART scheduling policies has been introduced to formalize the common heuristic of \"biasing toward small jobs.\" We study the tail of the sojourn-time (response-time) distribution under both SMART policies and the foreground-background policy (FB) in the GI/GI/1 queue. We prove that these policies behave very well under heavy-tailed service times. Specifically, we show that the sojourn-time tail under all SMART policies and FB is similar to that of the service-time tail, up to a constant, which makes the SMART class superior to first-come-first-served (FCFS). In contrast, for light-tailed service times, we prove that the sojourn-time tail under FB and SMART is larger than that under FCFS. However, we show that the sojourn-time tail for a job of size y under FB and all SMART policies still outperforms FCFS as long as y is not too large.", "date": "2008-01", "date_type": "published", "publication": "Operations Research", "volume": "56", "number": "1", "publisher": "Institute for Operations Research and Management Sciences", "pagerange": "88-101", "id_number": "CaltechAUTHORS:20170408-151537902", "issn": "0030-364X", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20170408-151537902", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1287/opre.1070.0504", "primary_object": { "basename": "5469d1200cf2f5eb18051e62.pdf", "url": "https://authors.library.caltech.edu/records/7y4w9-rsx11/files/5469d1200cf2f5eb18051e62.pdf" }, "resource_type": "article", "pub_year": "2008", "author_list": "Nuyens, Misja; Wierman, Adam; et el." }, { "id": "https://authors.library.caltech.edu/records/ff7s5-2fn53", "eprint_id": 18166, "eprint_status": "archive", "datestamp": "2023-08-22 10:07:40", "lastmod": "2023-10-20 15:49:29", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Winands-E-M-M", "name": { "family": "Winands", "given": "Erik M.M." } }, { "id": "Boxma-O-J", "name": { "family": "Boxma", "given": "Onno J." } } ] }, "title": "Scheduling in polling systems", "ispublished": "pub", "full_text_status": "restricted", "keywords": "Polling systems; Scheduling policies; Exhaustive service; Gated service", "note": "\u00a9 2007 Elsevier Ltd. \n\nAvailable online 27 June 2007.", "abstract": "We present a simple mean value analysis (MVA) framework for analyzing the effect of scheduling within queues in classical asymmetric polling systems with gated or exhaustive service. Scheduling in polling systems finds many applications in computer and communication systems. Our framework leads not only to unification but also to extension of the literature studying scheduling in polling systems. It illustrates that a large class of scheduling policies behaves similarly in the exhaustive polling model and the standard M/GI/1 model, whereas scheduling policies in the gated polling model behave very differently than in an M/GI/1.", "date": "2007-10", "date_type": "published", "publication": "Performance Evaluation", "volume": "64", "number": "9-12", "publisher": "Elsevier", "pagerange": "1009-1028", "id_number": "CaltechAUTHORS:20100506-110944543", "issn": "0166-5316", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20100506-110944543", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1016/j.peva.2007.06.015", "resource_type": "article", "pub_year": "2007", "author_list": "Wierman, Adam; Winands, Erik M.M.; et el." }, { "id": "https://authors.library.caltech.edu/records/46vgx-rr704", "eprint_id": 106421, "eprint_status": "archive", "datestamp": "2023-08-19 19:49:03", "lastmod": "2023-10-20 23:28:07", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Fairness and classifications", "ispublished": "pub", "full_text_status": "restricted", "note": "\u00a9 2007 Association for Computing Machinery.", "abstract": "The growing trend in computer systems towards using scheduling policies that prioritize jobs with small service requirements has resulted in a new focus on the fairness of such policies. In particular, researchers have been interested in whether prioritizing small job sizes results in large jobs being treated \"unfairly.\" However, fairness is an amorphous concept and thus difficult to define and study. This article provides a short survey of recent work in this area.", "date": "2007-03", "date_type": "published", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "34", "number": "4", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "4-12", "id_number": "CaltechAUTHORS:20201104-083857037", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20201104-083857037", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/1243401.1243405", "resource_type": "article", "pub_year": "2007", "author_list": "Wierman, Adam" }, { "id": "https://authors.library.caltech.edu/records/bvktq-zc844", "eprint_id": 106162, "eprint_status": "archive", "datestamp": "2023-08-22 07:43:52", "lastmod": "2023-10-20 23:09:16", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Osogami-Takayuki", "name": { "family": "Osogami", "given": "Takayuki" } }, { "id": "Harchol-Balter-M", "name": { "family": "Harchol-Balter", "given": "Mor" } }, { "id": "Scheller-Wolf-A", "name": { "family": "Scheller-Wolf", "given": "Alan" } } ] }, "title": "How many servers are best in a dual-priority system?", "ispublished": "pub", "full_text_status": "restricted", "keywords": "Scheduling; Queueing; Multiserver; Priority; Preemptive; M/PH/k; Dimensionality reduction; Busy period", "note": "\u00a9 2006 Elsevier Ltd. \n\nReceived 4 August 2004, Revised 26 November 2005, Available online 20 March 2006. \n\nThis work was supported by NSF Grant CCR-0311383 and grant sponsorship from IBM Corporation.", "abstract": "We ask the question, \"for minimizing mean response time (sojourn time), which is preferable: one fast server of speed 1, or slow servers each of speed?\" Our setting is the system with two priority classes of customers, high priority and low priority, where PH is a phase-type distribution. We find that multiple slow servers are often preferable, and we demonstrate exactly how many servers are preferable as a function of the load and service time distribution. In addition, we find that the optimal number of servers with respect to the high priority jobs may be very different from that preferred by low priority jobs, and we characterize these preferences. We also study the optimal number of servers with respect to overall mean response time, averaged over high and low priority jobs. Lastly, we ascertain the effect of the service demand variability of high priority jobs on low priority jobs.", "date": "2006-12", "date_type": "published", "publication": "Performance Evaluation", "volume": "63", "number": "12", "publisher": "Elsevier", "pagerange": "1253-1272", "id_number": "CaltechAUTHORS:20201020-075618304", "issn": "0166-5316", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20201020-075618304", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CCR-0311383" }, { "agency": "IBM Corporation" } ] }, "doi": "10.1016/j.peva.2005.12.004", "resource_type": "article", "pub_year": "2006", "author_list": "Wierman, Adam; Osogami, Takayuki; et el." }, { "id": "https://authors.library.caltech.edu/records/w5qez-yt939", "eprint_id": 106422, "eprint_status": "archive", "datestamp": "2023-08-19 19:01:57", "lastmod": "2023-10-20 23:28:10", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "On the effect of inexact size information in size based policies", "ispublished": "pub", "full_text_status": "restricted", "note": "\u00a9 2006 Association for Computing Machinery. \n\nI am grateful to Varun Gupta and Misja Nuyens for there helpful feedback on developing the SMART, class, and for all of the valuable feedback I received at the MAMA workshop.", "abstract": "Recently, there have been a number of scheduling success stories in computer applications. Across a wide array of applications, the simple heuristic of \"prioritizing small jobs\" has been used to reduce user response times with enormous success. For instance, variants of Shortest-Remaining-Processing-Time (SRPT) and Preemptive-Shortest-Job-First (PSJF) have been suggested for use in web servers [5, 12], wireless applications [6], and databases [8]. As a result of the attention given to size based policies by computer systems researchers, there has been a resurgence in analytical work studying these policies. However, the policies studied in theory, e.g. SRPT and PSJF, are idealized versions of the policies implemented by practitioners. In particular, the intricacies of computer systems force the use of complex hybrid policies in practice, though these more complex policies are still built around the heuristic of \"prioritizing small jobs.\" Thus, there exists a gap between the results provided by theoretical research and the needs of practitioners. This gap results from three primary disconnects between the model studied in theory and the needs of system designers. First, in designing systems, the goal is not simply to provide small response times; other performance measures are also important. Thus, idealized policies such as SRPT and PSJF are often tweaked by practitioners to perform well on secondary performance measures (e.g. fairness and slowdown) [3, 11, 12]. Second, the overhead involved in distinguishing between an infinite number of different priority classes typically causes system designers to discretize policies such as SRPT and PSJF so that they use only a small number of priority classes (5-10) [5, 11]. Third, in many cases information about the service demands (sizes) of jobs is inexact. For instance, when serving static content, web servers have exact knowledge of the sizes of the files being served, but have inexact knowledge of network conditions. Thus, the web server only has an estimate of the true service demand [7, 12].", "date": "2006-12", "date_type": "published", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "34", "number": "3", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "21-23", "id_number": "CaltechAUTHORS:20201104-085827475", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20201104-085827475", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/1215956.1215966", "resource_type": "article", "pub_year": "2006", "author_list": "Wierman, Adam" }, { "id": "https://authors.library.caltech.edu/records/s9vw0-w8303", "eprint_id": 104884, "eprint_status": "archive", "datestamp": "2023-08-19 16:48:06", "lastmod": "2023-10-20 22:03:01", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Harchol-Balter-M", "name": { "family": "Harchol-Balter", "given": "Mor" } }, { "id": "Osogami-Takayuki", "name": { "family": "Osogami", "given": "Takayuki" } }, { "id": "Scheller-Wolf-A", "name": { "family": "Scheller-Wolf", "given": "Alan" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Multi-Server queueing systems with multiple priority classes", "ispublished": "pub", "full_text_status": "restricted", "keywords": "M/GI/k, M/PH/k, multi-server queue, priority queue, matrix analytic methods, busy periods, multi-class queue, server farm, preemptive priority", "note": "\u00a9 2005 Springer Science + Business Media, Inc. \n\nReceived 2 October 2004; Revised 8 March 2005. \n\nSupported by NSF Career Grant CCR-0133077, NSF Theory CCR-0311383, NSF ITR CCR-0313148, and IBM Corporation via Pittsburgh Digital Greenhouse Grant 2003.\n\nHarchol-Balter, M., Osogami, T., Scheller-Wolf, A. et al. Correction to: Multi-server queueing systems with multiple priority classes. Queueing Syst (2021). https://doi.org/10.1007/s11134-021-09710-1", "abstract": "We present the first near-exact analysis of an M/PH/k queue with m > 2 preemptive-resume priority classes. Our analysis introduces a new technique, which we refer to as Recursive Dimensionality Reduction (RDR). The key idea in RDR is that the m-dimensionally infinite Markov chain, representing the m class state space, is recursively reduced to a 1-dimensionally infinite Markov chain, that is easily and quickly solved. RDR involves no truncation and results in only small inaccuracy when compared with simulation, for a wide range of loads and variability in the job size distribution. Our analytic methods are then used to derive insights on how multi-server systems with prioritization compare with their single server counterparts with respect to response time. Multi-server systems are also compared with single server systems with respect to the effect of different prioritization schemes\u2014\"smart\" prioritization (giving priority to the smaller jobs) versus \"stupid\" prioritization (giving priority to the larger jobs). We also study the effect of approximating m class performance by collapsing the m classes into just two classes.", "date": "2005-12", "date_type": "published", "publication": "Queueing Systems", "volume": "51", "number": "3-4", "publisher": "Springer", "pagerange": "331-360", "id_number": "CaltechAUTHORS:20200810-134515351", "issn": "0257-0130", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20200810-134515351", "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": "CCR-0313148" }, { "agency": "IBM Corporation" }, { "agency": "Pittsburgh Digital Greenhouse", "grant_number": "2003" } ] }, "doi": "10.1007/s11134-005-2898-7", "resource_type": "article", "pub_year": "2005", "author_list": "Harchol-Balter, Mor; Osogami, Takayuki; et el." }, { "id": "https://authors.library.caltech.edu/records/6bf2q-at461", "eprint_id": 108378, "eprint_status": "archive", "datestamp": "2023-08-22 03:44:08", "lastmod": "2023-10-23 16:59:09", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Harchol-Balter-Mor", "name": { "family": "Harchol-Balter", "given": "Mor" } } ] }, "title": "Classifying scheduling policies with respect to higher moments of conditional response time", "ispublished": "pub", "full_text_status": "restricted", "keywords": "Scheduling; response time; predictability; variance; cumulants; M/G/1; FB; LAS; SET; foreground-background; least attained service; PS; processor sharing; SRPT; shortest remaining processing time; PSJF; shortest job first", "note": "\u00a9 2005 ACM.\n\nSupported by NSF Career Grant CCR-0133077, NSF Theory CCR-0311383, NSF ITR CCR-0313148, IBM Corporation via Pittsburgh Digital Greenhouse Grant 2003, and a NSF Graduate Research Fellowship.", "abstract": "In addition to providing small mean response times, modern applications seek to provide users predictable service and, in some cases, Quality of Service (QoS) guarantees. In order to understand the predictability of response times under a range of scheduling policies, we study the conditional variance in response times seen by jobs of different sizes. We define a metric and a criterion that distinguish between contrasting functional behaviors of conditional variance, and we then classify large groups of scheduling policies.In addition to studying the conditional variance of response times, we also derive metrics appropriate for comparing higher conditional moments of response time across job sizes. We illustrate that common statistics such as raw and central moments are not appropriate when comparing higher conditional moments of response time. Instead, we find that cumulant moments should be used.", "date": "2005-06", "date_type": "published", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "33", "number": "1", "publisher": "Association for Computing Machinery (ACM)", "place_of_pub": "New York, NY", "pagerange": "229-240", "id_number": "CaltechAUTHORS:20210310-083407671", "isbn": "1595930221", "issn": "0163-5999", "book_title": "Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20210310-083407671", "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": "CCR-0313148" }, { "agency": "IBM Corporation" }, { "agency": "Pittsburgh Digital Greenhouse", "grant_number": "2003" }, { "agency": "NSF Graduate Research Fellowship" } ] }, "doi": "10.1145/1064212.1064238", "resource_type": "article", "pub_year": "2005", "author_list": "Wierman, Adam and Harchol-Balter, Mor" }, { "id": "https://authors.library.caltech.edu/records/5hvd8-j9010", "eprint_id": 108379, "eprint_status": "archive", "datestamp": "2023-08-22 03:44:16", "lastmod": "2023-10-23 16:59:14", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Harchol-Balter-Mor", "name": { "family": "Harchol-Balter", "given": "Mor" } }, { "id": "Osogami-Takayuki", "name": { "family": "Osogami", "given": "Takayuki" } } ] }, "title": "Nearly insensitive bounds on SMART scheduling", "ispublished": "pub", "full_text_status": "restricted", "keywords": "Scheduling; response time; SMART; M/G/1; PS; processor sharing; SRPT; shortest remaining processing time; PSJF; preemptive shortest job first", "note": "\u00a9 2005 ACM. \n\nSupported by NSF Career Grant CCR-0133077, NSF Theory CCR-0311383, NSF ITR CCR-0313148, IBM Corporation via Pittsburgh Digital Greenhouse Grant 2003, and a NSF Graduate Research Fellowship.", "abstract": "We define the class of SMART scheduling policies. These are policies that bias towards jobs with small remaining service times, jobs with small original sizes, or both, with the motivation of minimizing mean response time and/or mean slowdown. Examples of SMART policies include PSJF, SRPT, and hybrid policies such as RS (which biases according to the product of the remaining size and the original size of a job).For many policies in the SMART class, the mean response time and mean slowdown are not known or have complex representations involving multiple nested integrals, making evaluation difficult. In this work, we prove three main results. First, for all policies in the SMART class, we prove simple upper and lower bounds on mean response time. Second, we show that all policies in the SMART class, surprisingly, have very similar mean response times. Third, we show that the response times of SMART policies are largely insensitive to the variability of the job size distribution. In particular, we focus on the SRPT and PSJF policies and prove insensitive bounds in these cases.", "date": "2005-06", "date_type": "published", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "33", "number": "1", "publisher": "Association for Computing Machinery (ACM)", "place_of_pub": "New York, NY", "pagerange": "205-216", "id_number": "CaltechAUTHORS:20210310-083932675", "isbn": "1595930221", "issn": "0163-5999", "book_title": "Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20210310-083932675", "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": "CCR-0313148" }, { "agency": "IBM Corporation" }, { "agency": "Pittsburgh Digital Greenhouse", "grant_number": "2003" }, { "agency": "NSF Graduate Research Fellowship" } ] }, "doi": "10.1145/1064212.1064236", "resource_type": "article", "pub_year": "2005", "author_list": "Wierman, Adam; Harchol-Balter, Mor; et el." }, { "id": "https://authors.library.caltech.edu/records/5r688-r2e06", "eprint_id": 106427, "eprint_status": "archive", "datestamp": "2023-08-19 14:12:38", "lastmod": "2023-10-20 23:28:43", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Osogami-Takayuki", "name": { "family": "Osogami", "given": "Takayuki" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Harchol-Balter-M", "name": { "family": "Harchol-Balter", "given": "Mor" } }, { "id": "Scheller-Wolf-A", "name": { "family": "Scheller-Wolf", "given": "Alan" } } ] }, "title": "A recursive analysis technique for multi-dimensionally infinite Markov chains", "ispublished": "pub", "full_text_status": "restricted", "note": "\u00a9 2004 Association for Computing Machinery. \n\nThis work was supported by NSF Grant CCR-0311383 and NSF\nGrant CCR-0133077.", "abstract": "Performance analysis of multiserver systems with multiple classes of jobs often has a common source of difficulty: the state space needed to capture the system behavior grows infinitely in multiple dimensions. For example, consider two processors, each serving its own M/M/1 queue, where one of the processors (the \"donor\") can help the other processor (the \"beneficiary\") with its jobs, during times when the donor processor is idle [5, 16] or when some threshold conditions are met [14, 15]. Since the behavior of beneficiary jobs depends on the number of donor jobs in system, performance analysis of beneficiary jobs involves a two dimensionally infinite (2D-infinite) state space, where one dimension corresponds to the number of beneficiary jobs and the other dimension corresponds to the number of donor jobs. Another example is an M/M/2 queue with two priority classes, where high priority jobs have preemptive priority over low priority jobs (see for example [1, 3, 4, 8, 10, 11, 12, 17] and references therein). Since the behavior of low priority jobs depends on the number of high priority jobs in system, performance analysis of low priority jobs involves 2D-infinite state space, where each dimension corresponds to the number of each class of jobs in system. As we will see, when there are m priority classes, performance analysis of the lowest priority classes involves m dimensionally infinite state space.", "date": "2004-09", "date_type": "published", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "32", "number": "2", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "3-5", "id_number": "CaltechAUTHORS:20201104-094617374", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20201104-094617374", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CCR-0311383" }, { "agency": "NSF", "grant_number": "CCR-0133077" } ] }, "doi": "10.1145/1035334.1035337", "resource_type": "article", "pub_year": "2004", "author_list": "Osogami, Takayuki; Wierman, Adam; et el." }, { "id": "https://authors.library.caltech.edu/records/n9rp8-1xb11", "eprint_id": 106165, "eprint_status": "archive", "datestamp": "2023-08-22 01:28:55", "lastmod": "2023-10-20 23:09:31", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Salzman-J", "name": { "family": "Salzman", "given": "Julia" } }, { "id": "Jablonski-M", "name": { "family": "Jablonski", "given": "Michael" } }, { "id": "Godbole-A-P", "name": { "family": "Godbole", "given": "Anant P." } } ] }, "title": "An improved upper bound for the pebbling threshold of the n-path", "ispublished": "pub", "full_text_status": "restricted", "keywords": "Pebbling number; Pebbling threshold; n-Path; n-Cycle", "note": "\u00a9 2003 Elsevier B.V. Under an Elsevier user license. \n\nReceived 3 January 2002, Revised 17 September 2002, Accepted 7 October 2002, Available online 16 October 2003. \n\nThe research of each of the four authors was supported by NSF Grant DMS-0049015, and was conducted at East Tennessee State University in the Summers of 2000 and 2001, when Salzman, Wierman and Jablonski were undergraduate students at Princeton University, Carnegie Mellon University and the University of Tennessee (Knoxville), respectively. We thank the anonymous referees for a most meticulous appraisal of the paper, and for several useful suggestions.", "abstract": "Given a configuration of t indistinguishable pebbles on the n vertices of a graph G, we say that a vertex v can be reached if a pebble can be placed on it in a finite number of \"moves\". G is said to be pebbleable if all its vertices can be thus reached. Now given the n-path P_n how large (resp. small) must t be so as to be able to pebble the path almost surely (resp. almost never)? It was known that the threshold th(P_n) for pebbling the path satisfies n2^c\u221algn \u2a7d th(Pn_) \u2a7d n2\u00b2\u221algn, where lg = log\u2082 and c < 1/\u221a2 is arbitrary. We improve the upper bound for the threshold function to th(P_n) \u2a7d n2^d\u221algn, where d > 1 is arbitrary.", "date": "2004-01-28", "date_type": "published", "publication": "Discrete Mathematics", "volume": "275", "number": "1-3", "publisher": "Elsevier", "pagerange": "367-373", "id_number": "CaltechAUTHORS:20201020-083144033", "issn": "0012-365X", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20201020-083144033", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "DMS-0049015" } ] }, "doi": "10.1016/j.disc.2002.10.001", "resource_type": "article", "pub_year": "2004", "author_list": "Wierman, Adam; Salzman, Julia; et el." }, { "id": "https://authors.library.caltech.edu/records/zndfe-chp38", "eprint_id": 104635, "eprint_status": "archive", "datestamp": "2023-08-22 01:25:55", "lastmod": "2023-10-20 20:41:16", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Bansal-N", "name": { "family": "Bansal", "given": "Nikhil" } }, { "id": "Harchol-Balter-M", "name": { "family": "Harchol-Balter", "given": "Mor" } } ] }, "title": "A note on comparing response times in the M/GI/1/FB and M/GI/1/PS queues", "ispublished": "pub", "full_text_status": "restricted", "keywords": "Scheduling; M/G/1; Feedback (FB); Least attained service (LAS); Shortest elapsed time (SET); Processor sharing (PS); Sojourn time; Response time", "note": "\u00a9 2003 Elsevier B.V. \n\nReceived 20 September 2002, Revised 15 April 2003, Accepted 16 April 2003, Available online 1 July 2003. \n\nThis work was supported by NSF Career Grant CCR-0133077, by NSF ITR Grant 99-167 ANI-0081396, by Cisco Systems, Spinnaker Networks via Pittsburgh Digital Greenhouse Grant 01-1, and an IBM Research Fellowship.", "abstract": "We compare the overall mean response time (a.k.a. sojourn time) of the processor sharing (PS) and feedback (FB) queues under an M/GI/1 system. We show that FB outperforms PS under service distributions having decreasing failure rates; whereas PS outperforms FB under service distributions having increasing failure rates.", "date": "2004-01", "date_type": "published", "publication": "Operations Research Letters", "volume": "32", "number": "1", "publisher": "Elsevier", "pagerange": "73-76", "id_number": "CaltechAUTHORS:20200729-101550519", "issn": "0167-6377", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20200729-101550519", "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": "99-167 ANI-0081396" }, { "agency": "Cisco Systems" }, { "agency": "Spinnaker Networks" }, { "agency": "Pittsburgh Digital Greenhouse", "grant_number": "01-1" }, { "agency": "IBM" } ] }, "doi": "10.1016/s0167-6377(03)00061-0", "resource_type": "article", "pub_year": "2004", "author_list": "Wierman, Adam; Bansal, Nikhil; et el." }, { "id": "https://authors.library.caltech.edu/records/ecw9p-jck30", "eprint_id": 106426, "eprint_status": "archive", "datestamp": "2023-08-19 11:58:14", "lastmod": "2023-10-20 23:28:34", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Osogami-Takayuki", "name": { "family": "Osogami", "given": "Takayuki" } }, { "id": "Ols\u00e9n-J\u00f6rgen", "name": { "family": "Ols\u00e9n", "given": "J\u00f6rgen" } } ] }, "title": "Modeling TCP-vegas under on/off traffic", "ispublished": "pub", "full_text_status": "restricted", "note": "\u00a9 2003 Association for Computing Machinery.", "abstract": "There has been a significant amount of research toward modeling variants of the Transmission Control Protocol (TCP) in order to understand the impact of this protocol on file transmission times and network utilization. Analytical models have emerged as a way to reduce the time required for evaluation when compared with more traditional evaluations performed using event driven simulators such as ns. In addition, when designed carefully, analytical models help researchers make design decisions about novel TCP mechanisms.", "date": "2003-09", "date_type": "published", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "31", "number": "2", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "6-8", "id_number": "CaltechAUTHORS:20201104-094050639", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20201104-094050639", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/959143.959146", "resource_type": "article", "pub_year": "2003", "author_list": "Wierman, Adam; Osogami, Takayuki; et el." }, { "id": "https://authors.library.caltech.edu/records/rxyej-tnj09", "eprint_id": 106425, "eprint_status": "archive", "datestamp": "2023-08-22 00:34:55", "lastmod": "2023-10-20 23:28:30", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } }, { "id": "Harchol-Balter-M", "name": { "family": "Harchol-Balter", "given": "Mor" } } ] }, "title": "Classifying scheduling policies with respect to unfairness in an M/GI/1", "ispublished": "pub", "full_text_status": "restricted", "keywords": "Scheduling; unfairness; M/G/1; FB; LAS; SET; feedback; least attained\nservice; shortest elapsed time; PS; processor sharing; SRPT; shortest remaining processing time; slowdown", "note": "\u00a9 2003 Association for Computing Machinery. \n\nThis work was supported by NSF Career Grant CCR-0133077 and\nby Pittsburgh Digital Greenhouse Grant 01-1.", "abstract": "It is common to evaluate scheduling policies based on their mean response times. Another important, but sometimes opposing, performance metric is a scheduling policy's fairness. For example, a policy that biases towards small job sizes so as to minimize mean response time may end up being unfair to large job sizes. In this paper we define three types of unfairness and demonstrate large classes of scheduling policies that fall into each type. We end with a discussion on which jobs are the ones being treated unfairly.", "date": "2003-06", "date_type": "published", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "31", "number": "1", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "238-249", "id_number": "CaltechAUTHORS:20201104-093530569", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20201104-093530569", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "funders": { "items": [ { "agency": "NSF", "grant_number": "CCR-0133077" }, { "agency": "Pittsburgh Digital Greenhouse", "grant_number": "01-1" } ] }, "doi": "10.1145/885651.781057", "resource_type": "article", "pub_year": "2003", "author_list": "Wierman, Adam and Harchol-Balter, Mor" }, { "id": "https://authors.library.caltech.edu/records/5w429-jkq43", "eprint_id": 106424, "eprint_status": "archive", "datestamp": "2023-08-19 10:23:47", "lastmod": "2023-10-20 23:28:24", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Harchol-Balter-M", "name": { "family": "Harchol-Balter", "given": "Mor" } }, { "id": "Sigman-K", "name": { "family": "Sigman", "given": "Karl" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Understanding the slowdown of large jobs in an M/GI/1 system", "ispublished": "pub", "full_text_status": "restricted", "note": "\u00a9 2002 Association for Computing Machinery. \n\nThis is a brief introduction to our recent Technical Report CMU-CS-02-118.", "abstract": "We explore the performance of an M/GI/1 queue under various scheduling policies from the perspective of a new metric: the it slowdown experienced by largest jobs. We consider scheduling policies that bias against large jobs, towards large jobs, and those that are fair, e.g., Processor-Sharing. We prove that as job size increases to infinity, all work conserving policies converge almost surely with respect to this metric to no more than 1/(1-\u03c1), where \u03c1 denotes load. We also find that the expected slowdown under any work conserving policy can be made arbitrarily close to that under Processor-Sharing, for all job sizes that are sufficiently large.", "date": "2002-12", "date_type": "published", "publication": "ACM SIGMETRICS Performance Evaluation Review", "volume": "30", "number": "3", "publisher": "Association for Computing Machinery (ACM)", "pagerange": "9-11", "id_number": "CaltechAUTHORS:20201104-093156865", "issn": "0163-5999", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20201104-093156865", "rights": "No commercial reproduction, distribution, display or performance rights in this work are provided.", "doi": "10.1145/605521.605526", "resource_type": "article", "pub_year": "2002", "author_list": "Harchol-Balter, Mor; Sigman, Karl; et el." }, { "id": "https://authors.library.caltech.edu/records/5g47m-4sk44", "eprint_id": 106160, "eprint_status": "archive", "datestamp": "2023-08-21 23:40:33", "lastmod": "2023-10-20 23:09:09", "type": "article", "metadata_visibility": "show", "creators": { "items": [ { "id": "Harchol-Balter-M", "name": { "family": "Harchol-Balter", "given": "Mor" } }, { "id": "Sigman-K", "name": { "family": "Sigman", "given": "Karl" } }, { "id": "Wierman-A", "name": { "family": "Wierman", "given": "Adam" } } ] }, "title": "Asymptotic convergence of scheduling policies with respect to slowdown", "ispublished": "pub", "full_text_status": "restricted", "keywords": "Scheduling; Conservation; Large jobs; Convergence; Shortest-remaining-processing-time; Processor-sharing", "note": "\u00a9 2002 Elsevier Science B.V. \n\nThis work was supported by NSF Career grant CCR-0133077, NSF ITR grant 99-167 ANI-0081396 and by Spinnaker Networks via Pittsburgh Digital Greenhouse grant 01-1.", "abstract": "We explore the performance of an M/GI/1 queue under various scheduling policies from the perspective of a new metric: the slowdown experienced by the largest jobs. We consider scheduling policies that bias against large jobs, towards large jobs, and those that are fair, e.g., processor-sharing (PS). We prove that as job size increases to infinity, all work conserving policies converge almost surely with respect to this metric to no more than 1/(1\u2212\u03c1), where \u03c1 denotes the load. We also find that the expected slowdown under any work conserving policy can be made arbitrarily close to that under PS, for all job sizes that are sufficiently large.", "date": "2002-09", "date_type": "published", "publication": "Performance Evaluation", "volume": "49", "number": "1-4", "publisher": "Elsevier", "pagerange": "241-256", "id_number": "CaltechAUTHORS:20201020-074935944", "issn": "0166-5316", "official_url": "https://resolver.caltech.edu/CaltechAUTHORS:20201020-074935944", "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": "99-167 ANI-0081396" }, { "agency": "Pittsburgh Digital Greenhouse", "grant_number": "01-1" } ] }, "doi": "10.1016/s0166-5316(02)00132-3", "resource_type": "article", "pub_year": "2002", "author_list": "Harchol-Balter, Mor; Sigman, Karl; et el." } ]