The Best Duo 2014 - 2015.

Slides:



Advertisements
Similar presentations
Load Balancing of Elastic Traffic in Heterogeneous Wireless Networks Abdulfetah Khalid, Samuli Aalto and Pasi Lassila
Advertisements

Queuing Theory For Dummies
Queuing Models Basic Concepts
Data Communication and Networks Lecture 13 Performance December 9, 2004 Joseph Conron Computer Science Department New York University
I think your suggestion is, Can we do two things at once? Well, we’re of the view that we can walk and chew gum at the same time. —Richard Armitage, deputy.
Modeling and Analysis of Manufacturing Systems Session 2 QUEUEING MODELS January 2001.
Analysis and Design of Asynchronous Transfer Lines as a series of G/G/m queues: Overview and Examples.
QUEUING MODELS Queuing theory is the analysis of waiting lines It can be used to: –Determine the # checkout stands to have open at a store –Determine the.
Effect of higher moments of job size distribution on the performance of an M/G/k system VARUN GUPTA Joint work with: Mor Harchol-Balter Carnegie Mellon.
Effect of higher moments of job size distribution on the performance of an M/G/k system VARUN GUPTA Joint work with: Mor Harchol-Balter Carnegie Mellon.
Modeling and Analysis of CONWIP-based Flowlines as Closed Queueing Networks.
1 Real-Time Queueing Network Theory Presented by Akramul Azim Department of Electrical and Computer Engineering University of Waterloo, Canada John P.
Flows and Networks Plan for today (lecture 5): Last time / Questions? Waiting time simple queue Little Sojourn time tandem network Jackson network: mean.
1 Chapter 5 Flow Lines Types Issues in Design and Operation Models of Asynchronous Lines –Infinite or Finite Buffers Models of Synchronous (Indexing) Lines.
Management of Waiting Lines McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
CS433 Modeling and Simulation Lecture 13 Queueing Theory Dr. Anis Koubâa 03 May 2009 Al-Imam Mohammad Ibn Saud University.
Queueing Analysis of Production Systems (Factory Physics)
Networks of Queues Plan for today (lecture 6): Last time / Questions? Product form preserving blocking Interpretation traffic equations Kelly / Whittle.
18 Management of Waiting Lines.
Queuing Theory Basic properties, Markovian models, Networks of queues, General service time distributions, Finite source models, Multiserver queues Chapter.
Queueing Theory What is a queue? Examples of queues: Grocery store checkout Fast food (McDonalds – vs- Wendy’s) Hospital Emergency rooms Machines waiting.
1 Chapters 8 Overview of Queuing Analysis. Chapter 8 Overview of Queuing Analysis 2 Projected vs. Actual Response Time.
yahoo.com SUT-System Level Performance Models yahoo.com SUT-System Level Performance Models8-1 chapter11 Single Queue Systems.
M/M/1 Queues Customers arrive according to a Poisson process with rate. There is only one server. Service time is exponential with rate  j-1 jj+1...
CSCI1600: Embedded and Real Time Software Lecture 19: Queuing Theory Steven Reiss, Fall 2015.
Flows and Networks Plan for today (lecture 6): Last time / Questions? Kelly / Whittle network Optimal design of a Kelly / Whittle network: optimisation.
Modeling and Analysis of CONWIP-based Flowlines as Closed Queueing Networks.
OPERATING SYSTEMS CS 3530 Summer 2014 Systems and Models Chapter 03.
Management of Waiting Lines Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent.
Queueing Theory. The study of queues – why they form, how they can be evaluated, and how they can be optimized. Building blocks – arrival process and.
1 Lecture 06 EEE 441: Wireless And Mobile Communications BRAC University.
McGraw-Hill/Irwin Copyright © 2009 by The McGraw-Hill Companies, Inc. All Rights Reserved. Chapter 18 Management of Waiting Lines.
OPERATING SYSTEMS CS 3502 Fall 2017
Lecture 14 – Queuing Networks
McGraw-Hill/Irwin ©2009 The McGraw-Hill Companies, All Rights Reserved
Synchronous Manufacturing and Theory of Constraints
Models of Traffic Flow 1.
Load Balancing and Data centers
Queueing Theory What is a queue? Examples of queues:
Analysis and Design of Asynchronous Transfer Lines as a series of G/G/m queues: Overview and Examples.
Synchronous Manufacturing
Management of Waiting Lines
Queuing Theory Non-Markov Systems
Measuring Service in Multi-Class Networks
Queuing models Basic definitions, assumptions, and identities
Statistics Review ChE 477 Winter 2018 Dr. Harding.
IV-2 Manufacturing Systems modeling
Chapter 7 Sampling Distributions.
System Performance: Queuing
Queuing models Basic definitions, assumptions, and identities
Differential Equations
COMP60611 Fundamentals of Parallel and Distributed Systems
Variability 8/24/04 Paul A. Jensen
Flows and Networks Plan for today (lecture 6):
Topics Modeling CONWIP Flowlines as Closed Queueing Networks
Queuing Models and Capacity Planning
Chapter 7 Sampling Distributions.
Lecture 14 – Queuing Networks
COMP60621 Designing for Parallelism
Chapter 7 Sampling Distributions.
Queuing Networks Mean Value Analysis
Queuing Theory III.
Queuing Theory III.
CSE 550 Computer Network Design
Numerical Studies on Braess-like Paradoxes for Non-Cooperative Load Balancing in Distributed Computer Systems By Said Fathy El-Zoghdy, Hisao Kameda, and.
Chapter 7 Sampling Distributions.
LECTURE 09 QUEUEING THEORY PART3
Switch Performance Analysis and Design Improvements
Synchronous Manufacturing and Theory of Constraints
SIMULATION EXAMPLES QUEUEING SYSTEMS.
Presentation transcript:

The Best Duo 2014 - 2015

Unlucky Days Sometimes, things may go in the other direction…

Soccer Teams vs. Queueing Networks In soccer teams Contribution Scoring Assistance Chemistry In queueing networks Dependence Single player (Bale) vs. his performance in a team

Dependence among Single Queues in Series Kan Wu

Dependence in Queueing Networks Dependence among stations Positive: reduce system queue time Negative: increase system queue time Queue time classification Actual queue time The queue time performance in appearance The total score a player get Contribution queue time The authentic contribution to the system The effort a player contributed to the total score of the team

Reduction Method Friedman tandem queue (1965) Constant service time (cs = 0) System queue time is solely determined by the bottleneck = Bottleneck QT when it is a single server system Actual QT1 = 20 Actual QTBN = 80 Contribution QT1 = 0 Contribution QTBN = 100 Fully coupled system QTBN = 100 QT1 = 20 QTBN = 80 l l BN 1 BN

Jackson Network Under Markovian assumptions Exponential service time (cs = 1) with Poisson arrivals Each station behaves independently in the steady state Actual QT1 = 20 Actual QTBN = 100 Contribution QT1 = 20 Contribution QTBN = 100 ASIA (all see initial arrivals) system 1 BN QTBN = 100 QT1 = 20 l

ASIA and Fully Coupled Systems N single sever in series ASIA and Fully coupled systems 1 l 2 3 N S1 S2 … S3 SN 1 (l, ca1) BN1 N … BNk Actual queue times Contribution queue times

General Situation In general, contribution queue time can be obtained through the concept of intrinsic ratios.

Contribution Queue Time Conservation of queue time Contribution is relative to the ASIA queue times Computation of Contribution Factor Contribution is relative to the ASIA queue times

Dependence in Tandem Queues Uni-Direction dependence Decentralized dispatching policy with local information The states of downstream stations have no impact on the dispatching decisions of the upstream stations. Diffusion vs. Blocking Diffusion: actual queue time increases due to the upstream stations. Blocking: actual queue time decreases due to the upstream stations. Quantified through contribution queue time… S1 l S2 S3 SN …

Case study: Diffusion on Bottlenecks Poisson arrivals with mean 33 1/3 min Service times: 20 – 23 – 25 – 28 – 30 SCVs: 8 – 0.8 – 0.8 – 0.8 – 0.4 Bottleneck is the last station Actual queue times: 135.18 – 124.96 – 101.67 – 172.46 – 220.35 ASIA system QTs: 135.00 – 46.07 – 67.50 – 132.30 – 189.00 S1 l S2 S3 S5 Bottleneck is in an increasing order

Diffusion on Bottlenecks – First 2 Stations Actual queue times: 135.18 – 124.96 ASIA system QTs: 135.00 – 46.07 Contribution QTs: 214.07 – 46.07 S1 l S2 Total actual QT = Total Contribution QT

Diffusion on Bottlenecks – First 3 Stations Actual queue times: 135.18 – 124.96 – 101.67 ASIA system QTs: 135.00 – 46.07 – 67.50 Contribution QTs: 242.19 – 52.12 – 67.50 S1 l S2 S3

Diffusion on Bottlenecks – All 5 Stations Actual queue times: 135.18 – 124.96 – 101.67 – 172.46 – 220.35 ASIA system QTs: 135.00 – 46.07 – 67.50 – 132.30 – 189.00 Contribution QTs: 284.86 – 61.31 – 79.39 – 140.06 – 189.00 Contribution QTs are longer than the ASIA system QTs

Block on Bottlenecks – All 5 Stations Service times: 20 – 23 – 25 – 28 – 30 with Poisson arrivals & SCVs 0.25 for all Actual queue times: 18.75 – 22.88 – 30.37 – 63.47 – 116.73 ASIA system QTs: 18.75 – 32.00 – 46.88 – 91.88 – 168.75 Contribution QTs: 2.17 – 7.20 – 17.48 – 56.59 – 168.75 Contribution QTs are less than the ASIA system QTs

Second Moment Result on TOC Service times: 28 – 26 – 24 – 22 – 30 with SCVs 0.8 Poisson arrivals If the SCVs can be reduced by half, which one should be the 1st? : Service time SCV of station i is reduced by p (in percentage) S1 l S2 S3 S5  

Second Moment Result on TOC   Improvement can be started from the furnace

Summary Dependence among tandem queues Theory of constraint Actual queue time vs. contribution queue time Blocking and diffusion effects Dependence cannot be captured by the product-form and Brownian networks Theory of constraint Utilization should be strictly less than 1 in the long run Total sojourn/cycle time is the true limit Improving the performance of the system bottleneck may not be the most effective place to reduce system cycle time Improvement should start from the system bottleneck or upstream stations

~ Just like human beings, a server has its life in a queueing network Thank you

Defense Acquisition Program Assembly Batching Dispatching Shift Schedule

Approximate Model for System Cycle Time k1: aBN k2’: Variability of the (n - 1) non-bottleneck (in ASIA systems) k3: Non-bottleneck capacity

Regression Results G/G/1 model YAN’s model k1 = 0.356 k2 = 422.951 Yang, Ankenman and Nelson (2007) k1 = 0.356 k2 = 422.951 k3 = 14.636 BN Cap = 13.7

Model for Multiple-Server Stations k1: by historical bottleneck queue time in heavy traffic. by Sakasegawa (1977) k3: capacity of the 2nd bottleneck, i.e. k2: by historical factory cycle time

System with Multiple Servers k1 = 0.087 k3 = 248.276

The Intrinsic Gap and Intrinsic Ratio Intrinsic Gap (IG): The queue time difference between the ASIA and BSIA systems. Intrinsic Ratio (IR): If cs = 0 => actual QT = QT in BSIA => IR is 0 In Jackson networks => actual QT = QT in ASIA system => IR is 1 QT in BSIA QT in ASIA Actual QT IG

Structures of STQB 1 (l, ca1) BN (l, ca2) (m1, cs1) (m2, cs2) ASIA: BSIA: Intrinsic Gap: Intrinsic Ratio: QT2 r

Simulation: Near-Linearity of the IR in STQB STQB with Poisson Arrivals (with cs < 1) 10B ~ 100B data points in heavy traffic For different (m1, cs1, cs2) combinations 2nd QT in ASIA system => Upper bound (by observation) 2nd QT in fully coupled system => Lower bound

Robustness & Heavy Traffic Property in STQB IG = QT1 QT2 M/M/1 queues for 1/m1 = 25, 1/m2 = 30 (BN) 1 BN QT2 in BSIA QT2 QT2 in ASIA IG

Two Important Properties of STQB The intrinsic ratio is approximately linear across most traffic intensities Nearly-Linear Relationship Robustness in heavy traffic Approximation

Approximate Model for STQB Let y2 = cs1 Compared with simulation Errors = 3.3% (when cs < 1, arrival process is Poisson) vs. 11.0% for QNA and 13.1% for QNET Back