Communication Networks II Contents


 Hillary Reed
 1 years ago
 Views:
Transcription
1 8 / 1  Communcaton Networs II (Görg)  Communcaton Networs II Contents 1 Fundamentals of probablty theory 2 Traffc n communcaton networs 3 Stochastc & Marovan Processes (SP & MP) 4 Fnte State Marovan Processes 5 Analyss of Marovan servce systems 6 Queues for modelng communcaton networs 7 M/G/1 model 8 The model M/G/1/FCFS/NONPRE 9 The model M/G/1/FCFS/PRE
2 8 / 2  Communcaton Networs II (Görg) The Model M/G/1/FCFS/NONPRE; statc prortes e consder the model n fgure 2.7 from chapter 2 wth several queues and ndependent Posson arrvals for the ndvdual queues. Each of the queues receves a prorty number (l N). The schedulng s nonpreemptve (NONPRE). That s, a newly arrvng job of any prorty never nterrupts the job n servce. Thus, ths s sutable for modelng of I/O traffc n real computers wth ther bac up memory, pacet swtchng and others. server Fgure 2.7 (see also chapter 2): Traffc Model
3 8 / 3  Communcaton Networs II (Görg)  Jobs of prorty are also called jobs of type. e agan consder the statonary equlbrum state of the system. For ths system hgh prorty queues can be n a stable state even for a total load exceedng one,.e. > 1. The type random varables nterarrval tme TA and servce tme T B are consdered to be statstcally ndependent and negatveexponentally (for T A A ) and generally (G) (for T ) dstrbuted. B e ntroduce a new arrval rate λ, whch gves the sum of arrval rates of all prortes less than or equal to. 1. (8.1) A sum of several Posson processes produces agan a Posson process [Cha 1]. In addton, we defne the rth moment of weghted servce tme dstrbuton of the jobs belongng to the set of the hghest prortes through ( r) 1 ( r) (8.2)
4 8 / 4  Communcaton Networs II (Görg)  Now, we get the total traffc load produced by prortes 1 to as gven below: 1 1 (8.3) Thus N corresponds to the overall traffc load of the M/G/1 model. Also n ths case, t s possble to derve the generatng functon of the queue length dstrbuton and the LST of the watng tme dstrbuton. However, the dervaton s more complcated than n the case wthout prortes. Thus we lmt ourselves to the computaton of the mean watng tme. e observe a test job of prorty from ts arrval to departure and follow ts fate n the model: At the arrval of the test t job there are n watng jobs belongng to the prorty class (=1,2,...,N) plus the job n servce n case of a busy system. Obvously the test job cannot receve servce, f there are unserved ed jobs n the same or hgher prorty queue. e In addton to that t has to wat due to all the hgher prorty jobs (prorty 1 to 1), that arrve durng the watng tme of the test job.
5 8 / 5  Communcaton Networs II (Görg) 
6 8 / 6  Communcaton Networs II (Görg)  The mean watng tme of the test job conssts of three components: 0 (8.4) 0 s the mean of the remanng servce tme of the job, that s beng served at arrval. s the mean of the so called vrtual watng tme, whch corresponds to the sum of servce tmes of all type 1 to jobs watng at arrval of the test job. The mean of ths number s gven by n 1 +n n. s the mean of the total servce tmes of all hgher (than ) )prorty yjobs that arrve durng the full watng tme of the test job. Let us calculate these three components one by one. 0: 2 For a sngle prorty system we have 0 () / 2. Extendng ths result for N prortes through weghted addton, we get N 1 () 2 1 () 2 0 NN 2 1 2
7 8 / 7  Communcaton Networs II (Görg)  : Tang the fact, that we can group the jobs for summaton ndependent of ther actual servce order due to the from system and schedulng strategy ndependent Posson arrval process, we can wrte for 1 E( n) where E(n ) s the expected number of prorty jobs watng at arrval of the test job. As Lttle s law s applcable for each of the ndvdual d prortes separately, we can wrte E(n )= (and also L = V ). Thus, we get wth = 1 1
8 8 / 8  Communcaton Networs II (Görg)  : The mean number of prorty jobs arrvng durng the watng tme of the test job s. Thus smlar to we get Ths leads to (8.5) N 1 ( 2 )
9 8 / 9  Communcaton Networs II (Görg)  The fnal expresson s obtaned by mathematcal nducton N () 2 () 2 1 NN ( )( ) ( )( ) (8.5a) As we are nterested n the cdf of the watng tme, we also state the 2nd moment as well. e use the followng abbrevatons: () 2 () 1 NN 2 1 ( ) () 3 () 2 () 2 () 2 NN NN 2 31 ( ) 2 ( 1 ) under the condton N <1 we get the frst and second moments of the watng tme to be () 1 () 2 1 ( 1 ) ( 2 ) ( 1 ) ( 2 ) 2 3 ( 1 ) ( 1 ) (8.6) (8.7) (8.8) (8.9)
10 8 / Communcaton Networs II (Görg)  Themeansystemtmeofaprorty tme a job s V (8.10) and the mean number of type jobs n the system s [Lt 1] L V (8.11) The probablty blt for an dle system s P{ dle} 1 N (8.12) Ths result holds for any servce tme dstrbuton.
11 8 / Communcaton Networs II (Görg)  Fgure 8.1: Normalzed mean watng tme of prorty jobs as a functon of the traffc load N for the model M/M/1/FCFS/NONPRE. It holds 1 = 2 = = and =/N wth =. The dashed curve holds for the model M/M/1/FCFS. a) N=2 b) N=5
12 8 / Communcaton Networs II (Görg)  Fgure 8.1 shows two examples (N=2 and d5) for the model M/M/1/FCFS/NONPRE wth dentcal servce tme dstrbuton for all jobs and wth unformly dstrbuted traffc load over all the prortes ( = N /N). The results for the FCFS model wthout prortes (Fgure 5.9) s also shown for comparson. In contrast to fgure 7.5, where the type of the job was dentfed accordng to ts servce tme t, all the servce tme duratons occur for each of the prortes n ths system. e see that for the least mportant prorty =N, even at smallest total traffc load N, the nstablty level s reached whereas for the most mportant prorty =1 1even for N >1 stll fnte mean watng tmes preval. Ths behavor s due to the fact that the lowest prorty receves hgh preference and reaches hgh mean watng tmes only for the case where ts own traffc load 1 (n ths example 1 = N /N) approaches 1. However, for the computaton of the moments of watng tme for a saturated arrval process N > 1, results whch are also shown n fgure 8.1, we have to nclude addtonal condton equatons (8.5) and (8.9).
13 8 / Communcaton Networs II (Görg)  A statonary equlbrum s possble n the model n Fgure 2.7 only for the prortes wth <1 [Cob 1], [Ja 1]. Only the jobs n these prortes experence fnte watng tme. Jobs n prortes > have to wat for an nfnte duraton wth probablty 1. For the computaton of moments of watng tme, we frst fnd out the number N, satsfyng the condton (1) <1,.e., we determne the prorty, whose traffc load saturates the system. Then, for the computatons usng equatons (8.7) and (8.8), should be lmted n such a way that =1. All the traffc loads n prortes wth (<N) must be set equal to zero. Ths approach results from the method of dervaton of the formulas to compute moments of the watng tme. Unfortunately, ths lmtaton s often omtted n lterature.
14 8 / Communcaton Networs II (Görg) The varance of the watng tme of jobs n prorty can be calculated () 1 wth from 2 (2) 2. (8.13) Fgure 8.2 shows the standard devaton normalzed w. r. t. expected servce tme, / for the same example n fgure 8.1 wth N=5 5 prortes. Fgure 8.2: Normalzed standard devaton for the Model M/M/1/FCFS/NONPRE; Parameter as n Fgure 8.1
15 8 / Communcaton Networs II (Görg)  Introducton of prortes always ncreases the varance and the hgher moments of the watng tme dstrbuton of all the jobs havng prortes hgher than =1 compared to the system wthout prortes. Explct reverse transformaton of the LST of watng tme dstrbuton of types >1 s not possble even for the smplest model M/M/1/FCFS/NONPRE. The possblty of approxmatng the watng tme dstrbuton through a hyperexponental p dstrbuton n such a way that at least the most mportant moments match remans. The other opton s to get the dstrbuton through smulaton. In the model descrbed below, the overheads for swtchng from one job to another are consdered n such a way that they get added to the servce tme of the job.
16 8 / Communcaton Networs II (Görg) Mnmum common mean watng tme n model M/G/1/FCFS/NONPRE There are applcaton examples, where a group of N dfferent job types can exst that are prncpally raned equally. As an example, we are only nterested n the goal that the mean watng tme of the jobs n group ( 1 ) N s as small as possble. The rth moment of the watng tme dstrbuton correspondng to jobs n ths group s defned through () r N N 1 N () r N For r=1 we also wrte ths n the form. (8.14) In cases where the servce tme s not nown but the mean of the group the job belongs to s nown n advance, t s possble to allocate external prortes n such a way that the mean watng tme s nfluenced. As shown n [Con 1], [Ja 1] the overall mean watng tme (and also the overall mean system tme) become mnmal, f the prortes are assgned accordng to the ncreasng order of the mean servce tme of the group. That means the prortes are allocated n such a way that the condton < +1 s always satsfed.
17 8 / Communcaton Networs II (Görg)  If we assume a lnear cost factor g for jobs of type (=1,2,...,N) then the average cost per job,.e., the mean watng cost s gven by N N 1 N 1 g g (8.15) In order to mae sure that ths quantty becomes a mnmum the followng condton needs to be satsfed: 1 2 N L L g g g g 1 2 (1 stands for the hghest prorty). N (8.16) For a general evaluaton functon g (t) the prortes are best assgned [Ol 1] for the types and j n such a way that the condton gven below s satsfed g ( t ) dp ( TB t ) gj ( t ) dpj ( TB t ) 0 0 (8.17) tdp ( T t) tdp ( T t) 0 B 0 j B Type jobs should have a hgher prorty than type j jobs.
18 8 / Communcaton Networs II (Görg)  If we schedule the jobs accordng to FCFS wthout external prortes then we get the frst and second moments of the watng tme to be, see also equatons (7.24) and (7.28) of the M/G/1 system. () 1 FCFS FCFS () 2 N N N 2 ( 1 ) (8.18) N N 2 FCFS 31 ( ) () 2 2 FCFS () 3 N (8.19) th ths, the comparson between dfferent prorty allocatons s made possble, that can be used to select the prortes n an optmal way.
19 8 / Communcaton Networs II (Görg) The model M/G/1//SJF /SJF revsted t Now, we derve the results n 7.4 n a smple manner, usng the results for the nonpreemptve external prorty example. e now assume that the servce tme of all the jobs are nown at arrval. After each completon the shortest job n the queue s selected for processng as the next. For smplcty we assume dscrete servce tmes: g (=1,2,...) are the probabltes, that a job needs Q unts of servce tme. g s the arrval rate of jobs that need exactly unts of duraton Q. Ths system can be represented as shown n fgure 2.7, as the arrvals n the ndvdual types also happen to be Posson dstrbuted due to the addtve nature of the Posson process, wth g n place of. By replacng through g and through Q g n equaton (8.4), we get the mean watng tme of a job wth unts of servce tme where H () 2 2 ( 1 H )( 1 H1 ) ( Q) g 1
20 8 / Communcaton Networs II (Görg)  For the lmtng case of contnuous servce tme dstrbuton, we get the result by replacng Q through the dfferental tme element and g through the servce tme densty functon. For Q0, we get the condtonal watng tme of jobs, that have a servce tme of t, as gven n equaton 7.36.a.
21 8 / Communcaton Networs II (Görg) 
22 8 / Communcaton Networs II (Görg) 
23 8 / Communcaton Networs II (Görg) 
1. Fundamentals of probability theory 2. Emergence of communication traffic 3. Stochastic & Markovian Processes (SP & MP)
6.3 /  Communcaton Networks II (Görg) SS20  www.comnets.unbremen.de Communcaton Networks II Contents. Fundamentals of probablty theory 2. Emergence of communcaton traffc 3. Stochastc & Markovan Processes
More informationChapter 7. RandomVariate Generation 7.1. Prof. Dr. Mesut Güneş Ch. 7 RandomVariate Generation
Chapter 7 RandomVarate Generaton 7. Contents Inversetransform Technque AcceptanceRejecton Technque Specal Propertes 7. Purpose & Overvew Develop understandng of generatng samples from a specfed dstrbuton
More information1 Approximation Algorithms
CME 305: Dscrete Mathematcs and Algorthms 1 Approxmaton Algorthms In lght of the apparent ntractablty of the problems we beleve not to le n P, t makes sense to pursue deas other than complete solutons
More informationMAC Layer Service Time Distribution of a Fixed Priority Real Time Scheduler over 802.11
Internatonal Journal of Software Engneerng and Its Applcatons Vol., No., Aprl, 008 MAC Layer Servce Tme Dstrbuton of a Fxed Prorty Real Tme Scheduler over 80. Inès El Korb Ecole Natonale des Scences de
More informationRecurrence. 1 Definitions and main statements
Recurrence 1 Defntons and man statements Let X n, n = 0, 1, 2,... be a MC wth the state space S = (1, 2,...), transton probabltes p j = P {X n+1 = j X n = }, and the transton matrx P = (p j ),j S def.
More informationPerformance Analysis of MultiServer based on ProcessorSharing Queue
Performance Analyss of MultServer based on ProcessorSharng Queue Xaofeng Zhang*, Baoqun Yn* and Hao Sh* *Department of Automaton Unversty of Scence and Technology of Chna, Hefe, Chna zhxf325@mal.ustc.edu.cn,bqyn@ustc.edu.cn,haosh@mal.ustc.edu.cn
More informationThe Performance Analysis Of A M/M/2/2+1 Retrial Queue With Unreliable Server
Journal of Statstcal Scence and Applcaton, October 5, Vol. 3, No. 9, 6374 do:.765/384/5.9.3 D DAV I D PUBLISHING The Performance Analyss Of A M/M//+ Retral Queue Wth Unrelable Server R. Kalyanaraman
More informationExtending Probabilistic Dynamic Epistemic Logic
Extendng Probablstc Dynamc Epstemc Logc Joshua Sack May 29, 2008 Probablty Space Defnton A probablty space s a tuple (S, A, µ), where 1 S s a set called the sample space. 2 A P(S) s a σalgebra: a set
More informationAn Analysis of Central Processor Scheduling in Multiprogrammed Computer Systems
STANCS73355 I SUSE73013 An Analyss of Central Processor Schedulng n Multprogrammed Computer Systems (Dgest Edton) by Thomas G. Prce October 1972 Techncal Report No. 57 Reproducton n whole or n part
More informationbenefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).
REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or
More informationCalculation of Sampling Weights
Perre Foy Statstcs Canada 4 Calculaton of Samplng Weghts 4.1 OVERVIEW The basc sample desgn used n TIMSS Populatons 1 and 2 was a twostage stratfed cluster desgn. 1 The frst stage conssted of a sample
More informationTHE TITANIC SHIPWRECK: WHO WAS
THE TITANIC SHIPWRECK: WHO WAS MOST LIKELY TO SURVIVE? A STATISTICAL ANALYSIS Ths paper examnes the probablty of survvng the Ttanc shpwreck usng lmted dependent varable regresson analyss. Ths appled analyss
More informationOptimal outpatient appointment scheduling
Health Care Manage Sc (27) 1:217 229 DOI 1.17/s17297915 Optmal outpatent appontment schedulng Gudo C. Kaandorp Ger Koole Receved: 15 March 26 / Accepted: 28 February 27 / Publshed onlne: 23 May 27 Sprnger
More informationAnalysis of EnergyConserving Access Protocols for Wireless Identification Networks
From the Proceedngs of Internatonal Conference on Telecommuncaton Systems (ITC97), March 223, 1997. 1 Analyss of EnergyConservng Access Protocols for Wreless Identfcaton etworks Imrch Chlamtac a, Chara
More information106 M.R. Akbar Jokar and M. Sefbarghy polcy, ndependent Posson demands n the retalers, a backordered demand durng stockouts n all nstallatons and cons
Scenta Iranca, Vol. 13, No. 1, pp 105{11 c Sharf Unversty of Technology, January 006 Research Note Cost Evaluaton of a TwoEchelon Inventory System wth Lost Sales and Approxmately Normal Demand M.R. Akbar
More informationThe Greedy Method. Introduction. 0/1 Knapsack Problem
The Greedy Method Introducton We have completed data structures. We now are gong to look at algorthm desgn methods. Often we are lookng at optmzaton problems whose performance s exponental. For an optmzaton
More informationThe OC Curve of Attribute Acceptance Plans
The OC Curve of Attrbute Acceptance Plans The Operatng Characterstc (OC) curve descrbes the probablty of acceptng a lot as a functon of the lot s qualty. Fgure 1 shows a typcal OC Curve. 10 8 6 4 1 3 4
More informationGraph Theory and Cayley s Formula
Graph Theory and Cayley s Formula Chad Casarotto August 10, 2006 Contents 1 Introducton 1 2 Bascs and Defntons 1 Cayley s Formula 4 4 Prüfer Encodng A Forest of Trees 7 1 Introducton In ths paper, I wll
More informationPSYCHOLOGICAL RESEARCH (PYC 304C) Lecture 12
14 The Chsquared dstrbuton PSYCHOLOGICAL RESEARCH (PYC 304C) Lecture 1 If a normal varable X, havng mean µ and varance σ, s standardsed, the new varable Z has a mean 0 and varance 1. When ths standardsed
More informationPerformance Analysis of Energy Consumption of Smartphone Running Mobile Hotspot Application
Internatonal Journal of mart Grd and lean Energy Performance Analyss of Energy onsumpton of martphone Runnng Moble Hotspot Applcaton Yun on hung a chool of Electronc Engneerng, oongsl Unversty, 511 angdodong,
More information8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by
6 CHAPTER 8 COMPLEX VECTOR SPACES 5. Fnd the kernel of the lnear transformaton gven n Exercse 5. In Exercses 55 and 56, fnd the mage of v, for the ndcated composton, where and are gven by the followng
More informationI. SCOPE, APPLICABILITY AND PARAMETERS Scope
D Executve Board Annex 9 Page A/R ethodologcal Tool alculaton of the number of sample plots for measurements wthn A/R D project actvtes (Verson 0) I. SOPE, PIABIITY AD PARAETERS Scope. Ths tool s applcable
More informationTHE DISTRIBUTION OF LOAN PORTFOLIO VALUE * Oldrich Alfons Vasicek
HE DISRIBUION OF LOAN PORFOLIO VALUE * Oldrch Alfons Vascek he amount of captal necessary to support a portfolo of debt securtes depends on the probablty dstrbuton of the portfolo loss. Consder a portfolo
More information2.4 Bivariate distributions
page 28 2.4 Bvarate dstrbutons 2.4.1 Defntons Let X and Y be dscrete r.v.s defned on the same probablty space (S, F, P). Instead of treatng them separately, t s often necessary to thnk of them actng together
More informationMulticlass MultiServer Thresholdbased Systems: a. Study of Noninstantaneous Server Activation
Multclass MultServer Thresholdbased Systems: a Study of Nonnstantaneous Server Actvaton 1 ChengFu Chou, Leana Golubchk, and John C. S. Lu Abstract In ths paper, we consder performance evaluaton of
More informationII. PROBABILITY OF AN EVENT
II. PROBABILITY OF AN EVENT As ndcated above, probablty s a quantfcaton, or a mathematcal model, of a random experment. Ths quantfcaton s a measure of the lkelhood that a gven event wll occur when the
More informationTHE METHOD OF LEAST SQUARES THE METHOD OF LEAST SQUARES
The goal: to measure (determne) an unknown quantty x (the value of a RV X) Realsaton: n results: y 1, y 2,..., y j,..., y n, (the measured values of Y 1, Y 2,..., Y j,..., Y n ) every result s encumbered
More informationCALL ADMISSION CONTROL IN WIRELESS MULTIMEDIA NETWORKS
CALL ADMISSION CONTROL IN WIRELESS MULTIMEDIA NETWORKS Novella Bartoln 1, Imrch Chlamtac 2 1 Dpartmento d Informatca, Unverstà d Roma La Sapenza, Roma, Italy novella@ds.unroma1.t 2 Center for Advanced
More informationThe Probit Model. Alexander Spermann. SoSe 2009
The Probt Model Aleander Spermann Unversty of Freburg SoSe 009 Course outlne. Notaton and statstcal foundatons. Introducton to the Probt model 3. Applcaton 4. Coeffcents and margnal effects 5. Goodnessofft
More informationBasic Queueing Theory M/M/* Queues. Introduction
Basc Queueng Theory M/M/* Queues These sldes are created by Dr. Yh Huang of George Mason Unversty. Students regstered n Dr. Huang's courses at GMU can ake a sngle achnereadable copy and prnt a sngle copy
More informationb) The mean of the fitted (predicted) values of Y is equal to the mean of the Y values: c) The residuals of the regression line sum up to zero: = ei
Mathematcal Propertes of the Least Squares Regresson The least squares regresson lne obeys certan mathematcal propertes whch are useful to know n practce. The followng propertes can be establshed algebracally:
More informationRapid Estimation Method for Data Capacity and Spectrum Efficiency in Cellular Networks
Rapd Estmaton ethod for Data Capacty and Spectrum Effcency n Cellular Networs C.F. Ball, E. Humburg, K. Ivanov, R. üllner Semens AG, Communcatons oble Networs unch, Germany carsten.ball@semens.com Abstract
More informationTime Series Analysis in Studies of AGN Variability. Bradley M. Peterson The Ohio State University
Tme Seres Analyss n Studes of AGN Varablty Bradley M. Peterson The Oho State Unversty 1 Lnear Correlaton Degree to whch two parameters are lnearly correlated can be expressed n terms of the lnear correlaton
More informationCase Study: Load Balancing
Case Study: Load Balancng Thursday, 01 June 2006 Bertol Marco A.A. 2005/2006 Dmensonamento degl mpant Informatc LoadBal  1 Introducton Optmze the utlzaton of resources to reduce the user response tme
More informationThe Development of Web Log Mining Based on ImproveKMeans Clustering Analysis
The Development of Web Log Mnng Based on ImproveKMeans Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna wangtngzhong2@sna.cn Abstract.
More informationValue Driven Load Balancing
Value Drven Load Balancng Sherwn Doroud a, Esa Hyytä b,1, Mor HarcholBalter c,2 a Tepper School of Busness, Carnege Mellon Unversty, 5000 Forbes Ave., Pttsburgh, PA 15213 b Department of Communcatons
More informationdenote the location of a node, and suppose node X . This transmission causes a successful reception by node X for any other node
Fnal Report of EE359 Class Proect Throughput and Delay n Wreless Ad Hoc Networs Changhua He changhua@stanford.edu Abstract: Networ throughput and pacet delay are the two most mportant parameters to evaluate
More informationErrorPropagation.nb 1. Error Propagation
ErrorPropagaton.nb Error Propagaton Suppose that we make observatons of a quantty x that s subject to random fluctuatons or measurement errors. Our best estmate of the true value for ths quantty s then
More informationMoment of a force about a point and about an axis
3. STATICS O RIGID BODIES In the precedng chapter t was assumed that each of the bodes consdered could be treated as a sngle partcle. Such a vew, however, s not always possble, and a body, n general, should
More informationA Novel Methodology of Working Capital Management for Large. Public Constructions by Using Fuzzy Scurve Regression
Novel Methodology of Workng Captal Management for Large Publc Constructons by Usng Fuzzy Scurve Regresson ChengWu Chen, Morrs H. L. Wang and TngYa Hseh Department of Cvl Engneerng, Natonal Central Unversty,
More informationRiskbased Fatigue Estimate of Deep Water Risers  Course Project for EM388F: Fracture Mechanics, Spring 2008
Rskbased Fatgue Estmate of Deep Water Rsers  Course Project for EM388F: Fracture Mechancs, Sprng 2008 Chen Sh Department of Cvl, Archtectural, and Envronmental Engneerng The Unversty of Texas at Austn
More informationProject Networks With MixedTime Constraints
Project Networs Wth MxedTme Constrants L Caccetta and B Wattananon Western Australan Centre of Excellence n Industral Optmsaton (WACEIO) Curtn Unversty of Technology GPO Box U1987 Perth Western Australa
More informationChapter 3 Group Theory p. 1  Remark: This is only a brief summary of most important results of groups theory with respect
Chapter 3 Group Theory p.  3. Compact Course: Groups Theory emark: Ths s only a bref summary of most mportant results of groups theory wth respect to the applcatons dscussed n the followng chapters. For
More informationNasdaq Iceland Bond Indices 01 April 2015
Nasdaq Iceland Bond Indces 01 Aprl 2015 Fxed duraton Indces Introducton Nasdaq Iceland (the Exchange) began calculatng ts current bond ndces n the begnnng of 2005. They were a response to recent changes
More informationA Lyapunov Optimization Approach to Repeated Stochastic Games
PROC. ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, OCT. 2013 1 A Lyapunov Optmzaton Approach to Repeated Stochastc Games Mchael J. Neely Unversty of Southern Calforna http://wwwbcf.usc.edu/
More informationPAS: A Packet Accounting System to Limit the Effects of DoS & DDoS. Debish Fesehaye & Klara Naherstedt University of IllinoisUrbana Champaign
PAS: A Packet Accountng System to Lmt the Effects of DoS & DDoS Debsh Fesehaye & Klara Naherstedt Unversty of IllnosUrbana Champagn DoS and DDoS DDoS attacks are ncreasng threats to our dgtal world. Exstng
More informationLecture 2: Absorbing states in Markov chains. Mean time to absorption. WrightFisher Model. Moran Model.
Lecture 2: Absorbng states n Markov chans. Mean tme to absorpton. WrghtFsher Model. Moran Model. Antonna Mtrofanova, NYU, department of Computer Scence December 8, 2007 Hgher Order Transton Probabltes
More informationRealTime Process Scheduling
RealTme Process Schedulng ktw@cse.ntu.edu.tw (RealTme and Embedded Systems Laboratory) Independent Process Schedulng Processes share nothng but CPU Papers for dscussons: C.L. Lu and James. W. Layland,
More informationA Note on the Decomposition of a Random Sample Size
A Note on the Decomposton of a Random Sample Sze Klaus Th. Hess Insttut für Mathematsche Stochastk Technsche Unverstät Dresden Abstract Ths note addresses some results of Hess 2000) on the decomposton
More informationModule 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..
More informationThis paper concerns the evaluation and analysis of order
ORDERFULFILLMENT PERFORMANCE MEASURES IN AN ASSEMBLE TOORDER SYSTEM WITH STOCHASTIC LEADTIMES JINGSHENG SONG Unversty of Calforna, Irvne, Calforna SUSAN H. XU Penn State Unversty, Unversty Park, Pennsylvana
More informationANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING
ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING Matthew J. Lberatore, Department of Management and Operatons, Vllanova Unversty, Vllanova, PA 19085, 6105194390,
More informationEfficient Project Portfolio as a tool for Enterprise Risk Management
Effcent Proect Portfolo as a tool for Enterprse Rsk Management Valentn O. Nkonov Ural State Techncal Unversty Growth Traectory Consultng Company January 5, 27 Effcent Proect Portfolo as a tool for Enterprse
More informationOn the Optimal Control of a Cascade of HydroElectric Power Stations
On the Optmal Control of a Cascade of HydroElectrc Power Statons M.C.M. Guedes a, A.F. Rbero a, G.V. Smrnov b and S. Vlela c a Department of Mathematcs, School of Scences, Unversty of Porto, Portugal;
More informationx f(x) 1 0.25 1 0.75 x 1 0 1 1 0.04 0.01 0.20 1 0.12 0.03 0.60
BIVARIATE DISTRIBUTIONS Let be a varable that assumes the values { 1,,..., n }. Then, a functon that epresses the relatve frequenc of these values s called a unvarate frequenc functon. It must be true
More informationInequality and The Accounting Period. Quentin Wodon and Shlomo Yitzhaki. World Bank and Hebrew University. September 2001.
Inequalty and The Accountng Perod Quentn Wodon and Shlomo Ytzha World Ban and Hebrew Unversty September Abstract Income nequalty typcally declnes wth the length of tme taen nto account for measurement.
More information1. Measuring association using correlation and regression
How to measure assocaton I: Correlaton. 1. Measurng assocaton usng correlaton and regresson We often would lke to know how one varable, such as a mother's weght, s related to another varable, such as a
More information9.1 The Cumulative Sum Control Chart
Learnng Objectves 9.1 The Cumulatve Sum Control Chart 9.1.1 Basc Prncples: Cusum Control Chart for Montorng the Process Mean If s the target for the process mean, then the cumulatve sum control chart s
More informationA DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATIONBASED OPTIMIZATION. Michael E. Kuhl Radhamés A. TolentinoPeña
Proceedngs of the 2008 Wnter Smulaton Conference S. J. Mason, R. R. Hll, L. Mönch, O. Rose, T. Jefferson, J. W. Fowler eds. A DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATIONBASED OPTIMIZATION
More informationPortfolio Loss Distribution
Portfolo Loss Dstrbuton Rsky assets n loan ortfolo hghly llqud assets holdtomaturty n the bank s balance sheet Outstandngs The orton of the bank asset that has already been extended to borrowers. Commtment
More informationJoint Resource Allocation and BaseStation. Assignment for the Downlink in CDMA Networks
Jont Resource Allocaton and BaseStaton 1 Assgnment for the Downlnk n CDMA Networks Jang Won Lee, Rav R. Mazumdar, and Ness B. Shroff School of Electrcal and Computer Engneerng Purdue Unversty West Lafayette,
More informationRECOGNIZING DIFFERENT TYPES OF STOCHASTIC PROCESSES
RECOGNIZING DIFFERENT TYPES OF STOCHASTIC PROCESSES JONG U. KIM AND LASZLO B. KISH Department of Electrcal and Computer Engneerng, Texas A&M Unversty, College Staton, TX 778418, USA Receved (receved date)
More informationA New Quality of Service Metric for Hard/Soft RealTime Applications
A New Qualty of Servce Metrc for Hard/Soft RealTme Applcatons Shaoxong Hua and Gang Qu Electrcal and Computer Engneerng Department and Insttute of Advanced Computer Study Unversty of Maryland, College
More informationState function: eigenfunctions of hermitian operators> normalization, orthogonality completeness
Schroednger equaton Basc postulates of quantum mechancs. Operators: Hermtan operators, commutators State functon: egenfunctons of hermtan operators> normalzaton, orthogonalty completeness egenvalues and
More informationModeling and Analysis of 2D Service Differentiation on ecommerce Servers
Modelng and Analyss of D Servce Dfferentaton on ecommerce Servers Xaobo Zhou, Unversty of Colorado, Colorado Sprng, CO zbo@cs.uccs.edu Janbn We and ChengZhong Xu Wayne State Unversty, Detrot, Mchgan
More informationChapter 4 ECONOMIC DISPATCH AND UNIT COMMITMENT
Chapter 4 ECOOMIC DISATCH AD UIT COMMITMET ITRODUCTIO A power system has several power plants. Each power plant has several generatng unts. At any pont of tme, the total load n the system s met by the
More informationCHOLESTEROL REFERENCE METHOD LABORATORY NETWORK. Sample Stability Protocol
CHOLESTEROL REFERENCE METHOD LABORATORY NETWORK Sample Stablty Protocol Background The Cholesterol Reference Method Laboratory Network (CRMLN) developed certfcaton protocols for total cholesterol, HDL
More informationSPEE Recommended Evaluation Practice #6 Definition of Decline Curve Parameters Background:
SPEE Recommended Evaluaton Practce #6 efnton of eclne Curve Parameters Background: The producton hstores of ol and gas wells can be analyzed to estmate reserves and future ol and gas producton rates and
More informationSolutions to the exam in SF2862, June 2009
Solutons to the exam n SF86, June 009 Exercse 1. Ths s a determnstc perodcrevew nventory model. Let n = the number of consdered wees,.e. n = 4 n ths exercse, and r = the demand at wee,.e. r 1 = r = r
More informationOpen Access A Load Balancing Strategy with Bandwidth Constraint in Cloud Computing. Jing Deng 1,*, Ping Guo 2, Qi Li 3, Haizhu Chen 1
Send Orders for Reprnts to reprnts@benthamscence.ae The Open Cybernetcs & Systemcs Journal, 2014, 8, 115121 115 Open Access A Load Balancng Strategy wth Bandwdth Constrant n Cloud Computng Jng Deng 1,*,
More informationAnswer: A). There is a flatter IS curve in the high MPC economy. Original LM LM after increase in M. IS curve for low MPC economy
4.02 Quz Solutons Fall 2004 MultpleChoce Questons (30/00 ponts) Please, crcle the correct answer for each of the followng 0 multplechoce questons. For each queston, only one of the answers s correct.
More informationSection 4.1 Random Variables
Secton 4.1 Random Varables Oftentmes, we are not nterested n the specfc outcome of an experment. Instead, we are nterested n a functon of the outcome. EXAMPLE: Consder rollng a far de twce. S = {(, j)
More informationWhat is Candidate Sampling
What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble
More informationDEFINING %COMPLETE IN MICROSOFT PROJECT
CelersSystems DEFINING %COMPLETE IN MICROSOFT PROJECT PREPARED BY James E Aksel, PMP, PMISP, MVP For Addtonal Informaton about Earned Value Management Systems and reportng, please contact: CelersSystems,
More informationQuantization Effects in Digital Filters
Quantzaton Effects n Dgtal Flters Dstrbuton of Truncaton Errors In two's complement representaton an exact number would have nfntely many bts (n general). When we lmt the number of bts to some fnte value
More informationEfficient Bandwidth Management in Broadband Wireless Access Systems Using CACbased Dynamic Pricing
Effcent Bandwdth Management n Broadband Wreless Access Systems Usng CACbased Dynamc Prcng Bader AlManthar, Ndal Nasser 2, Najah Abu Al 3, Hossam Hassanen Telecommuncatons Research Laboratory School of
More information9 Arithmetic and Geometric Sequence
AAU  Busness Mathematcs I Lecture #5, Aprl 4, 010 9 Arthmetc and Geometrc Sequence Fnte sequence: 1, 5, 9, 13, 17 Fnte seres: 1 + 5 + 9 + 13 +17 Infnte sequence: 1,, 4, 8, 16,... Infnte seres: 1 + + 4
More informationv a 1 b 1 i, a 2 b 2 i,..., a n b n i.
SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 455 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces we have studed thus far n the text are real vector spaces snce the scalars are
More informationLevel Annuities with Payments Less Frequent than Each Interest Period
Level Annutes wth Payments Less Frequent than Each Interest Perod 1 Annutymmedate 2 Annutydue Level Annutes wth Payments Less Frequent than Each Interest Perod 1 Annutymmedate 2 Annutydue Symoblc approach
More informationJoint Scheduling of Processing and Shuffle Phases in MapReduce Systems
Jont Schedulng of Processng and Shuffle Phases n MapReduce Systems Fangfe Chen, Mural Kodalam, T. V. Lakshman Department of Computer Scence and Engneerng, The Penn State Unversty Bell Laboratores, AlcatelLucent
More informationLecture 10: Linear Regression Approach, Assumptions and Diagnostics
Approach to Modelng I Lecture 1: Lnear Regresson Approach, Assumptons and Dagnostcs Sandy Eckel seckel@jhsph.edu 8 May 8 General approach for most statstcal modelng: Defne the populaton of nterest State
More informationThe Power of Slightly More than One Sample in Randomized Load Balancing
The Power of Slghtly More than One Sample n Randomzed oad Balancng e Yng, R. Srkant and Xaohan Kang Abstract In many computng and networkng applcatons, arrvng tasks have to be routed to one of many servers,
More informationSolution of Algebraic and Transcendental Equations
CHAPTER Soluton of Algerac and Transcendental Equatons. INTRODUCTION One of the most common prolem encountered n engneerng analyss s that gven a functon f (, fnd the values of for whch f ( = 0. The soluton
More informationAN APPOINTMENT ORDER OUTPATIENT SCHEDULING SYSTEM THAT IMPROVES OUTPATIENT EXPERIENCE
AN APPOINTMENT ORDER OUTPATIENT SCHEDULING SYSTEM THAT IMPROVES OUTPATIENT EXPERIENCE YuL Huang Industral Engneerng Department New Mexco State Unversty Las Cruces, New Mexco 88003, U.S.A. Abstract Patent
More informationAn Analysis of Factors Influencing the SelfRated Health of Elderly Chinese People
Open Journal of Socal Scences, 205, 3, 520 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/ss http://dx.do.org/0.4236/ss.205.35003 An Analyss of Factors Influencng the SelfRated Health of
More informationComment on Rotten Kids, Purity, and Perfection
Comment Comment on Rotten Kds, Purty, and Perfecton PerreAndré Chappor Unversty of Chcago Iván Wernng Unversty of Chcago and Unversdad Torcuato d Tella After readng Cornes and Slva (999), one gets the
More informationEnabling P2P Oneview Multiparty Video Conferencing
Enablng P2P Onevew Multparty Vdeo Conferencng Yongxang Zhao, Yong Lu, Changja Chen, and JanYn Zhang Abstract MultParty Vdeo Conferencng (MPVC) facltates realtme group nteracton between users. Whle P2P
More informationBandwdth Packng E. G. Coman, Jr. and A. L. Stolyar Bell Labs, Lucent Technologes Murray Hll, NJ 07974 fegc,stolyarg@research.belllabs.com Abstract We model a server that allocates varyng amounts of bandwdth
More informationRisk Model of LongTerm Production Scheduling in Open Pit Gold Mining
Rsk Model of LongTerm Producton Schedulng n Open Pt Gold Mnng R Halatchev 1 and P Lever 2 ABSTRACT Open pt gold mnng s an mportant sector of the Australan mnng ndustry. It uses large amounts of nvestments,
More informationThe Load Balancing of Database Allocation in the Cloud
, March 35, 23, Hong Kong The Load Balancng of Database Allocaton n the Cloud Yulung Lo and MnShan La Abstract Each database host n the cloud platform often has to servce more than one database applcaton
More informationVarying Response Ratio Priority: A Preemptive CPU Scheduling Algorithm (VRRP)
Journal of Computer and Communcatons, 2015, 3, 4051 Publshed Onlne Aprl 2015 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/10.4236/cc.2015.34005 Varyng Response Rato Prorty: A Preemptve CPU
More informationRate Monotonic (RM) Disadvantages of cyclic. TDDB47 Real Time Systems. Lecture 2: RM & EDF. Prioritybased scheduling. States of a process
Dsadvantages of cyclc TDDB47 Real Tme Systems Manual scheduler constructon Cannot deal wth any runtme changes What happens f we add a task to the set? RealTme Systems Laboratory Department of Computer
More informationFeature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College
Feature selecton for ntruson detecton Slobodan Petrovć NISlab, Gjøvk Unversty College Contents The feature selecton problem Intruson detecton Traffc features relevant for IDS The CFS measure The mrmr measure
More informationThe Application of Fractional Brownian Motion in Option Pricing
Vol. 0, No. (05), pp. 738 http://dx.do.org/0.457/jmue.05.0..6 The Applcaton of Fractonal Brownan Moton n Opton Prcng Qngxn Zhou School of Basc Scence,arbn Unversty of Commerce,arbn zhouqngxn98@6.com
More information+ + +   This circuit than can be reduced to a planar circuit
MeshCurrent Method The meshcurrent s analog of the nodeoltage method. We sole for a new set of arables, mesh currents, that automatcally satsfy KCLs. As such, meshcurrent method reduces crcut soluton to
More informationBERNSTEIN POLYNOMIALS
OnLne Geometrc Modelng Notes BERNSTEIN POLYNOMIALS Kenneth I. Joy Vsualzaton and Graphcs Research Group Department of Computer Scence Unversty of Calforna, Davs Overvew Polynomals are ncredbly useful
More informationDistributed Optimal Contention Window Control for Elastic Traffic in Wireless LANs
Dstrbuted Optmal Contenton Wndow Control for Elastc Traffc n Wreless LANs Yalng Yang, Jun Wang and Robn Kravets Unversty of Illnos at UrbanaChampagn { yyang8, junwang3, rhk@cs.uuc.edu} Abstract Ths paper
More informationtaposh_kuet20@yahoo.comcsedchan@cityu.edu.hk rajib_csedept@yahoo.co.uk, alam_shihabul@yahoo.com
G. G. Md. Nawaz Al 1,2, Rajb Chakraborty 2, Md. Shhabul Alam 2 and Edward Chan 1 1 Cty Unversty of Hong Kong, Hong Kong, Chna taposh_kuet20@yahoo.comcsedchan@ctyu.edu.hk 2 Khulna Unversty of Engneerng
More informationU.C. Berkeley CS270: Algorithms Lecture 4 Professor Vazirani and Professor Rao Jan 27,2011 Lecturer: Umesh Vazirani Last revised February 10, 2012
U.C. Berkeley CS270: Algorthms Lecture 4 Professor Vazran and Professor Rao Jan 27,2011 Lecturer: Umesh Vazran Last revsed February 10, 2012 Lecture 4 1 The multplcatve weghts update method The multplcatve
More informationComputer Networks 55 (2011) 3503 3516. Contents lists available at ScienceDirect. Computer Networks. journal homepage: www.elsevier.
Computer Networks 55 (2011) 3503 3516 Contents lsts avalable at ScenceDrect Computer Networks journal homepage: www.elsever.com/locate/comnet Bonded defct round robn schedulng for multchannel networks
More information