Scheduling and staffing strategic servers. strategic servers system performance Journal reviews Call centers Crowdsourcing Cloud computing Enterprise.

Slides:

Advertisements

Similar presentations

Dispatching to Incentivize Fast Service in Multi-Server Queues Raga Gopalakrishnan and Adam Wierman California Institute of Technology Sherwin Doroudi.

Advertisements

Achieving Elasticity for Cloud MapReduce Jobs Khaled Salah IEEE CloudNet 2013 – San Francisco November 13, 2013.

Fast Convergence of Selfish Re-Routing Eyal Even-Dar, Tel-Aviv University Yishay Mansour, Tel-Aviv University.

Raga Gopalakrishnan University of Colorado at Boulder Adam Wierman (Caltech) Amy R. Ward (USC) Sherwin Doroudi (CMU) Scheduling and Staffing when Servers.

Routing and Staffing to Incentivize Servers in Many Server Systems Amy Ward (USC) Raga Gopalakrishnan (Caltech/CU-Boulder/USC) Adam Wierman (Caltech) Sherwin.

ISE480 Sequencing and Scheduling Izmir University of Economics ISE Fall Semestre.

The Impact of Server Incentives on Scheduling Raga Gopalakrishnan and Adam Wierman California Institute of Technology Sherwin Doroudi Carnegie Mellon University.

Chunyang Tong Sriram Dasu Information & Operations Management Marshall School of Business University of Southern California Los Angeles CA Dynamic.

S. Chopra/Operations/Managing Services1 Operations Management: Capacity Management in Services Module u Why do queues build up? u Process attributes and.

On Priority Queues with Impatient Customers: Exact and Asymptotic Analysis Seminar in Operations Research 01/01/2007 Luba Rozenshmidt Advisor: Prof. Avishai.

Robust Allocation of a Defensive Budget Considering an Attacker’s Private Information Mohammad E. Nikoofal and Jun Zhuang Presenter: Yi-Cin Lin Advisor:

Raga Gopalakrishnan University of Colorado at Boulder Adam Wierman (Caltech) Amy R. Ward (USC) Sherwin Doroudi (CMU) Routing and Staffing when Servers.

NETE4631:Capacity Planning (3)- Private Cloud Lecture 11 Suronapee Phoomvuthisarn, Ph.D. /

Queueing Theory: Recap

Maryam Elahi Fairness in Speed Scaling Design Joint work with: Carey Williamson and Philipp Woelfel.

OM&PM/Class 7a1 Operations Management & Performance Modeling 1Operations Strategy 2Process Analysis 3Lean Operations 4Supply Chain Management 5Capacity.

Computer Science Deadline Fair Scheduling: Bridging the Theory and Practice of Proportionate-Fair Scheduling in Multiprocessor Servers Abhishek Chandra.

Competition between adaptive agents: learning and collective efficiency Damien Challet Oxford University Matteo Marsili ICTP-Trieste (Italy)

Dynamic Spectrum Management: Optimization, game and equilibrium Tom Luo (Yinyu Ye) December 18, WINE 2008.

Staffing and Routing in Large-Scale Service Systems with Heterogeneous-Servers Mor Armony Stern School of Business, NYU INFORMS 2009 Joint work with Avi.

FINDING THE OPTIMAL QUANTUM SIZE Revisiting the M/G/1 Round-Robin Queue VARUN GUPTA Carnegie Mellon University.

Staffing and Routing in Large-Scale Service Systems with Heterogeneous-Servers Mor Armony Based on joint papers with Avi Mandelbaum and Amy Ward TexPoint.

Modeling and Simulation Dr. X. Topics  M/M/1 models and how they can be used  Simple Queuing Systems  Time-varying parameters  Simulation parameters.

Is 99% Utilization of a Supercomputer a Good Thing? Scheduling in Context: User Utility Functions Cynthia Bailey Lee Department of Computer Science and.

Raga Gopalakrishnan University of Colorado at Boulder Adam Wierman (Caltech) Amy R. Ward (USC) Sherwin Doroudi (CMU) Staffing and Routing to incentivize.

1 EC9B6 Voting and Communication Lecture 1 Prof. Francesco Squintani

L/O/G/O Equilibrium prices for providers in Queueing System Petrozavodsk Nina Plaksina Petrozavodsk State University 2011 year.

Asaf Cohen (joint work with Rami Atar) Department of Mathematics University of Michigan Financial Mathematics Seminar University of Michigan March 11,

By: Gang Zhou Computer Science Department University of Virginia 1 A Game-Theoretic Framework for Congestion Control in General Topology Networks SYS793.

MobSched: An Optimizable Scheduler for Mobile Cloud Computing S. SindiaS. GaoB. Black A.LimV. D. AgrawalP. Agrawal Auburn University, Auburn, AL 45 th.

M EAN -V ALUE A NALYSIS Manijeh Keshtgary O VERVIEW Analysis of Open Queueing Networks Mean-Value Analysis 2.

Decentralised load balancing in closed and open systems A. J. Ganesh University of Bristol Joint work with S. Lilienthal, D. Manjunath, A. Proutiere and.

On the variance curve of outputs for some queues and networks Yoni Nazarathy Gideon Weiss Yoav Kerner QPA Seminar, EURANDOM January 8, 2009.

Flows and Networks Plan for today (lecture 5): Last time / Questions? Blocking of transitions Kelly / Whittle network Optimal design of a Kelly / Whittle.

Cloud Computing Energy efficient cloud computing Keke Chen.

1 Efficiency and Nash Equilibria in a Scrip System for P2P Networks Eric J. Friedman Joseph Y. Halpern Ian Kash.

Storage Management in Virtualized Cloud Environments Sankaran Sivathanu, Ling Liu, Mei Yiduo and Xing Pu Student Workshop on Frontiers of Cloud Computing,

Yoni Nazarathy Gideon Weiss University of Haifa Yoni Nazarathy Gideon Weiss University of Haifa The Asymptotic Variance of the Output Process of Finite.

1 Distributed Process Scheduling: A System Performance Model Vijay Jain CSc 8320, Spring 2007.

On a Production/Inventory System with Strategic Customers and Unobservable Inventory Levels Can Oz Fikri Karaesmen SMMSO June 2015.

Link Scheduling & Queuing COS 461: Computer Networks

Analysis of M/M/c/N Queuing System With Balking, Reneging and Synchronous Vacations Dequan Yue Department of Statistics, College of Sciences Yanshan University,

Control for Stochastic Models via Diffusion Approximations Amy Ward, ANS Lecture Series 2008 TexPoint fonts used in EMF. Read the TexPoint manual before.

Blind Fair Routing in Large-Scale Service Systems Mor Armony Stern School of Business, NYU *Joint work with Amy Ward TexPoint fonts used in EMF. Read the.

Networks of Queues Plan for today (lecture 6): Last time / Questions? Product form preserving blocking Interpretation traffic equations Kelly / Whittle.

Queuing Theory Basic properties, Markovian models, Networks of queues, General service time distributions, Finite source models, Multiserver queues Chapter.

Waiting Lines and Queuing Models. Queuing Theory  The study of the behavior of waiting lines Importance to business There is a tradeoff between faster.

Chapter 16 Capacity Planning and Queuing Models

On the variance curve of outputs for some queues and networks Yoni Nazarathy Gideon Weiss Yoav Kerner CWI Amsterdam March 2009.

October, 2000.A Self Organsing NN for Job Scheduling in Distributed Systems I.C. Legrand1 Iosif C. Legrand CALTECH.

Michael J. Neely, University of Southern California CISS, Princeton University, March 2012 Asynchronous Scheduling for.

4th Annual INFORMS Revenue Management and Pricing Section Conference, June 2004 An Asymptotically-Optimal Dynamic Admission Policy for a Revenue Management.

Positive Harris Recurrence and Diffusion Scale Analysis of a Push-Pull Queueing Network Yoni Nazarathy and Gideon Weiss University of Haifa ValueTools.

Investment and market structure in industries with congestion Ramesh Johari November 7, 2005 (Joint work with Gabriel Weintraub and Ben Van Roy)

ITMANET PI Meeting September 2009 ITMANET Nequ-IT Focus Talk (PI Neely): Reducing Delay in MANETS via Queue Engineering.

NETE4631: Network Information System Capacity Planning (2) Suronapee Phoomvuthisarn, Ph.D. /

Job Scheduling P. (Saday) Sadayappan Ohio State University.

Technical Supplement 2 Waiting Line Models McGraw-Hill/Irwin Copyright © 2011 by the McGraw-Hill Companies, Inc. All rights reserved.

Audit Games Jeremiah Blocki, Nicolas Christin, Anupam Datta, Ariel D. Procaccia, Arunesh Sinha 1 Carnegie Mellon University.

Yoni Nazarathy Gideon Weiss University of Haifa Yoni Nazarathy Gideon Weiss University of Haifa The Asymptotic Variance of the Output Process of Finite.

COMT 4291 Queuing Analysis COMT Call/Packet Arrival Arrival Rate, Inter-arrival Time, 1/ Arrival Rate measures the number of customer arrivals.

Networks (3TU) Plan for today (lecture 5): Last time / Questions? Tandem network Jackson network: definition Jackson network: equilibrium distribution.

Energy-Aware Scheduling on Heterogeneous Processors

Deadline Scheduling and Heavy tail distributionS

Computer Systems Performance Evaluation

2016 International Conference on Grey Systems and Uncertainty Analysis

P. (Saday) Sadayappan Ohio State University

Deadline Scheduling and Heavy tailED distributions

Computer Systems Performance Evaluation

Numerical Studies on Braess-like Paradoxes for Non-Cooperative Load Balancing in Distributed Computer Systems By Said Fathy El-Zoghdy, Hisao Kameda, and.

Presentation transcript:

Scheduling and staffing strategic servers

strategic servers system performance Journal reviews Call centers Crowdsourcing Cloud computing Enterprise data centers … service systems 

strategic servers system performance Journal reviews Call centers Crowdsourcing Cloud computing Enterprise data centers … service systems This talk: Impact of strategic servers on optimal system design  Classic Queueing: Assumes fixed (arrival and) service rates, fixed control/policies. Queueing games: Strategic arrivals Service/price competition [Hassin and Haviv 2003] Scheduling and staffing strategic servers

Outline The M/M/1 Queue – a simple example Model for a strategic server The M/M/N Queue Classic policies in non-strategic setting Impact of strategic servers SchedulingStaffing which idle server gets the next job? how many servers to hire?

M/M/1/FCFS   strategic server idleness cost utility function    LHS RHS

Outline The M/M/1 queue – a simple example Model for a strategic server The strategic M/M/N queue Classic policies in non-strategic setting Impact of strategic servers SchedulingStaffing

M/M/N/FCFS  strategic servers scheduling   symmetric Nash equilibrium Nash equilibrium existence? performance? Blue for strategic service rates Yellow for control/policy parameters

Outline The M/M/1 queue – a simple example Model for a strategic server The strategic M/M/N queue Classic policies in non-strategic setting Impact of strategic servers SchedulingStaffing

M/M/N/FCFS scheduling    When servers are not strategic… [Lin et al. 1984] [Véricourt et al. 2005] [Armony 2005] [Atar 2008] [Armony et al. 2010]

M/M/N/FCFS  scheduling   Q: Which policy does better – FSF or its counterpart, SSF? Theorem: No symmetric equilibrium exists under either FSF or SSF. Q: How about Longest-Idle-Server-First (LISF)? Theorem: All idle-time-order-based policies result in the same symmetric equilibrium as Random. Q: Can we do better than Random? Answer: Yes! (ask me later!)

M/M/N/FCFS  Random   First order condition:

Problem: This is a mess!!!

Outline The M/M/1 queue – a simple example Model for a strategic server The strategic M/M/N queue Classic policies in non-strategic setting Impact of strategic servers SchedulingStaffing

M/M/N/FCFS    When servers are not strategic… Random staffing asymptotically optimal [Borst et al. 2004]

M/M/N/FCFS  Random  staffing When servers are strategic… Problem: Explicit expression unknown!

M/M/N/FCFS  Random  staffing When servers are strategic… (ask me later!)

Concluding remarks We need to rethink optimal system design when servers are strategic! M/M/N/FCFS  Random   loss of efficiency? $ $$$$ $$ ? ?

Scheduling and staffing strategic servers