Äriprotsesside modelleerimine ja automatiseerimine Loeng 8 Järjekorrateooria ja äriprotsessid. Enn Õunapuu
|
|
- Raymond Stewart
- 5 years ago
- Views:
Transcription
1
2 Äriprotsesside modelleerimine ja automatiseerimine Loeng 8 Järjekorrateooria ja äriprotsessid Enn Õunapuu enn@cc.ttu.ee
3 Kava Järjekorrateooria Näited Järeldused Küsimused
4 Loengu eesmärk Loengu eesmärgiks on anda alus mõningate tähtsate protsesside optimeerimiseks
5 Queuing theory definitions (Bose) the basic phenomenon of queueing arises whenever a shared facility needs to be accessed for service by a large number of jobs or customers. (Wolff) The primary tool for studying these problems [of congestions] is known as queueing theory. (Kleinrock) We study the phenomena of standing, waiting, and serving, and we call this study Queueing Theory." "Any system in which arrivals place demands upon a finite capacity resource may be termed a queueing system. (Mathworld) The study of the waiting times, lengths, and other properties of queues. CS352 Fall,2005 5
6 Applications of Queuing Theory Telecommunications Traffic control Determining the sequence of computer operations Predicting computer performance Health services (eg. control of hospital bed assignments) Airport traffic, airline ticket sales Layout of manufacturing systems. In computers, jobs share many resources: CPU, disks, devices Only one can access at a time, and others must wait in queues Queuing theory helps determine time jobs spend in queue CS352 Fall,2005 6
7 Example application of queuing theory In many retail stores and banks multiple line/multiple checkout system a queuing system where customers wait for the next available cashier We can prove using queuing theory that : throughput improves increases when queues are used instead of separate lines CS352 Fall,2005 7
8 Why flow analysis is not enough? Flow analysis does not consider waiting times due to resource contention Queuing analysis and simulation address these limitations and have a broader applicability
9 Why is Queuing Analysis Important? Capacity problems are very common in industry and one of the main drivers of process redesign Need to balance the cost of increased capacity against the gains of increased productivity and service Queuing and waiting time analysis is particularly important in service systems Large costs of waiting and of lost sales due to waiting Prototype Example ER at a Hospital Patients arrive by ambulance or by their own accord One doctor is always on duty More patients seeks help longer waiting times Question: Should another MD position be instated? Laguna & Marklund
10 Delay is Caused by Job Interference Deterministic traffic Variable but spaced apart traffic If arrivals are regular or sufficiently spaced apart, no queuing delay occurs Dimitri P. Bertsekas
11 Burstiness Causes Interference Queuing results from variability in service times and/or interarrival intervals Dimitri P. Bertsekas
12 Job Size Variation Causes Interference Deterministic arrivals, variable job sizes Dimitri P. Bertsekas
13 High Utilization Exacerbates Interference The queuing probability increases as the load increases Utilization close to 100% is unsustainable too long queuing times Dimitri P. Bertsekas
14 The Poisson Process Common arrival assumption in many queuing and simulation models The times between arrivals are independent, identically distributed and exponential P (arrival < t) = 1 e -λt Key property: The fact that a certain event has not happened tells us nothing about how long it will take before it happens e.g., P(X > 40 X >= 30) = P (X > 10) Laguna & Marklund
15 Negative Exponential Distribution
16 Queuing theory: basic concepts arrivals waiting service l Basic characteristics: l (mean arrival rate) = average number of arrivals per time unit m (mean service rate) = average numberof jobs that can be handled by one server per time unit: c = number of servers c m Wil van der Aalst
17 Queuing theory concepts (cont.) l Wq,Lq W,L c m Given l, m and c, we can calculate : occupation rate: r Wq = average time in queue W = average system in system (i.e. cycle time) Lq = average number in queue (i.e. length of queue) L = average number in system average (i.e. Work-in-Progress) Wil van der Aalst
18 M/M/1 queue l Assumptions: time between arrivals and service time follow a negative exponential distribution 1 server (c = 1) FIFO L=r/(1- r) 1 ρ W=L/l=1/(m- l) m Capacity Demand Available Capacity λ μ L q = r 2 /(1- r) = L-r Wq=Lq/l= l /( m(m- l)) Laguna & Marklund
19 M/M/c queue Now there are c servers in parallel, so the expected capacity per time unit is then c*m r Capacity Demand Available Capacity l c* m Little s Formula Wq=Lq/l W=Wq+(1/m) Little s Formula L=lW Laguna & Marklund
20 Tool Support For M/M/c systems, the exact computation of Lq is rather complex Consider using a tool, e.g c c n n q P ) c!(1 ) / (... c)p (n L r r m l 1 c 1 c 0 n n 0 ) /(c ( 1 1 c! ) / ( n! ) / ( P m l m l m l
21 Example ER at County Hospital Situation Patients arrive according to a Poisson process with intensity l ( the time between arrivals is exp(l) distributed. The service time (the doctor s examination and treatment time of a patient) follows an exponential distribution with mean 1/m (=exp(m) distributed) The ER can be modeled as an M/M/c system where c=the number of doctors Data gathering l = 2 patients per hour m = 3 patients per hour Question Should the capacity be increased from 1 to 2 doctors? Laguna & Marklund
22 Queuing Analysis Hospital Scenario Interpretation To be in the queue = to be in the waiting room To be in the system = to be in the ER (waiting or under treatment) Characteristic One doctor (c=1) Two Doctors (c=2) r 2/3 1/3 Lq 4/3 patients 1/12 patients L 2 patients 3/4 patients Wq 2/3 h = 40 minutes 1/24 h = 2.5 minutes W 1 h 3/8 h = 22.5 minutes Is it warranted to hire a second doctor? Laguna & Marklund
23 Process Simulation Drawbacks of queuing theory: Generally not applicable when system includes parallel activities Requires case-by-case mathematical analysis Assumes steady-state (valid only for long-term analysis) Process simulation is more versatile (also more popular) Process simulation = run a large number of process instances, gather data (cost, duration, resource usage) and calculate statistics from the output
24 Process Simulation Steps in evaluating a process with simulation 1. Model the process (e.g. BPMN) 2. Enhance the process model with simulation info simulation model - Based on assumptions or better based on data (logs) 3. Run the simulation 4. Analyze the simulation outputs 1. Process duration and cost stats and histograms 2. Waiting times (per activity) 3. Resource utilization (per resource) 5. Repeat for alternative scenarios
25 Elements of a simulation model The process model including: Events, activities, control-flow relations (flows, gateways) Resource classes (i.e. lanes) Resource assignment Mapping from activities to resource classes Processing times Per activity or per activity-resource pair Costs Per activity and/or per activity-resource pair Arrival rate of process instances Conditional branching probabilities (XOR gateways)
26 Simulation Example BPMN model Receive info Request info No accept Deliver card Start Check for completeness complete? Yes Perform checks Make decision Decide reject Notify acceptance End Notify rejection review request Time out reviiew Receive review request
27 Resource Pools (Roles) Two options to define resource pools E.g. Define individual resources of type clerk Or assign a number of anonymous resources all with the same cost 3 anonymous clerks with cost of 10 per hour, 8 hours per day 2 individually named clerks - Jim: 12.4 per hour - Mike: 14.8 per hour 1 manager John at 20 per hour, 8 hours per day
28 Resource pools and execution times Task Role Execution Time Normal distribution: mean and std deviation Receive application system 0 0 Check completeness Clerk 30 mins 10 mins Perform checks Clerk 2 hours 1 hour Request info system 1 min 0 Receive info (Event) system 48 hours 24 hours Make decision Manager 1 hour 30 mins Notify rejection system 1 min 0 Time out (Time) system 72 hours 0 Receive review request (Event) system 48 hours 12 hours Notify acceptance system 1 min 0 Deliver Credit card system 1 hour 0 Alternative: assign execution times to the tasks only (like in cycle time analysis)
29 Reminder: Normal Distribution
30 Arrival rate and branching probabilities 10 applications per hour (one at a time) Poisson arrival process (negative exponential) No Receive info Request info accept Deliver card Start Receive review request Check for completeness complete? Yes 0.7 Perform checks reviiew Make decision 0.2 Decide 0.5 reject Notify acceptance Notify rejection 0.8 Time out review request End Alternative: instead of branching probabilities one can assign conditional expressions to the branches based on input data
31 # PI's Simulation output: KPIs Resource Resource Utilization Cost % 4, $ 4, % 4, % 3, % 3, % 2, % 2, % 1, % 1, % % $ % Cycle Time - Histogram 10.00% $ 5.04% % 4 Clerk 2 Manager System Days
32 Simulation output: detailed logs Process Instance # Activities Start End Cycle Time Cycle Time (s) Total Time 6 5 4/06/ :00 4/06/ :26 03:26: :26: /06/ :00 5/06/2007 9:30 19:30: :30:38 Process Instance Activity ID Activity Name Activity Type Resource Start End /06/ :00 5/06/ :14 18:14: :14:56 6aed54717-f044-4da1-b543-82a660809ecb Check for completeness Task Manager 4/06/ :00 4/06/ : /06/ :00 5/06/ :14 17:14: :14:56 6a270f5c6-7e16-42c1-bfc4-dd10ce8dc835 Perform checks Task Clerk 4/06/ :53 4/06/ : /06/ :00 5/06/ :06 16:06: :06: d7c-1eda-40ea-ac7d-886fa03de15b Make decision Task Manager 4/06/ :25 4/06/ : /06/2007 5:00 6/06/ :01 29:01: :01: a64eb e6-e7de36d348c2 Notify acceptance IntermediateEvent (none) 4/06/ :26 4/06/ : /06/ :00 6/06/ :33 26:33: :33:21 60a72cf f31-8c7e-6d093429ab04 Deliver card Task System 4/06/ :26 4/06/ :26 7aed54717-f044-4da1-b543-82a660809ecb Check for completeness Task Manager 4/06/ :00 4/06/ :31 7a270f5c6-7e16-42c1-bfc4-dd10ce8dc835 Perform checks Task Clerk 4/06/ :31 5/06/2007 8:30
33 Example application of queuing theory CS352 Fall,
34 Queuing theory for studying networks View network as collections of queues FIFO data-structures Queuing theory provides probabilistic analysis of these queues Examples: Average length Average waiting time Probability queue is at a certain length Probability a packet will be lost CS352 Fall,
35 Little s Law Arrivals System Departures Little s Law: Mean number tasks in system = mean arrival rate x mean response time Observed before, Little was first to prove Applies to any system in equilibrium, as long as nothing in black box is creating or destroying tasks CS352 Fall,
36 2. Service time distribution 1. Arrival Process Queue 5. Customer Population Queueing Notation 4. Server Capacity= # of seats for customer waiting for service + # of servers 3. Number of Servers Chapter 30 Introduction to Queueing Theory 36
37 Arrival process Let s say customers arrive at t 1,t 2,,t j Random variables j =t j -t j-1 are inter arrival times. Usually assume inter arrival times j are independent, identically distributed (IID). Most common arrival processes are Poisson arrivals: if inter arrival times are IID and exponentially distributed, then the arrival rate follows a Poisson distribution Poisson Process Service time distribution Amount of time each customer spends at the server Again, usually assume IID Most commonly used distribution is the exponential distribution. Chapter 30 Introduction to Queueing Theory 37
38 Number of servers If servers are not identical, divide them into groups of identical servers with separate queues for each group Each group is a queuing system System capacity the number of places for waiting customers + the number of servers Population size: The total number of potential customers who can ever come to the system. Service discipline: The order where the customers are served. (e.g., FCFS, LCFS, RR, etc) Chapter 30 Introduction to Queueing Theory 38
39 Kendall notation A/S/m/B/K/SD A is Arrival time distribution S is Service time distribution m is number of servers B is number of buffers (system capacity) K is population size SD is service discipline Chapter 30 Introduction to Queueing Theory 39
40 Kendall notation The distributions for interarrival time and service times are generally denoted by M Exponential (M means memoryless in that the current arrival is independent of the past) E k Erlang with parameter k H k Hyperexponential with parameter k D Deterministic (time are constant) G General (the results are valid for all distributions) Assume only individual arrivals (no bulk arrivals) Chapter 30 Introduction to Queueing Theory 40
41 Notation Example M/M/3/20/1500/FCFS single queue system with: Exponentially distributed arrivals Exponentially distributed service times Three servers Capacity 20 (17 spaces for waiting customers) Population is 1500 total Service discipline is FCFS Often, assume infinite queue and infinite population and FCFS, so just M/M/3 Chapter 30 Introduction to Queueing Theory 41
42 Time Previous arrival Arrival Begin Service End Service = interarrival time l = mean arrival rate = 1/E[ ] s = service time per job m = mean service rate per server w s = 1/E[s] (total service rate for m servers is mm) r n q = number of jobs waiting to receive service. n s = number of jobs receiving service n = number of jobs in system n = n q + n s r = response time = w + s w = waiting time Note that all of these variables are random variables except for l and m. Chapter 30 Introduction to Queueing Theory 42
43 Rules for All Queues Stability Condition If the number of jobs becomes infinite, the system is unstable. For stability, the mean arrival rate less than the mean service rate. l < mm Does not apply to finite buffer system or the finite population systems They are always stable. - Finite population: queue length is always finite. - Finite buffer system: arrivals are lost when the number of jobs in the system exceed the system capacity. Chapter 30 Introduction to Queueing Theory 43
44 Rules for All Queues Number in System vs. Number in Queue n = n q + n s E[n] = E[n q ]+E[n s ] Also, if the service rate of each server is independent of the number in queue Cov(n q,n s ) = 0 Var[n] = Var[n q ]+Var[n s ] Chapter 30 Introduction to Queueing Theory 44
45 Rules for All Queues Number vs. Time (Little s law) If jobs are not lost due to buffer overflow, the mean jobs is related to its mean response time as follows: mean number of jobs in system time Similarly = arrival rate x mean response mean jobs in queue = arrival rate x mean waiting time For finite buffers can use effective arrival rate, that is, the rate of jobs actually admitted to the system. Chapter 30 Introduction to Queueing Theory 45
46 Rules for All Queues Time in System vs. Time in Queue Time spent in system, response time, is the sum of waiting time and service time r = w + s In particular: E[r] = E[w] + E[s] If the service rate is independent of jobs in queue Cov(w,s) = 0 Var[r] = Var[w] + Var[s] Chapter 30 Introduction to Queueing Theory 46
47 Applying Little s Law Example: A disk server satisfies an I/O request in average of 100 msec. I/O rate is about 100 requests/sec. What is the mean number of requests at the disk server? Mean number at server = arrival rate x response time = (100 requests/sec) x (0.1 sec) = 10 requests Chapter 30 Introduction to Queueing Theory 47
48 Importance of the Queuing Theory -Improve Customer Service, continuously. -When a system gets congested, the service delay in the system increases. A good understanding of the relationship between congestion and delay is essential for designing effective congestion control for any system. Queuing Theory provides all the tools needed for this analysis.
49 Queuing Models Calculates the best number of servers to minimize costs. Different models for different situations (Like SimQuick, we noticed different measures for arrival and service times) Exponential Normal Constant Etc.
50 Queuing Models Calculate: Average number of customers in the system waiting and being served Average number of customers waiting in the line Average time a customer spends in the system waiting and being served Average time a customer spends waiting in the waiting line or queue. Probability no customers in the system Probability n customers in the system Utilization rate: The proportion of time the system is in use.
51 Assumptions Different for every system. Variable service times and arrival times are used to decide what model to use. Not a complex problem: Queuing Theory is not intended for complex problems. We have seen this in class, where this are many decision points and paths to take. This can become tedious, confusing, time consuming, and ultimately useless.
52 Examples of Queuing Theory Outside customers (Commercial Service Systems) - Barber shop, bank teller, cafeteria line Transportation Systems - Airports, traffic lights Social Service Systems -Judicial System, healthcare Business or Industrial Production lines
53 How the Queuing Theory is used in Supply Chain Management Supply Chain Management use simulations and mathematics to solve many problems. The Queuing Theory is an important tool used to model many supply chain problems. It is used to study situations in which customers (or orders placed by customers) form a line and wait to be served by a service or manufacturing facility. Clearly, long lines result in high response times and dissatisfied customers. The Queuing Theory may be used to determine the appropriate level of capacity required at manufacturing facilities and the staffing levels required at service facilities, over the nominal average capacity required to service expected demand without these surges.
54 Questions? 54
Äriprotsesside modelleerimine ja automatiseerimine Loeng 9 Järjekorrateooria ja äriprotsessid. Enn Õunapuu
Äriprotsesside modelleerimine ja automatiseerimine Loeng 9 Järjekorrateooria ja äriprotsessid Enn Õunapuu enn.ounapuu@ttu.ee Kava Järjekorrateooria Näited Järeldused Küsimused Loengu eesmärk Loengu eesmärgiks
More informationLecture 7 Quantitative Process Analysis II
MTAT.03.231 Business Process Management Lecture 7 Quantitative Process Analysis II Marlon Dumas marlon.dumas ät ut. ee 1 Process Analysis 2 Process Analysis Techniques Qualitative analysis Value-Added
More informationIntroduction to Queuing Systems
Introduction to Queuing Systems Queuing Theory View network as collections of queues FIFO data-structures Queuing theory provides probabilistic analysis of these queues Examples: Average length Probability
More informationLecture 5: Performance Analysis I
CS 6323 : Modeling and Inference Lecture 5: Performance Analysis I Prof. Gregory Provan Department of Computer Science University College Cork Slides: Based on M. Yin (Performability Analysis) Overview
More informationIntroduction to Performance Engineering and Modeling
Introduction to Performance Engineering and Modeling Dr. Michele Mazzucco Software Engineering Group Michele.Mazzucco@ut.ee http://math.ut.ee/~mazzucco What is Performance Engineering? Whether you design,
More informationQueuing Systems. 1 Lecturer: Hawraa Sh. Modeling & Simulation- Lecture -4-21/10/2012
Queuing Systems Queuing theory establishes a powerful tool in modeling and performance analysis of many complex systems, such as computer networks, telecommunication systems, call centers, manufacturing
More informationRead Chapter 4 of Kurose-Ross
CSE 422 Notes, Set 4 These slides contain materials provided with the text: Computer Networking: A Top Down Approach,5th edition, by Jim Kurose and Keith Ross, Addison-Wesley, April 2009. Additional figures
More informationIntroduction to Performance Engineering and Modeling
Introduction to Performance Engineering and Modeling Dr. Michele Mazzucco Software Engineering Group Michele.Mazzucco@ut.ee http://math.ut.ee/~mazzucco Today s lecture is not about performance and modeling
More informationQueuing Networks Modeling Virtual Laboratory
Queuing Networks Modeling Virtual Laboratory Dr. S. Dharmaraja Department of Mathematics IIT Delhi http://web.iitd.ac.in/~dharmar Queues Notes 1 1 Outline Introduction Simple Queues Performance Measures
More informationUNIT 4: QUEUEING MODELS
UNIT 4: QUEUEING MODELS 4.1 Characteristics of Queueing System The key element s of queuing system are the customer and servers. Term Customer: Can refer to people, trucks, mechanics, airplanes or anything
More informationTeletraffic theory I: Queuing theory
Teletraffic theory I: Queuing theory Lecturer: Dmitri A. Moltchanov E-mail: moltchan@cs.tut.fi http://www.cs.tut.fi/kurssit/tlt-2716/ 1. Place of the course TLT-2716 is a part of Teletraffic theory five
More informationTELCOM 2130 Queueing Theory. David Tipper Associate Professor Graduate Telecommunications and Networking Program. University of Pittsburgh
TELCOM 2130 Queueing Theory David Tipper Associate Professor Graduate Telecommunications and Networking Program University of Pittsburgh Learning Objective To develop the modeling and mathematical skills
More informationFundamentals of Queueing Models
Fundamentals of Queueing Models Michela Meo Maurizio M. Munafò Michela.Meo@polito.it Maurizio.Munafo@polito.it TLC Network Group - Politecnico di Torino 1 Modeling a TLC network Modelization and simulation
More informationCPSC 531: System Modeling and Simulation. Carey Williamson Department of Computer Science University of Calgary Fall 2017
CPSC 531: System Modeling and Simulation Carey Williamson Department of Computer Science University of Calgary Fall 2017 Recap: Simulation Model Taxonomy 2 Recap: DES Model Development How to develop a
More informationReview. EECS 252 Graduate Computer Architecture. Lec 18 Storage. Introduction to Queueing Theory. Deriving Little s Law
EECS 252 Graduate Computer Architecture Lec 18 Storage David Patterson Electrical Engineering and Computer Sciences University of California, Berkeley Review Disks: Arial Density now 30%/yr vs. 100%/yr
More informationQueueing Models. System Capacity the number of customers who are allowed to be in the system at any given time.
Queueing Models Introduction Many systems can be readily modeled as a queueing model. Such a model represents the system as a set of one or more customers and one or more servers. A customer is defined
More informationTeletraffic theory (for beginners)
Teletraffic theory (for beginners) samuli.aalto@hut.fi teletraf.ppt S-38.8 - The Principles of Telecommunications Technology - Fall 000 Contents Purpose of Teletraffic Theory Network level: switching principles
More informationWhy is scheduling so difficult?
Queueing Page 1 Why is scheduling so difficult? Wednesday, November 8, 2017 7:35 AM Scheduling is a matter of great controversy. Should it be fair? (O(log n)) Should it instead be fast? (O(1)) As well,
More informationAdvanced Internet Technologies
Advanced Internet Technologies Chapter 3 Performance Modeling Dr.-Ing. Falko Dressler Chair for Computer Networks & Internet Wilhelm-Schickard-Institute for Computer Science University of Tübingen http://net.informatik.uni-tuebingen.de/
More informationBANK ATM QUEUEING MODEL: A CASE STUDY Ashish Upadhayay* 1
ISSN 2277-2685 IJESR/May 2017/ Vol-7/Issue-5/40-45 Ashish Upadhayay / International Journal of Engineering & Science Research BANK ATM QUEUEING MODEL: A CASE STUDY Ashish Upadhayay* 1 1 Research Scholar,
More informationAirside Congestion. Airside Congestion
Airside Congestion Amedeo R. Odoni T. Wilson Professor Aeronautics and Astronautics Civil and Environmental Engineering Massachusetts Institute of Technology Objectives Airside Congestion _ Introduce fundamental
More informationUsing Queuing theory the performance measures of cloud with infinite servers
Using Queuing theory the performance measures of cloud with infinite servers A.Anupama Department of Information Technology GMR Institute of Technology Rajam, India anupama.a@gmrit.org G.Satya Keerthi
More informationA Comparative Approach to Reduce the Waiting Time Using Queuing Theory in Cloud Computing Environment
International Journal of Information and Computation Technology. ISSN 0974-2239 Volume 4, Number 5 (2014), pp. 469-474 International Research Publications House http://www. irphouse.com /ijict.htm A Comparative
More informationCover sheet for Assignment 3
Faculty of Arts and Science University of Toronto CSC 358 - Introduction to Computer Networks, Winter 2018, LEC0101 Cover sheet for Assignment 3 Due Monday March 5, 10:00am. Complete this page and attach
More informationModule 7:Application of stochastic processes in queueing theory Lecture 29:Application of stochastic processes in Queueing Theory
The Lecture Contains: Introdution For a queueing system we generally should define or know the following General system notations Example of Single servers What we can glean from the set of information
More informationQUEUING SYSTEM. Yetunde Folajimi, PhD
QUEUING SYSTEM Yetunde Folajimi, PhD Introduction What is a queue? A line of people or things waiting to be handled, usually in sequential order starting at the beginning or top of the line or sequence.
More informationA Rant on Queues. Van Jacobson. July 26, MIT Lincoln Labs Lexington, MA
A Rant on Queues Van Jacobson July 26, 2006 MIT Lincoln Labs Lexington, MA Unlike the phone system, the Internet supports communication over paths with diverse, time varying, bandwidth. This means we often
More informationM/G/c/K PERFORMANCE MODELS
M/G/c/K PERFORMANCE MODELS J. MacGregor Smith Department of Mechanical and Industrial Engineering, University of Massachusetts Amherst, Massachusetts 01003 e-mail: jmsmith@ecs.umass.edu Abstract Multi-server
More informationStochastic Processing Networks: What, Why and How? Ruth J. Williams University of California, San Diego
Stochastic Processing Networks: What, Why and How? Ruth J. Williams University of California, San Diego http://www.math.ucsd.edu/~williams 1 OUTLINE! What is a Stochastic Processing Network?! Applications!
More informationMean Value Analysis and Related Techniques
Mean Value Analysis and Related Techniques 34-1 Overview 1. Analysis of Open Queueing Networks 2. Mean-Value Analysis 3. Approximate MVA 4. Balanced Job Bounds 34-2 Analysis of Open Queueing Networks Used
More informationVolume 5, No. 2, May -June, 2013, ISSN
ABSTRACT Simulation Tool for Queuing Models: QSIM Pratiksha Saxena, Lokesh Sharma Gautam Buddha University, Department of Mathematics, School of Applied Sciences, Gautam Buddha University, Greater Noida,
More informationMarkov Chains and Multiaccess Protocols: An. Introduction
Markov Chains and Multiaccess Protocols: An Introduction Laila Daniel and Krishnan Narayanan April 8, 2012 Outline of the talk Introduction to Markov Chain applications in Communication and Computer Science
More informationMODELS FOR QUEUING SYSTEMS
0 MODELS FOR QUEUING SYSTEMS Omor Sharif University of South Carolina Department of Civil and Environmental Engineering 00 Main Street Columbia, SC 0 Telephone: (0) -0 Fax: (0) -00 Email: omor.sharif@gmail.com
More information3. Examples. Contents. Classical model for telephone traffic (1) Classical model for telephone traffic (2)
Contents Model for telephone traffic Packet level model for data traffic Flow level model for elastic data traffic Flow level model for streaming data traffic lect03.ppt S-38.45 - Introduction to Teletraffic
More informationModeling and Performance Analysis with Discrete-Event Simulation
Simulation Modeling and Performance Analysis with Discrete-Event Simulation Chapter 10 Verification and Validation of Simulation Models Contents Model-Building, Verification, and Validation Verification
More informationGBA 334 Module 6 Lecture Notes Networks and Queues. These notes will cover network models and queuing theory.
GBA Module Lecture Notes Networks and Queues These notes will cover network models and queuing theory. Have you ever wondered how your GPS knows the most efficient route to get you to your destination?
More informationModeling and Simulation (An Introduction)
Modeling and Simulation (An Introduction) 1 The Nature of Simulation Conceptions Application areas Impediments 2 Conceptions Simulation course is about techniques for using computers to imitate or simulate
More informationMulti-threaded, discrete event simulation of distributed computing systems
Multi-threaded, discrete event simulation of distributed computing systems Iosif C. Legrand California Institute of Technology, Pasadena, CA, U.S.A Abstract The LHC experiments have envisaged computing
More informationROORKEE COLLEGE OF ENGINEERING
ROORKEE COLLEGE OF ENGINEERING OPERATIONS RESEARCH LECTURE NOTES RAHUL BHARTI Assistant Professor RCE, ROORKEE Introduction The mathematical models which tells to optimise (minimize or maximise) the objective
More informationDDSS: Dynamic Dedicated Servers Scheduling for Multi Priority Level Classes in Cloud Computing
DDSS: Dynamic Dedicated Servers Scheduling for Multi Priority Level Classes in Cloud Computing Husnu Saner Narman Md. Shohrab Hossain Mohammed Atiquzzaman School of Computer Science University of Oklahoma,
More informationTable 9.1 Types of Scheduling
Table 9.1 Types of Scheduling Long-term scheduling Medium-term scheduling Short-term scheduling I/O scheduling The decision to add to the pool of processes to be executed The decision to add to the number
More informationAn Efficient Queuing Model for Resource Sharing in Cloud Computing
The International Journal Of Engineering And Science (IJES) Volume 3 Issue 10 Pages 36-43 2014 ISSN (e): 2319 1813 ISSN (p): 2319 1805 An Efficient Queuing Model for Resource Sharing in Cloud Computing
More informationChapter 5. Minimization of Average Completion Time and Waiting Time in Cloud Computing Environment
Chapter 5 Minimization of Average Completion Time and Waiting Time in Cloud Computing Cloud computing is the use of the Internet for the tasks the users performing on their computer. Cloud computing, also
More informationCS370 Operating Systems
CS370 Operating Systems Colorado State University Yashwant K Malaiya Spring 1018 L10 Synchronization Slides based on Text by Silberschatz, Galvin, Gagne Various sources 1 1 FAQ Development project: You
More informationSlides 11: Verification and Validation Models
Slides 11: Verification and Validation Models Purpose and Overview The goal of the validation process is: To produce a model that represents true behaviour closely enough for decision making purposes.
More informationForecasting Oracle Performance
Forecasting Oracle Performance - Better than a Crystal Ball Yuri van Buren Senior Oracle DBA Specialist End-2-End Performance Management Engineer Yuri van Buren 17 Years with Logica which is now part of
More informationCS 3640: Introduction to Networks and Their Applications
CS 3640: Introduction to Networks and Their Applications Fall 2018, Lecture 4: Packet switching performance metrics Instructor: Rishab Nithyanand Teaching Assistant: Md. Kowsar Hossain 1 You should Be
More informationLecture 22: Buffering & Scheduling. CSE 123: Computer Networks Alex C. Snoeren
Lecture 22: Buffering & Scheduling CSE 123: Computer Networks Alex C. Snoeren Lecture 23 Overview Buffer Management FIFO RED Traffic Policing/Scheduling 2 Key Router Challenges Buffer management: which
More informationQueuing Networks. Renato Lo Cigno. Simulation and Performance Evaluation Queuing Networks - Renato Lo Cigno 1
Queuing Networks Renato Lo Cigno Simulation and Performance Evaluation 2014-15 Queuing Networks - Renato Lo Cigno 1 Moving between Queues Queuing Networks - Renato Lo Cigno - Interconnecting Queues 2 Moving
More informationETSN01 Exam Solutions
ETSN01 Exam Solutions March 014 Question 1 (a) See p17 of the cellular systems slides for a diagram and the full procedure. The main points here were that the HLR needs to be queried to determine the location
More information* Department of Computer Science, University of Pisa, Pisa, Italy Department of Elect. Engineering, University of Roma Tor Vergata, Rome, Italy
A SURVEY OF PRODUCT-FORM QUEUEING NETWORKS WITH BLOCKING AND THEIR EQUIVALENCES Simonetta BALSAMO * and Vittoria DE NITTO PERSONE' * Department of Computer Science, University of Pisa, Pisa, Italy Department
More informationResource allocation in networks. Resource Allocation in Networks. Resource allocation
Resource allocation in networks Resource Allocation in Networks Very much like a resource allocation problem in operating systems How is it different? Resources and jobs are different Resources are buffers
More informationPerspectives on Network Calculus No Free Lunch but Still Good Value
ACM Sigcomm 2012 Perspectives on Network Calculus No Free Lunch but Still Good Value Florin Ciucu T-Labs / TU Berlin Jens Schmitt TU Kaiserslautern Outline Network Calculus (NC): A Theory for System Performance
More informationChapter 10 Verification and Validation of Simulation Models. Banks, Carson, Nelson & Nicol Discrete-Event System Simulation
Chapter 10 Verification and Validation of Simulation Models Banks, Carson, Nelson & Nicol Discrete-Event System Simulation Purpose & Overview The goal of the validation process is: To produce a model that
More informationCPU Scheduling. Daniel Mosse. (Most slides are from Sherif Khattab and Silberschatz, Galvin and Gagne 2013)
CPU Scheduling Daniel Mosse (Most slides are from Sherif Khattab and Silberschatz, Galvin and Gagne 2013) Basic Concepts Maximum CPU utilization obtained with multiprogramming CPU I/O Burst Cycle Process
More informationPower Laws in ALOHA Systems
Power Laws in ALOHA Systems E6083: lecture 7 Prof. Predrag R. Jelenković Dept. of Electrical Engineering Columbia University, NY 10027, USA predrag@ee.columbia.edu February 28, 2007 Jelenković (Columbia
More informationCS162 Operating Systems and Systems Programming Lecture 17. Disk Management and File Systems
CS162 Operating Systems and Systems Programming Lecture 17 Disk Management and File Systems March 18, 2010 Ion Stoica http://inst.eecs.berkeley.edu/~cs162 Review: Want Standard Interfaces to Devices Block
More informationChapter 6: CPU Scheduling. Operating System Concepts 9 th Edition
Chapter 6: CPU Scheduling Silberschatz, Galvin and Gagne 2013 Chapter 6: CPU Scheduling Basic Concepts Scheduling Criteria Scheduling Algorithms Thread Scheduling Multiple-Processor Scheduling Real-Time
More informationThis formula shows that partitioning the network decreases the total traffic if 1 N R (1 + p) < N R p < 1, i.e., if not all the packets have to go
Chapter 3 Problem 2 In Figure 3.43 of the text every node transmits R bps, and we assume that both network partitions consist of 1 N nodes. So the total traffic generated by the nodes 2 of each Ethernet
More informationAdvanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras
Advanced Operations Research Prof. G. Srinivasan Department of Management Studies Indian Institute of Technology, Madras Lecture 32 Multiple Server Queueing Models In this lecture, we continue our discussion
More informationQueueing Networks. Lund University /
Queueing Networks Queueing Networks - Definition A queueing network is a network of nodes in which each node is a queue The output of one queue is connected to the input of another queue We will only consider
More informationTCP performance analysis through. processor sharing modeling
TCP performance analysis through processor sharing modeling Pasi Lassila a,b, Hans van den Berg a,c, Michel Mandjes a,d, and Rob Kooij c a Faculty of Mathematical Sciences, University of Twente b Networking
More informationApplication of QNA to analyze the Queueing Network Mobility Model of MANET
1 Application of QNA to analyze the Queueing Network Mobility Model of MANET Harsh Bhatia 200301208 Supervisor: Dr. R. B. Lenin Co-Supervisors: Prof. S. Srivastava Dr. V. Sunitha Evaluation Committee no:
More informationOperating Systems and Networks Recitation Session 4
Systems Group Department of Computer Science ETH Zürich Operating Systems and Networks Recitation Session 4 25/03/2011 Simon Gerber Group 5 Checksum 5/10/13 2 1 s complement sum 1000 0110 0101 1110 1st
More informationEP2200 Queueing theory and teletraffic systems
EP2200 Queueing theory and teletraffic systems Viktoria Fodor Laboratory of Communication Networks School of Electrical Engineering Lecture 1 If you want to model networks Or a complex data flow A queue's
More informationAnalytic Performance Models for Bounded Queueing Systems
Analytic Performance Models for Bounded Queueing Systems Praveen Krishnamurthy Roger D. Chamberlain Praveen Krishnamurthy and Roger D. Chamberlain, Analytic Performance Models for Bounded Queueing Systems,
More informationNetwork Performance Analysis
Network Performance Analysis Network Performance Analysis Thomas Bonald Mathieu Feuillet Series Editor Pierre-Noël Favennec First published 2011 in Great Britain and the United States by ISTE Ltd and
More informationON NEW STRATEGY FOR PRIORITISING THE SELECTED FLOW IN QUEUING SYSTEM
ON NEW STRATEGY FOR PRIORITISING THE SELECTED FLOW IN QUEUING SYSTEM Wojciech Burakowski, Halina Tarasiuk,RyszardSyski Warsaw University of Technology, Poland Institute of Telecommunications 00-665-Warsaw,
More informationFuzzy Queueing Model Using DSW Algorithm
Fuzzy Queueing Model Using DSW Algorithm R. Srinivasan Department of Mathematics, Kongunadu College of Engineering and Technology, Tiruchirappalli 621215, Tamilnadu ABSTRACT--- This paper proposes a procedure
More informationNetwork Performance: Queuing
Network Performance: Queuing EE 122: Intro to Communication Networks Fall 2006 (MW 4-5:30 in Donner 155) Vern Paxson TAs: Dilip Antony Joseph and Sukun Kim http://inst.eecs.berkeley.edu/~ee122/ Materials
More informationSimulation Studies of the Basic Packet Routing Problem
Simulation Studies of the Basic Packet Routing Problem Author: Elena Sirén 48314u Supervisor: Pasi Lassila February 6, 2001 1 Abstract In this paper the simulation of a basic packet routing problem using
More informationCalculating Call Blocking and Utilization for Communication Satellites that Use Dynamic Resource Allocation
Calculating Call Blocking and Utilization for Communication Satellites that Use Dynamic Resource Allocation Leah Rosenbaum Mohit Agrawal Leah Birch Yacoub Kureh Nam Lee UCLA Institute for Pure and Applied
More information10. Network planning and dimensioning
lect10.ppt S-38.145 - Introduction to Teletraffic Theory - Fall 2000 1 Contents Introduction Network planning Traffic forecasts Dimensioning 2 Telecommunication network A simple model of a telecommunication
More informationMean Value Analysis and Related Techniques
Mean Value Analysis and Related Techniques Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu Audio/Video recordings of this lecture are available at: 34-1 Overview
More informationDetermining the Number of CPUs for Query Processing
Determining the Number of CPUs for Query Processing Fatemah Panahi Elizabeth Soechting CS747 Advanced Computer Systems Analysis Techniques The University of Wisconsin-Madison fatemeh@cs.wisc.edu, eas@cs.wisc.edu
More informationPARALLEL ALGORITHMS FOR IP SWITCHERS/ROUTERS
THE UNIVERSITY OF NAIROBI DEPARTMENT OF ELECTRICAL AND INFORMATION ENGINEERING FINAL YEAR PROJECT. PROJECT NO. 60 PARALLEL ALGORITHMS FOR IP SWITCHERS/ROUTERS OMARI JAPHETH N. F17/2157/2004 SUPERVISOR:
More informationHomework 2: Implementing a Firewall with Load Sharing
Homework 2: Implementing a Firewall with Load Sharing The purpose of this homework is to simulate a redundant firewall to compare performance of one versus multiple processors, and various queue sizes.
More informationEP2200 Queueing theory and teletraffic systems
EP2200 Queueing theory and teletraffic systems Viktoria Fodor Laboratory of Communication Networks School of Electrical Engineering Lecture 1 If you want to model networks Or a complex data flow A queue's
More informationImplementation of Queuing Models on Cloud Computing Based Data Centers
, pp.318-325 http://dx.doi.org/10.14257/astl.2017.147.44 Implementation of Queuing Models on Cloud Computing Based Data Centers N. Thirupathi Rao 1, P. Srinivas 1, K. Asish Vardhan 2, Debnath Bhattacharyya
More informationLecture 14: Congestion Control"
Lecture 14: Congestion Control" CSE 222A: Computer Communication Networks Alex C. Snoeren Thanks: Amin Vahdat, Dina Katabi Lecture 14 Overview" TCP congestion control review XCP Overview 2 Congestion Control
More informationIntroduction to the course
Introduction to the course Lecturer: Dmitri A. Moltchanov E-mail: moltchan@cs.tut.fi http://www.cs.tut.fi/ moltchan/modsim/ http://www.cs.tut.fi/kurssit/tlt-2706/ 1. What is the teletraffic theory? Multidisciplinary
More information048866: Packet Switch Architectures
048866: Packet Switch Architectures Output-Queued Switches Deterministic Queueing Analysis Fairness and Delay Guarantees Dr. Isaac Keslassy Electrical Engineering, Technion isaac@ee.technion.ac.il http://comnet.technion.ac.il/~isaac/
More informationCS 556 Advanced Computer Networks Spring Solutions to Midterm Test March 10, YOUR NAME: Abraham MATTA
CS 556 Advanced Computer Networks Spring 2011 Solutions to Midterm Test March 10, 2011 YOUR NAME: Abraham MATTA This test is closed books. You are only allowed to have one sheet of notes (8.5 11 ). Please
More informationÄriprotsesside modelleerimine ja automatiseerimine Loeng 5 Äriprotsesside modelleerimine BPMN. Enn Õunapuu
Äriprotsesside modelleerimine ja automatiseerimine Loeng 5 Äriprotsesside modelleerimine BPMN Enn Õunapuu enn@cc.ttu.ee Kava Üldine lähenemisviis BPMN Näited 3 Mudelitel põhinev tarkvara arendus Protsessitundlik
More informationQueueing Theory. M/M/1 and M/M/m Queues
Queueing Theory M/M/1 and M/M/m Queues Why queuing theory? Reason about the system Analyze different components Determine bottlenecks Queues are a core aspect of complex systems Art of Computer Systems
More informationÄriprotsesside modelleerimine ja automatiseerimine Loeng 5 Äriprotsesside modelleerimine BPMN. Enn Õunapuu
Äriprotsesside modelleerimine ja automatiseerimine Loeng 5 Äriprotsesside modelleerimine BPMN Enn Õunapuu enn@cc.ttu.ee Kava Üldine lähenemisviis BPMN Näited 3 Mudelitel põhinev tarkvara arendus Protsessitundlik
More informationWHITE PAPER. Latency & Jitter WHITE PAPER OVERVIEW
Latency & Jitter In Networking Performance Evaluation OVERVIEW Latency and jitter are two key measurement parameters when evaluating and benchmarking the performance of a network, system or device. Different
More informationCPU Scheduling: Objectives
CPU Scheduling: Objectives CPU scheduling, the basis for multiprogrammed operating systems CPU-scheduling algorithms Evaluation criteria for selecting a CPU-scheduling algorithm for a particular system
More informationCS162 Operating Systems and Systems Programming Lecture 17. Disk Management and File Systems
CS162 Operating Systems and Systems Programming Lecture 17 Disk Management and File Systems October 29, 2007 Prof. John Kubiatowicz http://inst.eecs.berkeley.edu/~cs162 Review: Want Standard Interfaces
More informationNetwork Traffic Characterisation
Modeling Modeling Theory Outline 1 2 The Problem Assumptions 3 Standard Car Model The Packet Train Model The Self - Similar Model 4 Random Variables and Stochastic Processes The Poisson and Exponential
More informationFlow Control. Flow control problem. Other considerations. Where?
Flow control problem Flow Control An Engineering Approach to Computer Networking Consider file transfer Sender sends a stream of packets representing fragments of a file Sender should try to match rate
More informationAdvanced Computer Networks
Advanced Computer Networks QoS in IP networks Prof. Andrzej Duda duda@imag.fr Contents QoS principles Traffic shaping leaky bucket token bucket Scheduling FIFO Fair queueing RED IntServ DiffServ http://duda.imag.fr
More informationScheduling. Monday, November 22, 2004
Scheduling Page 1 Scheduling Monday, November 22, 2004 11:22 AM The scheduling problem (Chapter 9) Decide which processes are allowed to run when. Optimize throughput, response time, etc. Subject to constraints
More informationMultiple Access Communications. EEE 538, WEEK 11 Dr. Nail Akar Bilkent University Electrical and Electronics Engineering Department
Multiple Access Communications EEE 538, WEEK 11 Dr. Nail Akar Bilkent University Electrical and Electronics Engineering Department 1 Multiple Access Satellite systems, radio networks (WLAN), ethernet segment
More informationAnnouncements. Network Performance: Queuing. Goals of Today s Lecture. Window Scaling. Window Scaling, con t. Window Scaling, con t
Announcements Network Performance: Queuing Additional reading for today s lecture: Peterson & Davie 3.4 EE 122: Intro to Communication Networks Fall 2006 (MW 4-5:30 in Donner 155) Vern Paxson As: Dilip
More informationWEB OBJECT SIZE SATISFYING MEAN WAITING TIME IN MULTIPLE ACCESS ENVIRONMENT
International Journal of Computer Networks & Communications (IJCNC) Vol.6, No.4, July 014 WEB OBJECT SIZE SATISFYING MEAN WAITING TIME IN MULTIPLE ACCESS ENVIRONMENT Y. J. Lee Department of Technology
More informationTransmission Control Protocol. ITS 413 Internet Technologies and Applications
Transmission Control Protocol ITS 413 Internet Technologies and Applications Contents Overview of TCP (Review) TCP and Congestion Control The Causes of Congestion Approaches to Congestion Control TCP Congestion
More information70 CHAPTER 1 COMPUTER NETWORKS AND THE INTERNET
70 CHAPTER 1 COMPUTER NETWORKS AND THE INTERNET one of these packets arrives to a packet switch, what information in the packet does the switch use to determine the link onto which the packet is forwarded?
More informationWeb application performance
Web application performance A Lecture for LinuxDays 2017 by Ing. Tomáš Vondra Cloud Architect at Capacity planning Marketing gives you: estimate of the number of customers and its trend > You need to translate
More informationScheduling Monday, November 22, :22 AM
Scheduling Page 1 Scheduling Monday, November 22, 2004 10:22 AM The scheduling problem (Chapter 9) Decide which processes are allowed to run when. Optimize throughput, response time, etc. Subject to constraints
More information