Challenges in Packet Switched Setting
|
|
- Jessie Evans
- 5 years ago
- Views:
Transcription
1 Stochastic Models for Information Processing Bernard Fleury, Søren V. Andersen, Hans-Peter Schwefel Mm1 Channel Characterization and Measurements (bfl) Mm2 Discrete-time Markov Chains, HMMs (hps) Mm3 Loss models and error concealment (sva) Mm4 Modeling of Medium Access Schemes (hps) Mm5 Traffic and Performance Models (hps) Note: slide-set will be complemented by formulas, mathematical derivations, and examples on the black-board! Page 1 Revision (SIPCOM9-3) Challenges in Packet Switched Setting Challenges in IP networks: HTTP Multiplexing of packets at nodes (L3) TCP Burstiness of IP traffic (L3-7) IP Impact of Dynamic Routing (L3) Link-Layer Performance impact of transport layer, in particular TCP (L4) Wide range of applications different traffic & QoS requirements (L5-7) Feedback: performance traffic model, e.g. for TCP traffic, adaptive applications L5-7 L4 L3 L2 Challenges in Wireless Networks: Wireless link models (channel models) MAC & LLC modeling RRM procedures Mobility models Cross layer optimization Analysis frequently with stochastic models Page 2
2 Revision (SIPCOM9-3) Basic concepts Probabilities Random experiment with set of possible results Ω Axiomatic definition on event set V(Ω) 0 Pr(A) 1; Pr( )=0; Pr(A B)=Pr(A)+Pr(B) if A B= [ A,B (Ω) ] Conditional probabilities: Pr(A B)=Pr(A B) / Pr(B) Random Variables (RV) Definition: X: Ω ú; Pr(X=x)=Pr(X -1 (x)) Probability density function f(x), cumulative distribution function F(x)=Pr(X x), reliability function (complementary distr. Function) R(x)=1-F(x)=Pr(X>x) Expected value, moments: E(X n )= x n f(x) dx Relevant Examples, e.g.: number of packets that arrive at the access router in the next hour (discrete) Buffer occupancy (#packets) in switch x at time y (discrete) Number of downloads ( mouse clicks ) in the next web session (discrete) Time until arrival of the next IP packet at a base station (continuous) Page 3 Revision (SIPCOM9-3) Basic concepts: Exponential Distributions Important Case: Exponentially distributed RV Single parameter: rate λ Density function f(x)= λ exp(- λx), x>0 Cdf: F(x)=1-exp(- λx), Reliability function: R(x)=exp(- λx) Moments: E{X}=1/ λ; Var{X}=1/ λ 2, C 2 = Var{X} / [E{X}] 2 = 1 Important properties: Memory-less: Pr(X>x+y X>x) = exp(- λy) Properties of two independent exponential RV: X with rate λ, Y with rate µ Distribution of min(x,y): exponential with rate (λ+µ) Pr(X<Y)= λ/(λ+µ) Page 4
3 Revision (SIPCOM9-3) Basic concepts III: Stochastic Processes Definition of process (X i ) (discrete) or (N t ) (continuous) Simplest type: X i independent and identically distributed (iid) Relevant Examples: Inter-arrival time process: X i Counting Process: n-1 N(t) = max{n Σ i=1 X i t}, alternatively N i ( ) = N(i ) N([i-1] ) Important Example: Poisson Process Assume i.i.d. exponential packet inter-arrival times (rate λ): X i :=T i -T i-1 Counting Process: Number of packets N t until time t Pr(N t =n)= (λt) n exp(- λt) / n! Properties: Merging: arrivals from two independent Poisson processes with rate λ 1 and λ 2 Poisson process with rate (λ 1 + λ 2 ) Thinning: arrivals from a Poisson process of rate λ are discarded independently with probability p Poisson process with rate (1-p) λ Central Limit Theorem: superposition of n independent processes results in the limit n in a Poisson process (under some conditions on the processes) Page 5 Revision (SIPCOM9-3) Continuous Time Markov Processes Defined by State-Space: finite or countable infinite, w/o.l.g. E={0,1,2,...,K} (K= also allowed) Transition rates: µ jk Holding time in state j: exponential with rate Σ k j µ jk =: µ j Transition probability from state j to k: µ jk / Σ l j µ jl = µ jk / µ j X t = RV indicating the current state at time t; π i (t):=pr(x t =i) Markov Property : transitions do not depend on history but only on current state t 0 <t 1 <...<t n, i 0,i 1,...i n,j E Computation of steady-state probabilities Chapman Kolmogorov Equations: dπ i (t)/dt = - µ i π i (t) + Σ j i µ ji π j (t) Flow-balance equations, steady-state (t ): µ i π i = Σ j i µ ji π j Here: restriction to irreducible, homogeneous processes Matrix Notation! Page 6
4 Revision (SIPCOM9-3) Queueing Models: Kendall Notation X/Y/C[/B] Queues (example: M/M/1, GI/M/2/10, M/M/10/10,...) X: Specifies Arrival Process M=Markovian Poisson GI=General Independent iid Y: Specifies Service Process (M,G(I),...) C: Number of Servers B: size of finite waiting room (buffer) [also counting the packet in service] If not specified: B= Often also specified: service discipline FIFO: First-In-First-Out (default) Processor Sharing: PS Last-in-first-out LIFO (preemptive or non-preemptive) Earliest Deadline First (EDF), etc. λ µ Finite buffer (size B) Scope here: Point-process models as opposed to fluidflow queues Page 7 Revision (SIPCOM9-3) M/M/1 queue Poisson arrival of packets (first M Markovian) with rate λ Exponentially distributed service times of rate µ (second M ) λ Single Server (1) FIFO service discipline Q t = Number of packets in system is continuous-time Markov Process Derived Parameter: Utilization, ρ= λ/ µ : if ρ 1, instable case (no steady-state q.l.d) Infinite buffer µ Performance Parameters Queue-length distribution: π(t), steady-state limit: π=lim π(t) (if ρ<1) Queue-length that an arriving customer sees Waiting/System time distribution Buffer-Overflow Probability for level B = Pr(arriving customers sees buffer occupancy B or higher) Page 8
5 Revision (SIPCOM9-3) M/M/1 queue: Performance λ λ λ µ µ µ Birth-Death Process Probability of i packets in queue [using flow-balance equations] π i := Pr(Q=i) = (1-ρ)* ρ i, where ρ= λ/ µ <1 Probability of idle server: π 0 = (1-ρ) Average Queue-length: E{Q}= ρ/(1-ρ) Average Delay (System Time): E{S}= E{Q}/ λ = 1/(µ-λ) Buffer Overflow Probabilities (PASTA principle) Pr(Q (a) B)= Pr(Q B) = ρ B Page 9 Discussion: Models for packet traffic Poisson assumption for packet arrivals may be applicable for highly aggregated traffic (core networks), but otherwise traffic tends to be bursty High data rates in ftp download but less activity between downloads http: activities after mouse-clicks Video streaming: high data rates in frame transmissions Interactive Voice: talk and silent periods Model Modifications: Bulk Arrival processes ON/OFF models Hierarchical models [Assumption of exponential service times?] Page 10
6 Content 1. Motivation 2. Traffic Characteristics Daily profiles, stationarity Autocorrelation, ON/OFF models Examples: ATM Traffic Measurements Gaming Traffic 3. Markov Modulated Poisson Processes Definition Basic Properties 4. Performance Models: MMPP/M/1 Queues Matrix formulation, Quasi-Birth Death Processes Steady-State Queue-length probabilities Solving the quadratic matrix equation 5. Long-Range Dependence and Heavy-Tails 6. Summary, Exercises Page 11 Daily Profiles: Stationarity A stationary process has the property that the mean, variance and autocorrelation structure do not change over time. Informally: we mean a flat looking series, without trend, constant variance over time, a constant autocorrelation structure over time and no periodic fluctuations (seasonality). NIST/SEMATECH e-handbook of Statistical Methods Page 12
7 The 1-Hour / Stationarity Connection Nonstationarity in traffic is primarily a result of varying human behavior over time The biggest trend is diurnal This trend can usually be ignored up to timescales of about an hour, especially in the busy hour x 10 8 Traffic in OD Flow Eigenflow Mon Tue Wed Thu Fri Sat Sun Page Mon Tue Wed Thu Fri Sat Sun Traffic Modeling: A Reasonable Approach Fully characterizing a stochastic process can be impossible Potentially infinite set of properties to capture Some properties can be very hard to estimate A reasonable approach is to concentrate on two particular properties: marginal distribution and autocorrelation Page 14
8 Autocorrelation Once we have characterized the marginals, we know a lot about the process. In fact, if the process consisted of i.i.d. samples, we would be done. However, most traffic has the property that its measurements are not independent. Lack of independence usually results in autocorrelation Autocorrelation is the tendency for two measurements to both be greater than, or less than, the mean at the same time. Page 15 Measuring Autocorrelation Coefficient of Autocorrelation (assumes stationarity): R(k) = Cov(X n,x n+k )/Var[X 0 ] = ( E[X n X n+k ] E 2 [X 0 ]) / Var[X 0 ] Page 16
9 Traffic Properties Poisson Arrival processes & M/M/1 type queues exponential distributions, memory-less Coefficient of variation: C 2 =Var(X)/[E{X}] 2 =1 Uncorrelated arrivals/services (Steady-state analysis) Actual Measurements (inter-cell times X i ): C 2 (X) between 13,,30 positive autocorrelation coefficient: ř(k) = (Σ i (X i -x)(x i+k -x)) / Var(X) > 0, slowly decaying with k Correlation Plot (Inter-cell times) Page 17 Bursty Models: ON/OFF Models Parameters: N sources, each average rate κ During ON periods: peak-rate λ p Mean duration of ON and OFF times κ = λ p ON/(ON+OFF) bursty traffic, when λ p >> κ Page 18
10 General hierarchical models Frequently used: Several levels with increasing granularity E.g. 3 levels: sessions, connections, packets Or: 5-level model: Page 19 Revision (SIPCOM9-3, MM4 Use Case) Measurement: Game Traffic Traffic Measurements of Counter-Strike Session Architecture: 2 clients, 1 server Within switched 100Mb/s Ethernet Measurement of UDP traffic Inter-packet time distribution (inter-departure time) Packet Size distribution Correlation properties (auto-, cross-) for four different flows Flow 1: Client 1 Server Flow 2: Client 2 Server Flow 3: Server Client 1 Flow 4: Server Client 2 Page 20
11 Revision (SIPCOM9-3, MM4 Use Case) Inter-departure time distribution Upstream: two modes, around 33 ms and 50 ms Downstream: single mode, around 60ms Page 21 Revision (SIPCOM9-3, MM4 Use Case) Modeling of Gaming Traffic Downstream (server client) i.i.d. normally distributed Upstream (client server) Mix of two normal distributions Normal distributions fitted with the mean and standard deviation of the traffic sample Selection of short or long inter-departure time determined by discrete time Markov chain Transition matrix derived from traffic samples Page 22
12 Revision (SIPCOM9-3, MM4 Use Case) Auto-correlation of inter-packet times Coefficient of auto-correlation Seemingly some periodic properties in game traffic Not achieved (of course) by two-state Markov model! Page 23 Content 1. Motivation 2. Traffic Characteristics Daily profiles, stationarity Autocorrelation, ON/OFF models Examples: ATM Traffic Measurements Gaming Traffic 3. Markov Modulated Poisson Processes Definition Basic Properties 4. Performance Models: MMPP/M/1 Queues Matrix formulation, Quasi-Birth Death Processes Steady-State Queue-length probabilities Solving the quadratic matrix equation 5. Long-Range Dependence and Heavy-Tails 6. Summary, Exercises Page 24
13 Markov Modulated Poisson Processes Example: Single-Source ON/OFF model Page 25 Multiplexed ON/OFF Models Parameters: N sources, each average rate κ During ON periods: peak-rate λ p Mean duration of ON and OFF times ON & OFF Times exponential MMPP representation with N+1 states (Exercises!) Page 26
14 Content 1. Motivation 2. Traffic Characteristics Daily profiles, stationarity Autocorrelation, ON/OFF models Examples: ATM Traffic Measurements Gaming Traffic 3. Markov Modulated Poisson Processes Definition Basic Properties 4. Performance Models: MMPP/M/1 Queues Matrix formulation, Quasi-Birth Death Processes Steady-State Queue-length probabilities Solving the quadratic matrix equation 5. Long-Range Dependence and Heavy-Tails 6. Summary, Exercises Page 27 MMPP/M/1 Queues State space: <n,i>, n=# packets in queue, i=state of modulating process order states lexiographically Generator matrix Block-tri-diagonal: Quasi-Birth-Death Process Steady-state probability vector: Matrix Form of Balance Equations Matrix Geometric Solution From boundary conditions: Page 28
15 Matrix-Geometric Factor: R From Balance equations. Sufficient condition for R: with Performance Parameters: Scalar queue-length probabilities Average queue-length How to solve quadratic matrix equation: Simple iteration Spectral decomposition (not discussed here) Page 29 Computational aspects Simple iteration method (*) may lead to long processing times Numerical properties Page 30
16 (optional) MMPP/M/1/B Queues Finite buffer-space, loss model Generator matrix Mixed matrix geometric solution Approaches to obtain matrix factor S Page 31 Content 1. Motivation 2. Traffic Characteristics Daily profiles, stationarity Autocorrelation, ON/OFF models Examples: ATM Traffic Measurements Gaming Traffic 3. Markov Modulated Poisson Processes Definition Basic Properties 4. Performance Models: MMPP/M/1 Queues Matrix formulation, Quasi-Birth Death Processes Steady-State Queue-length probabilities Solving the quadratic matrix equation 5. Long-Range Dependence and Heavy-Tails 6. Summary, Exercises Page 32
17 Distributional Tails A particularly important part of a distribution is the (upper) tail P[X>x] Large values dominate statistics and performance Shape of tail critically important Page 33 Light Tails, Heavy Tails Light Exponential or faster decline f 1 (x) = 2 exp(-2(x-1)) Heavy Slower than any exponential f 2 (x) = x -2 Page 34
18 Examining Tails Best done using log-log complementary CDFs Plot log(1-f(x)) vs log(x) 1-F 2 (x) 1-F 1 (x) Page 35 Heavy Tails Arrive pre-1985: Scattered measurements note high variability in computer systems workloads : Detailed measurements note long distributional tails File sizes Process lifetimes : Attention focuses specifically on (approximately) polynomial tail shape: heavy tails post-1998: Heavy tails used in standard models Page 36
19 Power Tails, Mathematically We say that a random variable X is power tailed if: α P[ X > x ] ~ x 0 < α 2 a( x) where a(x) ~ b(x) means lim ( ) = 1. x b x Focusing on polynomial shape allows Parsimonious description Capture of variability in α parameter Page 37 A Fundamental Shift in Viewpoint Traditional modeling methods have focused on distributions with light tails Tails that decline exponentially fast (or faster) Arbitrarily large observations are vanishingly rare Heavy tailed models behave quite differently Arbitrarily large observations have non-negligible probability Large observations, although rare, can dominate a system s performance characteristics Page 38
20 Heavy Tails are Surprisingly Common Sizes of data objects in computer systems Files stored on Web servers Data objects/flow lengths traveling through the Internet Files stored in general-purpose Unix filesystems I/O traces of filesystem, disk, and tape activity Process/Job lifetimes Node degree in certain graphs Inter-domain and router structure of the Internet Connectivity of WWW pages Zipf s Law Page 39 Evidence: Web File Sizes Barford et al., World Wide Web, 1999 Page 40
21 Evidence: Process Lifetimes Harchol-Balter and Downey, ACM TOCS, 1997 Page 41 The Bad News Workload metrics following heavy tailed distributions are extremely variable For example, for power tails: When α 2, distribution has infinite variance When α 1, distribution has infinite mean In practice, empirical moments are slow to converge or nonconvergent To characterize system performance, either: Attention must shift to distribution itself, or Attention must be paid to timescale of analysis Page 42
22 Heavy Tails in Practice Power tails with α=0.8 Large observations dominate statistics (e.g., sample mean) Page 43 Self-Similar Properties: =10 s =1 s Measurement of intervall-based Counting Process =0.1 s =0.01 s Self-Similar Poisson Traditional Bursty Page 44
23 Long-Range Dependence in Measurements Correlation Plot (Inter-cell times) Aggregated Variance Plot r(k) ~ k -α+1 with α 1.4 Var X (m) ~ m -α+1 Var X Long-Range Dependence found in ATM measurements Page 45 Mathematical Definitions Self-Similarity with Hurst Parameter H: [N i ( )] i = [s -H N j (s )] j d Second Order Self-Similarity: r (m) (k) r(k) for all m,k=1,2,... where r (m) (k) is autocorrelation of averaged, m-aggregated process Asymptotic Second Order Self-Similarity: lim r (m) (k) / r(k) = 1 for all m=1,2,... Long-Range Dependence: Σ r(k) (assuming r(k) 0 ) with special case: r(k) ~ 1/k (α-1), 1<α<2 The latter processes are asymptotic second order self-similar! k Page 46
24 ON/OFF models with Heavy-Tails Power-Tail distribution Very long ON periods can occur Exponent α: Heavier Tails for lower α; Impact on exponent in AKF Truncated Tail: Power-Tail Range, Maximum Burst Size (MBS) Page 47 Performance Impact `Blow-up Regions i 0 =1,...,N for LRD traffic Radical delay increase at transitions Power-Tailed queuelength-distr....with changing exponents β(i 0 ) Page 48
25 Summary 1. Motivation 2. Traffic Characteristics Daily profiles, stationarity Autocorrelation, ON/OFF models Examples: ATM Traffic Measurements Gaming Traffic 3. Markov Modulated Poisson Processes Definition Basic Properties 4. Performance Models: MMPP/M/1 Queues Matrix formulation, Quasi-Birth Death Processes Steady-State Queue-length probabilities Solving the quadratic matrix equation 5. Long-Range Dependence and Heavy-Tails 6. Summary, Exercises Page 49 Non-exponential Service Times: M/G/1 Queues Poisson Arrivals (rate λ) service times general (ME) distributed (i.i.d. RVs Y i ) Utilization: ρ = λ E{Y} [ Pr(Q=0)=1- ρ for infinite buffer model, as we will see later] Solution Approaches: Embedded Markov Chain (see e.g. Kleinrock) Pollaczek-Khinchin Formula: where C^2:=coefficient of variation of service times Matrix-Exponential Distributions Quasi Birth-Death Processes existence of Matrix-geometric solution Page 50
26 References Traffic Measurements H. Gogl, Measurement and Characterization of Traffic Streams in High-Speed Wide Area Networks, VDI Verlag, E. Matthiesen, J. Larsen, F. Olufsen: Quality of Service for Computer Gaming An Evaluation of DiffServ, Student Report, Aalborg University, Spring M. Neuts: Matrix geometric Solutions in Stochastic Models, John Hopkins University Press, M. Neuts: Structured stochastic matrices of M/G/1 type and their applications. Dekker, G. Latouche, V. Ramaswami: Introduction to matrix-analytic methods in stochastic modeling. ASA-SIAM Series on Statistics and Applied Probability H.-P. Schwefel: Performance Analysis of Intermediate Systems Serving Aggregated ON/OFF Traffic with Long-Range Dependent Properties, Dissertation, TU Munich, [Appendices B,C,D,F] K. Meier-Hellstern, W. Fischer: MMPP Cookbook, Performance Evaluation 18, p P. Fiorini et al.: Auto-correlation Lag-k for customers departing from Semi-Markov Processes, Technical Report TUM-I9506, TU München, July M. Crovella: Network Traffic Modeling, PhD lecture, Aalborg University, February Page 51 Exercises: A network operator asks you to assist him in dimensioning his access router. The operator expects that during the daily busy hours, the router is used by N=10 users, each of them independently generates traffic according to an ON/OFF process with exponential ON and OFF periods. On periods have mean ON=10s with a Poisson packet rate of λ p =6pck/sec for a single user. OFF periods show mean Z=20 seconds. The aggregated traffic stream of N=10 users can be described by an MMPP with K=11 states. a. Determine the Q and the L matrix of the MMPP (in MATLAB). b. Compute the stationary probability vector pi of the MMPP. What is the average packet rate generated by the MMPP? c. Determine the queue-length distribution of an MMPP/M/1 queue with service rate nu=30pck/sec via the following steps. i. Compute the coefficient matrices A0,A1,A2 for the quadratic matrix equation for the rate matrix R. ii. Solve the quadratic matrix equation via the simple iterative method from the lecture. Measure the time that Matlab needs to do so. iii. Use R to compute and plot the queue-length probabilities and the average queue-length. d. Compare the average queue-length with an M/M/1 queue of same utilization. Page 52
Intro: Packet-Based Transport
PhD Course: Performance & Reliability Analysis of IP-based mobile Communication Networks Henrik Schiøler, Hans-Peter Schwefel, Lester Lipsky Day 1 Basics Modeling approaches & bursty traffic models (HPS)
More informationLecture 7: Simulation of Markov Processes. Pasi Lassila Department of Communications and Networking
Lecture 7: Simulation of Markov Processes Pasi Lassila Department of Communications and Networking Contents Markov processes theory recap Elementary queuing models for data networks Simulation of Markov
More informationCPSC 531: System Modeling and Simulation. Carey Williamson Department of Computer Science University of Calgary Fall 2017
CPSC 531: System Modeling and Simulation Carey Williamson Department of Computer Science University of Calgary Fall 2017 Motivating Quote for Queueing Models Good things come to those who wait - poet/writer
More informationStochastic process. X, a series of random variables indexed by t
Stochastic process X, a series of random variables indexed by t X={X(t), t 0} is a continuous time stochastic process X={X(t), t=0,1, } is a discrete time stochastic process X(t) is the state at time t,
More informationIntroduction to Queueing Theory
Introduction to Queueing Theory Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu Audio/Video recordings of this lecture are available at: 30-1 Overview Queueing Notation
More informationNICTA Short Course. Network Analysis. Vijay Sivaraman. Day 1 Queueing Systems and Markov Chains. Network Analysis, 2008s2 1-1
NICTA Short Course Network Analysis Vijay Sivaraman Day 1 Queueing Systems and Markov Chains Network Analysis, 2008s2 1-1 Outline Why a short course on mathematical analysis? Limited current course offering
More informationNetwork Traffic Characteristic
Network Traffic Characteristic Hojun Lee hlee02@purros.poly.edu 5/24/2002 EL938-Project 1 Outline Motivation What is self-similarity? Behavior of Ethernet traffic Behavior of WAN traffic Behavior of WWW
More informationLecture 20: Reversible Processes and Queues
Lecture 20: Reversible Processes and Queues 1 Examples of reversible processes 11 Birth-death processes We define two non-negative sequences birth and death rates denoted by {λ n : n N 0 } and {µ n : n
More informationPERFORMANCE-RELEVANT NETWORK TRAFFIC CORRELATION
PERFORMANCE-RELEVANT NETWORK TRAFFIC CORRELATION Hans-Peter Schwefel Center for Teleinfrastruktur Aalborg University email: hps@kom.aau.dk Lester Lipsky Dept. of Comp. Sci. & Eng. University of Connecticut
More informationJitter Analysis of an MMPP 2 Tagged Stream in the presence of an MMPP 2 Background Stream
Jitter Analysis of an MMPP 2 Tagged Stream in the presence of an MMPP 2 Background Stream G Geleji IBM Corp Hursley Park, Hursley, UK H Perros Department of Computer Science North Carolina State University
More informationPerformance Evaluation of Queuing Systems
Performance Evaluation of Queuing Systems Introduction to Queuing Systems System Performance Measures & Little s Law Equilibrium Solution of Birth-Death Processes Analysis of Single-Station Queuing Systems
More informationQUEUING SYSTEM. Yetunde Folajimi, PhD
QUEUING SYSTEM Yetunde Folajimi, PhD Part 2 Queuing Models Queueing models are constructed so that queue lengths and waiting times can be predicted They help us to understand and quantify the effect of
More informationLink Models for Circuit Switching
Link Models for Circuit Switching The basis of traffic engineering for telecommunication networks is the Erlang loss function. It basically allows us to determine the amount of telephone traffic that can
More informationChapter 2 Queueing Theory and Simulation
Chapter 2 Queueing Theory and Simulation Based on the slides of Dr. Dharma P. Agrawal, University of Cincinnati and Dr. Hiroyuki Ohsaki Graduate School of Information Science & Technology, Osaka University,
More informationQueueing Theory and Simulation. Introduction
Queueing Theory and Simulation Based on the slides of Dr. Dharma P. Agrawal, University of Cincinnati and Dr. Hiroyuki Ohsaki Graduate School of Information Science & Technology, Osaka University, Japan
More informationIntroduction to Queueing Theory
Introduction to Queueing Theory Raj Jain Washington University in Saint Louis Jain@eecs.berkeley.edu or Jain@wustl.edu A Mini-Course offered at UC Berkeley, Sept-Oct 2012 These slides and audio/video recordings
More informationComputer Networks More general queuing systems
Computer Networks More general queuing systems Saad Mneimneh Computer Science Hunter College of CUNY New York M/G/ Introduction We now consider a queuing system where the customer service times have a
More informationQueueing Theory I Summary! Little s Law! Queueing System Notation! Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K "
Queueing Theory I Summary Little s Law Queueing System Notation Stationary Analysis of Elementary Queueing Systems " M/M/1 " M/M/m " M/M/1/K " Little s Law a(t): the process that counts the number of arrivals
More informationQueueing Theory II. Summary. ! M/M/1 Output process. ! Networks of Queue! Method of Stages. ! General Distributions
Queueing Theory II Summary! M/M/1 Output process! Networks of Queue! Method of Stages " Erlang Distribution " Hyperexponential Distribution! General Distributions " Embedded Markov Chains M/M/1 Output
More informationData analysis and stochastic modeling
Data analysis and stochastic modeling Lecture 7 An introduction to queueing theory Guillaume Gravier guillaume.gravier@irisa.fr with a lot of help from Paul Jensen s course http://www.me.utexas.edu/ jensen/ormm/instruction/powerpoint/or_models_09/14_queuing.ppt
More informationQueuing Networks: Burke s Theorem, Kleinrock s Approximation, and Jackson s Theorem. Wade Trappe
Queuing Networks: Burke s Theorem, Kleinrock s Approximation, and Jackson s Theorem Wade Trappe Lecture Overview Network of Queues Introduction Queues in Tandem roduct Form Solutions Burke s Theorem What
More informationQueueing systems. Renato Lo Cigno. Simulation and Performance Evaluation Queueing systems - Renato Lo Cigno 1
Queueing systems Renato Lo Cigno Simulation and Performance Evaluation 2014-15 Queueing systems - Renato Lo Cigno 1 Queues A Birth-Death process is well modeled by a queue Indeed queues can be used to
More informationQueueing Systems: Lecture 3. Amedeo R. Odoni October 18, Announcements
Queueing Systems: Lecture 3 Amedeo R. Odoni October 18, 006 Announcements PS #3 due tomorrow by 3 PM Office hours Odoni: Wed, 10/18, :30-4:30; next week: Tue, 10/4 Quiz #1: October 5, open book, in class;
More informationPart I Stochastic variables and Markov chains
Part I Stochastic variables and Markov chains Random variables describe the behaviour of a phenomenon independent of any specific sample space Distribution function (cdf, cumulative distribution function)
More informationSome Background Information on Long-Range Dependence and Self-Similarity On the Variability of Internet Traffic Outline Introduction and Motivation Ch
On the Variability of Internet Traffic Georgios Y Lazarou Information and Telecommunication Technology Center Department of Electrical Engineering and Computer Science The University of Kansas, Lawrence
More informationAsymptotic Delay Distribution and Burst Size Impact on a Network Node Driven by Self-similar Traffic
Èíôîðìàöèîííûå ïðîöåññû, Òîì 5, 1, 2005, ñòð. 4046. c 2004 D'Apice, Manzo. INFORMATION THEORY AND INFORMATION PROCESSING Asymptotic Delay Distribution and Burst Size Impact on a Network Node Driven by
More informationIntro Refresher Reversibility Open networks Closed networks Multiclass networks Other networks. Queuing Networks. Florence Perronnin
Queuing Networks Florence Perronnin Polytech Grenoble - UGA March 23, 27 F. Perronnin (UGA) Queuing Networks March 23, 27 / 46 Outline Introduction to Queuing Networks 2 Refresher: M/M/ queue 3 Reversibility
More informationIntroduction to Queueing Theory
Introduction to Queueing Theory Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu Audio/Video recordings of this lecture are available at: http://www.cse.wustl.edu/~jain/cse567-11/
More informationA GENERALIZED MARKOVIAN QUEUE TO MODEL AN OPTICAL PACKET SWITCHING MULTIPLEXER
A GENERALIZED MARKOVIAN QUEUE TO MODEL AN OPTICAL PACKET SWITCHING MULTIPLEXER RAM CHAKKA Department of Computer Science Norfolk State University, USA TIEN VAN DO, ZSOLT PÁNDI Department of Telecommunications
More informationChapter 2. Poisson Processes. Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan
Chapter 2. Poisson Processes Prof. Shun-Ren Yang Department of Computer Science, National Tsing Hua University, Taiwan Outline Introduction to Poisson Processes Definition of arrival process Definition
More informationIntroduction to Markov Chains, Queuing Theory, and Network Performance
Introduction to Markov Chains, Queuing Theory, and Network Performance Marceau Coupechoux Telecom ParisTech, departement Informatique et Réseaux marceau.coupechoux@telecom-paristech.fr IT.2403 Modélisation
More informationDesign of IP networks with Quality of Service
Course of Multimedia Internet (Sub-course Reti Internet Multimediali ), AA 2010-2011 Prof. Pag. 1 Design of IP networks with Quality of Service 1 Course of Multimedia Internet (Sub-course Reti Internet
More informationM/G/1 and M/G/1/K systems
M/G/1 and M/G/1/K systems Dmitri A. Moltchanov dmitri.moltchanov@tut.fi http://www.cs.tut.fi/kurssit/elt-53606/ OUTLINE: Description of M/G/1 system; Methods of analysis; Residual life approach; Imbedded
More informationA FAST MATRIX-ANALYTIC APPROXIMATION FOR THE TWO CLASS GI/G/1 NON-PREEMPTIVE PRIORITY QUEUE
A FAST MATRIX-ANAYTIC APPROXIMATION FOR TE TWO CASS GI/G/ NON-PREEMPTIVE PRIORITY QUEUE Gábor orváth Department of Telecommunication Budapest University of Technology and Economics. Budapest Pf. 9., ungary
More informationChapter 1. Introduction. 1.1 Stochastic process
Chapter 1 Introduction Process is a phenomenon that takes place in time. In many practical situations, the result of a process at any time may not be certain. Such a process is called a stochastic process.
More informationContents LIST OF TABLES... LIST OF FIGURES... xvii. LIST OF LISTINGS... xxi PREFACE. ...xxiii
LIST OF TABLES... xv LIST OF FIGURES... xvii LIST OF LISTINGS... xxi PREFACE...xxiii CHAPTER 1. PERFORMANCE EVALUATION... 1 1.1. Performance evaluation... 1 1.2. Performance versus resources provisioning...
More informationRecap. Probability, stochastic processes, Markov chains. ELEC-C7210 Modeling and analysis of communication networks
Recap Probability, stochastic processes, Markov chains ELEC-C7210 Modeling and analysis of communication networks 1 Recap: Probability theory important distributions Discrete distributions Geometric distribution
More informationQueueing Theory. VK Room: M Last updated: October 17, 2013.
Queueing Theory VK Room: M1.30 knightva@cf.ac.uk www.vincent-knight.com Last updated: October 17, 2013. 1 / 63 Overview Description of Queueing Processes The Single Server Markovian Queue Multi Server
More informationSolutions to COMP9334 Week 8 Sample Problems
Solutions to COMP9334 Week 8 Sample Problems Problem 1: Customers arrive at a grocery store s checkout counter according to a Poisson process with rate 1 per minute. Each customer carries a number of items
More informationQueueing Networks G. Rubino INRIA / IRISA, Rennes, France
Queueing Networks G. Rubino INRIA / IRISA, Rennes, France February 2006 Index 1. Open nets: Basic Jackson result 2 2. Open nets: Internet performance evaluation 18 3. Closed nets: Basic Gordon-Newell result
More informationSolutions to Homework Discrete Stochastic Processes MIT, Spring 2011
Exercise 6.5: Solutions to Homework 0 6.262 Discrete Stochastic Processes MIT, Spring 20 Consider the Markov process illustrated below. The transitions are labelled by the rate q ij at which those transitions
More informationElementary queueing system
Elementary queueing system Kendall notation Little s Law PASTA theorem Basics of M/M/1 queue M/M/1 with preemptive-resume priority M/M/1 with non-preemptive priority 1 History of queueing theory An old
More informationInternet Traffic Modeling and Its Implications to Network Performance and Control
Internet Traffic Modeling and Its Implications to Network Performance and Control Kihong Park Department of Computer Sciences Purdue University park@cs.purdue.edu Outline! Motivation! Traffic modeling!
More informationClassical Queueing Models.
Sergey Zeltyn January 2005 STAT 99. Service Engineering. The Wharton School. University of Pennsylvania. Based on: Classical Queueing Models. Mandelbaum A. Service Engineering course, Technion. http://iew3.technion.ac.il/serveng2005w
More informationIn Proceedings of the 1997 Winter Simulation Conference, S. Andradottir, K. J. Healy, D. H. Withers, and B. L. Nelson, eds.
In Proceedings of the 1997 Winter Simulation Conference, S. Andradottir, K. J. Healy, D. H. Withers, and B. L. Nelson, eds. LONG-LASTING TRANSIENT CONDITIONS IN SIMULATIONS WITH HEAVY-TAILED WORKLOADS
More informationCS418 Operating Systems
CS418 Operating Systems Lecture 14 Queuing Analysis Textbook: Operating Systems by William Stallings 1 1. Why Queuing Analysis? If the system environment changes (like the number of users is doubled),
More informationMarkov processes and queueing networks
Inria September 22, 2015 Outline Poisson processes Markov jump processes Some queueing networks The Poisson distribution (Siméon-Denis Poisson, 1781-1840) { } e λ λ n n! As prevalent as Gaussian distribution
More informationClass 11 Non-Parametric Models of a Service System; GI/GI/1, GI/GI/n: Exact & Approximate Analysis.
Service Engineering Class 11 Non-Parametric Models of a Service System; GI/GI/1, GI/GI/n: Exact & Approximate Analysis. G/G/1 Queue: Virtual Waiting Time (Unfinished Work). GI/GI/1: Lindley s Equations
More informationA Measurement-Analytic Approach for QoS Estimation in a Network Based on the Dominant Time Scale
222 IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 11, NO. 2, APRIL 2003 A Measurement-Analytic Approach for QoS Estimation in a Network Based on the Dominant Time Scale Do Young Eun and Ness B. Shroff, Senior
More informationProbability and Statistics Concepts
University of Central Florida Computer Science Division COT 5611 - Operating Systems. Spring 014 - dcm Probability and Statistics Concepts Random Variable: a rule that assigns a numerical value to each
More informationName of the Student:
SUBJECT NAME : Probability & Queueing Theory SUBJECT CODE : MA 6453 MATERIAL NAME : Part A questions REGULATION : R2013 UPDATED ON : November 2017 (Upto N/D 2017 QP) (Scan the above QR code for the direct
More informationQueues and Queueing Networks
Queues and Queueing Networks Sanjay K. Bose Dept. of EEE, IITG Copyright 2015, Sanjay K. Bose 1 Introduction to Queueing Models and Queueing Analysis Copyright 2015, Sanjay K. Bose 2 Model of a Queue Arrivals
More informationExact Simulation of the Stationary Distribution of M/G/c Queues
1/36 Exact Simulation of the Stationary Distribution of M/G/c Queues Professor Karl Sigman Columbia University New York City USA Conference in Honor of Søren Asmussen Monday, August 1, 2011 Sandbjerg Estate
More informationPerformance Modelling of Computer Systems
Performance Modelling of Computer Systems Mirco Tribastone Institut für Informatik Ludwig-Maximilians-Universität München Fundamentals of Queueing Theory Tribastone (IFI LMU) Performance Modelling of Computer
More informationBefore proceeding to bad news: connection between heavy-tailedness and google? saga of two lucky kids (aka grad students ) lesson to be drawn?
Before proceeding to bad news: connection between heavy-tailedness and google? saga of two lucky kids (aka grad students ) lesson to be drawn? dave goliath Now, to the bad news! Bad news #1: queueing on
More informationTime Reversibility and Burke s Theorem
Queuing Analysis: Time Reversibility and Burke s Theorem Hongwei Zhang http://www.cs.wayne.edu/~hzhang Acknowledgement: this lecture is partially based on the slides of Dr. Yannis A. Korilis. Outline Time-Reversal
More informationComputer Systems Modelling
Computer Systems Modelling Computer Laboratory Computer Science Tripos, Part II Michaelmas Term 2003 R. J. Gibbens Problem sheet William Gates Building JJ Thomson Avenue Cambridge CB3 0FD http://www.cl.cam.ac.uk/
More informationPart II: continuous time Markov chain (CTMC)
Part II: continuous time Markov chain (CTMC) Continuous time discrete state Markov process Definition (Markovian property) X(t) is a CTMC, if for any n and any sequence t 1
More informationProbability Models in Electrical and Computer Engineering Mathematical models as tools in analysis and design Deterministic models Probability models
Probability Models in Electrical and Computer Engineering Mathematical models as tools in analysis and design Deterministic models Probability models Statistical regularity Properties of relative frequency
More informationGlossary availability cellular manufacturing closed queueing network coefficient of variation (CV) conditional probability CONWIP
Glossary availability The long-run average fraction of time that the processor is available for processing jobs, denoted by a (p. 113). cellular manufacturing The concept of organizing the factory into
More informationAdvanced Computer Networks Lecture 3. Models of Queuing
Advanced Computer Networks Lecture 3. Models of Queuing Husheng Li Min Kao Department of Electrical Engineering and Computer Science University of Tennessee, Knoxville Spring, 2016 1/13 Terminology of
More informationJ. MEDHI STOCHASTIC MODELS IN QUEUEING THEORY
J. MEDHI STOCHASTIC MODELS IN QUEUEING THEORY SECOND EDITION ACADEMIC PRESS An imprint of Elsevier Science Amsterdam Boston London New York Oxford Paris San Diego San Francisco Singapore Sydney Tokyo Contents
More informationDynamic resource sharing
J. Virtamo 38.34 Teletraffic Theory / Dynamic resource sharing and balanced fairness Dynamic resource sharing In previous lectures we have studied different notions of fair resource sharing. Our focus
More informationMulti Stage Queuing Model in Level Dependent Quasi Birth Death Process
International Journal of Statistics and Systems ISSN 973-2675 Volume 12, Number 2 (217, pp. 293-31 Research India Publications http://www.ripublication.com Multi Stage Queuing Model in Level Dependent
More informationqueue KTH, Royal Institute of Technology, Department of Microelectronics and Information Technology
Analysis of the Packet oss Process in an MMPP+M/M/1/K queue György Dán, Viktória Fodor KTH, Royal Institute of Technology, Department of Microelectronics and Information Technology {gyuri,viktoria}@imit.kth.se
More informationGI/M/1 and GI/M/m queuing systems
GI/M/1 and GI/M/m queuing systems Dmitri A. Moltchanov moltchan@cs.tut.fi http://www.cs.tut.fi/kurssit/tlt-2716/ OUTLINE: GI/M/1 queuing system; Methods of analysis; Imbedded Markov chain approach; Waiting
More informationM/G/1 and Priority Queueing
M/G/1 and Priority Queueing Richard T. B. Ma School of Computing National University of Singapore CS 5229: Advanced Compute Networks Outline PASTA M/G/1 Workload and FIFO Delay Pollaczek Khinchine Formula
More informationA matrix-analytic solution for the DBMAP/PH/1 priority queue
Queueing Syst (6) 53:17 145 DOI 117/s11134-6-836- A matrix-analytic solution for the DBMAP/PH/1 priority queue Ji-An Zhao Bo Li Xi-Ren Cao Ishfaq Ahmad Received: 18 September / Revised: November 5 C Science
More informationUNIVERSITY OF YORK. MSc Examinations 2004 MATHEMATICS Networks. Time Allowed: 3 hours.
UNIVERSITY OF YORK MSc Examinations 2004 MATHEMATICS Networks Time Allowed: 3 hours. Answer 4 questions. Standard calculators will be provided but should be unnecessary. 1 Turn over 2 continued on next
More informationTCOM 501: Networking Theory & Fundamentals. Lecture 6 February 19, 2003 Prof. Yannis A. Korilis
TCOM 50: Networking Theory & Fundamentals Lecture 6 February 9, 003 Prof. Yannis A. Korilis 6- Topics Time-Reversal of Markov Chains Reversibility Truncating a Reversible Markov Chain Burke s Theorem Queues
More informationCapacity management for packet-switched networks with heterogeneous sources. Linda de Jonge. Master Thesis July 29, 2009.
Capacity management for packet-switched networks with heterogeneous sources Linda de Jonge Master Thesis July 29, 2009 Supervisors Dr. Frank Roijers Prof. dr. ir. Sem Borst Dr. Andreas Löpker Industrial
More informationContinuous Time Processes
page 102 Chapter 7 Continuous Time Processes 7.1 Introduction In a continuous time stochastic process (with discrete state space), a change of state can occur at any time instant. The associated point
More informationNetworking = Plumbing. Queueing Analysis: I. Last Lecture. Lecture Outline. Jeremiah Deng. 29 July 2013
Networking = Plumbing TELE302 Lecture 7 Queueing Analysis: I Jeremiah Deng University of Otago 29 July 2013 Jeremiah Deng (University of Otago) TELE302 Lecture 7 29 July 2013 1 / 33 Lecture Outline Jeremiah
More informationCS 798: Homework Assignment 3 (Queueing Theory)
1.0 Little s law Assigned: October 6, 009 Patients arriving to the emergency room at the Grand River Hospital have a mean waiting time of three hours. It has been found that, averaged over the period of
More informationFigure 10.1: Recording when the event E occurs
10 Poisson Processes Let T R be an interval. A family of random variables {X(t) ; t T} is called a continuous time stochastic process. We often consider T = [0, 1] and T = [0, ). As X(t) is a random variable
More informationDiscrete Event Simulation IN2045
Chair for Network Architectures and Services Prof. Carle Department of Computer Science TU München Discrete Event Simulation IN2045 Dipl.-Inform. Alexander Klein Dr. Nils Kammenhuber Prof. Dr.-Ing Georg
More informationQueuing Theory and Stochas St t ochas ic Service Syste y ms Li Xia
Queuing Theory and Stochastic Service Systems Li Xia Syllabus Instructor Li Xia 夏俐, FIT 3 618, 62793029, xial@tsinghua.edu.cn Text book D. Gross, J.F. Shortle, J.M. Thompson, and C.M. Harris, Fundamentals
More informationStochastic Network Calculus
Stochastic Network Calculus Assessing the Performance of the Future Internet Markus Fidler joint work with Amr Rizk Institute of Communications Technology Leibniz Universität Hannover April 22, 2010 c
More informationStochastic Models in Computer Science A Tutorial
Stochastic Models in Computer Science A Tutorial Dr. Snehanshu Saha Department of Computer Science PESIT BSC, Bengaluru WCI 2015 - August 10 to August 13 1 Introduction 2 Random Variable 3 Introduction
More informationNon Markovian Queues (contd.)
MODULE 7: RENEWAL PROCESSES 29 Lecture 5 Non Markovian Queues (contd) For the case where the service time is constant, V ar(b) = 0, then the P-K formula for M/D/ queue reduces to L s = ρ + ρ 2 2( ρ) where
More informationNEW FRONTIERS IN APPLIED PROBABILITY
J. Appl. Prob. Spec. Vol. 48A, 209 213 (2011) Applied Probability Trust 2011 NEW FRONTIERS IN APPLIED PROBABILITY A Festschrift for SØREN ASMUSSEN Edited by P. GLYNN, T. MIKOSCH and T. ROLSKI Part 4. Simulation
More informationECE 3511: Communications Networks Theory and Analysis. Fall Quarter Instructor: Prof. A. Bruce McDonald. Lecture Topic
ECE 3511: Communications Networks Theory and Analysis Fall Quarter 2002 Instructor: Prof. A. Bruce McDonald Lecture Topic Introductory Analysis of M/G/1 Queueing Systems Module Number One Steady-State
More informationChapter 3 Balance equations, birth-death processes, continuous Markov Chains
Chapter 3 Balance equations, birth-death processes, continuous Markov Chains Ioannis Glaropoulos November 4, 2012 1 Exercise 3.2 Consider a birth-death process with 3 states, where the transition rate
More informationOverload Analysis of the PH/PH/1/K Queue and the Queue of M/G/1/K Type with Very Large K
Overload Analysis of the PH/PH/1/K Queue and the Queue of M/G/1/K Type with Very Large K Attahiru Sule Alfa Department of Mechanical and Industrial Engineering University of Manitoba Winnipeg, Manitoba
More informationSession-Based Queueing Systems
Session-Based Queueing Systems Modelling, Simulation, and Approximation Jeroen Horters Supervisor VU: Sandjai Bhulai Executive Summary Companies often offer services that require multiple steps on the
More informationExercises Stochastic Performance Modelling. Hamilton Institute, Summer 2010
Exercises Stochastic Performance Modelling Hamilton Institute, Summer Instruction Exercise Let X be a non-negative random variable with E[X ]
More informationIntro to Queueing Theory
1 Intro to Queueing Theory Little s Law M/G/1 queue Conservation Law 1/31/017 M/G/1 queue (Simon S. Lam) 1 Little s Law No assumptions applicable to any system whose arrivals and departures are observable
More informationDeparture Processes of a Tandem Network
The 7th International Symposium on perations Research and Its Applications (ISRA 08) Lijiang, China, ctober 31 Novemver 3, 2008 Copyright 2008 RSC & APRC, pp. 98 103 Departure Processes of a Tandem Network
More informationModelling the Arrival Process for Packet Audio
Modelling the Arrival Process for Packet Audio Ingemar Kaj and Ian Marsh 2 Dept. of Mathematics, Uppsala University, Sweden ikaj@math.uu.se 2 SICS AB, Stockholm, Sweden ianm@sics.se Abstract. Packets in
More informationEffect of the Traffic Bursts in the Network Queue
RICE UNIVERSITY Effect of the Traffic Bursts in the Network Queue by Alireza KeshavarzHaddad A Thesis Submitted in Partial Fulfillment of the Requirements for the Degree Master of Science Approved, Thesis
More informationCOMP9334 Capacity Planning for Computer Systems and Networks
COMP9334 Capacity Planning for Computer Systems and Networks Week 2: Operational Analysis and Workload Characterisation COMP9334 1 Last lecture Modelling of computer systems using Queueing Networks Open
More informationContents Preface The Exponential Distribution and the Poisson Process Introduction to Renewal Theory
Contents Preface... v 1 The Exponential Distribution and the Poisson Process... 1 1.1 Introduction... 1 1.2 The Density, the Distribution, the Tail, and the Hazard Functions... 2 1.2.1 The Hazard Function
More informationEvaluation of Effective Bandwidth Schemes for Self-Similar Traffic
Proceedings of the 3th ITC Specialist Seminar on IP Measurement, Modeling and Management, Monterey, CA, September 2000, pp. 2--2-0 Evaluation of Effective Bandwidth Schemes for Self-Similar Traffic Stefan
More informationBIRTH DEATH PROCESSES AND QUEUEING SYSTEMS
BIRTH DEATH PROCESSES AND QUEUEING SYSTEMS Andrea Bobbio Anno Accademico 999-2000 Queueing Systems 2 Notation for Queueing Systems /λ mean time between arrivals S = /µ ρ = λ/µ N mean service time traffic
More informationBirth-Death Processes
Birth-Death Processes Birth-Death Processes: Transient Solution Poisson Process: State Distribution Poisson Process: Inter-arrival Times Dr Conor McArdle EE414 - Birth-Death Processes 1/17 Birth-Death
More informationIEOR 6711, HMWK 5, Professor Sigman
IEOR 6711, HMWK 5, Professor Sigman 1. Semi-Markov processes: Consider an irreducible positive recurrent discrete-time Markov chain {X n } with transition matrix P (P i,j ), i, j S, and finite state space.
More informationCDA5530: Performance Models of Computers and Networks. Chapter 3: Review of Practical
CDA5530: Performance Models of Computers and Networks Chapter 3: Review of Practical Stochastic Processes Definition Stochastic ti process X = {X(t), t T} is a collection of random variables (rvs); one
More informationExploring regularities and self-similarity in Internet traffic
Exploring regularities and self-similarity in Internet traffic FRANCESCO PALMIERI and UGO FIORE Centro Servizi Didattico Scientifico Università degli studi di Napoli Federico II Complesso Universitario
More informationStatistics 150: Spring 2007
Statistics 150: Spring 2007 April 23, 2008 0-1 1 Limiting Probabilities If the discrete-time Markov chain with transition probabilities p ij is irreducible and positive recurrent; then the limiting probabilities
More information57:022 Principles of Design II Final Exam Solutions - Spring 1997
57:022 Principles of Design II Final Exam Solutions - Spring 1997 Part: I II III IV V VI Total Possible Pts: 52 10 12 16 13 12 115 PART ONE Indicate "+" if True and "o" if False: + a. If a component's
More information