Communication Networks II Contents
|
|
- Hillary Reed
- 7 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 non-preemptve (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 nter-arrval tme TA and servce tme T B are consdered to be statstcally ndependent and negatve-exponentally (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 r-th 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 r-th 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 non-preemptve 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.un-bremen.de Communcaton Networks II Contents. Fundamentals of probablty theory 2. Emergence of communcaton traffc 3. Stochastc & Markovan Processes
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 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 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 two-stage stratfed cluster desgn. 1 The frst stage conssted of a sample
More informationAn Analysis of Central Processor Scheduling in Multiprogrammed Computer Systems
STAN-CS-73-355 I SU-SE-73-013 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 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 informationOptimal outpatient appointment scheduling
Health Care Manage Sc (27) 1:217 229 DOI 1.17/s1729-7-915- 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 Energy-Conserving Access Protocols for Wireless Identification Networks
From the Proceedngs of Internatonal Conference on Telecommuncaton Systems (ITC-97), March 2-23, 1997. 1 Analyss of Energy-Conservng Access Protocols for Wreless Identfcaton etworks Imrch Chlamtac a, Chara
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 informationPSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 12
14 The Ch-squared dstrbuton PSYCHOLOGICAL RESEARCH (PYC 304-C) 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 angdo-dong,
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 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 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 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 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 achne-readable copy and prnt a sngle copy
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 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 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 informationValue Driven Load Balancing
Value Drven Load Balancng Sherwn Doroud a, Esa Hyytä b,1, Mor Harchol-Balter c,2 a Tepper School of Busness, Carnege Mellon Unversty, 5000 Forbes Ave., Pttsburgh, PA 15213 b Department of Communcatons
More informationThe Development of Web Log Mining Based on Improve-K-Means Clustering Analysis
The Development of Web Log Mnng Based on Improve-K-Means Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna wangtngzhong2@sna.cn Abstract.
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 informationA Novel Methodology of Working Capital Management for Large. Public Constructions by Using Fuzzy S-curve Regression
Novel Methodology of Workng Captal Management for Large Publc Constructons by Usng Fuzzy S-curve Regresson Cheng-Wu Chen, Morrs H. L. Wang and Tng-Ya Hseh Department of Cvl Engneerng, Natonal Central Unversty,
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://www-bcf.usc.edu/
More informationProject Networks With Mixed-Time Constraints
Project Networs Wth Mxed-Tme 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 informationPAS: A Packet Accounting System to Limit the Effects of DoS & DDoS. Debish Fesehaye & Klara Naherstedt University of Illinois-Urbana Champaign
PAS: A Packet Accountng System to Lmt the Effects of DoS & DDoS Debsh Fesehaye & Klara Naherstedt Unversty of Illnos-Urbana Champagn DoS and DDoS DDoS attacks are ncreasng threats to our dgtal world. Exstng
More informationRisk-based Fatigue Estimate of Deep Water Risers -- Course Project for EM388F: Fracture Mechanics, Spring 2008
Rsk-based 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 informationReal-Time Process Scheduling
Real-Tme Process Schedulng ktw@cse.ntu.edu.tw (Real-Tme and Embedded Systems Laboratory) Independent Process Schedulng Processes share nothng but CPU Papers for dscussons: C.L. Lu and James. W. Layland,
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 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 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, 610-519-4390,
More informationOn the Optimal Control of a Cascade of Hydro-Electric Power Stations
On the Optmal Control of a Cascade of Hydro-Electrc 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 informationThis paper concerns the evaluation and analysis of order
ORDER-FULFILLMENT PERFORMANCE MEASURES IN AN ASSEMBLE- TO-ORDER SYSTEM WITH STOCHASTIC LEADTIMES JING-SHENG SONG Unversty of Calforna, Irvne, Calforna SUSAN H. XU Penn State Unversty, Unversty Park, Pennsylvana
More informationHow To Calculate The Accountng Perod Of Nequalty
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 informationA DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATION-BASED OPTIMIZATION. Michael E. Kuhl Radhamés A. Tolentino-Peñ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 SIMULATION-BASED OPTIMIZATION
More informationPortfolio Loss Distribution
Portfolo Loss Dstrbuton Rsky assets n loan ortfolo hghly llqud assets hold-to-maturty n the bank s balance sheet Outstandngs The orton of the bank asset that has already been extended to borrowers. Commtment
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 informationA New Quality of Service Metric for Hard/Soft Real-Time Applications
A New Qualty of Servce Metrc for Hard/Soft Real-Tme Applcatons Shaoxong Hua and Gang Qu Electrcal and Computer Engneerng Department and Insttute of Advanced Computer Study Unversty of Maryland, College
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 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 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 Annuty-mmedate 2 Annuty-due Level Annutes wth Payments Less Frequent than Each Interest Perod 1 Annuty-mmedate 2 Annuty-due Symoblc approach
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 Multple-Choce Questons (30/00 ponts) Please, crcle the correct answer for each of the followng 0 multple-choce questons. For each queston, only one of the answers s correct.
More informationDEFINING %COMPLETE IN MICROSOFT PROJECT
CelersSystems DEFINING %COMPLETE IN MICROSOFT PROJECT PREPARED BY James E Aksel, PMP, PMI-SP, MVP For Addtonal Informaton about Earned Value Management Systems and reportng, please contact: CelersSystems,
More informationEfficient Bandwidth Management in Broadband Wireless Access Systems Using CAC-based Dynamic Pricing
Effcent Bandwdth Management n Broadband Wreless Access Systems Usng CAC-based Dynamc Prcng Bader Al-Manthar, Ndal Nasser 2, Najah Abu Al 3, Hossam Hassanen Telecommuncatons Research Laboratory School of
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 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 informationModeling and Analysis of 2D Service Differentiation on e-commerce Servers
Modelng and Analyss of D Servce Dfferentaton on e-commerce Servers Xaobo Zhou, Unversty of Colorado, Colorado Sprng, CO zbo@cs.uccs.edu Janbn We and Cheng-Zhong Xu Wayne State Unversty, Detrot, Mchgan
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, Alcatel-Lucent
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, 115-121 115 Open Access A Load Balancng Strategy wth Bandwdth Constrant n Cloud Computng Jng Deng 1,*,
More informationAN APPOINTMENT ORDER OUTPATIENT SCHEDULING SYSTEM THAT IMPROVES OUTPATIENT EXPERIENCE
AN APPOINTMENT ORDER OUTPATIENT SCHEDULING SYSTEM THAT IMPROVES OUTPATIENT EXPERIENCE Yu-L Huang Industral Engneerng Department New Mexco State Unversty Las Cruces, New Mexco 88003, U.S.A. Abstract Patent
More informationThe Load Balancing of Database Allocation in the Cloud
, March 3-5, 23, Hong Kong The Load Balancng of Database Allocaton n the Cloud Yu-lung Lo and Mn-Shan La Abstract Each database host n the cloud platform often has to servce more than one database applcaton
More informationHow Sets of Coherent Probabilities May Serve as Models for Degrees of Incoherence
1 st Internatonal Symposum on Imprecse Probabltes and Ther Applcatons, Ghent, Belgum, 29 June 2 July 1999 How Sets of Coherent Probabltes May Serve as Models for Degrees of Incoherence Mar J. Schervsh
More informationRisk Model of Long-Term Production Scheduling in Open Pit Gold Mining
Rsk Model of Long-Term 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 informationResearch Article Enhanced Two-Step Method via Relaxed Order of α-satisfactory Degrees for Fuzzy Multiobjective Optimization
Hndaw Publshng Corporaton Mathematcal Problems n Engneerng Artcle ID 867836 pages http://dxdoorg/055/204/867836 Research Artcle Enhanced Two-Step Method va Relaxed Order of α-satsfactory Degrees for Fuzzy
More informationTraffic State Estimation in the Traffic Management Center of Berlin
Traffc State Estmaton n the Traffc Management Center of Berln Authors: Peter Vortsch, PTV AG, Stumpfstrasse, D-763 Karlsruhe, Germany phone ++49/72/965/35, emal peter.vortsch@ptv.de Peter Möhl, PTV AG,
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 informationThe Application of Fractional Brownian Motion in Option Pricing
Vol. 0, No. (05), pp. 73-8 http://dx.do.org/0.457/jmue.05.0..6 The Applcaton of Fractonal Brownan Moton n Opton Prcng Qng-xn Zhou School of Basc Scence,arbn Unversty of Commerce,arbn zhouqngxn98@6.com
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 Urbana-Champagn { yyang8, junwang3, rhk@cs.uuc.edu} Abstract Ths paper
More informationRate Monotonic (RM) Disadvantages of cyclic. TDDB47 Real Time Systems. Lecture 2: RM & EDF. Priority-based 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? Real-Tme 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 informationBERNSTEIN POLYNOMIALS
On-Lne 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 informationRetailers must constantly strive for excellence in operations; extremely narrow profit margins
Managng a Retaler s Shelf Space, Inventory, and Transportaton Gerard Cachon 300 SH/DH, The Wharton School, Unversty of Pennsylvana, Phladelpha, Pennsylvana 90 cachon@wharton.upenn.edu http://opm.wharton.upenn.edu/cachon/
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 mult-channel networks
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 informationEnabling P2P One-view Multi-party Video Conferencing
Enablng P2P One-vew Mult-party Vdeo Conferencng Yongxang Zhao, Yong Lu, Changja Chen, and JanYn Zhang Abstract Mult-Party Vdeo Conferencng (MPVC) facltates realtme group nteracton between users. Whle P2P
More informationInstitute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic
Lagrange Multplers as Quanttatve Indcators n Economcs Ivan Mezník Insttute of Informatcs, Faculty of Busness and Management, Brno Unversty of TechnologCzech Republc Abstract The quanttatve role of Lagrange
More informationBandwdth Packng E. G. Coman, Jr. and A. L. Stolyar Bell Labs, Lucent Technologes Murray Hll, NJ 07974 fegc,stolyarg@research.bell-labs.com Abstract We model a server that allocates varyng amounts of bandwdth
More informationRELIABILITY, RISK AND AVAILABILITY ANLYSIS OF A CONTAINER GANTRY CRANE ABSTRACT
Kolowrock Krzysztof Joanna oszynska MODELLING ENVIRONMENT AND INFRATRUCTURE INFLUENCE ON RELIABILITY AND OPERATION RT&A # () (Vol.) March RELIABILITY RIK AND AVAILABILITY ANLYI OF A CONTAINER GANTRY CRANE
More informationSelf-Adaptive SLA-Driven Capacity Management for Internet Services
Self-Adaptve SLA-Drven Capacty Management for Internet Servces Bruno Abrahao, Vrglo Almeda and Jussara Almeda Computer Scence Department Federal Unversty of Mnas Geras, Brazl Alex Zhang, Drk Beyer and
More informationThe Stochastic Guaranteed Service Model with Recourse for Multi-Echelon Warehouse Management
The Stochastc Guaranteed Servce Model wth Recourse for Mult-Echelon Warehouse Management Jörg Rambau, Konrad Schade 1 Lehrstuhl für Wrtschaftsmathematk Unverstät Bayreuth Bayreuth, Germany Abstract The
More informationNPAR TESTS. One-Sample Chi-Square Test. Cell Specification. Observed Frequencies 1O i 6. Expected Frequencies 1EXP i 6
PAR TESTS If a WEIGHT varable s specfed, t s used to replcate a case as many tmes as ndcated by the weght value rounded to the nearest nteger. If the workspace requrements are exceeded and samplng has
More informationCalculating the high frequency transmission line parameters of power cables
< ' Calculatng the hgh frequency transmsson lne parameters of power cables Authors: Dr. John Dcknson, Laboratory Servces Manager, N 0 RW E B Communcatons Mr. Peter J. Ncholson, Project Assgnment Manager,
More information"Research Note" APPLICATION OF CHARGE SIMULATION METHOD TO ELECTRIC FIELD CALCULATION IN THE POWER CABLES *
Iranan Journal of Scence & Technology, Transacton B, Engneerng, ol. 30, No. B6, 789-794 rnted n The Islamc Republc of Iran, 006 Shraz Unversty "Research Note" ALICATION OF CHARGE SIMULATION METHOD TO ELECTRIC
More informationAn Introduction to 3G Monte-Carlo simulations within ProMan
An Introducton to 3G Monte-Carlo smulatons wthn ProMan responsble edtor: Hermann Buddendck AWE Communcatons GmbH Otto-Llenthal-Str. 36 D-71034 Böblngen Phone: +49 70 31 71 49 7-16 Fax: +49 70 31 71 49
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 informationAn Alternative Way to Measure Private Equity Performance
An Alternatve Way to Measure Prvate Equty Performance Peter Todd Parlux Investment Technology LLC Summary Internal Rate of Return (IRR) s probably the most common way to measure the performance of prvate
More informationA generalized hierarchical fair service curve algorithm for high network utilization and link-sharing
Computer Networks 43 (2003) 669 694 www.elsever.com/locate/comnet A generalzed herarchcal far servce curve algorthm for hgh network utlzaton and lnk-sharng Khyun Pyun *, Junehwa Song, Heung-Kyu Lee Department
More informationCheckng and Testng in Nokia RMS Process
An Integrated Schedulng Mechansm for Fault-Tolerant Modular Avoncs Systems Yann-Hang Lee Mohamed Youns Jeff Zhou CISE Department Unversty of Florda Ganesvlle, FL 326 yhlee@cse.ufl.edu Advanced System Technology
More informationForecasting the Direction and Strength of Stock Market Movement
Forecastng the Drecton and Strength of Stock Market Movement Jngwe Chen Mng Chen Nan Ye cjngwe@stanford.edu mchen5@stanford.edu nanye@stanford.edu Abstract - Stock market s one of the most complcated systems
More informationAvailability-Based Path Selection and Network Vulnerability Assessment
Avalablty-Based Path Selecton and Network Vulnerablty Assessment Song Yang, Stojan Trajanovsk and Fernando A. Kupers Delft Unversty of Technology, The Netherlands {S.Yang, S.Trajanovsk, F.A.Kupers}@tudelft.nl
More informationRelay Secrecy in Wireless Networks with Eavesdropper
Relay Secrecy n Wreless Networks wth Eavesdropper Parvathnathan Venktasubramanam, Tng He and Lang Tong School of Electrcal and Computer Engneerng Cornell Unversty, Ithaca, NY 14853 Emal : {pv45, th255,
More informationAn Interest-Oriented Network Evolution Mechanism for Online Communities
An Interest-Orented Network Evoluton Mechansm for Onlne Communtes Cahong Sun and Xaopng Yang School of Informaton, Renmn Unversty of Chna, Bejng 100872, P.R. Chna {chsun,yang}@ruc.edu.cn Abstract. Onlne
More informationFuzzy Set Approach To Asymmetrical Load Balancing In Distribution Networks
Fuzzy Set Approach To Asymmetrcal Load Balancng n Dstrbuton Networks Goran Majstrovc Energy nsttute Hrvoje Por Zagreb, Croata goran.majstrovc@ehp.hr Slavko Krajcar Faculty of electrcal engneerng and computng
More informationFragility Based Rehabilitation Decision Analysis
.171. Fraglty Based Rehabltaton Decson Analyss Cagdas Kafal Graduate Student, School of Cvl and Envronmental Engneerng, Cornell Unversty Research Supervsor: rcea Grgoru, Professor Summary A method s presented
More informationOptimal Bidding Strategies for Generation Companies in a Day-Ahead Electricity Market with Risk Management Taken into Account
Amercan J. of Engneerng and Appled Scences (): 8-6, 009 ISSN 94-700 009 Scence Publcatons Optmal Bddng Strateges for Generaton Companes n a Day-Ahead Electrcty Market wth Rsk Management Taken nto Account
More informationPerformance Analysis and Comparison of QoS Provisioning Mechanisms for CBR Traffic in Noisy IEEE 802.11e WLANs Environments
Tamkang Journal of Scence and Engneerng, Vol. 12, No. 2, pp. 143149 (2008) 143 Performance Analyss and Comparson of QoS Provsonng Mechansms for CBR Traffc n Nosy IEEE 802.11e WLANs Envronments Der-Junn
More information1 Example 1: Axis-aligned rectangles
COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture # 6 Scrbe: Aaron Schld February 21, 2013 Last class, we dscussed an analogue for Occam s Razor for nfnte hypothess spaces that, n conjuncton
More informationMean Molecular Weight
Mean Molecular Weght The thermodynamc relatons between P, ρ, and T, as well as the calculaton of stellar opacty requres knowledge of the system s mean molecular weght defned as the mass per unt mole of
More informationEfficient On-Demand Data Service Delivery to High-Speed Trains in Cellular/Infostation Integrated Networks
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. XX, NO. XX, MONTH 2XX 1 Effcent On-Demand Data Servce Delvery to Hgh-Speed Trans n Cellular/Infostaton Integrated Networks Hao Lang, Student Member,
More informationGENETIC ALGORITHM FOR PROJECT SCHEDULING AND RESOURCE ALLOCATION UNDER UNCERTAINTY
Int. J. Mech. Eng. & Rob. Res. 03 Fady Safwat et al., 03 Research Paper ISS 78 049 www.jmerr.com Vol., o. 3, July 03 03 IJMERR. All Rghts Reserved GEETIC ALGORITHM FOR PROJECT SCHEDULIG AD RESOURCE ALLOCATIO
More informationDynamic Pricing for Smart Grid with Reinforcement Learning
Dynamc Prcng for Smart Grd wth Renforcement Learnng Byung-Gook Km, Yu Zhang, Mhaela van der Schaar, and Jang-Won Lee Samsung Electroncs, Suwon, Korea Department of Electrcal Engneerng, UCLA, Los Angeles,
More informationLinear Circuits Analysis. Superposition, Thevenin /Norton Equivalent circuits
Lnear Crcuts Analyss. Superposton, Theenn /Norton Equalent crcuts So far we hae explored tmendependent (resste) elements that are also lnear. A tmendependent elements s one for whch we can plot an / cure.
More informationLogical Development Of Vogel s Approximation Method (LD-VAM): An Approach To Find Basic Feasible Solution Of Transportation Problem
INTERNATIONAL JOURNAL OF SCIENTIFIC & TECHNOLOGY RESEARCH VOLUME, ISSUE, FEBRUARY ISSN 77-866 Logcal Development Of Vogel s Approxmaton Method (LD- An Approach To Fnd Basc Feasble Soluton Of Transportaton
More informationHow To Understand The Results Of The German Meris Cloud And Water Vapour Product
Ttel: Project: Doc. No.: MERIS level 3 cloud and water vapour products MAPP MAPP-ATBD-ClWVL3 Issue: 1 Revson: 0 Date: 9.12.1998 Functon Name Organsaton Sgnature Date Author: Bennartz FUB Preusker FUB Schüller
More informationDynamic Online-Advertising Auctions as Stochastic Scheduling
Dynamc Onlne-Advertsng Auctons as Stochastc Schedulng Isha Menache and Asuman Ozdaglar Massachusetts Insttute of Technology {sha,asuman}@mt.edu R. Srkant Unversty of Illnos at Urbana-Champagn rsrkant@llnos.edu
More informationOn Robust Network Planning
On Robust Network Plannng Al Tzghadam School of Electrcal and Computer Engneerng Unversty of Toronto, Toronto, Canada Emal: al.tzghadam@utoronto.ca Alberto Leon-Garca School of Electrcal and Computer Engneerng
More informationRing structure of splines on triangulations
www.oeaw.ac.at Rng structure of splnes on trangulatons N. Vllamzar RICAM-Report 2014-48 www.rcam.oeaw.ac.at RING STRUCTURE OF SPLINES ON TRIANGULATIONS NELLY VILLAMIZAR Introducton For a trangulated regon
More information