as the algorithm that will be implemented in Asynchronous Transfer Mode ( ATM ) networks.
|
|
- Bruno Osborne
- 6 years ago
- Views:
Transcription
1 ON SIMPLIFIED MODELLING OF THE LEAKY BUCKET M Jennings, R J McEliece, J Murphy andzyu Abstract The Generic Cell Rate Algorithm, or more commonly the leaky bucket, has been standardised as the algorithm that will be implemented in Asynchronous Transfer Mode ( ATM ) networks. To model an ATM network it is important to be able to model this algorithm. However most proposed models are complex and because the leaky bucket is only one element within the network the model should be simple. In this paper we attempt to simplify the model by making some assumptions. There are two mathematical models proposed to achieve this. In the rst we look at the cell scale and although the model is detailed, the approximation is that the token arrival is random. In the second model we look at the token scale where it is possible to have multiple cell arrivals in that period. This model is not as detailed as the rst. What is being investigated is if the real system would act better than these so that they could be used as an upper bound on the performance of the network. The results presented in this `work in progress' paper are only preliminary. 1 Introduction Asynchronous Transfer Mode ( ATM ) is the emerging standard for the future broadband-isdn networks and allows for the trac from users to vary both from one call to another and within the call. As ATM will give guarantees to the users it is important for the network to have a method for describing and controlling the trac ow across the user network interface ( UNI ) 11. The conformance denition for ATM networks has been standardised as the Generic Cell Rate Algorithm ( GCRA ), or leaky bucket, by the ATM Forum 2. This algorithm allows variable bit rate trac to be specied in terms of the mean bit rate and a burst tolerance. This will be used by the network to see if a cell is compliant ornotandmay also be used by the network as the Usage Parameter Control ( UPC ) mechanism. When modelling an ATM network it is important to be able to model this algorithm eectively and easily. The leaky bucket is also proposed within the network in a slightly dierent format and acts as a regulator 6. This tends to increase the performance of the network by smoothing the trac ow. The leaky bucket algorithm is shown in Fig. 1. The operation of the leaky bucket is that a splash is added to the bucket for each incoming cell when the bucket is not full. When the bucket is full cells cannot pass through to the network but the bucket leaks away at a constant rate. M. Jennings and J. Murphy, Electronic Engineering, Dublin City University, Glasnevin, Dublin 9, Ireland. Telephone: , Fax: , murphyj@eeng.dcu.ie R. J. McEliece and Z. Yu, Electrical Engineering, , California Institute of Technology, Pasadena, CA 91125, USA. zyu@systems.caltech.edu 19/1
2 The important parameters to be dened in this system are the leak rate of the bucket, the bucket capacity and the peak cell emission. If the cells cannot pass the leaky bucket they are lost, when the leaky bucket acts as the UPC. If the leaky bucket acts as a regulator and if the cells cannot pass they are stored and wait till they can pass. If there is an innite buer there will be no cell loss in the regulator. Incoming Cells Outgoing Cells Leaky Bucket Figure 1: Leaky Bucket or UPC Algorithm Another way of thinking about the leaky bucket is to imagine that there are tokens kept by the network and as long as the network has a token the cells can pass the leaky bucket. The tokens are generated deterministically every D seconds. The capacity of the bucket is the number of tokens that the network can store and is given by M. If the network has M tokens stored then it will not add another token until a cell passes and another token time has passed by at time t = nd. If there are no tokens available in the bucket then the cell is lost in the UPC version of the leaky bucket or else buered in the regulator version of the leaky bucket. If there are tokens available then there can be no cells waiting in the buer and if there are cells waiting in the buer then there are no tokens available. If we denote the buer size to be B then the state of the system can be described by two variables, the number of tokens available and the number of cells waiting. Therefore the possible states of the system are either tokens available (M 0) (M ; 1 0) (1 0) or no tokens available (0 0) (0 1) (0 2) (0 B) where the rst entry tells the number of tokens available and the second entry tells the number of cells waiting as is shown in Fig. 2. M,0 M 1,0... 2,0 1,0 1 > M tokens available 0,0 0,1... 0,2 0,B 0 > B cells waiting Figure 2: Possible States Of The Leaky Bucket There have been a number of methods proposed to model this algorithm 1 3;5 7;10 12;17.However all require complex models and intensive eort. The reason for this is that there is a mix of deterministic and stochastic processes occurring in the model. This would not be suitable for the simulation of a whole network or indeed for two algorithms in tandem. What is needed is a simplied model of the algorithm that captures the basic operation of it while allowing easy analysis. This is achieved in this paper by making the processes stochastic in one model and in 19/2
3 the other neglecting the detail of the real system. What is analysed in this paper is the operation of the leaky bucket as the regulator as this is the more general case. The UPC version of the leaky bucket is the same as the regulator except that there is no buer space. This paper is organised as follows. In the next section, Section 2, the rst model, the cell level model, is presented along with the assumptions that were used to make the analysis easy. Then in Section 3 the second model, the token level model is presented along with it's assumptions and drawbacks, and is also solved. There is then a comparison made between the two models and the real system in Section 4. This is done by running some simulations and analysing the results. Finally in Section 5 the conclusions are drawn and the areas for future work is examined. 2 Cell Level Model In this rst model, the cell model, the time unit that is taken is the cell time. This means that the system is examined every cell time, or T seconds, and in that time interval the following are possible : 0 cell arrives { 0 token arrives : ) remain in same state 0 cell arrives { 1 token arrives : ) move down a state 1 cell arrives { 0 token arrives : ) move up a state 1 cell arrives { 1 token arrives : ) remain in same state To make the analysis tractable we make the assumption that the token arrival is random, even though the tokens are generates deterministically every D seconds. If this assumption is allowed the system models as an M/M/1 system for Poisson arrivals and can be solved easily. The cell level model of this system would then be as shown in Fig. 3. lambda M,0 M 1,0 0,0 0,1 0,B mu Figure 3: Cell Level Model Of Leaky Bucket The cells arrive in a Poisson fashion with average arrival rate and the probability of the token arrival is then calculated so that the same number of tokens are generated in both the real system and the cell model. Therefore the service rate is 1=D. Using the normal notation of = = the probability of being in any state n is given by : p n = n (1 ; ) 1 ; M+B+1 = D n =0 1 2 M + B Being in state n means that the system is either in state (M ; n 0) if n<m or else in state (0 n; M) ifn>m. It is then possible to nd the probability of loss, which is denoted by P L : P L = (D)M+B (1 ; D) 1 ; (D) M+B+1 or P L = 1 M + B +1 if D =1 19/3
4 3 Token Level Model In this model the system is only examined every time that a token is generated. Therefore we are only interested in what happens every D seconds. There will be a token generated every D seconds so if there are no cell arrivals then the state of the system goes down one place. There can be a number of cells generated in this D seconds and if so then the state of the system increases by the number of cells generated less one. The state transition diagram would then be as is shown in Fig. 4. M,0 M 1,0... 0,0 0,1... 0,B Figure 4: Token Level Model Of Leaky Bucket The average number of cells that will arrive in this D seconds is given by D and has a Poisson distribution for Poisson arrivals. This model does not capture the detail of the real system but does generate the token in the correct fashion. Denote the probability ofi cell arrivals in D seconds by a i and then we have : ;D (D)i a i = e i! The steady state equation for the system is then : p n = p 0 a n + nx j=0 p j+1 a n;j 0 n M + B There may be restrictions on the number of arrivals that are possible in D seconds in which case there would not be Poisson arrivals. It is P possible to solve this by P dening the probability generating function (PGF) of p n as G(z) = 1 1=0 p i z i and A(z) = 1 1=0 a i z i. Using these PGF's and the steady state equation it is possible to get : G(z) = (1 ; ) (z ; 1) ze (1;z) ; 1 This corresponds to the PGF for the steady state queue of the M/D/1 system. MacLaurin series to expand this gives the steady state probabilities 18 as : Using the p 0 = (1 ; ) p 1 = (1 ; ) (e ; 1) p n = (1 ; ) nx j=1 (j) (;1) n;j e j n;j (n ; j)! + (j)n;j;1 (n ; j ; 1)! 4 Simulations & Results Having solved the two models mathematically, the next step was to simulate these models and compare them with the real system. Thus the following three systems were simulated on a 19/4
5 software package called SES/workbench. SES/workbench is an integrated collection of software tools for specifying and evaluating system designs by using discrete event simulation methods. It consists primarily of the following components: SES/design { a graphical editor module for specifying a system design SES/sim { a translation and simulation module for converting the design specications into an executable model SES/scope { an animated simulator that provides the ability to observe and debug an executing simulation model The three models were designed and saved within the same module in SES/design so that each time a simulation was run, results were obtained for each of the three models. Each ofthe simulations models about 12.5 seconds of real time, which is about one million cell times and took approximately 30 minutes to execute. The token model is shown in Fig. 5 as an example. SES/design 2.1 Module: real Index What How Submodel: token_model infor3 token_source token_full l_bucket token_sink tokens cell_source infor4 cell_block cell_sink cell_lost Figure 5: Simulation Of Token Model The problem that was modelled was a 34 Mb/s ATM Link with a single source at a mean rate of 2 Mb/s. The source was modelled by giving a probability of an arrival independently to each cell time, which models the Poisson process. Thirteen simulations were carried out and results were obtained for parameter changes in the capacity of the leaky bucket, the buer size and the ratio which the token generation rate exceeds the mean rate of the source. There were three dierent sets of simulations done. The rst ve simulations held the buer size constant and varied the other two parameters. Then for the next ve simulations the buer size was changed and the same parameters as before were used again. The way in which the parameters were changed was that a near linear decreasing relationship was assumed between the capacity of the leaky bucket and the ratio in which the token generation rate exceeds the mean rate. For example when the capacity of the leaky bucket increased the ratio decreased and vice versa. The last three simulations held the last two parameters constant and varied the buer capacity. The 19/5
6 parameters that were used for all the simulations are shown in Table 1. As a rst approximation the loss was examined for each of the models. The information regarding the queue length was also collected, but is not analysed here. The simulation results for the cell loss are also shown in Table 1. Table 1: Parameters Used For The Simulations Simulation Maximum Ratio Capacity of the Loss Number Buer Size Leaky Bucket Real Cell Token These results are plotted in Fig. 6 so that the dierences between the three models can be seen. cell loss real cell token Simulation Number Figure 6: Results It can bee seen that the simulation results correspond well to the mathematical models that were calculated before. The token model is close to the real system over all the ranges. It can be used as an upper bound on the loss except in the cases where the cell losses are high. The 19/6
7 cell model does act for an upper bound in these simulations and can be used as that. However in most cases it is over estimating the loss considerably. 5 Conclusions Two models have been proposed to model the leaky bucket in a simpler fashion to it's exact operation. This was done in order to allow either analytical or computer simulation of ATM networks which mighthave anumber of these leaky buckets at the edges and within the network. The models are easier to analyse and model than the exact leaky bucket, however, how good an estimate they are, is still uncertain. So far the token model seems more promising as it give results that are close to the real leaky bucket. However it cannot be used as a bound as it seems to produce more loss in some cases than the real leaky bucket and less in others. The cell model although more inaccurate than the token seems to produce an upper bound on the loss. The queue distribution has yet to be investigated along with more detailed mathematical analysis and computer simulations. This might be able to identify which model, if either, could be used to simplify the modelling. Acknowledgements The second and fourth authors acknowledge the support of a Pacic Bell grant. The rst and third authors acknowledge Prof. Charles McCorkell, Dublin City University, for his continuing encouragement and support of this work. References 1. Anantharam, V and Konstantopoulos, T: \Optimality and Interchangeability of Leaky Buckets in Tandem", April ATM Forum: \ATM User{Network Interface Specication", Prentice Hall, Bazanowski, Z and Killat, U: \The Superposition of Cell Streams with Geometrically Distributed Interarrivals in an ATM Multiplexer", IEEE trans. on Comms., Vol. 43, No.2/3/4, February / March / April Berger, A W: \Performance Analysis of a Rate-Controlled Throttle where Tokens and Jobs Queue", IEEE Journal on selected areas in communications, Vol 9, No. 2, February Butto, M, Cavallero, E and Tonietti, A: \Eectiveness of the "Leaky Bucket" Policing Mechanism in ATM networks", IEEE Journal on selected areas in communications, Vol 9, No. 3, April 1991, pp Cruz, R L: \A Calculus for Network Delay, Part I: Network Elements in Isolation", IEEE Trans. on Information Theory, Vol. 37, No. 1, pp 114{131, Jan Dittmann, L, Jacobsen, S B and Moth, K: \Flow Enforcement Algorithms for ATM networks", IEEE Journal on selected areas in communications, Vol 9, No. 3, April 1991, pp /7
8 8. Eckberg, A E: \The Single server Queue with Periodic Arrival Process and Deterministic Service Times", IEEE trans. on Comms., Vol 27, No.3, March 1979, pp Erimli, B, Murphy J and Murphy, J:\On Worst Case Trac in ATM Networks", Twelfth UK IEE Teletrac Symp., Windsor, UK, March Gallassi, G, Rigolio, G and Verri, L: \Resource Management and Dimensioning in ATM Networks, IEEE Network Magazine, May Hong, D and Suda, T: \Congestion Control and Prevention in ATM Networks", IEEE Network Magazine, July Murata, M, Oie, Y, Suda, T and Miyhara, H: \Analysis of a Discrete{Time Single{Server Queue with Bursty Inputs for Trac Control in ATM Networks", IEEE journal on selected areas in communications, Vol. 8, No. 3, April Ohba, Y, Murata M and Miyahara, H: \Analysis of Interdeparture Processes for Bursty Trac in ATM Networks", IEEE Journal on selected areas in communications, vol. 9, No. 3, April 1991, pp Rathgeb, E P: \Modelling and Performance Comparison of Policing Mechanisms for ATM networks", IEEE Journal on selected areas in communications, Vol 9, No. 3, April Roberts, J W and Virtamo, J T: \The Superposition of Periodic Cell Arrival Streams in an ATM Multiplexer", IEEE trans. on Comms., Vol 39, No.2, February 1991, pp Sidi, M, Liu, W, Cidon, I and Gopal, I: \Congestion Control Through Input Rate Regulation", IEEE, Globecom ' Stallings, W: \Opening the Floodgates (Preventing congestion on ATM networks)", LAN magazine, May Yu, Z: \The Analysis of the Leaky Bucket and the Statistical Multiplexor", Caltech technical report, 13th September /8
Traffic Descriptors for the Configuration of Leaky Bucket Policing Mechanisms with General Two-State Orr/Off Arrival Processes
Traffic Descriptors for the Configuration of Leaky Bucket Policing Mechanisms with General Two-State Orr/Off Arrival Processes D. s. Holtsinger H. G. Perras /Center for Communications and Signal Processing
More informationSUPPORT FOR applications requiring quality-of-service
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 6, NO. 6, DECEMBER 1998 811 Real-Time Estimation and Dynamic Renegotiation of UPC Parameters for Arbitrary Traffic Sources in ATM Networks Brian L. Mark, Member,
More informationOPERATING SYSTEMS. Systems and Models. CS 3502 Spring Chapter 03
OPERATING SYSTEMS CS 3502 Spring 2018 Systems and Models Chapter 03 Systems and Models A system is the part of the real world under study. It is composed of a set of entities interacting among themselves
More information2 in a competitive environment providers will need to price services in a manner that takes some account of network resource usage [14,2]. There are m
Preprint 0 (2000) 1{22 1 Telecommunication Systems, 15(3-4):323-343, 2000 A study of simple usage-based charging schemes for broadband networks Costas Courcoubetis a;b, Frank P. Kelly c, Vasilios A. Siris
More informationA new threshold-based traffic characterization and policing mechanism for communication networks
A new threshold-based traffic characterization and policing mechanism for communication networks S. Durinovic-Johri P. K. Johri AT&T Labs 200 Laurel Avenue, Middletown, NJ 07748, U.S.A. email: johri@ att.
More informationCOMPUTATIONAL ANALYSIS OF A MULTI-SERVER BULK ARRIVAL WITH TWO MODES SERVER BREAKDOWN
Mathematical and Computational Applications, Vol. 1, No. 2, pp. 249-259, 25. Association for cientific Research COMPUTATIONAL ANALYI OF A MULTI-ERVER BULK ARRIVAL ITH TO MODE ERVER BREAKDON A. M. ultan,
More informationINTRODUCTION AND CLASSIFICATION OF QUEUES 16.1 Introduction
INTRODUCTION AND CLASSIFICATION OF QUEUES 16.1 Introduction The study of waiting lines, called queuing theory is one of the oldest and most widely used Operations Research techniques. Waiting lines are
More information6A.2.1 ABSTRACT DIMENSIONING CRITERIA FOR POLICING FUNCTIONS IN ATM NETWORKS. P. Castelli (*), A. Forcina (+), A. Tonietti (*)
DIENSIONING CRITERIA FOR POLICING FUNCTIONS IN AT NETWORKS P. Castelli (*), A. Forcina (+), A. Tonietti (*) (*) Cselt, Via G. Reiss Romoli 274, 10148 Turin, Italy (+) Sip Headquarters, Via della Vignaccia
More informationEfficiency of Dynamic Pricing in Priority-based Contents Delivery Networks
Efficiency of Dynamic Pricing in Priority-based Contents Delivery Networks Noriyuki YAGI, Eiji TAKAHASHI, Kyoko YAMORI, and Yoshiaki TANAKA, Global Information and Telecommunication Institute, Waseda Unviersity
More informationstudies and reality Technical Report 243, ICS-FORTH, January 1999 Abstract
Usage-based charging using eective bandwidths: studies and reality Vasilios A. Siris 1, David J. Songhurst 2, George D. Stamoulis 1;4, Mechthild Stoer 3 Technical Report 243, ICS-FORTH, January 1999 Abstract
More informationIntroduction - Simulation. Simulation of industrial processes and logistical systems - MION40
Introduction - Simulation Simulation of industrial processes and logistical systems - MION40 1 What is a model? A model is an external and explicit representation of part of reality as seen by the people
More informationUsing Multi-chromosomes to Solve. Hans J. Pierrot and Robert Hinterding. Victoria University of Technology
Using Multi-chromosomes to Solve a Simple Mixed Integer Problem Hans J. Pierrot and Robert Hinterding Department of Computer and Mathematical Sciences Victoria University of Technology PO Box 14428 MCMC
More informationBusiness Quantitative Analysis [QU1] Examination Blueprint
Business Quantitative Analysis [QU1] Examination Blueprint 2014-2015 Purpose The Business Quantitative Analysis [QU1] examination has been constructed using an examination blueprint. The blueprint, also
More informationPERFORMANCE EVALUATION OF DEPENDENT TWO-STAGE SERVICES
PERFORMANCE EVALUATION OF DEPENDENT TWO-STAGE SERVICES Werner Sandmann Department of Information Systems and Applied Computer Science University of Bamberg Feldkirchenstr. 21 D-96045, Bamberg, Germany
More informationA Modeling Tool to Minimize the Expected Waiting Time of Call Center s Customers with Optimized Utilization of Resources
A Modeling Tool to Minimize the Expected Waiting Time of Call Center s Customers with Optimized Utilization of Resources Mohsin Iftikhar Computer Science Department College of Computer and Information
More informationA Simple EOQ-like Solution to an Inventory System with Compound Poisson and Deterministic Demand
A Simple EOQ-like Solution to an Inventory System with Compound Poisson and Deterministic Demand Katy S. Azoury San Francisco State University, San Francisco, California, USA Julia Miyaoka* San Francisco
More informationA Queuing Approach for Energy Supply in Manufacturing Facilities
A Queuing Approach for Energy Supply in Manufacturing Facilities Lucio Zavanella, Ivan Ferretti, Simone Zanoni, and Laura Bettoni Department of Mechanical and Industrial Engineering Università degli Studi
More informationTraffic Shaping (Part 2)
Lab 2b Traffic Shaping (Part 2) Purpose of this lab: This lab uses the leaky bucket implementation (from Lab 2a) for experiments with traffic shaping. The traffic for testing the leaky bucket will be the
More informationCOMP9334 Capacity Planning for Computer Systems and Networks
COMP9334 Capacity Planning for Computer Systems and Networks Week 7: Discrete event simulation (1) COMP9334 1 Week 3: Queues with Poisson arrivals Single-server M/M/1 Arrivals Departures Exponential inter-arrivals
More informationA DISCRETE-EVENT SIMULATION MODEL FOR A CONTINUOUS REVIEW PERISHABLE INVENTORY SYSTEM
A DISCRETE-EVENT SIMULATION MODEL FOR A CONTINUOUS REVIEW PERISHABLE INVENTORY SYSTEM Mohamed E. Seliaman Shaikh Arifusalam Department of Systems Engineering King Fahd Univeristy of Petroleum and Minerals
More informationEffective Business Management in Uncertain Business Environment Using Stochastic Queuing System with Encouraged Arrivals and Impatient Customers
Proceedings of International Conference on Strategies in Volatile and Uncertain Environment for Emerging Markets July 14-15, 2017 Indian Institute of Technology Delhi, New Delhi pp.479-488 Effective Business
More informationANALYSING QUEUES USING CUMULATIVE GRAPHS
AALYSIG QUEUES USIG CUMULATIVE GRAPHS G A Vignaux March 9, 1999 Abstract Queueing theory is the theory of congested systems. Usually it only handles steady state stochastic problems. In contrast, here
More informationPath Optimization for Inter-Switch Handoff in Wireless ATM Networks
Path Optimization for Inter-Switch Handoff in Wireless ATM Networks W. S. Vincent Wong, Henry C. B. Chan, and Victor C. M. Leung Department of Electrical and Computer Engineering University of British
More informationstatus of processors. A Job Scheduler dispatches a job to the requested number of processors using a certain scheduling algorithm
Eect of Job Size Characteristics on Job Scheduling Performance Kento Aida Department of Computational Intelligence and Systems Science, Tokyo Institute of Technology 4259, Nagatsuta, Midori-ku, Yokohama-shi
More informationResults of the Enterprise Project. Jussi Stader AIAI-TR-209. September 1996
Results of the Enterprise Project Jussi Stader AIAI-TR-209 September 1996 This paper appears in the proceedings of Expert Systems '96, the 16th Annual Conference of the British Computer Society Specialist
More informationAdministration & Monitoring Other Workflow Engines Application Agent Process Definition Tool Workflow Engine Workflow Database Invoked Application Fig
Predictive Workow Management Euthimios Panagos and Michael Rabinovich AT&T Labs - Research 180 Park Avenue Florham Park, NJ 07932 fthimios, mishag@research.att.com Abstract In this paper, we propose a
More informationALLOCATING SHARED RESOURCES OPTIMALLY FOR CALL CENTER OPERATIONS AND KNOWLEDGE MANAGEMENT ACTIVITIES
ALLOCATING SHARED RESOURCES OPTIMALLY FOR CALL CENTER OPERATIONS AND KNOWLEDGE MANAGEMENT ACTIVITIES Research-in-Progress Abhijeet Ghoshal Alok Gupta University of Minnesota University of Minnesota 321,
More informationQueuing Theory 1.1 Introduction
Queuing Theory 1.1 Introduction A common situation occurring in everyday life is that of queuing or waiting in a line. Queues (waiting lines) are usually seen at bus stop, ticket booths, doctor s clinics,
More informationOPERATIONS RESEARCH Code: MB0048. Section-A
Time: 2 hours OPERATIONS RESEARCH Code: MB0048 Max.Marks:140 Section-A Answer the following 1. Which of the following is an example of a mathematical model? a. Iconic model b. Replacement model c. Analogue
More informationQUEUEING, PERFORMANCE AND CONTROL IN ATM
QUEUEING, PERFORMANCE AND CONTROL IN ATM ITC-13 Workshops Proceedings of the Thirteenth International Teletraffic Congress Copenhagen, Denmarkjune 19-26,1991 Edited by J.W.COHEN Emeritus Professor Mathematical
More informationQueueing Theory and Waiting Lines
Queueing Theory and Waiting Lines Most waiting line problems are trying to find the best service Large staff => Good Service Small staff => Poor Service What is Best It depends on the organization! Most
More informationSTATISTICAL TECHNIQUES. Data Analysis and Modelling
STATISTICAL TECHNIQUES Data Analysis and Modelling DATA ANALYSIS & MODELLING Data collection and presentation Many of us probably some of the methods involved in collecting raw data. Once the data has
More informationQueuing Theory: A Case Study to Improve the Quality Services of a Restaurant
Queuing Theory: A Case Study to Improve the Quality Services of a Restaurant Lakhan Patidar 1*, Trilok Singh Bisoniya 2, Aditya Abhishek 3, Pulak Kamar Ray 4 Department of Mechanical Engineering, SIRT-E,
More informationOPERATIONS RESEARCH. Inventory Theory
OPERATIONS RESEARCH Chapter 5 Inventory Theory Prof. Bibhas C. Giri Department of Mathematics Jadavpur University Kolkata, India Email: bcgiri.jumath@gmail.com MODULE - 1: Economic Order Quantity and EOQ
More informationOperations and Supply Chain Management Prof. G. Srinivisan Department of Management Studies Indian Institute of Technology, Madras
Operations and Supply Chain Management Prof. G. Srinivisan Department of Management Studies Indian Institute of Technology, Madras Module No - 1 Lecture No - 22 Integrated Model, ROL for Normal Distribution
More informationAn Adaptive Pricing Scheme for Content Delivery Systems
An Adaptive Pricing Scheme for Content Delivery Systems Srinivasan Jagannathan & Kevin C. Almeroth Department of Computer Science University of California Santa Barbara, CA 936-5 fjsrini,almerothg@cs.ucsb.edu
More informationPrinciples of Inventory Management
John A. Muckstadt Amar Sapra Principles of Inventory Management When You Are Down to Four, Order More fya Springer Inventories Are Everywhere 1 1.1 The Roles of Inventory 2 1.2 Fundamental Questions 5
More informationControl rules for dispatching trains on general networks with multiple train speeds
Control rules for dispatching trains on general networks with multiple train speeds SHI MU and MAGED DESSOUKY* Daniel J. Epstein Department of Industrial and Systems Engineering University of Southern
More informationChapter III TRANSPORTATION SYSTEM. Tewodros N.
Chapter III TRANSPORTATION SYSTEM ANALYSIS www.tnigatu.wordpress.com tedynihe@gmail.com Lecture Overview Traffic engineering studies Spot speed studies Volume studies Travel time and delay studies Parking
More informationThe Production Possibilities Frontier and Social Choices *
OpenStax-CNX module: m48607 1 The Production Possibilities Frontier and Social Choices * OpenStax This work is produced by OpenStax-CNX and licensed under the Creative Commons Attribution License 4.0 By
More informationSimulating Queuing Models in SAS
ABSTRACT Simulating Queuing Models in SAS Danny Rithy, California Polytechnic State University, San Luis Obispo, CA This paper introduces users to how to simulate queuing models using SAS. SAS will simulate
More informationMidterm for CpE/EE/PEP 345 Modeling and Simulation Stevens Institute of Technology Fall 2003
Midterm for CpE/EE/PEP 345 Modeling and Simulation Stevens Institute of Technology Fall 003 The midterm is open book/open notes. Total value is 100 points (30% of course grade). All questions are equally
More informationSimulation Using. ProModel. Dr. Charles Harrell. Professor, Brigham Young University, Provo, Utah. Dr. Biman K. Ghosh, Project Leader
T H R D E D T 0 N Simulation Using ProModel Dr. Charles Harrell Professor, Brigham Young University, Provo, Utah Director, PROMODEL Corporation, Oram, Utah Dr. Biman K. Ghosh, Project Leader Professor,
More informationQueue Mining: Service Perspectives in Process Mining (Extended Abstract)
Queue Mining: Service Perspectives in Process Mining (Extended Abstract) Arik Senderovich 1 Introduction Modern business processes are supported by information systems that record processrelated events
More informationTimeNet - Examples of Extended Deterministic and Stochastic Petri Nets
TimeNet - Examples of Extended Deterministic and Stochastic Petri Nets Christoph Hellfritsch February 2, 2009 Abstract TimeNet is a toolkit for the performability evaluation of Petri nets. Performability
More informationA PETRI NET MODEL FOR SIMULATION OF CONTAINER TERMINALS OPERATIONS
Advanced OR and AI Methods in Transportation A PETRI NET MODEL FOR SIMULATION OF CONTAINER TERMINALS OPERATIONS Guido MAIONE 1, Michele OTTOMANELLI 1 Abstract. In this paper a model to simulate the operation
More informationJustifying Simulation. Why use simulation? Accurate Depiction of Reality. Insightful system evaluations
Why use simulation? Accurate Depiction of Reality Anyone can perform a simple analysis manually. However, as the complexity of the analysis increases, so does the need to employ computer-based tools. While
More informationDepartment of Management Studies, Indian Institute of Science
Modeling Urban Traffic Planning through Strategic Decisions A case from Bangalore, India S Srinidhi ------------------------------ srinidhi@mgmt.iisc.ernet.in N R Srinivasa Raghavan ---------- raghavan@mgmt.iisc.ernet.in
More informationwharehouse = AGV storage area workstation = unloading = loading
CORE DISCUSSION PAPER 2001/37 DESIGN AND PERFORMANCE ANALYSIS OF A HEAVILY LOADED MATERIAL HANDLING SYSTEM Philippe CHEVALIER 1,Yves POCHET 2 and Laurence TALBOT 3 September 2001 Abstract We consider the
More informationA Lazy Scheduling Scheme
A Lazy Scheduling Scheme for Improving Hypercube Performance Prasant Mohapatra, Chansu Yu, Chita R. Das Dept. of Electrical and Computer Engineering The Pennsylvania State University University Park, PA
More informationVARIABILITY PROFESSOR DAVID GILLEN (UNIVERSITY OF BRITISH COLUMBIA) & PROFESSOR BENNY MANTIN (UNIVERSITY OF WATERLOO)
VARIABILITY PROFESSOR DAVID GILLEN (UNIVERSITY OF BRITISH COLUMBIA) & PROFESSOR BENNY MANTIN (UNIVERSITY OF WATERLOO) Istanbul Technical University Air Transportation Management M.Sc. Program Logistic
More informationPERFORMANCE MODELING OF AUTOMATED MANUFACTURING SYSTEMS
PERFORMANCE MODELING OF AUTOMATED MANUFACTURING SYSTEMS N. VISWANADHAM Department of Computer Science and Automation Indian Institute of Science Y NARAHARI Department of Computer Science and Automation
More information1. For s, a, initialize Q ( s,
Proceedings of the 2006 Winter Simulation Conference L. F. Perrone, F. P. Wieland, J. Liu, B. G. Lawson, D. M. Nicol, and R. M. Fujimoto, eds. A REINFORCEMENT LEARNING ALGORITHM TO MINIMIZE THE MEAN TARDINESS
More informationA Systematic Approach to Performance Evaluation
A Systematic Approach to Performance evaluation is the process of determining how well an existing or future computer system meets a set of alternative performance objectives. Arbitrarily selecting performance
More informationMotivating Examples of the Power of Analytical Modeling
Chapter 1 Motivating Examples of the Power of Analytical Modeling 1.1 What is Queueing Theory? Queueing theory is the theory behind what happens when you have lots of jobs, scarce resources, and subsequently
More informationSimulation Software. Chapter 3. Based on the slides provided with the textbook. Jiang Li, Ph.D. Department of Computer Science
Simulation Software Chapter 3 Based on the slides provided with the textbook 3.1 Introduction Many features common to most simulation programs Special-purpose simulation packages incorporate these common
More informationLot Sizing for Individual Items with Time-varying Demand
Chapter 6 Lot Sizing for Individual Items with Time-varying Demand 6.1 The Complexity of Time-Varying Demand In the basic inventory models, deterministic and level demand rates are assumed. Here we allow
More informationOperator Scheduling Using Queuing Theory and Mathematical Programming Models
STOCHASTIC MODELS OF MANUFACTURING AND SERVICE OPERATIONS SMMSO 2009 Operator Scheduling Using Queuing Theory and Mathematical Programming Models Hesham K. Alfares Systems Engineering Department King Fahd
More informationOptimal Design Methodology for an AGV Transportation System by Using the Queuing Network Theory
Optimal Design Methodology for an AGV Transportation System by Using the Queuing Network Theory Satoshi Hoshino 1, Jun Ota 1, Akiko Shinozaki 2, and Hideki Hashimoto 2 1 Dept. of Precision Engineering,
More informationResults of the Enterprise Project. Jussi Stader. This paper appears in the proceedings of Expert Systems '96, the 16th Annual Conference
Results of the Enterprise Project Jussi Stader AIAI-TR-209 September 1996 This paper appears in the proceedings of Expert Systems '96, the 16th Annual Conference of the British Computer Society Specialist
More informationWord Count: 3792 words + 4 figure(s) + 4 table(s) = 5792 words
THE INTERPLAY BETWEEN FLEET SIZE, LEVEL-OF-SERVICE AND EMPTY VEHICLE REPOSITIONING STRATEGIES IN LARGE-SCALE, SHARED-RIDE AUTONOMOUS TAXI MOBILITY-ON-DEMAND SCENARIOS Shirley Zhu Department of Operations
More informationFacilitating a well-founded approach to autonomic systems
Fifth IEEE Workshop on Engineering of Autonomic and Autonomous Systems Facilitating a well-founded approach to autonomic systems Simon Dobson Systems Research Group School of Computer Science and Informatics
More informationQueueing and Service Patterns in a University Teaching Hospital F.O. Ogunfiditimi and E.S. Oguntade
Available online at http://ajol.info/index.php/njbas/index Nigerian Journal of Basic and Applied Science (2010), 18(2): 198-203 ISSN 0794-5698 Queueing and Service Patterns in a University Teaching Hospital
More informationNumerical investigation of tradeoffs in production-inventory control policies with advance demand information
Numerical investigation of tradeoffs in production-inventory control policies with advance demand information George Liberopoulos and telios oukoumialos University of Thessaly, Department of Mechanical
More informationHamdy A. Taha, OPERATIONS RESEARCH, AN INTRODUCTION, 5 th edition, Maxwell Macmillan International, 1992
Reference books: Anderson, Sweeney, and Williams, AN INTRODUCTION TO MANAGEMENT SCIENCE, QUANTITATIVE APPROACHES TO DECISION MAKING, 7 th edition, West Publishing Company,1994 Hamdy A. Taha, OPERATIONS
More informationChapter 14. Waiting Lines and Queuing Theory Models
Chapter 4 Waiting Lines and Queuing Theory Models To accompany Quantitative Analysis for Management, Tenth Edition, by Render, Stair, and Hanna Power Point slides created by Jeff Heyl 2008 Prentice-Hall,
More informationMasters in Business Statistics (MBS) /2015. Department of Mathematics Faculty of Engineering University of Moratuwa Moratuwa. Web:
Masters in Business Statistics (MBS) - 2014/2015 Department of Mathematics Faculty of Engineering University of Moratuwa Moratuwa Web: www.mrt.ac.lk Course Coordinator: Prof. T S G Peiris Prof. in Applied
More informationUniversity of Groningen. Effective monitoring and control with intelligent products Meyer, Gerben Gerald
University of Groningen Effective monitoring and control with intelligent products Meyer, Gerben Gerald IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF) if you wish
More informationIntroduction to Operating Systems Prof. Chester Rebeiro Department of Computer Science and Engineering Indian Institute of Technology, Madras
Introduction to Operating Systems Prof. Chester Rebeiro Department of Computer Science and Engineering Indian Institute of Technology, Madras Week 05 Lecture 19 Priority Based Scheduling Algorithms So
More informationUniversity of Groningen. Investment evaluation with respect to commercial uncertainty Broens, Douwe Frits
University of Groningen Investment evaluation with respect to commercial uncertainty Broens, Douwe Frits IMPORTANT NOTE: You are advised to consult the publisher's version (publisher's PDF) if you wish
More informationing and analysis of evolving systems. 1 Regression testing, which attempts to validate modied software and ensure that no new errors are introduced in
Architecture-Based Regression Testing of Evolving Systems Mary Jean Harrold Computer and Information Science The Ohio State University 395 Dreese Lab, 2015 Neil Avenue Columbus, OH 43210-1227 USA +1 614
More informationModeling of competition in revenue management Petr Fiala 1
Modeling of competition in revenue management Petr Fiala 1 Abstract. Revenue management (RM) is the art and science of predicting consumer behavior and optimizing price and product availability to maximize
More informationLecture 45. Waiting Lines. Learning Objectives
Lecture 45 Waiting Lines Learning Objectives After completing the lecture, we should be able to explain the formation of waiting lines in unloaded systems, identify the goal of queuing ( waiting line)
More informationChapter 13. Waiting Lines and Queuing Theory Models
Chapter 13 Waiting Lines and Queuing Theory Models To accompany Quantitative Analysis for Management, Eleventh Edition, by Render, Stair, and Hanna Power Point slides created by Brian Peterson Learning
More informationUse of Monte Carlo Simulation for Analyzing Queues in a Financial Institution
International Journal on Future Revolution in Computer Science & Communication Engineering ISSN: 2454-4248 Use of Monte Carlo Simulation for Analyzing Queues in a Financial Institution A Case Study In
More informationApplication of Queuing Theory for Locating Service Centers by Considering Provides Several Service in That
Cumhuriyet Üniversitesi Fen Fakültesi Fen Bilimleri Dergisi (CFD), Cilt:36, No: 4 Özel Sayı (215) ISSN: 13-1949 Cumhuriyet University Faculty of Science Science Journal (CSJ), Vol. 36, No: 4 Special Issue
More informationComputable General Equlibrium
Intro February 13, 2010 Plan of action What is CGE? Modelling rules: models data calibration Introduction to GAMS and its syntax. Simple pure exchange model and modelling convention. Computable general
More informationIntroduction to Analytics Tools Data Models Problem solving with analytics
Introduction to Analytics Tools Data Models Problem solving with analytics Analytics is the use of: data, information technology, statistical analysis, quantitative methods, and mathematical or computer-based
More informationTextbook: pp Chapter 12: Waiting Lines and Queuing Theory Models
1 Textbook: pp. 445-478 Chapter 12: Waiting Lines and Queuing Theory Models 2 Learning Objectives (1 of 2) After completing this chapter, students will be able to: Describe the trade-off curves for cost-of-waiting
More informationModel, analysis and application of employee assignment for quick service restaurant
Model, analysis and application of employee assignment for quic service restaurant Chun-Hsiung Lan Graduate Institute of Management Sciences Nanhua University Dalin, Chiayi Taiwan 622 R.O.C. Kuo-Torng
More informationMathematical Modeling and Analysis of Finite Queueing System with Unreliable Single Server
IOSR Journal of Mathematics (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 12, Issue 3 Ver. VII (May. - Jun. 2016), PP 08-14 www.iosrjournals.org Mathematical Modeling and Analysis of Finite Queueing
More informationOPTIMIZATION OF THE WELDING IN THE ERECTION SCHEDULING OF A SUEZMAX TANKER SHIP
OPTIMIZATION OF THE WELDING IN THE ERECTION SCHEDULING OF A SUEZMAX TANKER SHIP H A Tokola, Aalto University School of Engineering, Finland L F Assis, Federal University of Rio de Janeiro, Brazil R M Freire,
More informationApplication of Mb/M/1 Bulk Arrival Queueing System to Evaluate Key-In System in Islamic University of Indonesia
ISBN 978-81-933894-1-6 5th International Conference on Future Computational Technologies (ICFCT'217) Kyoto (Japan) April 18-19, 217 Application of Mb/M/1 Bulk Arrival Queueing System to Evaluate Key-In
More informationContents PREFACE 1 INTRODUCTION The Role of Scheduling The Scheduling Function in an Enterprise Outline of the Book 6
Integre Technical Publishing Co., Inc. Pinedo July 9, 2001 4:31 p.m. front page v PREFACE xi 1 INTRODUCTION 1 1.1 The Role of Scheduling 1 1.2 The Scheduling Function in an Enterprise 4 1.3 Outline of
More informationInternational Journal for Management Science And Technology (IJMST)
Volume 3; Issue 2 Manuscript- 3 ISSN: 2320-8848 (Online) ISSN: 2321-0362 (Print) International Journal for Management Science And Technology (IJMST) VALIDATION OF A MATHEMATICAL MODEL IN A TWO ECHELON
More informationCAF E: A Complex Adaptive Financial Environment. November 21, Abstract
CAF E: A Complex Adaptive Financial Environment Ron Even Courant Institute of Mathematical Sciences 251 Mercer St. New York, NY 10012 Bud Mishra Courant Institute of Mathematical Sciences 251 Mercer St.
More informationA Robust Optimization Model for Lot Sizing with Dynamic Demands
A Robust Optimization Model for Lot Sizing with Dynamic Demands Aurora Rostenila Department of Industrial Engineering Universitas Katolik Parahyangan (UNPAR), Bandung, Indonesia Tel: (+62) 203-2655, Email:
More informationGlobal Journal of Advance Engineering Technology and Sciences
Global Journal of Advanced Engineering Technologies and Sciences AN IMPROVED MODEL FOR ATM IN A WIRELESS COMMUNICATION NETWORK USING QUEUING TECHNIQUE Orji Hope Ekpereamaka *1, Udeh Ikemefuna James 2,
More informationLOAD SHARING IN HETEROGENEOUS DISTRIBUTED SYSTEMS
Proceedings of the 2 Winter Simulation Conference E. Yücesan, C.-H. Chen, J. L. Snowdon, and J. M. Charnes, eds. LOAD SHARING IN HETEROGENEOUS DISTRIBUTED SYSTEMS Helen D. Karatza Department of Informatics
More informationAn Inventory Model with Demand Dependent Replenishment Rate for Damageable Item and Shortage
Proceedings of the 2014 International Conference on Industrial Engineering and Operations Management Bali, Indonesia, January 7 9, 2014 An Inventory Model with Demand Dependent Replenishment Rate for Damageable
More informationMATHEMATICAL PROGRAMMING REPRESENTATIONS FOR STATE-DEPENDENT QUEUES
Proceedings of the 2008 Winter Simulation Conference S J Mason, R R Hill, L Mönch, O Rose, T Jefferson, J W Fowler eds MATHEMATICAL PROGRAMMING REPRESENTATIONS FOR STATE-DEPENDENT QUEUES Wai Kin (Victor)
More informationBottleneck Detection of Manufacturing Systems Using Data Driven Method
Proceedings of the 2007 IEEE International Symposium on Assembly and Manufacturing Ann Arbor, Michigan, USA, July 22-25, 2007 MoB2.1 Bottleneck Detection of Manufacturing Systems Using Data Driven Method
More informationChapter 1 INTRODUCTION TO SIMULATION
Chapter 1 INTRODUCTION TO SIMULATION Many problems addressed by current analysts have such a broad scope or are so complicated that they resist a purely analytical model and solution. One technique for
More informationReliability Prediction of a Trajectory Verification System
Reliability Prediction of a Trajectory Verification System Abstract Bojan Cukic, Diwakar Chakravarthy The Department of Computer Science and Electrical Engineering West Virginia niversity PO Box 69 Morgantown,
More informationLecture 6: Offered Load Analysis. IEOR 4615: Service Engineering Professor Whitt February 10, 2015
Lecture 6: Offered Load Analysis IEOR 4615: Service Engineering Professor Whitt February 10, 2015 What is the Problem? What capacity is needed in a service system? In order to meet uncertain exogenous
More informationIntroduction to Computer Simulation
Introduction to Computer Simulation EGR 260 R. Van Til Industrial & Systems Engineering Dept. Copyright 2013. Robert P. Van Til. All rights reserved. 1 What s It All About? Computer Simulation involves
More information82 R. FISCHER AND L. MIRMAN sectors. It is then easy to make comparisons between the cooperative and the noncooperative solutions. This formulation al
c Journal of Applied Mathematics & Decision Sciences, 1(2), 81{87 (1997) Reprints Available directly from the Editor. Printed in New Zealand. Limit Policies in N-Sector Dynamic Growth Games with Externalities
More informationThe Inuence of Dierent Workload. Descriptions on a Heuristic Load. Balancing Scheme. Thomas Kunz. December 1991
The Inuence of Dierent Workload Descriptions on a Heuristic Load Balancing Scheme Thomas Kunz December 1991? TI-6/91 Institut fur Theoretische Informatik Fachbereich Informatik Technische Hochschule Darmstadt
More informationAdvanced Microeconomics
Introduction to CGE January 2, 2011 Plan of action What is CGE? Modelling rules: models data calibration Introduction to GAMS and its syntax. Simple closed economy model and modelling convention. Computable
More informationOptimizing appointment driven systems via IPA
Optimizing appointment driven systems via IPA with applications to health care systems BMI Paper Aschwin Parmessar VU University Amsterdam Faculty of Sciences De Boelelaan 1081a 1081 HV Amsterdam September
More information