STUDENTS PROBABILITY DAY Weizmann Institute of Science March 28, 2007 Yoni Nazarathy (Supervisor: Prof. Gideon Weiss) University of Haifa Yoni Nazarathy.

Slides:



Advertisements
Similar presentations
Xia Zhou*, Stratis Ioannidis ♯, and Laurent Massoulié + * University of California, Santa Barbara ♯ Technicolor Research Lab, Palo Alto + Technicolor Research.
Advertisements

Queueing and Scheduling - Bridging the Gap Gideon Weiss University of Haifa CIRM Marseilles May, 2008 Gideon Weiss University of Haifa CIRM Marseilles.
Queueing Models and Ergodicity. 2 Purpose Simulation is often used in the analysis of queueing models. A simple but typical queueing model: Queueing models.
CWI PNA2, Reading Seminar, Presented by Yoni Nazarathy EURANDOM and the Dept. of Mechanical Engineering, TU/e Eindhoven September 17, 2009 An Assortment.
1 EL736 Communications Networks II: Design and Algorithms Class8: Networks with Shortest-Path Routing Yong Liu 10/31/2007.
Balancing Reduces Asymptotic Variance of Outputs Yoni Nazarathy * EURANDOM, Eindhoven University of Technology, The Netherlands. Based on some joint works.
Neeraj Jaggi ASSISTANT PROFESSOR DEPT OF ELECTRICAL ENGINEERING AND COMPUTER SCIENCE WICHITA STATE UNIVERSITY 1 Rechargeable Sensor Activation under Temporally.
Operational Research II By Dr. SW Poon. Line of Balance.
*Sponsored in part by the DARPA IT-MANET Program, NSF OCE Opportunistic Scheduling with Reliability Guarantees in Cognitive Radio Networks Rahul.
Network Bandwidth Allocation (and Stability) In Three Acts.
1 DYNAMIC SCHEDULING OF A PARALLEL SERVER SYSTEM IN HEAVY TRAFFIC UNDER A COMPLETE RESOURCE POOLING CONDITION Ruth J. Williams University of California,
A Fair Scheduling Policy for Wireless Channels with Intermittent Connectivity Saswati Sarkar Department of Electrical and Systems Engineering University.
1 40 th Annual CISS 2006 Conference on Information Sciences and Systems Some Optimization Trade-offs in Wireless Network Coding Yalin E. Sagduyu Anthony.
Queuing. Elements of Waiting Lines  Population –Source of customers Infinite or finite.
Finite Difference Methods to Solve the Wave Equation To develop the governing equation, Sum the Forces The Wave Equation Equations of Motion.
Finite Buffer Fluid Networks with Overflows Yoni Nazarathy, Swinburne University of Technology, Melbourne. Stijn Fleuren and Erjen Lefeber, Eindhoven University.
Buffer Management for Shared- Memory ATM Switches Written By: Mutlu Apraci John A.Copelan Georgia Institute of Technology Presented By: Yan Huang.
Optimal Energy and Delay Tradeoffs for Multi-User Wireless Downlinks Michael J. Neely University of Southern California
Asaf Cohen (joint work with Rami Atar) Department of Mathematics University of Michigan Financial Mathematics Seminar University of Michigan March 11,
Yoni Nazarathy EPPS EURANDOM November 4, 2010
Control and Optimization Meet the Smart Power Grid: Scheduling of Power Demands for Optimal Energy Management Authors: Iordanis Koutsopoulos Leandros Tassiulas.
Multiple-access Communication in Networks A Geometric View W. Chen & S. Meyn Dept ECE & CSL University of Illinois.
Distributed resource allocation in wireless data networks: Performance and design Alexandre Proutière Orange-FT / ENS Paris.
Distributed control and Smart Grids
Particle Filtering in Network Tomography
Yoni Nazarathy Gideon Weiss University of Haifa Yoni Nazarathy Gideon Weiss University of Haifa On the Variance of Queueing Output Processes Haifa Statistics.
On the variance curve of outputs for some queues and networks Yoni Nazarathy Gideon Weiss Yoav Kerner QPA Seminar, EURANDOM January 8, 2009.
Announcements Topics: Work On:
Finite Buffer Fluid Networks with Overflows Yoni Nazarathy, Swinburne University of Technology, Melbourne. Stijn Fleuren and Erjen Lefeber, Eindhoven University.
Flows and Networks Plan for today (lecture 5): Last time / Questions? Blocking of transitions Kelly / Whittle network Optimal design of a Kelly / Whittle.
Yoni Nazarathy Gideon Weiss University of Haifa Yoni Nazarathy Gideon Weiss University of Haifa The Asymptotic Variance of the Output Process of Finite.
Multiclass P2P Networks: Static Resource Allocation for Service Differentiation and Bandwidth Diversity Florence Clévenot-Perronnin, Philippe Nain and.
Full symmetric duality in continuous linear programming Evgeny ShindinGideon Weiss.
Maximization of Network Survivability against Intelligent and Malicious Attacks (Cont’d) Presented by Erion Lin.
Yoni Nazarathy Gideon Weiss University of Haifa Yoni Nazarathy Gideon Weiss University of Haifa The Asymptotic Variance of the Output Process of Finite.
Stability using fluid limits: Illustration through an example "Push-Pull" queuing network Yoni Nazarathy* EURANDOM Contains Joint work with Gideon Weiss.
On Optimizing the Backoff Interval for Random Access Scheme Zygmunt J. Hass and Jing Deng IEEE Transactions on Communications, Dec 2003.
1 A Simple Asymptotically Optimal Energy Allocation and Routing Scheme in Rechargeable Sensor Networks Shengbo Chen, Prasun Sinha, Ness Shroff, Changhee.
Queuing Networks Jean-Yves Le Boudec 1. Contents 1.The Class of Multi-Class Product Form Networks 2.The Elements of a Product-Form Network 3.The Product-Form.
Queuing Networks Jean-Yves Le Boudec 1. Networks of Queues Stability Queuing networks are frequently used models The stability issue may, in general,
On the variance curve of outputs for some queues and networks Yoni Nazarathy Gideon Weiss Yoav Kerner CWI Amsterdam March 2009.
Appointment Systems - a Stochastic and Fluid Approach Michal Penn The William Davidson Faculty of Industrial Engineering and Management Technion - Israel.
On Control of Queueing Networks and The Asymptotic Variance Rate of Outputs Ph.d Summary Talk Yoni Nazarathy Supervised by Prof. Gideon Weiss Haifa Statistics.
Michael J. Neely, University of Southern California CISS, Princeton University, March 2012 Asynchronous Scheduling for.
Yoni Nazarathy Gideon Weiss University of Haifa Yoni Nazarathy Gideon Weiss University of Haifa The Asymptotic Variance Rate of the Departure Process of.
Erasure Coding for Real-Time Streaming Derek Leong and Tracey Ho California Institute of Technology Pasadena, California, USA ISIT
Yoni Nazarathy Gideon Weiss University of Haifa Yoni Nazarathy Gideon Weiss University of Haifa On the Asymptotic Variance Rate of the Output Process of.
Positive Harris Recurrence and Diffusion Scale Analysis of a Push-Pull Queueing Network Yoni Nazarathy and Gideon Weiss University of Haifa ValueTools.
Delay-Based Back-Pressure Scheduling in Multi-Hop Wireless Networks 1 Bo Ji, 2 Changhee Joo and 1 Ness B. Shroff 1 Department of ECE, The Ohio State University.
Managing Server Energy and Operational Costs Chen, Das, Qin, Sivasubramaniam, Wang, Gautam (Penn State) Sigmetrics 2005.
ORSIS Conference, Jerusalem Mountains, Israel May 13, 2007 Yoni Nazarathy Gideon Weiss University of Haifa Yoni Nazarathy Gideon Weiss University of Haifa.
Finite-Horizon Energy Allocation and Routing Scheme in Rechargeable Sensor Networks Shengbo Chen, Prasun Sinha, Ness Shroff, Changhee Joo Electrical and.
Hidden Markov Model Multiarm Bandits: A Methodology for Beam Scheduling in Multitarget Tracking Presented by Shihao Ji Duke University Machine Learning.
Dynamic Programming Discrete time frame Multi-stage decision problem Solves backwards.
14 th INFORMS Applied Probability Conference, Eindhoven July 9, 2007 Yoni Nazarathy Gideon Weiss University of Haifa Yoni Nazarathy Gideon Weiss University.
Stochastic Optimization for Markov Modulated Networks with Application to Delay Constrained Wireless Scheduling Michael J. Neely University of Southern.
Energy Optimal Control for Time Varying Wireless Networks Michael J. Neely University of Southern California
Indian Institute of Technology Bombay 1 Communication Networks Prof. D. Manjunath
Yoni Nazarathy Gideon Weiss University of Haifa Yoni Nazarathy Gideon Weiss University of Haifa The Asymptotic Variance of the Output Process of Finite.
On the Variance of Output Counts of Some Queueing Systems Yoni Nazarathy Gideon Weiss SE Club, TU/e April 20, 2008.
Linear Programming Chapter 1 Introduction.
Mean Field Methods for Computer and Communication Systems Jean-Yves Le Boudec EPFL Network Science Workshop Hong Kong July
Dynamic Resource Allocation for Shared Data Centers Using Online Measurements By- Abhishek Chandra, Weibo Gong and Prashant Shenoy.
IBM Thomas J. Watson Research Center © 2004 IBM Corporation Analysis of Parallel-Server Systems with Dynamic Affinity Scheduling and Load Balancing Mark.
Capacity Allocation Paradox Isaac Keslassy
Full symmetric duality in continuous linear programming
Departure Process Variability of Queues and Queueing Networks
The Variance of Production Counts over a Long Time Horizon
Capacity Allocation Paradox Isaac Keslassy
Presentation transcript:

STUDENTS PROBABILITY DAY Weizmann Institute of Science March 28, 2007 Yoni Nazarathy (Supervisor: Prof. Gideon Weiss) University of Haifa Yoni Nazarathy (Supervisor: Prof. Gideon Weiss) University of Haifa Queueing Networks with Infinite Virtual Queues An Example, An Application and a Fundamental Question

Yoni Nazarathy, University of Haifa, Multi-Class Queueing Networks (Harrison 1988, Dai 1995, … ) Queues 1/4 3/4 Routes Initial Queue Levels Servers Processing Durations Resource Allocation (Scheduling) Network Dynamics

Yoni Nazarathy, University of Haifa, INTRODUCING: Infinite Virtual Queues Regular Queue Infinite Virtual Queue Example Realization   Relative Queue Length: Nominal Production Rate

Yoni Nazarathy, University of Haifa, MCQN+IVQ Queues 1/4 3/4 Routes Initial Queue Levels Servers Processing Durations Resource Allocation (Scheduling) Network Dynamics Nominal Productio n Rates

Yoni Nazarathy, University of Haifa, An Example

Yoni Nazarathy, University of Haifa, A Push-Pull Queueing System (Weiss, Kopzon 2002,2006) Server 1Server 2 PUSH PULL PUSH Fluid Solution: or Require Full Utilization Require Rate Stability “Inherently Stable” “Inherently Unstable” Proportion of time server i allocates to “Pulling”

Yoni Nazarathy, University of Haifa, Maximum Pressure (Dai, Lin 2005) Max-Pressure is a rate stable policy (even when ρ=1). Push-Pull acts like a ρ=1 System. As Proven by Dai and Lin, Max-Pressure is rate stable. But for the Push-Pull system Max-Pressure is not Positive Recurrent: Queue on Server 1 Queue on Server 2

Yoni Nazarathy, University of Haifa, Positive Recurrent Policies Exist!!! Kopzon, Weiss 2002 Kopzon, Weiss 2006

Yoni Nazarathy, University of Haifa, An Application

Yoni Nazarathy, University of Haifa, Near Optimal Control over a Finite Time Horizon Approximation Approach: 1) Approximate the problem using a fluid system. 2) Solve the fluid system (SCLP). 3) Track the fluid solution on-line (Using MCQN+IVQs). 4) Under proper scaling, the approach is asymptotically optimal. Approximation Approach: 1) Approximate the problem using a fluid system. 2) Solve the fluid system (SCLP). 3) Track the fluid solution on-line (Using MCQN+IVQs). 4) Under proper scaling, the approach is asymptotically optimal. Solution is intractable Finite Horizon Control of MCQN Weiss, Nazarathy 2007

Yoni Nazarathy, University of Haifa, Fluid formulation s.t. This is a Separated Continuous Linear Program (SCLP) Server 1Server

Yoni Nazarathy, University of Haifa, Fluid solution SCLP – Bellman, Anderson, Pullan, Weiss. Piecewise linear solution. Simplex based algorithm, finds the optimal solution in a finite number of steps (Weiss). The Optimal Solution: SCLP – Bellman, Anderson, Pullan, Weiss. Piecewise linear solution. Simplex based algorithm, finds the optimal solution in a finite number of steps (Weiss). The Optimal Solution:

Yoni Nazarathy, University of Haifa, Time Intervals For each time interval, set a MCQN with Infinite Virtual Queues.

Yoni Nazarathy, University of Haifa, Maximum Pressure (Dai, Lin) is such a policy, even when ρ=1 Now Control the MCQN+IVQ Using a Rate Stable Policy

Yoni Nazarathy, University of Haifa, Example realizations, N={1,10,100} seed 1 seed 2 seed 3 seed 4

Yoni Nazarathy, University of Haifa, A Fundamental Question

Yoni Nazarathy, University of Haifa, Is there a characterization of MCQN+IVQs that allows: Full Utilization of all the servers that have an IVQ. Stability of all finite queues. Proportional equality among production streams. Is there a characterization of MCQN+IVQs that allows: Full Utilization of all the servers that have an IVQ. Stability of all finite queues. Proportional equality among production streams. ?

Yoni Nazarathy, University of Haifa, Thank You