EXAM IN COURSE [EKSAMEN I EMNE] TTM4110 Dependability and Performance with Discrete event Simulation [Pålitelighet og ytelse med simulering]
|
|
- Andrea Thornton
- 8 years ago
- Views:
Transcription
1 Norwegian University of Science and Technology Department of Telematics Page 1 of 20 Contact during exam [Faglig kontakt under eksamen]: Poul E. Heegaard (94321 / ) EXAM IN COURSE [EKSAMEN I EMNE] TTM4110 Dependability and Performance with Discrete event Simulation [Pålitelighet og ytelse med simulering] Wednesday [Onsdag] :00 13:00 The English version starts on page 2. Bokmålsutgaven starter på side 10. Hjelpemidler: C - Graham Birtwistle: DEMOS - A system for Discrete Event Modelling on Simula. Formula sheet for TTM4110 Dependability and Performance with Discrete Event Simulation is attached. Predefined simple calculator. Graham Birtwistle: DEMOS - A system for Discrete Event Modelling on Simula. Formelsamling i fag TTM4110 Pålitelighet og ytelse med simulering er vedlagt. Forhåndsbestemt enkel kalulator.] Sensur 2011-week 2
2 Page 2 of 20 English version 1 GreenCloud is a small medium enterprise (SME) that provides a service A on a server park with three servers, C1,C2 and C3. They have some problems with stability and performance and would like to consider to consolidate their servers into a private cloud and maybe add computing resources from a public cloud provider. The solution they are considering is to let their three servers form a private cloud and to buy additional computing resources from public cloud provider 1 and 2, routed via network 1 or 2. This hybrid cloud solution is illustrated in Figure 1. Service A Private cloud Network 1 Public cloud 1 X C1 C2 C3 Network 2 Public cloud 2 Figure 1: Hybrid Cloud Computing System. Let p i be the probability that a successful service A request is handled by cloud i (i = A, A1,A2). The service times, S i, are deterministic. See Table 1 for numerical values. Table 1: Service times in the hybrid cloud i Cloud E(S i ) p i A Private 1/ A1 Public 1 1/ A2 Public 2 1/ a) Plot the probability mass function for the service times in the hybrid cloud. Determine the expected service time, E(S), and the variance, V ar(s)? What is the expected service time given that the service is served by one of the public clouds? 1 In case of divergence between the English and the Norwegian version, the English version prevails.
3 Page 3 of 20 0,8 0,6 0,4 0,2 0 1/10 1/5 1/2 E(S) =0.80 1/ / /2 =0.135 V ar(s) =0.80 (1/ ) (1/ ) (1/ ) 2 = E(S public) =(0.15 1/ /2)/( ) = In the following, assume that the service time in the private cloud is negative exponentially distributed with expectation E(S A )=1/µ A, while in the public clouds 1 and 2 it is negative exponentially distributed with expectations E(S A1 )=1/µ A1 and E(S A2 )=1/µ A2, respectively. b) Describe a generator of random variates of service times in the hybrid cloud. List the requirements for a random number generator. 1. Sample U 1 (0, 1) and U 2 (0, 1) 2. If U 1 <p A then S = Log(U 2 )/µ A 3. Else if U 1 <p A + p A1 then S = Log(U 2 )/µ A1 4. Else S = Log(U 2 )/µ A2 5. Goto 1. Requirements on page 110 in the textbook (fast, portable, long cycles, reproducible, good statistical properties) Figure 2 shows the empirical cumulative distribution function (CDF) after 1000 samples of the random variate generator above. c) Study the CDF and explain whether this distribution is symmetric or non-symmetric around the mean value. Define a quantile in a distribution? What is the 90% quantile in the CDF above (read approximately from the Figure 2)?
4 Page 4 of 20 empirical CDF service time Figure 2: Empirical cumulative distribution function (CDF) for service times in the hybrid cloud. 1. Not symmetric: the median is different from the mean value, the curve has no s-shape 2. X is an α-quantile in f(x) if P (x X) =α 3. The α =0.9-quantile in the given CDF: answers in the region is acceptable (the exact value from the data set, not available to the students, is ) Now, assume that in the private cloud each server can handle only one request of service A at the time. If all three servers are busy the service request is rejected. The requests for service A are generated from an infinte population according to a Poisson process with intensity λ A =9. The GreenCloud company have trouble with the rejected request and would like to consider the following two options: 1. Buy an additional server for their own privat cloud. The operational cost is c A =1per server (ignore the capital costs in this case). 2. Buy extra capacity from public cloud providers. Cost is c A1 =5and c A2 =2for public cloud 1 and 2, respectively. You pay only when the computer is in use. First consider the initial setup with only three servers in a private cloud. d) Make a Markov model of this private cloud and determine the average number of servers in use and the probability of rejected service requests. λ A λ A λ A µ A 2µ A 3µ A Steady state equations λ A p 0 = µ A p 1
5 Page 5 of 20 λ A p 1 =2µ A p 2 λ A p 2 =3µ A p 3 p 0 + p 1 + p 2 + p 3 =1 p i =(A i /i!)/ 3 ν=0 (Aν /ν!) For numerical values use λ A =9(this information was missing in the Norwegian edition) and µ A =10(from Table 1): p = {p 0,p 1,p 2,p 3 } = {0.412, 0.371, 0.167, 0.050} Expected number of servers in use: E[X] = 3 i=0 i p i =0.855 Probability of rejection: λp 3 / 3 ν=0 λp ν = p 3 (This can be recognized as the Erlang s loss model, and hence the call and time congetion is the same) Now, extend the private cloud with one server. e) Extend the Markov model from the previous task with one server extra. Determine the probability of rejected service requests now with four servers instead of three. Show how you can apply the Recursive Erlang s B-formula to obtain this. λ A λ A λ A µ A 2µ A 3µ A 4µ A λ A Request rejection (use recursive Erlang s B-formula): E 3 (A) =p 3 from previous point. E 4 (A) = AE 3(A) n+ae 3 (A) = =0.011 The alternative is to extend the capacity in the private cloud configuration with three server by buying capacity from public cloud providers. Through a service level agreement (SLA) GreenCloud is allowed to run one single process at the time on each of the two public clouds. If all three servers in the privat cloud are busy the service request is routed to the public cloud, and if any of the private cloud servers become idle then the process running on the public cloud will immediately be moved to the idle server in the private cloud. f) Extend the Markov model from d) with two public cloud servers. Define explicitly the state variable/vector in your model. Assume that public cloud 1 is selected if both public cloud are available and that processes are NOT moved from one public cloud to another. Given that the steady state probabilities are known (you should not obtain these) how can you determine the server utilization in the three different clouds expressed by the steady state probabilities? λ A 3,1,0 λa λ A λ A λ A 3µ A + µ A2 0,0,0 1,0,0 2,0,0 3,0,0 3µ A + µ A1 µ A 2µ A 3µ A 3µ A + µ A2 λ A 3,1,1 3,0,1 µ A1
6 Page 6 of 20 State : (i, j, k) where i =0,, 3 is the number of occupied servers in the private cloud, j =0, 1 and k =0, 1 is correspondingly the number of occupied servers in public cloud 1 and 2, respectively. If the p ijk s are known, the utilization in private cloud is 1 p 000 while utilization in public cloud 1 is p p 311 and in cloud 2 p p 311. The GreenCloud company pays only for the time the server in the public cloud is busy. In Table 2 you find the the steady state probabilities p i1 i 2 of that public cloud k is in state i k =0, 1 (represent the number of busy servers in public cloud k =1, 2). The probabilities p i 1 i 2 are for the case where cloud 2 is selected over cloud 1 when both public clouds are available. Table 2: Steady state probabilities of public clouds i 1 i 2 p i1 i 2 p i 1 i g) What are the operational costs for the configurations in e) and f)? Compare the two alternative configurations for the use of public clouds, i.e., selecting public cloud 1 over cloud 2 and vice versa. Discuss whether, and why you prefer one of the configurations over the other. Cost of four server configuration is 4 c A =4(your own computers you pay as if they are 100% in use) Cost of public 1 over 2: 3 c A +c A1 (p 1,0 +p 1,1 )+c A2 (p 0,1 +p 1,1 )= = Cost of public 2 over 1: 3 c A +c A1 (p 1,0 +p 1,1)+c A2 (p 0,1 +p 1,1) = = The latter conf is slightly cheaper, but with 8.7% increase in rejection probability (p 311 versus p 311 ), and with the given load profile renting from a public cloud is better than adding a new server in the privat cloud. In order to improve the robustness the GreenCloud company would like to have an agreement with at least two providers. At least one server must be working to provide service A. Servers in the private and public clouds may fail according to a Poisson process with intensity λ S. Similarly, the networks fail according to a Poisson process with intensity λ N. h) Establish a reliability block diagram to determine the reliability function of service A. What is the MTFF in the private cloud? P1 P2 P P P3 N1 N2 PC1 PC2 N PC NPC
7 Page 7 of 20 Reliability function: R(t) =1 (1 R P (t))(1 R NPC (t)) where R P (t) =1 (1 R P 1 (t))(1 R P 2 (t))(1 R P 3 (t)) and R NPC (t) =R N (t)r PC (t) where R N (t) =1 (1 R N1 (t))(1 R N2 (t)) and R PC (t) =1 (1 R PC1 (t))(1 R PC2 (t)) MTFF in a 3 node parallel structure (from formula sheet, Eq (48)): MTFF parallel = λ S i=1 =(1+1/2+1/3)/λ i S =11/(6λ S ) The servers in the private cloud will be repaired by a single, shared repairman. The repair time is negative exponentially distributed with intensity µ S. i) Determine symbolically the steady state availability of the private cloud. How will it affect your approach and solution if you assume multiple, independent repairmen instead of a single, shared repairman? P1 µ S A S = 3λ S 2λ S λ S µ S + λ S µ S µ S µ S P2 P3 (a) Single, shared repairman (b) Multiple, independent repairmen Single, shared repairman: Markov model because repair of servers are not independent of eachother: A (SR) =1 p 3 =1 6(λ S /µ S ) 3 1+3(λ S /µ S )+6(λ S /µ S ) 2 +6(λ S /µ S ) 3 Multiple, independent repairmen: Block diagram since both failure and repair are independent of eachother A (MR) =1 (1 A S ) 3 =1 (1 µ S λ S +µ S ) 3 =1 λ3 S (µ S +λ S ) 3 Finally, GreenCloud would like to add another service B. Due to privacy this service can only be executed on the private cloud. Service B will have non-preemptive priority over service A. Service A can still be executed both on the private and public clouds. The objective is to calculate the cost of providing service A and B and the corresponding rejection probabilities. j) Make a simulation model of this system. 1. What is the system state and corresponding events in your model? 2. Which system components are entities and resources in your model? 3. Describe the dynamics and interaction in the simulation model by activity diagrams.
8 Page 8 of How do you collect statistics to estimate the performance attributes in your objectives? System state: #servers in A, A1, A2 that are occuped, #servers in A, A1, A2 that are in operations NOTE: It is acceptable to assume that servers are always operational, however it is important to be consitent with your assumptions throughout the whole task Events: arrival of request, service completion, server failure and repair NOTE: rejects are per definition not events because it does not change the system state Entities: service A, service B, generator A, generator B, failure Resources: server A (3), A1 (1), A2 (1) Statistics: observe cluster utilization from RES report, and count number of requests and nuber of lost requests, indicated in activity diagram below. Minimum: assume no failures, see figure blow NOTE: since requests are rejected if all resources are occupied there will be no queuing and, hence, non-preemtive priority can not be taken into account To consider failures there are (at least) two options
9 Page 9 of Separate failure process that takes a resource in a non-preemptive way: the failure will be queued until resource becomes available. This is ok when the service times are short relative to the repair times 2. Add interrupts - send interrupt to the active service process (in serv A or serv B) that holds a server that has failed (complicated) In the figure below you find a description of the two options above. You need one per server pool (A, A1, A2).
MAS108 Probability I
1 QUEEN MARY UNIVERSITY OF LONDON 2:30 pm, Thursday 3 May, 2007 Duration: 2 hours MAS108 Probability I Do not start reading the question paper until you are instructed to by the invigilators. The paper
More informationCHAPTER 3 CALL CENTER QUEUING MODEL WITH LOGNORMAL SERVICE TIME DISTRIBUTION
31 CHAPTER 3 CALL CENTER QUEUING MODEL WITH LOGNORMAL SERVICE TIME DISTRIBUTION 3.1 INTRODUCTION In this chapter, construction of queuing model with non-exponential service time distribution, performance
More informationPull versus Push Mechanism in Large Distributed Networks: Closed Form Results
Pull versus Push Mechanism in Large Distributed Networks: Closed Form Results Wouter Minnebo, Benny Van Houdt Dept. Mathematics and Computer Science University of Antwerp - iminds Antwerp, Belgium Wouter
More informationProcess simulation. Enn Õunapuu enn.ounapuu@ttu.ee
Process simulation Enn Õunapuu enn.ounapuu@ttu.ee Content Problem How? Example Simulation Definition Modeling and simulation functionality allows for preexecution what-if modeling and simulation. Postexecution
More informationQueuing Theory II 2006 Samuel L. Baker
QUEUING THEORY II 1 More complex queues: Multiple Server Single Stage Queue Queuing Theory II 2006 Samuel L. Baker Assignment 8 is on page 7. Assignment 8A is on page 10. -- meaning that we have one line
More informationExam Introduction Mathematical Finance and Insurance
Exam Introduction Mathematical Finance and Insurance Date: January 8, 2013. Duration: 3 hours. This is a closed-book exam. The exam does not use scrap cards. Simple calculators are allowed. The questions
More informationDeployment of express checkout lines at supermarkets
Deployment of express checkout lines at supermarkets Maarten Schimmel Research paper Business Analytics April, 213 Supervisor: René Bekker Faculty of Sciences VU University Amsterdam De Boelelaan 181 181
More informationNetwork Design Performance Evaluation, and Simulation #6
Network Design Performance Evaluation, and Simulation #6 1 Network Design Problem Goal Given QoS metric, e.g., Average delay Loss probability Characterization of the traffic, e.g., Average interarrival
More informationIEOR 6711: Stochastic Models, I Fall 2012, Professor Whitt, Final Exam SOLUTIONS
IEOR 6711: Stochastic Models, I Fall 2012, Professor Whitt, Final Exam SOLUTIONS There are four questions, each with several parts. 1. Customers Coming to an Automatic Teller Machine (ATM) (30 points)
More informationHow To Manage A Call Center
THE ROLE OF SIMULATION IN CALL CENTER MANAGEMENT Roger Klungle AAA Michigan Introduction With recent advances in technology and the changing nature of business, call center management has become a rapidly
More informationSupplement to Call Centers with Delay Information: Models and Insights
Supplement to Call Centers with Delay Information: Models and Insights Oualid Jouini 1 Zeynep Akşin 2 Yves Dallery 1 1 Laboratoire Genie Industriel, Ecole Centrale Paris, Grande Voie des Vignes, 92290
More informationTenth Problem Assignment
EECS 40 Due on April 6, 007 PROBLEM (8 points) Dave is taking a multiple-choice exam. You may assume that the number of questions is infinite. Simultaneously, but independently, his conscious and subconscious
More informationAnalysis of a Production/Inventory System with Multiple Retailers
Analysis of a Production/Inventory System with Multiple Retailers Ann M. Noblesse 1, Robert N. Boute 1,2, Marc R. Lambrecht 1, Benny Van Houdt 3 1 Research Center for Operations Management, University
More informationM/M/1 and M/M/m Queueing Systems
M/M/ and M/M/m Queueing Systems M. Veeraraghavan; March 20, 2004. Preliminaries. Kendall s notation: G/G/n/k queue G: General - can be any distribution. First letter: Arrival process; M: memoryless - exponential
More informationLECTURE 16. Readings: Section 5.1. Lecture outline. Random processes Definition of the Bernoulli process Basic properties of the Bernoulli process
LECTURE 16 Readings: Section 5.1 Lecture outline Random processes Definition of the Bernoulli process Basic properties of the Bernoulli process Number of successes Distribution of interarrival times The
More informationQuantitative Analysis of Cloud-based Streaming Services
of Cloud-based Streaming Services Fang Yu 1, Yat-Wah Wan 2 and Rua-Huan Tsaih 1 1. Department of Management Information Systems National Chengchi University, Taipei, Taiwan 2. Graduate Institute of Logistics
More informationUNIT 2 QUEUING THEORY
UNIT 2 QUEUING THEORY LESSON 24 Learning Objective: Apply formulae to find solution that will predict the behaviour of the single server model II. Apply formulae to find solution that will predict the
More informationAn Approach to Load Balancing In Cloud Computing
An Approach to Load Balancing In Cloud Computing Radha Ramani Malladi Visiting Faculty, Martins Academy, Bangalore, India ABSTRACT: Cloud computing is a structured model that defines computing services,
More informationTibco TB0-119. TIBCO ActiveMatrix BusinessWorks 5 Exam. http://www.examskey.com/tb0-119.html
Tibco TB0-119 TIBCO ActiveMatrix BusinessWorks 5 Exam TYPE: DEMO http://www.examskey.com/tb0-119.html Examskey Tibco TB0-119 exam demo product is here for you to test the quality of the product. This Tibco
More informationAS-D2 THE ROLE OF SIMULATION IN CALL CENTER MANAGEMENT. Dr. Roger Klungle Manager, Business Operations Analysis
AS-D2 THE ROLE OF SIMULATION IN CALL CENTER MANAGEMENT Dr. Roger Klungle Manager, Business Operations Analysis AAA Michigan 1 Auto Club Drive Dearborn, MI 48126 U.S.A. Phone: (313) 336-9946 Fax: (313)
More informationLoad Balancing and Switch Scheduling
EE384Y Project Final Report Load Balancing and Switch Scheduling Xiangheng Liu Department of Electrical Engineering Stanford University, Stanford CA 94305 Email: liuxh@systems.stanford.edu Abstract Load
More informationLECTURE - 1 INTRODUCTION TO QUEUING SYSTEM
LECTURE - 1 INTRODUCTION TO QUEUING SYSTEM Learning objective To introduce features of queuing system 9.1 Queue or Waiting lines Customers waiting to get service from server are represented by queue and
More informationHow To Balance In A Distributed System
6 IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 11, NO. 1, JANUARY 2000 How Useful Is Old Information? Michael Mitzenmacher AbstractÐWe consider the problem of load balancing in dynamic distributed
More informationStochastic Processes and Queueing Theory used in Cloud Computer Performance Simulations
56 Stochastic Processes and Queueing Theory used in Cloud Computer Performance Simulations Stochastic Processes and Queueing Theory used in Cloud Computer Performance Simulations Florin-Cătălin ENACHE
More informationBasic Queuing Relationships
Queueing Theory Basic Queuing Relationships Resident items Waiting items Residence time Single server Utilisation System Utilisation Little s formulae are the most important equation in queuing theory
More informationContinuous Random Variables
Chapter 5 Continuous Random Variables 5.1 Continuous Random Variables 1 5.1.1 Student Learning Objectives By the end of this chapter, the student should be able to: Recognize and understand continuous
More informationCisco EXAM - 300-075. Implementing Cisco IP Telephony and Video, Part 2 (CIPTV2) Buy Full Product. http://www.examskey.com/300-075.
Cisco EXAM - 300-075 Implementing Cisco IP Telephony and Video, Part 2 (CIPTV2) Buy Full Product http://www.examskey.com/300-075.html Examskey Cisco 300-075 exam demo product is here for you to test the
More informationResponse Times in an Accident and Emergency Service Unit. Apurva Udeshi aau03@doc.ic.ac.uk
IMPERIAL COLLEGE, LONDON Department of Computing Response Times in an Accident and Emergency Service Unit Apurva Udeshi aau03@doc.ic.ac.uk Supervisor: Professor Peter Harrison Second Marker: Dr. William
More informationImportant Probability Distributions OPRE 6301
Important Probability Distributions OPRE 6301 Important Distributions... Certain probability distributions occur with such regularity in real-life applications that they have been given their own names.
More informationWaiting Times Chapter 7
Waiting Times Chapter 7 1 Learning Objectives Interarrival and Service Times and their variability Obtaining the average time spent in the queue Pooling of server capacities Priority rules Where are the
More informationŹ Ź ł ź Ź ś ź ł ź Ś ę ż ż ł ż ż Ż Ś ę Ż Ż ę ś ź ł Ź ł ł ż ż ź ż ż Ś ę ż ż Ź Ł Ż Ż Ą ż ż ę ź Ń Ź ś ł ź ż ł ś ź ź Ą ć ś ś Ź Ś ę ę ć ż Ź Ą Ń Ą ł ć ć ł ł ź ę Ś ę ś ę ł ś ć ź ś ł ś ł ł ł ł ć ć Ś ł ź Ś ł
More informationQueueing Systems. Ivo Adan and Jacques Resing
Queueing Systems Ivo Adan and Jacques Resing Department of Mathematics and Computing Science Eindhoven University of Technology P.O. Box 513, 5600 MB Eindhoven, The Netherlands March 26, 2015 Contents
More informationPerformance of Cloud Computing Centers with Multiple Priority Classes
202 IEEE Fifth International Conference on Cloud Computing Performance of Cloud Computing Centers with Multiple Priority Classes Wendy Ellens, Miroslav Živković, Jacob Akkerboom, Remco Litjens, Hans van
More informationHow To Compare Load Sharing And Job Scheduling In A Network Of Workstations
A COMPARISON OF LOAD SHARING AND JOB SCHEDULING IN A NETWORK OF WORKSTATIONS HELEN D. KARATZA Department of Informatics Aristotle University of Thessaloniki 546 Thessaloniki, GREECE Email: karatza@csd.auth.gr
More information1. Implementation of a testbed for testing Energy Efficiency by server consolidation using Vmware
1. Implementation of a testbed for testing Energy Efficiency by server consolidation using Vmware Cloud Data centers used by service providers for offering Cloud Computing services are one of the major
More informationOptimizing Cloud Use under Interval Uncertainty
Optimizing Cloud Use under Interval Uncertainty Vladik Kreinovich and Esthela Gallardo Department of Computer Science University of Texas at El Paso El Paso, TX 79968, USA vladik@utep.edu, egallardo5@miners.utep.edu
More informationCALL CENTER PERFORMANCE EVALUATION USING QUEUEING NETWORK AND SIMULATION
CALL CENTER PERFORMANCE EVALUATION USING QUEUEING NETWORK AND SIMULATION MA 597 Assignment K.Anjaneyulu, Roll no: 06212303 1. Introduction A call center may be defined as a service unit where a group of
More informationExample: 1. You have observed that the number of hits to your web site follow a Poisson distribution at a rate of 2 per day.
16 The Exponential Distribution Example: 1. You have observed that the number of hits to your web site follow a Poisson distribution at a rate of 2 per day. Let T be the time (in days) between hits. 2.
More informationAggregate Loss Models
Aggregate Loss Models Chapter 9 Stat 477 - Loss Models Chapter 9 (Stat 477) Aggregate Loss Models Brian Hartman - BYU 1 / 22 Objectives Objectives Individual risk model Collective risk model Computing
More informationForecasting and Planning a Multi-Skilled Workforce: What You Need To Know
Welcome Forecasting and Planning a Multi-Skilled Workforce: What You Need To Know Presented by: Skills Scheduling What is it? Scheduling that takes into account the fact that employees may have one or
More informationBNG 202 Biomechanics Lab. Descriptive statistics and probability distributions I
BNG 202 Biomechanics Lab Descriptive statistics and probability distributions I Overview The overall goal of this short course in statistics is to provide an introduction to descriptive and inferential
More informationVirtualization & Covance Inc.
Virtualization & Cloud Computing Environment Oleg Trigub Covance Inc. Agenda Disaster Recovery Challenges Benefits of Private Cloud DR RPO versus RTO Data Replication among Data Centers Is DR in the Cloud
More informationChapter 1. Introduction
Chapter 1 Introduction 1.1. Motivation Network performance analysis, and the underlying queueing theory, was born at the beginning of the 20th Century when two Scandinavian engineers, Erlang 1 and Engset
More informationBusiness Statistics. Successful completion of Introductory and/or Intermediate Algebra courses is recommended before taking Business Statistics.
Business Course Text Bowerman, Bruce L., Richard T. O'Connell, J. B. Orris, and Dawn C. Porter. Essentials of Business, 2nd edition, McGraw-Hill/Irwin, 2008, ISBN: 978-0-07-331988-9. Required Computing
More informationTABLE OF CONTENTS. 4. Daniel Markov 1 173
TABLE OF CONTENTS 1. Survival A. Time of Death for a Person Aged x 1 B. Force of Mortality 7 C. Life Tables and the Deterministic Survivorship Group 19 D. Life Table Characteristics: Expectation of Life
More informationExploratory Data Analysis
Exploratory Data Analysis Johannes Schauer johannes.schauer@tugraz.at Institute of Statistics Graz University of Technology Steyrergasse 17/IV, 8010 Graz www.statistics.tugraz.at February 12, 2008 Introduction
More informationCloud Storage and Online Bin Packing
Cloud Storage and Online Bin Packing Doina Bein, Wolfgang Bein, and Swathi Venigella Abstract We study the problem of allocating memory of servers in a data center based on online requests for storage.
More information2WB05 Simulation Lecture 8: Generating random variables
2WB05 Simulation Lecture 8: Generating random variables Marko Boon http://www.win.tue.nl/courses/2wb05 January 7, 2013 Outline 2/36 1. How do we generate random variables? 2. Fitting distributions Generating
More informationTraffic Analysis in Contact Centers
Traffic nalysis in Contact Centers Erik Chromy, Jan Diezka, Matus Kovacik, Matej Kavacky Institute of Telecommunications, Faculty of Electrical Engineering and Information Technology, lovak Republic chromy@ut.fei.stuba.sk,
More informationEXPLORING SPATIAL PATTERNS IN YOUR DATA
EXPLORING SPATIAL PATTERNS IN YOUR DATA OBJECTIVES Learn how to examine your data using the Geostatistical Analysis tools in ArcMap. Learn how to use descriptive statistics in ArcMap and Geoda to analyze
More informationEKSAMEN / EXAM TTM4100 18 05 2007
1.1 1.1.1...... 1.1.2...... 1.1.3...... 1.1.4...... 1.1.5...... 1.1.6...... 1.1.7...... 1.1.8...... 1.1.9...... 1.1.10.... 1.1.11... 1.1.16.... 1.1.12... 1.1.17.... 1.1.13... 1.1.18.... 1.1.14... 1.1.19....
More informationPractical Calculation of Expected and Unexpected Losses in Operational Risk by Simulation Methods
Practical Calculation of Expected and Unexpected Losses in Operational Risk by Simulation Methods Enrique Navarrete 1 Abstract: This paper surveys the main difficulties involved with the quantitative measurement
More informationMath 370, Actuarial Problemsolving Spring 2008 A.J. Hildebrand. Practice Test, 1/28/2008 (with solutions)
Math 370, Actuarial Problemsolving Spring 008 A.J. Hildebrand Practice Test, 1/8/008 (with solutions) About this test. This is a practice test made up of a random collection of 0 problems from past Course
More informationModels for Distributed, Large Scale Data Cleaning
Models for Distributed, Large Scale Data Cleaning Vincent J. Maccio, Fei Chiang, and Douglas G. Down McMaster University Hamilton, Ontario, Canada {macciov,fchiang,downd}@mcmaster.ca Abstract. Poor data
More informationMTAT.03.231 Business Process Management (BPM) Lecture 6 Quantitative Process Analysis (Queuing & Simulation)
MTAT.03.231 Business Process Management (BPM) Lecture 6 Quantitative Process Analysis (Queuing & Simulation) Marlon Dumas marlon.dumas ät ut. ee Business Process Analysis 2 Process Analysis Techniques
More informationExploratory data analysis (Chapter 2) Fall 2011
Exploratory data analysis (Chapter 2) Fall 2011 Data Examples Example 1: Survey Data 1 Data collected from a Stat 371 class in Fall 2005 2 They answered questions about their: gender, major, year in school,
More informationIntegrating a Factory and Supply Chain Simulator into a Textile Supply Chain Management Curriculum
Integrating a Factory and Supply Chain Simulator into a Textile Supply Chain Management Curriculum Kristin Thoney Associate Professor Department of Textile and Apparel, Technology and Management ABSTRACT
More informationBreak-even analysis. On page 256 of It s the Business textbook, the authors refer to an alternative approach to drawing a break-even chart.
Break-even analysis On page 256 of It s the Business textbook, the authors refer to an alternative approach to drawing a break-even chart. In order to survive businesses must at least break even, which
More information4 The M/M/1 queue. 4.1 Time-dependent behaviour
4 The M/M/1 queue In this chapter we will analyze the model with exponential interarrival times with mean 1/λ, exponential service times with mean 1/µ and a single server. Customers are served in order
More informationThe Joint Distribution of Server State and Queue Length of M/M/1/1 Retrial Queue with Abandonment and Feedback
The Joint Distribution of Server State and Queue Length of M/M/1/1 Retrial Queue with Abandonment and Feedback Hamada Alshaer Université Pierre et Marie Curie - Lip 6 7515 Paris, France Hamada.alshaer@lip6.fr
More informationModelling the performance of computer mirroring with difference queues
Modelling the performance of computer mirroring with difference queues Przemyslaw Pochec Faculty of Computer Science University of New Brunswick, Fredericton, Canada E3A 5A3 email pochec@unb.ca ABSTRACT
More informationPerformance Analysis of a Selected System in a Process Industry
Research Article International Journal of Current Engineering and Technology E-ISSN 2277 4106, P-ISSN 2347-5161 2014 INPRESSCO, All Rights Reserved Available at http://inpressco.com/category/ijcet Performance
More informationNormality Testing in Excel
Normality Testing in Excel By Mark Harmon Copyright 2011 Mark Harmon No part of this publication may be reproduced or distributed without the express permission of the author. mark@excelmasterseries.com
More informationNonparametric adaptive age replacement with a one-cycle criterion
Nonparametric adaptive age replacement with a one-cycle criterion P. Coolen-Schrijner, F.P.A. Coolen Department of Mathematical Sciences University of Durham, Durham, DH1 3LE, UK e-mail: Pauline.Schrijner@durham.ac.uk
More informationCHAPTER 5 WLDMA: A NEW LOAD BALANCING STRATEGY FOR WAN ENVIRONMENT
81 CHAPTER 5 WLDMA: A NEW LOAD BALANCING STRATEGY FOR WAN ENVIRONMENT 5.1 INTRODUCTION Distributed Web servers on the Internet require high scalability and availability to provide efficient services to
More informationOPTIMIZED PERFORMANCE EVALUATIONS OF CLOUD COMPUTING SERVERS
OPTIMIZED PERFORMANCE EVALUATIONS OF CLOUD COMPUTING SERVERS K. Sarathkumar Computer Science Department, Saveetha School of Engineering Saveetha University, Chennai Abstract: The Cloud computing is one
More informationCourse Text. Required Computing Software. Course Description. Course Objectives. StraighterLine. Business Statistics
Course Text Business Statistics Lind, Douglas A., Marchal, William A. and Samuel A. Wathen. Basic Statistics for Business and Economics, 7th edition, McGraw-Hill/Irwin, 2010, ISBN: 9780077384470 [This
More informationKnowledge Management in Call Centers: How Routing Rules Influence Expertise and Service Quality
Knowledge Management in Call Centers: How Routing Rules Influence Expertise and Service Quality Christoph Heitz Institute of Data Analysis and Process Design, Zurich University of Applied Sciences CH-84
More information- 1 - intelligence. showing the layout, and products moving around on the screen during simulation
- 1 - LIST OF SYMBOLS, TERMS AND EXPRESSIONS This list of symbols, terms and expressions gives an explanation or definition of how they are used in this thesis. Most of them are defined in the references
More informationThe International Journal Of Science & Technoledge (ISSN 2321 919X) www.theijst.com
THE INTERNATIONAL JOURNAL OF SCIENCE & TECHNOLEDGE Efficient Parallel Processing on Public Cloud Servers using Load Balancing Manjunath K. C. M.Tech IV Sem, Department of CSE, SEA College of Engineering
More informationSPARE PARTS INVENTORY SYSTEMS UNDER AN INCREASING FAILURE RATE DEMAND INTERVAL DISTRIBUTION
SPARE PARS INVENORY SYSEMS UNDER AN INCREASING FAILURE RAE DEMAND INERVAL DISRIBUION Safa Saidane 1, M. Zied Babai 2, M. Salah Aguir 3, Ouajdi Korbaa 4 1 National School of Computer Sciences (unisia),
More informationWeb Server Software Architectures
Web Server Software Architectures Author: Daniel A. Menascé Presenter: Noshaba Bakht Web Site performance and scalability 1.workload characteristics. 2.security mechanisms. 3. Web cluster architectures.
More informationStatistics I for QBIC. Contents and Objectives. Chapters 1 7. Revised: August 2013
Statistics I for QBIC Text Book: Biostatistics, 10 th edition, by Daniel & Cross Contents and Objectives Chapters 1 7 Revised: August 2013 Chapter 1: Nature of Statistics (sections 1.1-1.6) Objectives
More informationMath 370/408, Spring 2008 Prof. A.J. Hildebrand. Actuarial Exam Practice Problem Set 5 Solutions
Math 370/408, Spring 2008 Prof. A.J. Hildebrand Actuarial Exam Practice Problem Set 5 Solutions About this problem set: These are problems from Course 1/P actuarial exams that I have collected over the
More informationAachen Summer Simulation Seminar 2014
Aachen Summer Simulation Seminar 2014 Lecture 07 Input Modelling + Experimentation + Output Analysis Peer-Olaf Siebers pos@cs.nott.ac.uk Motivation 1. Input modelling Improve the understanding about how
More informationPARTIAL CROSS TRAINING IN CALL CENTERS WITH UNCERTAIN ARRIVALS AND GLOBAL SERVICE LEVEL AGREEMENTS. D. J. Medeiros
Proceedings of the 07 Winter Simulation Conference S. G. Henderson, B. Biller, M.-H. Hsieh, J. Shortle, J. D. Tew, and R. R. Barton, eds. PARTIAL CROSS TRAINING IN CALL CENTERS WITH UNCERTAIN ARRIVALS
More informationJava Modules for Time Series Analysis
Java Modules for Time Series Analysis Agenda Clustering Non-normal distributions Multifactor modeling Implied ratings Time series prediction 1. Clustering + Cluster 1 Synthetic Clustering + Time series
More informationCHAPTER 7 STOCHASTIC ANALYSIS OF MANPOWER LEVELS AFFECTING BUSINESS 7.1 Introduction
CHAPTER 7 STOCHASTIC ANALYSIS OF MANPOWER LEVELS AFFECTING BUSINESS 7.1 Introduction Consider in this chapter a business organization under fluctuating conditions of availability of manpower and business
More informationMAINTAINED SYSTEMS. Harry G. Kwatny. Department of Mechanical Engineering & Mechanics Drexel University ENGINEERING RELIABILITY INTRODUCTION
MAINTAINED SYSTEMS Harry G. Kwatny Department of Mechanical Engineering & Mechanics Drexel University OUTLINE MAINTE MAINTE MAINTAINED UNITS Maintenance can be employed in two different manners: Preventive
More informationUNIT I: RANDOM VARIABLES PART- A -TWO MARKS
UNIT I: RANDOM VARIABLES PART- A -TWO MARKS 1. Given the probability density function of a continuous random variable X as follows f(x) = 6x (1-x) 0
More informationComparison of Request Admission Based Performance Isolation Approaches in Multi-tenant SaaS Applications
Comparison of Request Admission Based Performance Isolation Approaches in Multi-tenant SaaS Applications Rouven Kreb 1 and Manuel Loesch 2 1 SAP AG, Walldorf, Germany 2 FZI Research Center for Information
More informationPermutation Tests for Comparing Two Populations
Permutation Tests for Comparing Two Populations Ferry Butar Butar, Ph.D. Jae-Wan Park Abstract Permutation tests for comparing two populations could be widely used in practice because of flexibility of
More information1. Repetition probability theory and transforms
1. Repetition probability theory and transforms 1.1. A prisoner is kept in a cell with three doors. Through one of them he can get out of the prison. The other one leads to a tunnel: through this he is
More informationLOGNORMAL MODEL FOR STOCK PRICES
LOGNORMAL MODEL FOR STOCK PRICES MICHAEL J. SHARPE MATHEMATICS DEPARTMENT, UCSD 1. INTRODUCTION What follows is a simple but important model that will be the basis for a later study of stock prices as
More informationManufacturing Systems Modeling and Analysis
Guy L. Curry Richard M. Feldman Manufacturing Systems Modeling and Analysis 4y Springer 1 Basic Probability Review 1 1.1 Basic Definitions 1 1.2 Random Variables and Distribution Functions 4 1.3 Mean and
More informationRandom Variate Generation (Part 3)
Random Variate Generation (Part 3) Dr.Çağatay ÜNDEĞER Öğretim Görevlisi Bilkent Üniversitesi Bilgisayar Mühendisliği Bölümü &... e-mail : cagatay@undeger.com cagatay@cs.bilkent.edu.tr Bilgisayar Mühendisliği
More informationWEEK #22: PDFs and CDFs, Measures of Center and Spread
WEEK #22: PDFs and CDFs, Measures of Center and Spread Goals: Explore the effect of independent events in probability calculations. Present a number of ways to represent probability distributions. Textbook
More informationCloud Computing Backgrounder
Cloud Computing Backgrounder No surprise: information technology (IT) is huge. Huge costs, huge number of buzz words, huge amount of jargon, and a huge competitive advantage for those who can effectively
More informationChapter 3 RANDOM VARIATE GENERATION
Chapter 3 RANDOM VARIATE GENERATION In order to do a Monte Carlo simulation either by hand or by computer, techniques must be developed for generating values of random variables having known distributions.
More informationThe Small Business Guide to Cloud Computing PRESENTED BY. www.keymethods.net/cloud 888.860.2074 info@keymethods.net
The Small Business Guide to Cloud Computing PRESENTED BY You ve undoubtedly heard the term cloud computing being used over the past couple of years, and you may be wondering what all of the buzz is about.
More informationEfficient Parallel Processing on Public Cloud Servers Using Load Balancing
Efficient Parallel Processing on Public Cloud Servers Using Load Balancing Valluripalli Srinath 1, Sudheer Shetty 2 1 M.Tech IV Sem CSE, Sahyadri College of Engineering & Management, Mangalore. 2 Asso.
More informationPerformance Analysis of Job-Shop Production Systems under Different Order Release Control Parameters
Performance Analysis of Job-Shop Production Systems under Different Order Release Control Parameters Paulo S. A. Sousa and Maria R. A. Moreira Abstract Controlling the flow of materials inside job-shops
More informationCost of Capital and Corporate Refinancing Strategy: Optimization of Costs and Risks *
Cost of Capital and Corporate Refinancing Strategy: Optimization of Costs and Risks * Garritt Conover Abstract This paper investigates the effects of a firm s refinancing policies on its cost of capital.
More informationA Quantitative Approach to Commercial Damages. Applying Statistics to the Measurement of Lost Profits + Website
Brochure More information from http://www.researchandmarkets.com/reports/2212877/ A Quantitative Approach to Commercial Damages. Applying Statistics to the Measurement of Lost Profits + Website Description:
More informationCloud computing is a marketing term that means different things to different people. In this presentation, we look at the pros and cons of using
Cloud computing is a marketing term that means different things to different people. In this presentation, we look at the pros and cons of using Amazon Web Services rather than setting up a physical server
More information1. Let A, B and C are three events such that P(A) = 0.45, P(B) = 0.30, P(C) = 0.35,
1. Let A, B and C are three events such that PA =.4, PB =.3, PC =.3, P A B =.6, P A C =.6, P B C =., P A B C =.7. a Compute P A B, P A C, P B C. b Compute P A B C. c Compute the probability that exactly
More informationTRAFFIC ENGINEERING OF DISTRIBUTED CALL CENTERS: NOT AS STRAIGHT FORWARD AS IT MAY SEEM. M. J. Fischer D. A. Garbin A. Gharakhanian D. M.
TRAFFIC ENGINEERING OF DISTRIBUTED CALL CENTERS: NOT AS STRAIGHT FORWARD AS IT MAY SEEM M. J. Fischer D. A. Garbin A. Gharakhanian D. M. Masi January 1999 Mitretek Systems 7525 Colshire Drive McLean, VA
More informationSimple Queuing Theory Tools You Can Use in Healthcare
Simple Queuing Theory Tools You Can Use in Healthcare Jeff Johnson Management Engineering Project Director North Colorado Medical Center Abstract Much has been written about queuing theory and its powerful
More informationA Comparative Performance Analysis of Load Balancing Algorithms in Distributed System using Qualitative Parameters
A Comparative Performance Analysis of Load Balancing Algorithms in Distributed System using Qualitative Parameters Abhijit A. Rajguru, S.S. Apte Abstract - A distributed system can be viewed as a collection
More informationAlgebra 1 Course Information
Course Information Course Description: Students will study patterns, relations, and functions, and focus on the use of mathematical models to understand and analyze quantitative relationships. Through
More information