Internet Dial-Up Traffic Modelling
|
|
- Reynold Carter
- 7 years ago
- Views:
Transcription
1 NTS 5, Fifteenth Nordic Teletraffic Seminar Lund, Sweden, August 4, Internet Dial-Up Traffic Modelling Villy B. Iversen Arne J. Glenstrup Jens Rasmussen Abstract This paper deals with analysis and modelling of real Internet dial-up traffic based on extensive data, which are described and analysed. When recording the traffic process the time axis is digitalised and analysis and modelling must take this into account. In particular, this is very important for arrival processes. It is also important to distinguish between fast variations within short time intervals and slow variations during the day. The detailed analysis shows that the arrival process is a Poisson process with slow variations. Keywords: scanning principle, time-dependent Poisson process, mean squared difference Introduction Characteristics of dial-up Internet calls are of great interest when dimensioning the local access network [], [7]. Internet calls have characteristics which are different from ordinary voice calls. The field data used for the study are Internet dial-up calls from Tele Danmark. During one week, Monday 8 Sunday 4, January 999, about.8 million calls have been recorded. Every call is recorded with arrival time, holding time, and other useful information such as identity of modem-pool, ISDN, subscription type, etc. Only about.5 % of the call attempts are rejected for various reasons. About 79 % of all calls are PSTN, and the remaining % are ISDN calls. ISDN calls are always counted as one call independent of the number of channels occupied. The accuracy of the time recordings is one second. Several papers deal with the same subject. The daily traffic profile has the maximum in the evening. In Fig. we show a typical profile for the number of calls. The mean value of the holding times is 5 times bigger the the mean value of voice holding times, and a typical pattern is shown in Fig.. Similar patterns are found by other authors. The distribution of the holding time has a coefficient of variation which is bigger than for voice calls, and the modelling has been studied using hyper-exponential, log-normal and Pareto distributions. vbi@tele.dtu.dk, Dept. of Telecommunication, Technical University of Denmark, DK 8 Denmark. panic@tele.dtu.dk, Dept. of Telecommunication, Technical University of Denmark, DK 8 Denmark. jenr@tdk.dk, Tele Danmark, Sletvej, DK 8 Denmark.
2 4 arrivals Figure : Number of calls per 5 minutes, Tuesday service time (sec) Figure : Mean holding time n seconds for calls arriving during 5 minutes, Tuesday,
3 In this paper we shall focus upon a study of the arrival process. In some papers it is concluded that the arrival process of Internet calls is more bursty than the Poisson process, whereas [7] concludes that within intervals of up to 5 minutes it can be considered as a stationary Poisson process. In larger time intervals we have intensity variations, but still a Poisson process. This corresponds to voice traffic where we have slow variations due to the daily call profile, but where the fast variations are of random (Poissonian) nature. The concept of slow and fast variations was introduced by Palm [8] and studied in detail for voice traffic in [5]. There are two basic ways to study an arrival process. We may keep a time interval fixed and study the number of calls within this interval (number representation), or we may keep a number of calls fixed, and study the time interval to get this number of calls (interval representation). We shall study both approaches in this paper. Interval representation The accuracy of the recordings is one second. That is, the continuous real time is discretized to an integer. This causes additional problems for the interval representation, whereas the number representation fits with this approach. When observing a continuous time process at regular time instants the continuous time intervals are transformed into a discrete time distribution. The important case of the Poisson process is transformed into a discrete time process with correlation between inter-arrival times of duration zero. Thus a model in discrete time based on geometric inter-arrival times (Bernoulli arrival process) is not equivalent to a Poisson process in continuous time. The transformation of traffic processes from continuous time to discrete time has been dealt with in the theory of traffic measurements where we observe the traffic process at regular time intervals. In the Holbæk measurements [5], which were the first computerized measurement, some fundamental aspects were investigated. The discrete time increases the observed burstiness of the traffic process, so it looks heavy-tailed, even if it is Poissonian.. The scanning method We shall only consider regular (constant) scanning intervals. The scanning method is e.g. applied to traffic measurements, call charging, numerical simulations, and processor control. By the scanning method we observe a discrete time distribution for the holding time which in real time usually is continuous. In practice, we usually choose a constant distance h between scanning instants, and we are able to derive a relation between the observed time interval and the real time interval (Fig. ). We notice that there are overlaps between the continuous time intervals, so that the discrete distribution cannot be obtained by a simple integration of the continuous time interval over a fixed interval of length h. If the real holding times have a distribution function F(t), then it can be shown that we will observe the following discrete distribution [5]: p() = h p(k) = h h h F(t)dt () {F(t + kh) F(t +(k )h)}dt, k =,,... ()
4 Observed number of scans Interval for the real time (scan) Figure : By the scanning method a continuous time interval is transformed into a discrete time interval. The transformation is not unique. Interpretation: The arrival time of the call is assumed to be independent of the scanning process. Therefore, the density function of the time interval from the call arrival instant to the first scanning time is uniformly distributed and equal to (/h). The probability of observing zero scanning instants during the call holding time is denoted by p() and is equal to the probability that the call terminates before the next scanning time. For a fixed value of the holding time t this probability is equal to (F(t)/h), and to obtain the total probability we integrate over all possible values t ( t < h) and get (). In a similar way we derive formula () for p(k). For exponential distributed holding time intervals, F(t) = e µt, we will observe a discrete distribution, Westerberg s distribution [5]: p() = ( e µh) () µh p(k) = ( e µh) e (k )µh, k =,,... (4) µh The i th derivative of the probability generating function Z(z) (Z transformed) for the value z = becomes: Z (i) ()= i! ih (e µh ) i (5) from which we find the mean value m and form factor ε (second moment divided by the squared mean value) [6]: m = Z () ()= µh, (6) σ = Z () ()+Z () () Z () (), (7) ( ) σ ε = = µh eµh + e µh. (8) m 4
5 Thus for any distribution function F(t) we will always observe the correct mean value. When using Karlsson charging we will therefore always in the long run charge the correct amount. For a continuous measurement the form factor is. The contribution ε T is thus due to the influence from the measuring principle. In [] the scanning method is generalized to phase-type distributions for both the scanning interval and the inter-arrival time. The form factor is a measure of accuracy of the measurements. Fig. 4 shows how the form factor of the observed holding time for exponentially distributed holding times depends on the length of the scanning interval (8). By continuous measurements we get an ordinary sample. By the scanning method we get a sample of a sample so that there is uncertainty both because of the measuring method and because of the limited sample size. 5 Formfactor "... k = Scan interval [s, ] Figure 4: Form factor for exponentially distributed holding times which are observed by Erlang-k distributed scanning intervals in an unlimited measuring period. The case k = corresponds to regular (constant) scan intervals which transform the exponential distribution into Westerberg s distribution. The case k = corresponds to exponentially distributed scan intervals. The case h = corresponds to a continuous measurement. We notice that by regular scan intervals we loose almost no information if the scan interval is smaller than the mean holding time (chosen as time unit). In Fig. 5 and Fig. 6 we compare for ISDN calls the observed formfactor with the formfactor calculated from Westerberg s distribution using the total number of calls during 5 minutes to calculate the mean arrival rate. We notice the two curves are very similar. The ratio between the two results is shown in Fig. 7. So even though the formfactor is greater than two, we may assume it is a Poisson process within 5 minutes. If we look at high arrival rates and include all calls the observed and calculated formfactors 5
6 .5.5 Palm form factor Figure 5: Observed formfactor of inter-arrival times for ISDN-calls in 5-minutes intervals from observed data, Tuesday Cf. Fig Westerberg form factor Figure 6: Formfactor of inter-arrival times for ISDN-calls calculated from Westerberg s distribution (8) based on the total number of calls observed per 5 minutes, Tuesday Cf. Fig. 5. 6
7 . Palm/Westerberg form factor ratio Figure 7: The ratio between the observed values (Fig. 5) and the theoretical values (Fig. 6). will be identical, because all inter-arrival times will be zero except for 9 inter-arrivals equal to one second due to 9 scans during 5 minutes. An example is shown in Fig. 8. In this case we cannot make any conclusions about the inter-arrival time distribution for the busy periods. Investigation of intervals with fewer calls, e.g. for individual modem pools or during the night, show that Westerberg s distribution is a very good model for inter-arrival times for periods up to one hour. If we include the ISDN-calls as two simultaneous arrivals, the observed and calculated values become different for the cases where we don t have too many calls per scan interval. Number representation In this case we study the number of calls during intervals of fixed duration. The measuring method is exact. If the arrival process is a stationary Poisson process, then the number of calls during a fixed time interval will be Poisson-distributed. We may observe the number of calls per time interval (e.g. one second) during 5 minutes and perform tests for the Poisson distribution. In general, a χ -test will accept a Poisson hypothesis. In the following we shall look at a second order statistics to study intensity variations.. Generalized mean differences Let us consider a discrete distribution function p(i) (i =,,...) with mean value m, second moment m, and variance σ = m m. 7
8 6 4 Palm form factor Figure 8: Observed formfactor of inter-arrival times for all calls in 5-minutes intervals from measurements. The values calculated from Westerberg s distribution will be identical for the busy periods. Tuesday The generalized mean difference of order r is defined by: For r = wehave δ = i = i = i δ r = i i j r p(i) p( j). j (i j) p(i)p( j) j { i p(i) p( j)+ j p( j) p(i) i jp(i) p( j) } j i p(i)+ j p( j) = ( m m ) = σ. j ( ip(i) i )( ) jp( j) j For the discrete distributions applied in the BPP (Binomial Poisson Pascal) traffic model we get the normalized generalized mean difference (NGMD) (In the Binomial and Pascal distributions p denotes the probability of success): 8
9 Binomial: Poisson: Pascal: δ m = ( p). δ m =. δ m = ( + p). In the Binomial and Pascal distributions p denotes the probability of success. A double stochastic Poisson process (a Cox process) is a Poisson process where the intensity λ is a stochastic variable. If for example λ is Γ-distributed, then the interarrival times are Paretodistributed [6]. Let λ have the mean value be m λ and the variance σ λ, then we get for the the number of calls in a fixed time interval: Palm: δ m = + σ λ m λ. The above statistics may be used to distinguish between fast and slow variations in a point process [5]. If we let p(i) and p( j) denote the number of calls in two consecutive intervals of fixed length, then the slow variations have no influence upon the the result, because the statistic is a linear function of the intensity. On the other hand, fast variations within the duration of the two intervals will increase the value of the statistics. In Fig. 9 we show the NGMD for periods of 5 minutes based on consecutive intervals of duration second each. The average is about. indicating that the arrival process is a little more bursty than the Poisson process. In Fig. we show the NGMD for the same period when the consecutive intervals are of length 6 seconds each. The mean value increases to.5 indicating that there are small intensity variations during minutes. In Fig. we show the NGMD for increasing values of the consecutive intervals from to seconds. The curve indicates significant intensity variations during two consecutive periods of each minutes. If we consider individual model pools, the NGMD becomes close to for intervals of length 5 minutes, which indicates a Poisson process. By Palm s theorem [6] the total arrival process should be even more Poissonian. In the above examples the average number of call per second is about 7 for all 4 hours of the day. It seems as if the large number of calls per time interval tends to increase the value of NGMD above, even for a Poisson process. Further detailed investigations have to be carried out. 4 Conclusion Above we have presented results for the analysis of the arrival process of dial-up Internet calls. Most results are based on all recorded calls. In [4] investigations have also been carried out for individual modem-pools. All investigations indicate that the arrival process is a Poisson process with slow variations during the day. Only at particular times, e.g. at 9: in the evening when the tariff is reduced to 5 %, there are rather fast variations (Fig. ). 9
10 .5 generalised mean difference Figure 9: Normalized generalised mean differences using -second intervals for periods of 5 minutes. Average =.79. Tuesday generalised mean difference Figure : Normalized generalised mean differences using 6-seconds intervals for periods of 5 minutes. Average =.58. Tuesday
11 6 5 generalised mean difference interval length (sec) Figure : The mean-squared-deviation for all calls as a function of the period. Tuesday References [] Christensen, T. K. & Nielsen, B. F. & Iversen, V. B. (): Distribution of channel holding times in cellular communication systems. NTS 5, Fifteenth Nordic Teletraffic Seminar, Lund, August. 9 pp. [] Färber, J. & Bodamer, S. & Charzinski, J. (999): Statistical evaluation and modelling of Internet dial-up traffic. IND, Institute of Communication Networks and Computer Engineering, University of Stuttgart 999. Technical Report. pp. [] Fredericks, A. A. (999: Impact of holding time distributions on parcel blocking in multi class networks with application to Internet traffic on PSTN s. ITC 6, Sixteenth International Teletraffic Congress, Edinburgh, June 999. Proceedings pp Elsevier Science B. V [4] Hussain, I. (999): Characterization of dial-up based Internet user traffic. Master s thesis. Department of Telecommunication, Technical University of Denmark, August pp. [5] Iversen, V. B. (97): Analyses of real teletraffic processes based on computerized measurements. Ericsson Technics, vol. 9 (97): 64. [6] Iversen, V.B. (999): Introduction to Traffic Engineering. Textbook. Department of Telecommunication, Technical University of Denmark pp.
12 [7] Naldi, M. (999): Measurement-based modelling of Internet dial-up access connections. Computer networks, Vol. (999) :, 8 9. [8] Palm, Conny (94): Intensitätsschwankungen im Fernsprechverkehr. Ericsson Technics No. 44, pp. English translation by Chr. Jacobæus: Intensity Variations in Telephone Traffic, North-Holland Publ. Co. 987.
Measurement and Modelling of Internet Traffic at Access Networks
Measurement and Modelling of Internet Traffic at Access Networks Johannes Färber, Stefan Bodamer, Joachim Charzinski 2 University of Stuttgart, Institute of Communication Networks and Computer Engineering,
More informationTHE EFFECT OF HOLDING TIMES ON LOSS SYSTEMS
TH FFCT OF HOLDING TIMS ON LOSS SYSTMS V. B. IVRSN Technical University of Denmark, Lyngby, Denmark ABSTRACT This paper considers loss systems with Poissonian arrival processes and general holding time
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 informationNotes on Continuous Random Variables
Notes on Continuous Random Variables Continuous random variables are random quantities that are measured on a continuous scale. They can usually take on any value over some interval, which distinguishes
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 informationFEGYVERNEKI SÁNDOR, PROBABILITY THEORY AND MATHEmATICAL
FEGYVERNEKI SÁNDOR, PROBABILITY THEORY AND MATHEmATICAL STATIsTICs 4 IV. RANDOm VECTORs 1. JOINTLY DIsTRIBUTED RANDOm VARIABLEs If are two rom variables defined on the same sample space we define the joint
More informationTraffic Behavior Analysis with Poisson Sampling on High-speed Network 1
Traffic Behavior Analysis with Poisson Sampling on High-speed etwork Guang Cheng Jian Gong (Computer Department of Southeast University anjing 0096, P.R.China) Abstract: With the subsequent increasing
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 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 informationDrop Call Probability in Established Cellular Networks: from data Analysis to Modelling
Drop Call Probability in Established Cellular Networks: from data Analysis to Modelling G. Boggia, P. Camarda, A. D Alconzo, A. De Biasi and M. Siviero DEE - Politecnico di Bari, Via E. Orabona, 4-7125
More information99.37, 99.38, 99.38, 99.39, 99.39, 99.39, 99.39, 99.40, 99.41, 99.42 cm
Error Analysis and the Gaussian Distribution In experimental science theory lives or dies based on the results of experimental evidence and thus the analysis of this evidence is a critical part of the
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 information1.5 / 1 -- Communication Networks II (Görg) -- www.comnets.uni-bremen.de. 1.5 Transforms
.5 / -- Communication Networks II (Görg) -- www.comnets.uni-bremen.de.5 Transforms Using different summation and integral transformations pmf, pdf and cdf/ccdf can be transformed in such a way, that even
More informationProbability and Statistics Prof. Dr. Somesh Kumar Department of Mathematics Indian Institute of Technology, Kharagpur
Probability and Statistics Prof. Dr. Somesh Kumar Department of Mathematics Indian Institute of Technology, Kharagpur Module No. #01 Lecture No. #15 Special Distributions-VI Today, I am going to introduce
More information4. Continuous Random Variables, the Pareto and Normal Distributions
4. Continuous Random Variables, the Pareto and Normal Distributions A continuous random variable X can take any value in a given range (e.g. height, weight, age). The distribution of a continuous random
More informationChapter 4 Lecture Notes
Chapter 4 Lecture Notes Random Variables October 27, 2015 1 Section 4.1 Random Variables A random variable is typically a real-valued function defined on the sample space of some experiment. For instance,
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 informationIEOR 6711: Stochastic Models I Fall 2012, Professor Whitt, Tuesday, September 11 Normal Approximations and the Central Limit Theorem
IEOR 6711: Stochastic Models I Fall 2012, Professor Whitt, Tuesday, September 11 Normal Approximations and the Central Limit Theorem Time on my hands: Coin tosses. Problem Formulation: Suppose that I have
More informationIntroduction to General and Generalized Linear Models
Introduction to General and Generalized Linear Models General Linear Models - part I Henrik Madsen Poul Thyregod Informatics and Mathematical Modelling Technical University of Denmark DK-2800 Kgs. Lyngby
More information2. Discrete random variables
2. Discrete random variables Statistics and probability: 2-1 If the chance outcome of the experiment is a number, it is called a random variable. Discrete random variable: the possible outcomes can be
More informationPractice Problems for Homework #6. Normal distribution and Central Limit Theorem.
Practice Problems for Homework #6. Normal distribution and Central Limit Theorem. 1. Read Section 3.4.6 about the Normal distribution and Section 4.7 about the Central Limit Theorem. 2. Solve the practice
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 informationMeasuring Line Edge Roughness: Fluctuations in Uncertainty
Tutor6.doc: Version 5/6/08 T h e L i t h o g r a p h y E x p e r t (August 008) Measuring Line Edge Roughness: Fluctuations in Uncertainty Line edge roughness () is the deviation of a feature edge (as
More informationCHAPTER 6: Continuous Uniform Distribution: 6.1. Definition: The density function of the continuous random variable X on the interval [A, B] is.
Some Continuous Probability Distributions CHAPTER 6: Continuous Uniform Distribution: 6. Definition: The density function of the continuous random variable X on the interval [A, B] is B A A x B f(x; A,
More informationQUEUING THEORY. 1. Introduction
QUEUING THEORY RYAN BERRY Abstract. This paper defines the building blocks of and derives basic queuing systems. It begins with a review of some probability theory and then defines processes used to analyze
More informationA Uniform Asymptotic Estimate for Discounted Aggregate Claims with Subexponential Tails
12th International Congress on Insurance: Mathematics and Economics July 16-18, 2008 A Uniform Asymptotic Estimate for Discounted Aggregate Claims with Subexponential Tails XUEMIAO HAO (Based on a joint
More informationOverview of Monte Carlo Simulation, Probability Review and Introduction to Matlab
Monte Carlo Simulation: IEOR E4703 Fall 2004 c 2004 by Martin Haugh Overview of Monte Carlo Simulation, Probability Review and Introduction to Matlab 1 Overview of Monte Carlo Simulation 1.1 Why use simulation?
More informationPerformance Modeling of an Apache Web Server with Bursty Arrival Traffic
This is an author produced version of a paper presented at the 4th International Conference on Internet Computing (IC 3), June 23-26, 23, Las Vegas, Nevada. This paper has been peer-reviewed but may not
More informationLean Six Sigma Analyze Phase Introduction. TECH 50800 QUALITY and PRODUCTIVITY in INDUSTRY and TECHNOLOGY
TECH 50800 QUALITY and PRODUCTIVITY in INDUSTRY and TECHNOLOGY Before we begin: Turn on the sound on your computer. There is audio to accompany this presentation. Audio will accompany most of the online
More information12.5: CHI-SQUARE GOODNESS OF FIT TESTS
125: Chi-Square Goodness of Fit Tests CD12-1 125: CHI-SQUARE GOODNESS OF FIT TESTS In this section, the χ 2 distribution is used for testing the goodness of fit of a set of data to a specific probability
More informationPr(X = x) = f(x) = λe λx
Old Business - variance/std. dev. of binomial distribution - mid-term (day, policies) - class strategies (problems, etc.) - exponential distributions New Business - Central Limit Theorem, standard error
More informationIssues of Variance of Extreme Values in a Heterogeneous Teletraffic Environment
Issues of Variance of Extreme Values in a Heterogeneous Teletraffic Environment D.E. Bassey 1, R. C. Okoro 2, B. E. Okon 3 1, 2 Electronics and Computer Technology Unit, Department of Physics, University
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 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 informationHomework 4 - KEY. Jeff Brenion. June 16, 2004. Note: Many problems can be solved in more than one way; we present only a single solution here.
Homework 4 - KEY Jeff Brenion June 16, 2004 Note: Many problems can be solved in more than one way; we present only a single solution here. 1 Problem 2-1 Since there can be anywhere from 0 to 4 aces, the
More informationProbability and Random Variables. Generation of random variables (r.v.)
Probability and Random Variables Method for generating random variables with a specified probability distribution function. Gaussian And Markov Processes Characterization of Stationary Random Process Linearly
More informationSTT315 Chapter 4 Random Variables & Probability Distributions KM. Chapter 4.5, 6, 8 Probability Distributions for Continuous Random Variables
Chapter 4.5, 6, 8 Probability Distributions for Continuous Random Variables Discrete vs. continuous random variables Examples of continuous distributions o Uniform o Exponential o Normal Recall: A random
More informationTELETRAFFIC ENGINEERING and NETWORK PLANNING. Villy B. Iversen
TELETRAFFIC ENGINEERING and NETWORK PLANNING Villy B Iversen COM Course 34340 http://wwwcomdtudk/education/34340/ Technical University of Denmark Building 345v DK 2800 Kgs Lyngby vbi@comdtudk Revised January
More informationStatistics 100A Homework 7 Solutions
Chapter 6 Statistics A Homework 7 Solutions Ryan Rosario. A television store owner figures that 45 percent of the customers entering his store will purchase an ordinary television set, 5 percent will purchase
More informationFairfield Public Schools
Mathematics Fairfield Public Schools AP Statistics AP Statistics BOE Approved 04/08/2014 1 AP STATISTICS Critical Areas of Focus AP Statistics is a rigorous course that offers advanced students an opportunity
More informationInternet Traffic Variability (Long Range Dependency Effects) Dheeraj Reddy CS8803 Fall 2003
Internet Traffic Variability (Long Range Dependency Effects) Dheeraj Reddy CS8803 Fall 2003 Self-similarity and its evolution in Computer Network Measurements Prior models used Poisson-like models Origins
More informationResource Provisioning and Network Traffic
Resource Provisioning and Network Traffic Network engineering: Feedback traffic control closed-loop control ( adaptive ) small time scale: msec mainly by end systems e.g., congestion control Resource provisioning
More informationGenerating Random Numbers Variance Reduction Quasi-Monte Carlo. Simulation Methods. Leonid Kogan. MIT, Sloan. 15.450, Fall 2010
Simulation Methods Leonid Kogan MIT, Sloan 15.450, Fall 2010 c Leonid Kogan ( MIT, Sloan ) Simulation Methods 15.450, Fall 2010 1 / 35 Outline 1 Generating Random Numbers 2 Variance Reduction 3 Quasi-Monte
More informationCurriculum Map Statistics and Probability Honors (348) Saugus High School Saugus Public Schools 2009-2010
Curriculum Map Statistics and Probability Honors (348) Saugus High School Saugus Public Schools 2009-2010 Week 1 Week 2 14.0 Students organize and describe distributions of data by using a number of different
More informationSTAT 360 Probability and Statistics. Fall 2012
STAT 360 Probability and Statistics Fall 2012 1) General information: Crosslisted course offered as STAT 360, MATH 360 Semester: Fall 2012, Aug 20--Dec 07 Course name: Probability and Statistics Number
More informationNumerical Methods for Option Pricing
Chapter 9 Numerical Methods for Option Pricing Equation (8.26) provides a way to evaluate option prices. For some simple options, such as the European call and put options, one can integrate (8.26) directly
More information1 Sufficient statistics
1 Sufficient statistics A statistic is a function T = rx 1, X 2,, X n of the random sample X 1, X 2,, X n. Examples are X n = 1 n s 2 = = X i, 1 n 1 the sample mean X i X n 2, the sample variance T 1 =
More informationThe Exponential Distribution
21 The Exponential Distribution From Discrete-Time to Continuous-Time: In Chapter 6 of the text we will be considering Markov processes in continuous time. In a sense, we already have a very good understanding
More informationSimple Linear Regression Inference
Simple Linear Regression Inference 1 Inference requirements The Normality assumption of the stochastic term e is needed for inference even if it is not a OLS requirement. Therefore we have: Interpretation
More informationThis document is published at www.agner.org/random, Feb. 2008, as part of a software package.
Sampling methods by Agner Fog This document is published at www.agner.org/random, Feb. 008, as part of a software package. Introduction A C++ class library of non-uniform random number generators is available
More informationInstitute of Actuaries of India Subject CT3 Probability and Mathematical Statistics
Institute of Actuaries of India Subject CT3 Probability and Mathematical Statistics For 2015 Examinations Aim The aim of the Probability and Mathematical Statistics subject is to provide a grounding in
More informationTraffic Control by Influencing User Behavior
Traffic Control by Influencing User Behavior We examined a means of influencing user behavior to reduce the number of repeated calls by providing information to users and controlling the traffic before
More informationSection 5 Part 2. Probability Distributions for Discrete Random Variables
Section 5 Part 2 Probability Distributions for Discrete Random Variables Review and Overview So far we ve covered the following probability and probability distribution topics Probability rules Probability
More informationChapter 5 Discrete Probability Distribution. Learning objectives
Chapter 5 Discrete Probability Distribution Slide 1 Learning objectives 1. Understand random variables and probability distributions. 1.1. Distinguish discrete and continuous random variables. 2. Able
More informationLogNormal stock-price models in Exams MFE/3 and C/4
Making sense of... LogNormal stock-price models in Exams MFE/3 and C/4 James W. Daniel Austin Actuarial Seminars http://www.actuarialseminars.com June 26, 2008 c Copyright 2007 by James W. Daniel; reproduction
More informationKeywords: Dynamic Load Balancing, Process Migration, Load Indices, Threshold Level, Response Time, Process Age.
Volume 3, Issue 10, October 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Load Measurement
More informationChapter 5. Random variables
Random variables random variable numerical variable whose value is the outcome of some probabilistic experiment; we use uppercase letters, like X, to denote such a variable and lowercase letters, like
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 informationNon-Inferiority Tests for Two Means using Differences
Chapter 450 on-inferiority Tests for Two Means using Differences Introduction This procedure computes power and sample size for non-inferiority tests in two-sample designs in which the outcome is a continuous
More informationDepartment of Mathematics, Indian Institute of Technology, Kharagpur Assignment 2-3, Probability and Statistics, March 2015. Due:-March 25, 2015.
Department of Mathematics, Indian Institute of Technology, Kharagpur Assignment -3, Probability and Statistics, March 05. Due:-March 5, 05.. Show that the function 0 for x < x+ F (x) = 4 for x < for x
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 informationErrata and updates for ASM Exam C/Exam 4 Manual (Sixteenth Edition) sorted by page
Errata for ASM Exam C/4 Study Manual (Sixteenth Edition) Sorted by Page 1 Errata and updates for ASM Exam C/Exam 4 Manual (Sixteenth Edition) sorted by page Practice exam 1:9, 1:22, 1:29, 9:5, and 10:8
More informationMODELING OF SYN FLOODING ATTACKS Simona Ramanauskaitė Šiauliai University Tel. +370 61437184, e-mail: simram@it.su.lt
MODELING OF SYN FLOODING ATTACKS Simona Ramanauskaitė Šiauliai University Tel. +370 61437184, e-mail: simram@it.su.lt A great proportion of essential services are moving into internet space making the
More informationThe Effects of Start Prices on the Performance of the Certainty Equivalent Pricing Policy
BMI Paper The Effects of Start Prices on the Performance of the Certainty Equivalent Pricing Policy Faculty of Sciences VU University Amsterdam De Boelelaan 1081 1081 HV Amsterdam Netherlands Author: R.D.R.
More informatione.g. arrival of a customer to a service station or breakdown of a component in some system.
Poisson process Events occur at random instants of time at an average rate of λ events per second. e.g. arrival of a customer to a service station or breakdown of a component in some system. Let N(t) be
More informationMath 425 (Fall 08) Solutions Midterm 2 November 6, 2008
Math 425 (Fall 8) Solutions Midterm 2 November 6, 28 (5 pts) Compute E[X] and Var[X] for i) X a random variable that takes the values, 2, 3 with probabilities.2,.5,.3; ii) X a random variable with the
More informationLeast Squares Estimation
Least Squares Estimation SARA A VAN DE GEER Volume 2, pp 1041 1045 in Encyclopedia of Statistics in Behavioral Science ISBN-13: 978-0-470-86080-9 ISBN-10: 0-470-86080-4 Editors Brian S Everitt & David
More informationEMPIRICAL FREQUENCY DISTRIBUTION
INTRODUCTION TO MEDICAL STATISTICS: Mirjana Kujundžić Tiljak EMPIRICAL FREQUENCY DISTRIBUTION observed data DISTRIBUTION - described by mathematical models 2 1 when some empirical distribution approximates
More informationSection 5.1 Continuous Random Variables: Introduction
Section 5. Continuous Random Variables: Introduction Not all random variables are discrete. For example:. Waiting times for anything (train, arrival of customer, production of mrna molecule from gene,
More informationA Multi-Model Filter for Mobile Terminal Location Tracking
A Multi-Model Filter for Mobile Terminal Location Tracking M. McGuire, K.N. Plataniotis The Edward S. Rogers Sr. Department of Electrical and Computer Engineering, University of Toronto, 1 King s College
More informationNotes on the Negative Binomial Distribution
Notes on the Negative Binomial Distribution John D. Cook October 28, 2009 Abstract These notes give several properties of the negative binomial distribution. 1. Parameterizations 2. The connection between
More informationProbability Calculator
Chapter 95 Introduction Most statisticians have a set of probability tables that they refer to in doing their statistical wor. This procedure provides you with a set of electronic statistical tables that
More informationOptimal base-stock policy for the inventory system with periodic review, backorders and sequential lead times
44 Int. J. Inventory Research, Vol. 1, No. 1, 2008 Optimal base-stock policy for the inventory system with periodic review, backorders and sequential lead times Søren Glud Johansen Department of Operations
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 informationOn Testing Image Processing Applications With Statistical Methods
On Testing Image Processing Applications With Statistical Methods Johannes Mayer Abteilung Angewandte Informationsverarbeitung Universität Ulm D 89069 Ulm mayer@mathematik.uni-ulm.de Abstract: Testing
More informationCITY UNIVERSITY LONDON. BEng Degree in Computer Systems Engineering Part II BSc Degree in Computer Systems Engineering Part III PART 2 EXAMINATION
No: CITY UNIVERSITY LONDON BEng Degree in Computer Systems Engineering Part II BSc Degree in Computer Systems Engineering Part III PART 2 EXAMINATION ENGINEERING MATHEMATICS 2 (resit) EX2005 Date: August
More informationUNIVERSITY of MASSACHUSETTS DARTMOUTH Charlton College of Business Decision and Information Sciences Fall 2010
UNIVERSITY of MASSACHUSETTS DARTMOUTH Charlton College of Business Decision and Information Sciences Fall 2010 COURSE: POM 500 Statistical Analysis, ONLINE EDITION, Fall 2010 Prerequisite: Finite Math
More informationDimensional analysis is a method for reducing the number and complexity of experimental variables that affect a given physical phenomena.
Dimensional Analysis and Similarity Dimensional analysis is very useful for planning, presentation, and interpretation of experimental data. As discussed previously, most practical fluid mechanics problems
More informationTwitter Analytics: Architecture, Tools and Analysis
Twitter Analytics: Architecture, Tools and Analysis Rohan D.W Perera CERDEC Ft Monmouth, NJ 07703-5113 S. Anand, K. P. Subbalakshmi and R. Chandramouli Department of ECE, Stevens Institute Of Technology
More informationSuggestions for simplified Fixed Capital Stock calculations at Statistics Sweden Michael Wolf, National Accounts Division Statistics Sweden
Capital Stock Conference March 1997 Agenda Item VI Suggestions for simplified Fixed Capital Stock calculations at Statistics Sweden Michael Wolf, National Accounts Division Statistics Sweden 1 Suggestions
More informationMultiple Choice: 2 points each
MID TERM MSF 503 Modeling 1 Name: Answers go here! NEATNESS COUNTS!!! Multiple Choice: 2 points each 1. In Excel, the VLOOKUP function does what? Searches the first row of a range of cells, and then returns
More informationTrading activity as driven Poisson process: comparison with empirical data
Trading activity as driven Poisson process: comparison with empirical data V. Gontis, B. Kaulakys, J. Ruseckas Institute of Theoretical Physics and Astronomy of Vilnius University, A. Goštauto 2, LT-008
More informationPoisson Models for Count Data
Chapter 4 Poisson Models for Count Data In this chapter we study log-linear models for count data under the assumption of a Poisson error structure. These models have many applications, not only to the
More informationMath 461 Fall 2006 Test 2 Solutions
Math 461 Fall 2006 Test 2 Solutions Total points: 100. Do all questions. Explain all answers. No notes, books, or electronic devices. 1. [105+5 points] Assume X Exponential(λ). Justify the following two
More informationMulti-service Load Balancing in a Heterogeneous Network with Vertical Handover
1 Multi-service Load Balancing in a Heterogeneous Network with Vertical Handover Jie Xu, Member, IEEE, Yuming Jiang, Member, IEEE, and Andrew Perkis, Member, IEEE Abstract In this paper we investigate
More informationChicago Booth BUSINESS STATISTICS 41000 Final Exam Fall 2011
Chicago Booth BUSINESS STATISTICS 41000 Final Exam Fall 2011 Name: Section: I pledge my honor that I have not violated the Honor Code Signature: This exam has 34 pages. You have 3 hours to complete this
More informationObservingtheeffectof TCP congestion controlon networktraffic
Observingtheeffectof TCP congestion controlon networktraffic YongminChoi 1 andjohna.silvester ElectricalEngineering-SystemsDept. UniversityofSouthernCalifornia LosAngeles,CA90089-2565 {yongminc,silvester}@usc.edu
More informationPROBABILITY AND STATISTICS. Ma 527. 1. To teach a knowledge of combinatorial reasoning.
PROBABILITY AND STATISTICS Ma 527 Course Description Prefaced by a study of the foundations of probability and statistics, this course is an extension of the elements of probability and statistics introduced
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 informationModeling and Performance Evaluation of Computer Systems Security Operation 1
Modeling and Performance Evaluation of Computer Systems Security Operation 1 D. Guster 2 St.Cloud State University 3 N.K. Krivulin 4 St.Petersburg State University 5 Abstract A model of computer system
More informationTime Series Analysis
Time Series Analysis hm@imm.dtu.dk Informatics and Mathematical Modelling Technical University of Denmark DK-2800 Kgs. Lyngby 1 Outline of the lecture Identification of univariate time series models, cont.:
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 informationQuantitative Methods for Finance
Quantitative Methods for Finance Module 1: The Time Value of Money 1 Learning how to interpret interest rates as required rates of return, discount rates, or opportunity costs. 2 Learning how to explain
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 informationEstimation and attribution of changes in extreme weather and climate events
IPCC workshop on extreme weather and climate events, 11-13 June 2002, Beijing. Estimation and attribution of changes in extreme weather and climate events Dr. David B. Stephenson Department of Meteorology
More information" Y. Notation and Equations for Regression Lecture 11/4. Notation:
Notation: Notation and Equations for Regression Lecture 11/4 m: The number of predictor variables in a regression Xi: One of multiple predictor variables. The subscript i represents any number from 1 through
More informationMathematical Modeling of Inventory Control Systems with Lateral Transshipments
Mathematical Modeling of Inventory Control Systems with Lateral Transshipments Lina Johansson Master Thesis Department of Industrial Management and Logistics Division of Production Management Lund university,
More informationMaster s Theory Exam Spring 2006
Spring 2006 This exam contains 7 questions. You should attempt them all. Each question is divided into parts to help lead you through the material. You should attempt to complete as much of each problem
More informationMath 370/408, Spring 2008 Prof. A.J. Hildebrand. Actuarial Exam Practice Problem Set 2 Solutions
Math 70/408, Spring 2008 Prof. A.J. Hildebrand Actuarial Exam Practice Problem Set 2 Solutions About this problem set: These are problems from Course /P actuarial exams that I have collected over the years,
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 information