7. Queueing and sharing systems. ELEC-C7210 Modeling and analysis of communication networks 1

Size: px
Start display at page:

Download "7. Queueing and sharing systems. ELEC-C7210 Modeling and analysis of communication networks 1"

Transcription

1 7. Queueg ad shag systes ELECC7 Modelg ad aalyss of coucato etwoks

2 7. Queueg ad shag systes Cotets Refeshe: Sle teletaffc odel Queueg dscle M/M/FIFO ( seve, watg laces, custoe laces M/M/PS ( seve, watg laces, custoe laces Alcato to acket level odellg of data taffc M/M/FIFO ( seves, watg laces, custoe laces M/M/PS ( seves, watg laces, custoe laces Alcato to flow level odellg of elastc data taffc M/M//k/kPS (k custoes, seve, k custoe laces

3 7. Queueg ad shag systes Sle teletaffc odel Custoes ave at ate l (custoes e te ut /l aveage teaval te Custoes ae seved by aallel seves he busy, a seve seves at ate (custoes e te ut / aveage sevce te of a custoe Thee ae + custoe laces the syste at least sevce laces ad at ost watg laces It s assued that blocked custoes (avg a full syste ae lost l + 3

4 7. Queueg ad shag systes Pue queueg syste Fte ube of seves ( <, sevce laces, fte ube of watg laces ( If all seves ae occued whe a custoe aves, t occues oe of the watg laces No custoes ae lost but soe of the have to wat befoe gettg seved Fo the custoe s ot of vew, t s teestg to kow e.g. what s the obablty that t has to wat too log? l 4

5 7. Queueg ad shag systes Delay I a queueg syste, soe ackets have to wat befoe gettg seved A avg acket s buffeed, f the lk s busy uo the aval Delay of a acket cossts of the watg te, whch deeds o the state of the syste uo the aval, ad the tassso te, whch deeds o the legth of the acket ad the caacty of the lk Exale: acket legth 5 bytes lk seed Gbs tassso te 5*8/,,,. s s 5

6 7. Queueg ad shag systes Pue shag syste Fte ube of seves ( <, fte ube of sevce laces ( +, o watg laces If thee ae at ost custoes the syste (x, each custoe has ts ow seve. Othewse (x >, the total sevce ate ( s shaed faly aog all custoes. Thus, the ate at whch a custoe s seved equals {,/x} No custoes ae lost, ad o oe eeds to wat befoe the sevce. But the delay s the geate, the oe thee ae custoes the syste. Thus, delay s a teesg easue fo the custoe s ot of vew. l 6

7 7. Queueg ad shag systes Thoughut I a shag syste the sevce caacty s shaed aog all actve flows. It follows that all flows get delayed (uless thee s oly a sgle actve flow By defto, the ato betwee the aveage flow sze S ad the aveage total delay D of a flow s called thoughut q, q S / D Exale: S Mbt D 5 s qs/d. Mbs 7

8 7. Queueg ad shag systes Cotets Refeshe: Sle teletaffc odel Queueg dscle M/M/FIFO ( seve, watg laces, custoe laces M/M/PS ( seve, watg laces, custoe laces Alcato to acket level odellg of data taffc M/M/FIFO ( seves, watg laces, custoe laces M/M/PS ( seves, watg laces, custoe laces Alcato to flow level odellg of elastc data taffc M/M//k/kPS (k custoes, seve, k custoe laces 8

9 7. Queueg ad shag systes Queueg dscle Cosde a sgle seve ( queueg syste Queueg dscle (also sevce dscle detees the way the seve seves the custoes It tells whethe the custoes ae seved oebyoe o sultaeously Futheoe, f the custoes ae seved oebyoe, t tells whch ode they ae take to the sevce Ad f the custoes ae seved sultaeously, t tells how the sevce caacty s shaed aog the custoes Note: I coute systes the coesodg cocet s schedulg A queueg dscle s called wokcosevg f custoes ae seved wth full sevce ate wheeve the syste s oety 9

10 7. Queueg ad shag systes okcosevg queueg dscles Fst I Fst Out (FIFO Fst Coe Fst Seved (FCFS oday queueg dscle ( queue aval ode sevce ode custoes seved oebyoe (wth full sevce ate always seve the custoe that has bee watg fo the logest te Last I Fst Out (LIFO Last Coe Fst Seved (LCFS evesed queug dscle ( stack custoes seved oebyoe (wth full sevce ate always seve the custoe that has bee watg fo the shotest te Pocesso Shag (PS fa queueg custoes seved sultaeously whe custoes the syste, each of the seved wth equal ate / also kow as oud ob (RR

11 7. Queueg ad shag systes Cotets Refeshe: Sle teletaffc odel Queueg dscle M/M/FIFO ( seve, watg laces, custoe laces M/M/PS ( seve, watg laces, custoe laces Alcato to acket level odellg of data taffc M/M/FIFO ( seves, watg laces, custoe laces M/M/PS ( seves, watg laces, custoe laces Alcato to flow level odellg of elastc data taffc M/M//k/kPS (k custoes, seve, k custoe laces

12 7. Queueg ad shag systes M/M/FIFO queue Cosde the followg sle teletaffc odel: Ifte ube of deedet custoes (k Iteaval tes ae IID ad exoetally dstbuted wth ea /l so, custoes ave accodg to a Posso ocess wth testy l Oe seve ( Sevce tes ae IID ad exoetally dstbuted wth ea / Ifte ube of watg laces ( Default queueg dscle: FIFO Usg Kedall s otato, ths s a M/M/ queue oe ecsely: M/M/FIFO queue Notato: l/taffc load

13 7. Queueg ad shag systes Related ado vaables X ube of custoes the syste at a abtay te queue legth equlbu X* ube of custoes the syste at a (tycal aval te queue legth see by a avg custoe watg te of a (tycal custoe S sevce te of a (tycal custoe D + S total te the syste of a (tycal custoe delay 3

14 7. Queueg ad shag systes State tasto daga Let X(t deote the ube of custoes the syste at te t Assue that X(t at soe te t, ad cosde what haes dug a shot te teval (t, t+h]: wth ob. lh + o(h, a ew custoe aves (state tasto f + f >, the, wth ob. h + o(h, a custoe leaves the syste (state tasto f Pocess X(t s clealy a Makov ocess wth state tasto daga l l Note that ocess X(t s a educble bthdeath ocess wth a fte state sace S {,,,...} l 4

15 7. Queueg ad shag systes 5 Equlbu dstbuto ( Local balace equatos (LBE: Noalzg codto (N:,,,K, (LBE + + l l (N ( f, < ł Ł

16 7. Queueg ad shag systes Equlbu dstbuto ( Thus, fo a stable syste ( <, the equlbu dstbuto exsts ad s a geoetc dstbuto: < X ~ Geo( P{ X E[ X ] }, (, D [ X ] (,,, K Reak: Ths esult s vald fo ay wokcosevg queueg dscle (FIFO, LIFO, PS,... Ths esult s ot sestve to the sevce te dstbuto fo FIFO eve the ea queue legth E[X] deeds o the dstbuto Howeve, fo ay syetc queueg dscle (such as LIFO o PS the esult s, deed, sestve to the sevce te dstbuto 6

17 7. Queueg ad shag systes Mea queue legth E[X] vs. taffc load E[X] Taffc load 7

18 7. Queueg ad shag systes Mea delay Let D deote the total te (delay the syste of a (tycal custoe cludg both the watg te ad the sevce te S: D + S Lttle s foula: E[X] le[d]. Thus, Reak: E[ D] E[ X ] l l l The ea delay s the sae fo all wokcosevg queueg dscles (FIFO, LIFO, PS, But the vaace ad othe oets ae dffeet! 8

19 7. Queueg ad shag systes Mea delay E[D] vs. taffc load E[D] Taffc load 9

20 7. Queueg ad shag systes Mea watg te Let deote the watg te of a (tycal custoe Sce D S, we have E[ ] E[ D] E[ S]

21 7. Queueg ad shag systes atg te dstbuto ( Let deote the watg te of a (tycal custoe Let X* deote the ube of custoes the syste at the aval te PASTA: P{X* } P{X }. Assue ow, fo a whle, that X* Sevce tes S,,S of the watg custoes ae IID ad ~ Ex( Due to the eoyless oety of the exoetal dstbuto, the eag sevce te S * of the custoe sevce also follows Ex(dstbuto (ad s deedet of eveythg else Due to the FIFO queueg dscle, S * + S + + S Costuct a Posso (ot ocess t by defg t S * ad t S * + S + + S,. Now (sce X* : > t t >t S * S S 3 t3 S S t t t t t

22 7. Queueg ad shag systes atg te dstbuto ( Sce X*, we have Deote by A(t the Posso (coute ocess coesodg to t It follows that: t > t A(t O the othe had, we kow that A(t ~ Posso (t. Thus, > > > > }( { } { } * { } * { } { } * { } { t P t P X P X t P t P X P P t t >! ( } ( { } { j t j t e t A P t P j t

23 7. Queueg ad shag systes 3 atg te dstbuto (3 By cobg the evous foulas, we get t t t j t j t j j j t j t j t j t e e e e e e t P t P j j j (! ( (! (! ( ( ( }( { } { t + + > >

24 7. Queueg ad shag systes 4 atg te dstbuto (4 atg te ca thus be eseted as a oduct JD of two deedet ado vaables J ~ Beoull( ad D ~ Ex((: ( ( ( ( ( ( ] [ ] [ ] [ ] [ } { ] [ ] [ ] [ ] [, }, { } { } { } { > > > E E D D E J P E D E J E E t e t D J P t P J P P t

25 7. Queueg ad shag systes Cotets Refeshe: Sle teletaffc odel Queueg dscle M/M/FIFO ( seve, watg laces, custoe laces M/M/PS ( seve, watg laces, custoe laces Alcato to acket level odellg of data taffc M/M/FIFO ( seves, watg laces, custoe laces M/M/PS ( seves, watg laces, custoe laces Alcato to flow level odellg of elastc data taffc M/M//k/kPS (k custoes, seve, k custoe laces 5

26 7. Queueg ad shag systes M/M/PS queue Cosde the followg sle teletaffc odel: Ifte ube of deedet custoes (k Iteaval tes ae IID ad exoetally dstbuted wth ea /l so, custoes ave accodg to a Posso ocess wth testy l Oe seve ( Sevce equeets ae IID ad exoetally dstbuted wth ea / Ifte ube of custoe laces ( Queueg dscle: PS. All custoes ae seved sultaeously a fa way wth equal shaes of the sevce caacty. Usg Kedall s otato, ths s a M/M/PS queue Notato: l/taffc load 6

27 7. Queueg ad shag systes State tasto daga Let X(t deote the ube of custoes the syste at te t Assue that X(t at soe te t, ad cosde what haes dug a shot te teval (t, t+h]: wth ob. lh + o(h, a ew custoe aves (state tasto f + f >, the, wth ob. (/h + o(h h+o(h, a custoe leaves the syste (state tasto f Pocess X(t s clealy a Makov ocess wth state tasto daga l l Note that ths s the sae educble bthdeath ocess wth a fte state sace S {,,,...} as fo the M/M/FIFO queue. l 7

28 7. Queueg ad shag systes Equlbu dstbuto Thus, fo a stable syste ( <, the equlbu dstbuto exsts ad s a geoetc dstbuto: < X ~ Geo( P{ X E[ X ] }, (, D ( Reak: Isestvty wth esect to sevce te dstbuto [ X ],,, K The esult fo the PS dscle s sestve to the sevce te dstbuto, that s: t s vald fo ay sevce te dstbuto wth ea / So, stead of the M/M/PS odel, we ca cosde, as well, the oe geeal M/G/PS odel 8

29 7. Queueg ad shag systes Mea delay Let D deote the total te (delay the syste of a (tycal custoe Sce the ea ube of custoes the syste, E[X], s the sae fo all wokcosevg queueg dscles, also the ea delay s the sae, by Lttle s esult. e ay aly the esult deved fo the FIFO dscle slde 8: E[D] 9

30 7. Queueg ad shag systes Mea delay E[D] vs. taffc load Note that the te ut s the aveage sevce equeet E[S] E[D] taffc load 3

31 7. Queueg ad shag systes Relatve thoughut A qualty of sevce easue s the elatve thoughut E[S]/E[D]: E[ S] E[ D] ( Note that above elatve thoughut easues the sze of the custoes uts of te,.e., E[S] /, ad slaly the ea delay E[D] s the sae uts. Hece, elatve thoughut easues how sall the sevce te equeet s elatve to the oveall ea delay Late o we wll defe thoughut a slghtly dffeet way the cotext of flowlevel odelg of elastc taffc, whee we take to accout seaately the sze bts (fle sze ad seve caacty exessed bt/s 3

32 7. Queueg ad shag systes Relatve thoughut E[S]/E[D] vs. taffc load.8 E[S]/E[D] taffc load 3

33 7. Queueg ad shag systes Cotets Refeshe: Sle teletaffc odel Queueg dscle M/M/FIFO ( seve, watg laces, custoe laces M/M/PS ( seve, watg laces, custoe laces Alcato to acket level odellg of data taffc M/M/FIFO ( seves, watg laces, custoe laces M/M/PS ( seves, watg laces, custoe laces Alcato to flow level odellg of elastc data taffc M/M//k/kPS (k custoes, seve, k custoe laces 33

34 7. Queueg ad shag systes Packet level odel fo data taffc ( Queueg odels ae sutable fo descbg (acketswtched data taffc at acket level Poeeg wok ade by ay eole 6 s ad 7 s elated to ARPANET, atcula L. Kleock (htt:// Cosde a lk betwee two acket outes taffc cossts of data ackets tastted alog the lk R R R R 34

35 7. Queueg ad shag systes Packet level odel fo data taffc ( Ths ca be odelled as a ue queueg syste wth a sgle seve ( ad a fte buffe ( custoe acket l acket aval ate (ackets e te ut L aveage acket legth (data uts seve lk, watg laces buffe C lk seed (data uts e te ut sevce te acket tassso te / L/C aveage acket tassso te (te uts l 35

36 7. Queueg ad shag systes Taffc ocess acket status (watg/ tassso watg te tassso te 4 3 acket aval tes ube of ackets the syste lk occuato te te te 36

37 7. Queueg ad shag systes Taffc load The stegth of the offeed taffc s descbed by the taffc load By defto, the taffc load s the ato betwee the aval ate l ad the sevce ate C/L: l ll C The taffc load s a desoless quatty By Lttle s foula, t tells the utlzato facto of the seve, whch s the obablty that the seve s busy 37

38 7. Queueg ad shag systes Exale Cosde a lk betwee two acket outes. Assue that, o aveage, 5, ew ackets ave a secod, the ea acket legth s 5 bytes, ad the lk seed s Gbs. The the taffc load (as well as, the utlzato s 5,* 5* 8/,,,.6 6% 38

39 7. Queueg ad shag systes Teletaffc aalyss ( Syste caacty C lk seed kbs Taffc load l acket aval ate s (cosdeed hee as a vaable L aveage acket legth kbts (assued hee to be costat kbt Qualty of sevce (fo the uses ot of vew P z obablty that a acket has to wat too log,.e. loge tha a gve efeece value z (assued hee to be costat z. s s Assue a M/M/ queueg syste: ackets ave accodg to a Posso ocess (wth ate l acket legths ae deedet ad detcally dstbuted accodg to the exoetal dstbuto wth ea L queug dscle s FIFO 39

40 7. Queueg ad shag systes Teletaffc aalyss ( The the quattve elato betwee the thee factos (syste, taffc, ad qualty of sevce s gve by the followg foula: P z ll C at( C, l; L, z :, ex( ( C L l z ex( ( z, f f ll < C ll C ( < ( Note: The syste s stable oly the foe case ( <. Othewse the ube of ackets the buffe gows wthout lts. 4

41 7. Queueg ad shag systes Exale Assue that ackets ave at ate l6, s.6 ackets/s ad the lk seed s C. Gbs. kbt/s. The syste s stable sce ll C.6 < The obablty P z that a avg acket has to wat too log (.e. loge tha z s s P z at(.,.6;,.6ex( 4.» % 4

42 7. Queueg ad shag systes Caacty vs. aval ate Gve the qualty of sevce equeet that P z < %, the equed lk seed C deeds o the aval ate l as follows: C( l { c > ll at( c, l;, <.} lk seed C (Gbs aval ate l (ackets/s 4

43 7. Queueg ad shag systes Qualty of sevce vs. aval ate Gve the lk seed C. Gbs. kbt/s, the qualty of sevce P z deeds o the aval ate l as follows: P ( l at(., l;, z.8 qualty of sevce P z aval ate l (ackets/s 43

44 7. Queueg ad shag systes Qualty of sevce vs. caacty Gve the aval ate l6, s.6 ackets/s, the qualty of sevce P z deeds o the lk seed C as follows: P z ( R at( C,.6;,.8 qualty of sevce P z lk seed C (Gbs 44

45 7. Queueg ad shag systes Suay o alcato to acket level odellg of data taffc M/M/ odel ay be aled (to soe extet to acket level odellg of data taffc custoe IP acket l acket aval ate (ackets e te ut / aveage acket tassso te (te uts l/ taffc load Qualty of sevce s easued e.g. by the acket delay P z obablty that a acket has to wat too log,.e. loge tha a gve efeece value z P z P{ > z} e ( z 45

46 7. Queueg ad shag systes Multlexg ga e detee load so that ob. P z < % fo z (te uts Multlexg ga s descbed by the taffc load as a fucto of the sevce ate.8 load sevce ate 46

47 7. Queueg ad shag systes Cotets Refeshe: Sle teletaffc odel Queueg dscle M/M/FIFO ( seve, watg laces, custoe laces M/M/PS ( seve, watg laces, custoe laces Alcato to acket level odellg of data taffc M/M/FIFO ( seves, watg laces, custoe laces M/M/PS ( seves, watg laces, custoe laces Alcato to flow level odellg of elastc data taffc M/M//k/kPS (k custoes, seve, k custoe laces Deo: M/M//FIFO 47

48 7. Queueg ad shag systes M/M/FIFO queue Cosde the followg sle teletaffc odel: Ifte ube of deedet custoes (k Iteaval tes ae IID ad exoetally dstbuted wth ea /l so, custoes ave accodg to a Posso ocess wth testy l Fte ube of seves ( < Sevce tes ae IID ad exoetally dstbuted wth ea / Ifte ube of watg laces ( Default queueg dscle: FIFO Usg Kedall s otato, ths s a M/M/ queue oe ecsely: M/M/FIFO queue Notato: l/(taffc load 48

49 7. Queueg ad shag systes State tasto daga Let X(t deote the ube of custoes the syste at te t Assue that X(t at soe te t, ad cosde what haes dug a shot te teval (t, t+h]: wth ob. lh + o(h, a ew custoe aves (state tasto f + f >, the, wth ob. {,} h + o(h, a custoe leaves the syste (state tasto f Pocess X(t s clealy a Makov ocess wth state tasto daga l l Note that ocess X(t s a educble bthdeath ocess wth a fte state sace S {,,,...} l l + l 49

50 7. Queueg ad shag systes 5 Equlbu dstbuto ( Local balace equatos (LBE fo < : Local balace equatos (LBE fo : (LBE ( l + +,K,, (LBE!! ( l l,,,,! ( ( K l

51 7. Queueg ad shag systes 5 Equlbu dstbuto ( Noalzg codto (N:!( (! (!( (! (! (! (!! (, Notato : f, (N b a b a < + ł Ł + ł Ł + ł Ł +

52 7. Queueg ad shag systes 5 Equlbu dstbuto (3 Thus, fo a stable syste ( <, that s: l<, the equlbu dstbuto exsts ad s as follows: < b a b a b a b a ,, :,, : K K,,,,,,, } {!! ( X P b a b a

53 7. Queueg ad shag systes 53 Pobablty of watg Let deote the obablty that a avg custoe has to wat Let X* deote the ube of custoes the syste at a aval te A avg custoe has to wat wheeve all the seves ae occued at he aval te. Thus, PASTA: P{X* } P{X }. Thus, } * { X P b a b +!( (! } * { X P + : :

54 7. Queueg ad shag systes 54 Mea ube of watg custoes Let X deote the ube of watg custoes equlbu The!( ( ( ( ( ] [ X E 3 ] [ : ] [ : + X E X E

55 7. Queueg ad shag systes 55 Mea watg te Let deote the watg te of a (tycal custoe Lttle s foula: E[X ] le[]. Thus, l l l X E E ( ] [ ] [ ( ] [ : ] [ : E E

56 7. Queueg ad shag systes 56 Mea delay Let D deote the total te (delay the syste of a (tycal custoe cludg both the watg te ad the sevce te S: D + S The, l ( ] [ ] [ ] [ + ł Ł + + S E E D E ( ( ] [ : ] [ : ł Ł + + ł Ł + D E D E

57 7. Queueg ad shag systes 57 Mea queue legth Let X deote the ube of custoes the syste (queue legth equlbu Lttle s foula: E[X] le[d]. Thus, l l l l D E X E + + ] [ ] [ ] [ : ] [ : X E X E

58 7. Queueg ad shag systes 58 atg te dstbuto ( Let deote the watg te of a (tycal custoe Let X* deote the ube of custoes the syste at the aval te The custoe has to wat oly f X*. Ths haes wth ob.. Ude the assuto that X*, the syste, howeve, looks lke a oday M/M/ queue wth aval ate l ad sevce ate. Let deote the watg te of a (tycal custoe ths M/M/ queue Let X* deote the ube of custoes the syste at the aval te It follows that, } *' ' { } * { } * { } { } { ( > > > > t e X t P X t P X P t P P t

59 7. Queueg ad shag systes 59 atg te dstbuto ( atg te ca thus be eseted as a oduct JD of two de. ado vaables J ~ Beoull( ad D ~ Ex((: ( ( ( ( ( ( ( ] [ ] [ ] [ ] ' [ } { ] [ '] [ ] [ ] [, } ', { } { } { } { > > > t E E D D E J P E D E J E E t e t D J P t P J P P

60 7. Queueg ad shag systes Exale ( Pte oble Cosde the followg two dffeet cofguatos: Oe ad te (IID tg tes ~ Ex( Two slowe aallel tes (IID tg tes ~ Ex( Cteo: ze ea delay E[D] Oe ad te (M/M/ odel wth l/(: E[D ] Two slowe tes (M/M/ odel wth l/(: ( (+ + E [ D ] E[ D ] > E[ D ] 6

61 7. Queueg ad shag systes Exale ( E[D ]/E[D ] Taffc load 6

62 7. Queueg ad shag systes Cotets Refeshe: Sle teletaffc odel Queueg dscle M/M/FIFO ( seve, watg laces, custoe laces M/M/PS ( seve, watg laces, custoe laces Alcato to acket level odellg of data taffc M/M/FIFO ( seves, watg laces, custoe laces M/M/PS ( seves, watg laces, custoe laces Alcato to flow level odellg of elastc data taffc M/M//k/kPS (k custoes, seve, k custoe laces 6

63 7. Queueg ad shag systes M/M/PS queue Cosde the followg sle teletaffc odel: Ifte ube of deedet custoes (k Iteaval tes ae IID ad exoetally dstbuted wth ea /l so, custoes ave accodg to a Posso ocess wth testy l Fte ube of seves ( < Sevce equeets ae IID ad exoetally dstbuted wth ea / Ifte ube of custoe laces ( Queueg dscle: PS. If thee ae at ost custoes the syste (, each custoe has ts ow seve. Othewse ( >, the total sevce ate ( s shaed faly aog all custoes. Usg Kedall s otato, ths s a M/M/PS queue Notato: l/(taffc load 63

64 7. Queueg ad shag systes State tasto daga Let X(t deote the ube of custoes the syste at te t Assue that X(t at soe te t, ad cosde what haes dug a shot te teval (t, t+h]: wth ob. lh + o(h, a ew custoe aves (state tasto f + f >, the, wth ob. {,/} h + o(h {,} h + o(h, a custoe leaves the syste (state tasto f Pocess X(t s clealy a Makov ocess wth state tasto daga l l Note that ths s the sae educble bthdeath ocess wth a fte state sace S {,,,...} as fo the M/M/FIFO queue. l l + l 64

65 7. Queueg ad shag systes Equlbu dstbuto (3 Thus, fo a stable syste ( <, that s: l<, the equlbu dstbuto exsts ad s as follows: < P{ X } (!! a + b a + b,,,, K,, +, K Reak: Isestvty wth esect to sevce te dstbuto The esult fo the PS dscle s sestve to the sevce te dstbuto, that s: t s vald fo ay sevce te dstbuto wth ea / So, stead of the M/M/PS odel, we ca cosde, as well, the oe geeal M/G/PS odel 65

66 7. Queueg ad shag systes Mea delay Let D deote the total te (delay the syste of a (tycal custoe Sce the ea ube of custoes the syste, E[X], s the sae fo all wokcosevg queueg dscles, also the ea delay s the sae, by Lttle s esult. e ay aly the esult deved fo the FIFO dscle slde 55: E[ D] ( + ( whee w efes to the obablty P{ X * }! (!( b a + b 66

67 7. Queueg ad shag systes Mea delay E[D] vs. taffc load Note that the te ut s the aveage sevce equeet E[S] 6 5 E[D] taffc load 67

68 7. Queueg ad shag systes 68 Relatve thoughut A qualty of sevce easue s the elatve thoughut E[S]/E[D]: ( ( ( ( ( ( ] [ ] [ + + D E S E ( ( ( ] [ ] [ ( ] [ ] [ : : + + D E S E D E S E

69 7. Queueg ad shag systes Relatve thoughut E[S]/E[D] vs. taffc load E[S]/E[D] taffc load 69

70 7. Queueg ad shag systes Cotets Refeshe: Sle teletaffc odel Queueg dscle M/M/FIFO ( seve, watg laces, custoe laces M/M/PS ( seve, watg laces, custoe laces Alcato to acket level odellg of data taffc M/M/FIFO ( seves, watg laces, custoe laces M/M/PS ( seves, watg laces, custoe laces Alcato to flow level odellg of elastc data taffc M/M//k/kPS (k custoes, seve, k custoe laces 7

71 7. Queueg ad shag systes Flow level odel fo elastc data taffc ( Shag odels ae sutable fo descbg elastc data taffc at flow level Elastcty efes to the adatve sedg ate of TCP flows Ths kd of odels have bee oosed, e.g., by J. Robets ad hs eseaches (htt://eso.d.faceteleco.f/obets/ Cosde a lk betwee two acket outes taffc cossts of TCP flows loadg the lk R R R R 7

72 7. Queueg ad shag systes Flow level odel fo elastc data taffc ( The slest odel s a sgle seve ( ue shag syste wth a fxed total sevce ate of custoe TCP flow fle to be tasfeed l flow aval ate (flows e te ut S aveage flow sze aveage fle sze (data uts seve lk C lk seed (data uts e te ut sevce te fle tasfe te wth full lk seed / S/C aveage fle tasfe te wth full lk seed (te uts l 7

73 7. Queueg ad shag systes Taffc ocess flow duato tasfe te wth full lk ate exta delay flow aval tes te 4 3 ube of flows the syste elatve tassso ate fo sgle flows te / /4 /3 te 73

74 7. Queueg ad shag systes Teletaffc aalyss ( Syste caacty C lk seed Mbs Taffc load l flow aval ate flows e secod (cosdeed hee as a vaable S aveage flow sze kbts (assued hee to be costat Mbt the load / / Qualty of sevce (fo the uses ot of vew q thoughut E[S] / E[D] Assue a M/G/PS shag syste: flows ave accodg to a Posso ocess (wth ate l flow szes ae deedet ad detcally dstbuted accodg to ay dstbuto wth ea S q E[S] / E[D] l E[S] / E[N] C ( 74

75 7. Queueg ad shag systes Teletaffc aalyss ( The the quattatve elato betwee the thee factos (syste, taffc, ad qualty of sevce s gve by the followg foula: q Xut( C, l; S : C ls, C(, f f ls ls < C C ( < ( Note: Iteetato: The thoughut that a gve flow obtas equals the eag (o excess caacty C(. Cf. the esult slde 68 (M/G/PS wth,, dffeece s that elatve thoughut ad thoughut ae defed slghtly dffeetly. I elatve thoughut E[S] easues the sevce te whle thoughut E[S] s the ea fle sze bts. The syste s stable oly the foe case ( <. Othewse the ube of flows as well as the aveage delay gows wthout lts. I othe wods, the thoughut of a flow goes to zeo. 75

76 7. Queueg ad shag systes Exale Assue that flows ave at ate l6 flows e secod ad the lk seed s C Mbs. Gbs. The syste s stable sce Thoughut s C S l 6.6 < q Xut(,6; 6 4 Mbs.4 Gbs 76

77 7. Queueg ad shag systes Caacty vs. aval ate Gve the qualty of sevce equeet that q 4 Mbs, the equed lk seed C deeds o the aval ate l as follows: C( l { c > ls Xut( c, l; 4} ls lk seed C (Mbs aval ate l (flows e secod 77

78 7. Queueg ad shag systes Qualty of sevce vs. aval ate Gve the lk seed C Mbs, the qualty of sevce q deeds o the aval ate l as follows: q ( l Xut(, l; ls, l < /S 8 thoughut q (Mbs aval ate l (flows e secod 78

79 7. Queueg ad shag systes Qualty of sevce vs. caacty Gve the aval ate l6 flows e secod, the qualty of sevce q deeds o the lk seed C as follows: q ( C Xut( C,6; C 6S, C > 6S thoughut q (Mbs lk seed C (Mbs 79

80 7. Queueg ad shag systes Suay of alcato to flow level odellg of elastc data taffc M/G/PS odel s alcable to flow level odellg of elastc data taffc custoe TCP flow l flow aval ate (flows e te ut access lk seed fo a flow (data uts e te ut C seed of the shaed lk (data uts e te ut E[L] aveage flow sze (data uts E[S] / E[L]/ aveage flow tasfe te wth access lk ate l/( taffc load A qualty of sevce easue s the thoughut q E[ L] E[ D] E[ S] E[ D] ( ( + ( C ( ( + ( 8

81 7. Queueg ad shag systes Thoughut q vs. taffc load Note that the ate ut s the lk ate C.8 C thoughut q.6.4. C/ C/3 C/ C/ taffc load 8

82 7. Queueg ad shag systes Cotets Refeshe: Sle teletaffc odel Queueg dscle M/M/FIFO ( seve, watg laces, custoe laces M/M/PS ( seve, watg laces, custoe laces Alcato to acket level odellg of data taffc M/M/FIFO ( seves, watg laces, custoe laces M/M/PS ( seves, watg laces, custoe laces Alcato to flow level odellg of elastc data taffc M/M//k/kPS (k custoes, seve, k custoe laces 8

83 7. Queueg ad shag systes M/M//k/kPS queue Cosde the followg sle teletaffc odel: Fte ube of deedet custoes (k < ooff tye custoes (alteatg betwee dleess ad actvty Idle tes ae IID ad exoetally dstbuted wth ea / Oe seve ( Sevce equeets ae IID ad exoetally dstbuted wth ea / As ay custoe laces as custoes ( k Queueg dscle: PS. Usg Kedall s otato, ths s a M/M//k/kPS queue Ooff tye custoe: dleess sevce 83

84 7. Queueg ad shag systes State tasto daga Let X(t deote the ube of custoes the syste at te t Assue that X(t at soe te t, ad cosde what haes dug a shot te teval (t, t+h]: f < k, the, wth ob. (kh + o(h, a dle custoe becoes actve (state tasto f + f >, the, wth ob. (/h + o(h +o(h, a actve custoe becoes dle (state tasto f Pocess X(t s clealy a Makov ocess wth state tasto daga k (k k k Note that ocess X(t s a educble bthdeath ocess wth a fte state sace S {,,,k} 84

85 7. Queueg ad shag systes Equlbu dstbuto ( Local balace equatos (LBE: + ( k ( k + (LBE ( k! ( k k,,, K, k 85

86 7. Queueg ad shag systes 86 Equlbu dstbuto ( Noalzg codto (N: ł Ł k k k k k k k k k k k k k k k ' ' '! (! (! (! (! ( ( ( ( ( (N (

87 7. Queueg ad shag systes THE END hat you should udestad/eebe: exales of queueg ad shag systes what s eat by queueg dscle ad what kd of dscles ae FIFO, LIFO ad PS cocets of delay, taffc load ad thoughut what s eat by sestvty of soe systes to teaval ad/o sevce te dstbuto stablty codtos fo the systes (.e., whe a syste s stable? how ea delay ad watg tes ae calculated, dea behd devato of the watg te dstbutos 87

χ be any function of X and Y then

χ be any function of X and Y then We have show that whe we ae gve Y g(), the [ ] [ g() ] g() f () Y o all g ()() f d fo dscete case Ths ca be eteded to clude fuctos of ay ube of ado vaables. Fo eaple, suppose ad Y ae.v. wth jot desty fucto,

More information

RECAPITULATION & CONDITIONAL PROBABILITY. Number of favourable events n E Total number of elementary events n S

RECAPITULATION & CONDITIONAL PROBABILITY. Number of favourable events n E Total number of elementary events n S Fomulae Fo u Pobablty By OP Gupta [Ida Awad We, +91-9650 350 480] Impotat Tems, Deftos & Fomulae 01 Bascs Of Pobablty: Let S ad E be the sample space ad a evet a expemet espectvely Numbe of favouable evets

More information

IS 709/809: Computational Methods in IS Research. Simple Markovian Queueing Model

IS 709/809: Computational Methods in IS Research. Simple Markovian Queueing Model IS 79/89: Comutatoal Methods IS Research Smle Marova Queueg Model Nrmalya Roy Deartmet of Iformato Systems Uversty of Marylad Baltmore Couty www.umbc.edu Queueg Theory Software QtsPlus software The software

More information

Professor Wei Zhu. 1. Sampling from the Normal Population

Professor Wei Zhu. 1. Sampling from the Normal Population AMS570 Pofesso We Zhu. Samplg fom the Nomal Populato *Example: We wsh to estmate the dstbuto of heghts of adult US male. It s beleved that the heght of adult US male follows a omal dstbuto N(, ) Def. Smple

More information

are positive, and the pair A, B is controllable. The uncertainty in is introduced to model control failures.

are positive, and the pair A, B is controllable. The uncertainty in is introduced to model control failures. Lectue 4 8. MRAC Desg fo Affe--Cotol MIMO Systes I ths secto, we cosde MRAC desg fo a class of ult-ut-ult-outut (MIMO) olea systes, whose lat dyacs ae lealy aaetezed, the ucetates satsfy the so-called

More information

8. Queueing systems lect08.ppt S Introduction to Teletraffic Theory - Fall

8. Queueing systems lect08.ppt S Introduction to Teletraffic Theory - Fall 8. Queueg sysems lec8. S-38.45 - Iroduco o Teleraffc Theory - Fall 8. Queueg sysems Coes Refresher: Smle eleraffc model M/M/ server wag laces M/M/ servers wag laces 8. Queueg sysems Smle eleraffc model

More information

SUBSEQUENCE CHARACTERIZAT ION OF UNIFORM STATISTICAL CONVERGENCE OF DOUBLE SEQUENCE

SUBSEQUENCE CHARACTERIZAT ION OF UNIFORM STATISTICAL CONVERGENCE OF DOUBLE SEQUENCE Reseach ad Coucatos atheatcs ad atheatcal ceces Vol 9 Issue 7 Pages 37-5 IN 39-6939 Publshed Ole o Novebe 9 7 7 Jyot cadec Pess htt//yotacadecessog UBEQUENCE CHRCTERIZT ION OF UNIFOR TTITIC CONVERGENCE

More information

EP2200 Queueing theory and teletraffic systems. Queueing networks. Viktoria Fodor KTH EES/LCN KTH EES/LCN

EP2200 Queueing theory and teletraffic systems. Queueing networks. Viktoria Fodor KTH EES/LCN KTH EES/LCN EP2200 Queueg theory ad teletraffc systems Queueg etworks Vktora Fodor Ope ad closed queug etworks Queug etwork: etwork of queug systems E.g. data packets traversg the etwork from router to router Ope

More information

XII. Addition of many identical spins

XII. Addition of many identical spins XII. Addto of may detcal sps XII.. ymmetc goup ymmetc goup s the goup of all possble pemutatos of obects. I total! elemets cludg detty opeato. Each pemutato s a poduct of a ceta fte umbe of pawse taspostos.

More information

Lecture 9 Multiple Class Models

Lecture 9 Multiple Class Models Lectue 9 Multple Class Models Multclass MVA Appoxmate MVA 8.4.2002 Copyght Teemu Keola 2002 1 Aval Theoem fo Multple Classes Wth jobs the system, a job class avg to ay seve sees the seve as equlbum wth

More information

Chapter 2: Descriptive Statistics

Chapter 2: Descriptive Statistics Chapte : Decptve Stattc Peequte: Chapte. Revew of Uvaate Stattc The cetal teecy of a oe o le yetc tbuto of a et of teval, o hghe, cale coe, ofte uaze by the athetc ea, whch efe a We ca ue the ea to ceate

More information

Lecture 10: Condensed matter systems

Lecture 10: Condensed matter systems Lectue 0: Codesed matte systems Itoducg matte ts codesed state.! Ams: " Idstgushable patcles ad the quatum atue of matte: # Cosequeces # Revew of deal gas etopy # Femos ad Bosos " Quatum statstcs. # Occupato

More information

L-MOMENTS EVALUATION FOR IDENTICALLY AND NONIDENTICALLY WEIBULL DISTRIBUTED RANDOM VARIABLES

L-MOMENTS EVALUATION FOR IDENTICALLY AND NONIDENTICALLY WEIBULL DISTRIBUTED RANDOM VARIABLES THE PUBLISHING HOUSE PROCEEDINGS OF THE ROMANIAN ACADEMY, Sees A, OF THE ROMANIAN ACADEMY Volume 8, Numbe 3/27,. - L-MOMENTS EVALUATION FOR IDENTICALLY AND NONIDENTICALLY WEIBULL DISTRIBUTED RANDOM VARIABLES

More information

VIII Dynamics of Systems of Particles

VIII Dynamics of Systems of Particles VIII Dyacs of Systes of Patcles Cete of ass: Cete of ass Lea oetu of a Syste Agula oetu of a syste Ketc & Potetal Eegy of a Syste oto of Two Iteactg Bodes: The Reduced ass Collsos: o Elastc Collsos R whee:

More information

Exponential Generating Functions - J. T. Butler

Exponential Generating Functions - J. T. Butler Epoetal Geeatg Fuctos - J. T. Butle Epoetal Geeatg Fuctos Geeatg fuctos fo pemutatos. Defto: a +a +a 2 2 + a + s the oday geeatg fucto fo the sequece of teges (a, a, a 2, a, ). Ep. Ge. Fuc.- J. T. Butle

More information

Analysis of System Performance IN2072 Chapter 5 Analysis of Non Markov Systems

Analysis of System Performance IN2072 Chapter 5 Analysis of Non Markov Systems Char for Network Archtectures ad Servces Prof. Carle Departmet of Computer Scece U Müche Aalyss of System Performace IN2072 Chapter 5 Aalyss of No Markov Systems Dr. Alexader Kle Prof. Dr.-Ig. Georg Carle

More information

Simulation Output Analysis

Simulation Output Analysis Smulato Output Aalyss Summary Examples Parameter Estmato Sample Mea ad Varace Pot ad Iterval Estmato ermatg ad o-ermatg Smulato Mea Square Errors Example: Sgle Server Queueg System x(t) S 4 S 4 S 3 S 5

More information

= y and Normed Linear Spaces

= y and Normed Linear Spaces 304-50 LINER SYSTEMS Lectue 8: Solutos to = ad Nomed Lea Spaces 73 Fdg N To fd N, we eed to chaacteze all solutos to = 0 Recall that ow opeatos peseve N, so that = 0 = 0 We ca solve = 0 ecusvel backwads

More information

The Mathematical Appendix

The Mathematical Appendix The Mathematcal Appedx Defto A: If ( Λ, Ω, where ( λ λ λ whch the probablty dstrbutos,,..., Defto A. uppose that ( Λ,,..., s a expermet type, the σ-algebra o λ λ λ are defed s deoted by ( (,,...,, σ Ω.

More information

Some Different Perspectives on Linear Least Squares

Some Different Perspectives on Linear Least Squares Soe Dfferet Perspectves o Lear Least Squares A stadard proble statstcs s to easure a respose or depedet varable, y, at fed values of oe or ore depedet varables. Soetes there ests a deterstc odel y f (,,

More information

( m is the length of columns of A ) spanned by the columns of A : . Select those columns of B that contain a pivot; say those are Bi

( m is the length of columns of A ) spanned by the columns of A : . Select those columns of B that contain a pivot; say those are Bi Assgmet /MATH 47/Wte Due: Thusday Jauay The poblems to solve ae umbeed [] to [] below Fst some explaatoy otes Fdg a bass of the colum-space of a max ad povg that the colum ak (dmeso of the colum space)

More information

FIBONACCI-LIKE SEQUENCE ASSOCIATED WITH K-PELL, K-PELL-LUCAS AND MODIFIED K-PELL SEQUENCES

FIBONACCI-LIKE SEQUENCE ASSOCIATED WITH K-PELL, K-PELL-LUCAS AND MODIFIED K-PELL SEQUENCES Joual of Appled Matheatcs ad Coputatoal Mechacs 7, 6(), 59-7 www.ac.pcz.pl p-issn 99-9965 DOI:.75/jac.7..3 e-issn 353-588 FIBONACCI-LIKE SEQUENCE ASSOCIATED WITH K-PELL, K-PELL-LUCAS AND MODIFIED K-PELL

More information

2. Sample Space: The set of all possible outcomes of a random experiment is called the sample space. It is usually denoted by S or Ω.

2. Sample Space: The set of all possible outcomes of a random experiment is called the sample space. It is usually denoted by S or Ω. Ut: Rado expeet saple space evets classcal defto of pobablty ad the theoes of total ad copoud pobablty based o ths defto axoatc appoach to the oto of pobablty potat theoes based o ths appoach codtoal pobablty

More information

The Linear Probability Density Function of Continuous Random Variables in the Real Number Field and Its Existence Proof

The Linear Probability Density Function of Continuous Random Variables in the Real Number Field and Its Existence Proof MATEC Web of Cofeeces ICIEA 06 600 (06) DOI: 0.05/mateccof/0668600 The ea Pobablty Desty Fucto of Cotuous Radom Vaables the Real Numbe Feld ad Its Estece Poof Yya Che ad Ye Collee of Softwae, Taj Uvesty,

More information

A GENERAL CLASS OF ESTIMATORS UNDER MULTI PHASE SAMPLING

A GENERAL CLASS OF ESTIMATORS UNDER MULTI PHASE SAMPLING TATITIC IN TRANITION-ew sees Octobe 9 83 TATITIC IN TRANITION-ew sees Octobe 9 Vol. No. pp. 83 9 A GENERAL CLA OF ETIMATOR UNDER MULTI PHAE AMPLING M.. Ahed & Atsu.. Dovlo ABTRACT Ths pape deves the geeal

More information

Chapter 7 Varying Probability Sampling

Chapter 7 Varying Probability Sampling Chapte 7 Vayg Pobablty Samplg The smple adom samplg scheme povdes a adom sample whee evey ut the populato has equal pobablty of selecto. Ude ceta ccumstaces, moe effcet estmatos ae obtaed by assgg uequal

More information

A Family of Non-Self Maps Satisfying i -Contractive Condition and Having Unique Common Fixed Point in Metrically Convex Spaces *

A Family of Non-Self Maps Satisfying i -Contractive Condition and Having Unique Common Fixed Point in Metrically Convex Spaces * Advaces Pure Matheatcs 0 80-84 htt://dxdoorg/0436/a04036 Publshed Ole July 0 (htt://wwwscrporg/oural/a) A Faly of No-Self Mas Satsfyg -Cotractve Codto ad Havg Uque Coo Fxed Pot Metrcally Covex Saces *

More information

2.28 The Wall Street Journal is probably referring to the average number of cubes used per glass measured for some population that they have chosen.

2.28 The Wall Street Journal is probably referring to the average number of cubes used per glass measured for some population that they have chosen. .5 x 54.5 a. x 7. 786 7 b. The raked observatos are: 7.4, 7.5, 7.7, 7.8, 7.9, 8.0, 8.. Sce the sample sze 7 s odd, the meda s the (+)/ 4 th raked observato, or meda 7.8 c. The cosumer would more lkely

More information

Consider two masses m 1 at x = x 1 and m 2 at x 2.

Consider two masses m 1 at x = x 1 and m 2 at x 2. Chapte 09 Syste of Patcles Cete of ass: The cete of ass of a body o a syste of bodes s the pot that oes as f all of the ass ae cocetated thee ad all exteal foces ae appled thee. Note that HRW uses co but

More information

7.0 Equality Contraints: Lagrange Multipliers

7.0 Equality Contraints: Lagrange Multipliers Systes Optzato 7.0 Equalty Cotrats: Lagrage Multplers Cosder the zato of a o-lear fucto subject to equalty costrats: g f() R ( ) 0 ( ) (7.) where the g ( ) are possbly also olear fuctos, ad < otherwse

More information

Minimum Hyper-Wiener Index of Molecular Graph and Some Results on Szeged Related Index

Minimum Hyper-Wiener Index of Molecular Graph and Some Results on Szeged Related Index Joual of Multdscplay Egeeg Scece ad Techology (JMEST) ISSN: 359-0040 Vol Issue, Febuay - 05 Mmum Hype-Wee Idex of Molecula Gaph ad Some Results o eged Related Idex We Gao School of Ifomato Scece ad Techology,

More information

such that for 1 From the definition of the k-fibonacci numbers, the firsts of them are presented in Table 1. Table 1: First k-fibonacci numbers F 1

such that for 1 From the definition of the k-fibonacci numbers, the firsts of them are presented in Table 1. Table 1: First k-fibonacci numbers F 1 Scholas Joual of Egeeg ad Techology (SJET) Sch. J. Eg. Tech. 0; (C):669-67 Scholas Academc ad Scetfc Publshe (A Iteatoal Publshe fo Academc ad Scetfc Resouces) www.saspublshe.com ISSN -X (Ole) ISSN 7-9

More information

2.1.1 The Art of Estimation Examples of Estimators Properties of Estimators Deriving Estimators Interval Estimators

2.1.1 The Art of Estimation Examples of Estimators Properties of Estimators Deriving Estimators Interval Estimators . ploatoy Statstcs. Itoducto to stmato.. The At of stmato.. amples of stmatos..3 Popetes of stmatos..4 Devg stmatos..5 Iteval stmatos . Itoducto to stmato Samplg - The samplg eecse ca be epeseted by a

More information

1 Onto functions and bijections Applications to Counting

1 Onto functions and bijections Applications to Counting 1 Oto fuctos ad bectos Applcatos to Coutg Now we move o to a ew topc. Defto 1.1 (Surecto. A fucto f : A B s sad to be surectve or oto f for each b B there s some a A so that f(a B. What are examples of

More information

Minimizing spherical aberrations Exploiting the existence of conjugate points in spherical lenses

Minimizing spherical aberrations Exploiting the existence of conjugate points in spherical lenses Mmzg sphecal abeatos Explotg the exstece of cojugate pots sphecal leses Let s ecall that whe usg asphecal leses, abeato fee magg occus oly fo a couple of, so called, cojugate pots ( ad the fgue below)

More information

= lim. (x 1 x 2... x n ) 1 n. = log. x i. = M, n

= lim. (x 1 x 2... x n ) 1 n. = log. x i. = M, n .. Soluto of Problem. M s obvously cotuous o ], [ ad ], [. Observe that M x,..., x ) M x,..., x ) )..) We ext show that M s odecreasg o ], [. Of course.) mles that M s odecreasg o ], [ as well. To show

More information

Non-degenerate Perturbation Theory

Non-degenerate Perturbation Theory No-degeerate Perturbato Theory Proble : H E ca't solve exactly. But wth H H H' H" L H E Uperturbed egevalue proble. Ca solve exactly. E Therefore, kow ad. H ' H" called perturbatos Copyrght Mchael D. Fayer,

More information

Overview. Review Superposition Solution. Review Superposition. Review x and y Swap. Review General Superposition

Overview. Review Superposition Solution. Review Superposition. Review x and y Swap. Review General Superposition ylcal aplace Soltos ebay 6 9 aplace Eqato Soltos ylcal Geoety ay aetto Mechacal Egeeg 5B Sea Egeeg Aalyss ebay 6 9 Ovevew evew last class Speposto soltos tocto to aal cooates Atoal soltos of aplace s eqato

More information

Sebastián Martín Ruiz. Applications of Smarandache Function, and Prime and Coprime Functions

Sebastián Martín Ruiz. Applications of Smarandache Function, and Prime and Coprime Functions Sebastá Martí Ruz Alcatos of Saradache Fucto ad Pre ad Core Fuctos 0 C L f L otherwse are core ubers Aerca Research Press Rehoboth 00 Sebastá Martí Ruz Avda. De Regla 43 Choa 550 Cadz Sa Sarada@telele.es

More information

INTRODUCTION TO QUEUING MODELS

INTRODUCTION TO QUEUING MODELS UNIVERSITY OF MARIBOR FACULTY OF LOGISTICS Wokg ae INTRODUCTION TO QUEUING MODELS Deja Daga Bout Jeeb Celje, Jue 3 CONTENT BASICS OF MODELING AND SIMULATION...4. Descto of the system...7. Defto of the

More information

Mean is only appropriate for interval or ratio scales, not ordinal or nominal.

Mean is only appropriate for interval or ratio scales, not ordinal or nominal. Mea Same as ordary average Sum all the data values ad dvde by the sample sze. x = ( x + x +... + x Usg summato otato, we wrte ths as x = x = x = = ) x Mea s oly approprate for terval or rato scales, ot

More information

ˆ SSE SSE q SST R SST R q R R q R R q

ˆ SSE SSE q SST R SST R q R R q R R q Bll Evas Spg 06 Sggested Aswes, Poblem Set 5 ECON 3033. a) The R meases the facto of the vaato Y eplaed by the model. I ths case, R =SSM/SST. Yo ae gve that SSM = 3.059 bt ot SST. Howeve, ote that SST=SSM+SSE

More information

Lecture 8 IEEE DCF Performance

Lecture 8 IEEE DCF Performance Lecture 8 IEEE82. DCF Perforace IEEE82. DCF Basc Access Mechas A stato wth a ew packet to trast otors the chael actvty. If the chael s dle for a perod of te equal to a dstrbuted terfrae space (DIFS), the

More information

means the first term, a2 means the term, etc. Infinite Sequences: follow the same pattern forever.

means the first term, a2 means the term, etc. Infinite Sequences: follow the same pattern forever. 9.4 Sequeces ad Seres Pre Calculus 9.4 SEQUENCES AND SERIES Learg Targets:. Wrte the terms of a explctly defed sequece.. Wrte the terms of a recursvely defed sequece. 3. Determe whether a sequece s arthmetc,

More information

Chapter 5 Properties of a Random Sample

Chapter 5 Properties of a Random Sample Lecture 3 o BST 63: Statstcal Theory I Ku Zhag, /6/006 Revew for the revous lecture Cocets: radom samle, samle mea, samle varace Theorems: roertes of a radom samle, samle mea, samle varace Examles: how

More information

NONDIFFERENTIABLE MATHEMATICAL PROGRAMS. OPTIMALITY AND HIGHER-ORDER DUALITY RESULTS

NONDIFFERENTIABLE MATHEMATICAL PROGRAMS. OPTIMALITY AND HIGHER-ORDER DUALITY RESULTS HE PUBLISHING HOUSE PROCEEDINGS OF HE ROMANIAN ACADEMY, See A, OF HE ROMANIAN ACADEMY Volue 9, Nube 3/8,. NONDIFFERENIABLE MAHEMAICAL PROGRAMS. OPIMALIY AND HIGHER-ORDER DUALIY RESULS Vale PREDA Uvety

More information

VECTOR MECHANICS FOR ENGINEERS: Vector Mechanics for Engineers: Dynamics. In the current chapter, you will study the motion of systems of particles.

VECTOR MECHANICS FOR ENGINEERS: Vector Mechanics for Engineers: Dynamics. In the current chapter, you will study the motion of systems of particles. Seeth Edto CHPTER 4 VECTOR MECHNICS FOR ENINEERS: DYNMICS Fedad P. ee E. Russell Johsto, J. Systems of Patcles Lectue Notes: J. Walt Ole Texas Tech Uesty 003 The Mcaw-Hll Compaes, Ic. ll ghts eseed. Seeth

More information

Introduction to local (nonparametric) density estimation. methods

Introduction to local (nonparametric) density estimation. methods Itroducto to local (oparametrc) desty estmato methods A slecture by Yu Lu for ECE 66 Sprg 014 1. Itroducto Ths slecture troduces two local desty estmato methods whch are Parze desty estmato ad k-earest

More information

International Journal of Mathematics Trends and Technology (IJMTT) Volume 47 Number 1 July 2017

International Journal of Mathematics Trends and Technology (IJMTT) Volume 47 Number 1 July 2017 Iteatioal Joual of Matheatics Teds ad Techology (IJMTT) Volue 47 Nube July 07 Coe Metic Saces, Coe Rectagula Metic Saces ad Coo Fixed Poit Theoes M. Sivastava; S.C. Ghosh Deatet of Matheatics, D.A.V. College

More information

Summary of the lecture in Biostatistics

Summary of the lecture in Biostatistics Summary of the lecture Bostatstcs Probablty Desty Fucto For a cotuos radom varable, a probablty desty fucto s a fucto such that: 0 dx a b) b a dx A probablty desty fucto provdes a smple descrpto of the

More information

Question 1. Typical Cellular System. Some geometry TELE4353. About cellular system. About cellular system (2)

Question 1. Typical Cellular System. Some geometry TELE4353. About cellular system. About cellular system (2) TELE4353 Moble a atellte Commucato ystems Tutoal 1 (week 3-4 4 Questo 1 ove that fo a hexagoal geomety, the co-chael euse ato s gve by: Q (3 N Whee N + j + j 1/ 1 Typcal Cellula ystem j cells up cells

More information

Distribution of Geometrically Weighted Sum of Bernoulli Random Variables

Distribution of Geometrically Weighted Sum of Bernoulli Random Variables Appled Mathematc, 0,, 8-86 do:046/am095 Publhed Ole Novembe 0 (http://wwwscrpog/oual/am) Dtbuto of Geometcally Weghted Sum of Beoull Radom Vaable Abtact Deepeh Bhat, Phazamle Kgo, Ragaath Naayaachaya Ratthall

More information

Birth-Death Processes. Outline. EEC 686/785 Modeling & Performance Evaluation of Computer Systems. Relationship Among Stochastic Processes.

Birth-Death Processes. Outline. EEC 686/785 Modeling & Performance Evaluation of Computer Systems. Relationship Among Stochastic Processes. EEC 686/785 Modelig & Perforace Evaluatio of Couter Systes Lecture Webig Zhao Deartet of Electrical ad Couter Egieerig Clevelad State Uiversity webig@ieee.org based o Dr. Raj jai s lecture otes Relatioshi

More information

Chain Rules for Entropy

Chain Rules for Entropy Cha Rules for Etroy The etroy of a collecto of radom varables s the sum of codtoal etroes. Theorem: Let be radom varables havg the mass robablty x x.x. The...... The roof s obtaed by reeatg the alcato

More information

UNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS

UNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS UNIVERSITY OF OSLO DEPARTMENT OF ECONOMICS Postpoed exam: ECON430 Statstcs Date of exam: Jauary 0, 0 Tme for exam: 09:00 a.m. :00 oo The problem set covers 5 pages Resources allowed: All wrtte ad prted

More information

Likewise, properties of the optimal policy for equipment replacement & maintenance problems can be used to reduce the computation.

Likewise, properties of the optimal policy for equipment replacement & maintenance problems can be used to reduce the computation. Whe solvg a vetory repleshmet problem usg a MDP model, kowg that the optmal polcy s of the form (s,s) ca reduce the computatoal burde. That s, f t s optmal to replesh the vetory whe the vetory level s,

More information

A tighter lower bound on the circuit size of the hardest Boolean functions

A tighter lower bound on the circuit size of the hardest Boolean functions Electroc Colloquum o Computatoal Complexty, Report No. 86 2011) A tghter lower boud o the crcut sze of the hardest Boolea fuctos Masak Yamamoto Abstract I [IPL2005], Fradse ad Mlterse mproved bouds o the

More information

å 1 13 Practice Final Examination Solutions - = CS109 Dec 5, 2018

å 1 13 Practice Final Examination Solutions - = CS109 Dec 5, 2018 Chrs Pech Fal Practce CS09 Dec 5, 08 Practce Fal Examato Solutos. Aswer: 4/5 8/7. There are multle ways to obta ths aswer; here are two: The frst commo method s to sum over all ossbltes for the rak of

More information

Recent Advances in Computers, Communications, Applied Social Science and Mathematics

Recent Advances in Computers, Communications, Applied Social Science and Mathematics Recet Advaces Computes, Commucatos, Appled ocal cece ad athematcs Coutg Roots of Radom Polyomal Equatos mall Itevals EFRAI HERIG epatmet of Compute cece ad athematcs Ael Uvesty Cete of amaa cece Pa,Ael,4487

More information

Investigation of Partially Conditional RP Model with Response Error. Ed Stanek

Investigation of Partially Conditional RP Model with Response Error. Ed Stanek Partally Codtoal Radom Permutato Model 7- vestgato of Partally Codtoal RP Model wth Respose Error TRODUCTO Ed Staek We explore the predctor that wll result a smple radom sample wth respose error whe a

More information

Unit 9. The Tangent Bundle

Unit 9. The Tangent Bundle Ut 9. The Taget Budle ========================================================================================== ---------- The taget sace of a submafold of R, detfcato of taget vectors wth dervatos at

More information

Third handout: On the Gini Index

Third handout: On the Gini Index Thrd hadout: O the dex Corrado, a tala statstca, proposed (, 9, 96) to measure absolute equalt va the mea dfferece whch s defed as ( / ) where refers to the total umber of dvduals socet. Assume that. The

More information

CHAPTER VI Statistical Analysis of Experimental Data

CHAPTER VI Statistical Analysis of Experimental Data Chapter VI Statstcal Aalyss of Expermetal Data CHAPTER VI Statstcal Aalyss of Expermetal Data Measuremets do ot lead to a uque value. Ths s a result of the multtude of errors (maly radom errors) that ca

More information

Financial volatility and independent and identically distributed variables

Financial volatility and independent and identically distributed variables Facal volatlty ad deedet ad detcally dstbuted vaables Abal Fgueedo a, Ia Glea b, Raul Matsushta c, Sego Da Slva d,* a Deatet of Physcs, Uvesty of Basla, 7090-900 Basla DF, Bazl b Deatet of Physcs, Fedeal

More information

{ }{ ( )} (, ) = ( ) ( ) ( ) Chapter 14 Exercises in Sampling Theory. Exercise 1 (Simple random sampling): Solution:

{ }{ ( )} (, ) = ( ) ( ) ( ) Chapter 14 Exercises in Sampling Theory. Exercise 1 (Simple random sampling): Solution: Chapter 4 Exercses Samplg Theory Exercse (Smple radom samplg: Let there be two correlated radom varables X ad A sample of sze s draw from a populato by smple radom samplg wthout replacemet The observed

More information

Class 13,14 June 17, 19, 2015

Class 13,14 June 17, 19, 2015 Class 3,4 Jue 7, 9, 05 Pla for Class3,4:. Samplg dstrbuto of sample mea. The Cetral Lmt Theorem (CLT). Cofdece terval for ukow mea.. Samplg Dstrbuto for Sample mea. Methods used are based o CLT ( Cetral

More information

CIS 800/002 The Algorithmic Foundations of Data Privacy October 13, Lecture 9. Database Update Algorithms: Multiplicative Weights

CIS 800/002 The Algorithmic Foundations of Data Privacy October 13, Lecture 9. Database Update Algorithms: Multiplicative Weights CIS 800/002 The Algorthmc Foudatos of Data Prvacy October 13, 2011 Lecturer: Aaro Roth Lecture 9 Scrbe: Aaro Roth Database Update Algorthms: Multplcatve Weghts We ll recall aga) some deftos from last tme:

More information

STK4011 and STK9011 Autumn 2016

STK4011 and STK9011 Autumn 2016 STK4 ad STK9 Autum 6 Pot estmato Covers (most of the followg materal from chapter 7: Secto 7.: pages 3-3 Secto 7..: pages 3-33 Secto 7..: pages 35-3 Secto 7..3: pages 34-35 Secto 7.3.: pages 33-33 Secto

More information

Module Title: Business Mathematics and Statistics 2

Module Title: Business Mathematics and Statistics 2 CORK INSTITUTE OF TECHNOLOGY INSTITIÚID TEICNEOLAÍOCHTA CHORCAÍ Semeste Eamatos 009/00 Module Ttle: Busess Mathematcs ad Statstcs Module Code: STAT 6003 School: School of Busess ogamme Ttle: Bachelo of

More information

9 U-STATISTICS. Eh =(m!) 1 Eh(X (1),..., X (m ) ) i.i.d

9 U-STATISTICS. Eh =(m!) 1 Eh(X (1),..., X (m ) ) i.i.d 9 U-STATISTICS Suppose,,..., are P P..d. wth CDF F. Our goal s to estmate the expectato t (P)=Eh(,,..., m ). Note that ths expectato requres more tha oe cotrast to E, E, or Eh( ). Oe example s E or P((,

More information

2/20/2013. Topics. Power Flow Part 1 Text: Power Transmission. Power Transmission. Power Transmission. Power Transmission

2/20/2013. Topics. Power Flow Part 1 Text: Power Transmission. Power Transmission. Power Transmission. Power Transmission /0/0 Topcs Power Flow Part Text: 0-0. Power Trassso Revsted Power Flow Equatos Power Flow Proble Stateet ECEGR 45 Power Systes Power Trassso Power Trassso Recall that for a short trassso le, the power

More information

2. Independence and Bernoulli Trials

2. Independence and Bernoulli Trials . Ideedece ad Beroull Trals Ideedece: Evets ad B are deedet f B B. - It s easy to show that, B deedet mles, B;, B are all deedet ars. For examle, ad so that B or B B B B B φ,.e., ad B are deedet evets.,

More information

Debabrata Dey and Atanu Lahiri

Debabrata Dey and Atanu Lahiri RESEARCH ARTICLE QUALITY COMPETITION AND MARKET SEGMENTATION IN THE SECURITY SOFTWARE MARKET Debabrata Dey ad Atau Lahr Mchael G. Foster School of Busess, Uersty of Washgto, Seattle, Seattle, WA 9895 U.S.A.

More information

Atomic units The atomic units have been chosen such that the fundamental electron properties are all equal to one atomic unit.

Atomic units The atomic units have been chosen such that the fundamental electron properties are all equal to one atomic unit. tomc uts The atomc uts have bee chose such that the fudametal electo popetes ae all equal to oe atomc ut. m e, e, h/, a o, ad the potetal eegy the hydoge atom e /a o. D3.33564 0-30 Cm The use of atomc

More information

Section l h l Stem=Tens. 8l Leaf=Ones. 8h l 03. 9h 58

Section l h l Stem=Tens. 8l Leaf=Ones. 8h l 03. 9h 58 Secto.. 6l 34 6h 667899 7l 44 7h Stem=Tes 8l 344 Leaf=Oes 8h 5557899 9l 3 9h 58 Ths dsplay brgs out the gap the data: There are o scores the hgh 7's. 6. a. beams cylders 9 5 8 88533 6 6 98877643 7 488

More information

Chapter 5 Properties of a Random Sample

Chapter 5 Properties of a Random Sample Lecture 6 o BST 63: Statstcal Theory I Ku Zhag, /0/008 Revew for the prevous lecture Cocepts: t-dstrbuto, F-dstrbuto Theorems: Dstrbutos of sample mea ad sample varace, relatoshp betwee sample mea ad sample

More information

Difference Sets of Null Density Subsets of

Difference Sets of Null Density Subsets of dvces Pue Mthetcs 95-99 http://ddoog/436/p37 Pulshed Ole M (http://wwwscrpog/oul/p) Dffeece Sets of Null Dest Susets of Dwoud hd Dsted M Hosse Deptet of Mthetcs Uvest of Gul Rsht I El: hd@gulc h@googlelco

More information

Random Variables and Probability Distributions

Random Variables and Probability Distributions Radom Varables ad Probablty Dstrbutos * If X : S R s a dscrete radom varable wth rage {x, x, x 3,. } the r = P (X = xr ) = * Let X : S R be a dscrete radom varable wth rage {x, x, x 3,.}.If x r P(X = x

More information

Math 7409 Homework 2 Fall from which we can calculate the cycle index of the action of S 5 on pairs of vertices as

Math 7409 Homework 2 Fall from which we can calculate the cycle index of the action of S 5 on pairs of vertices as Math 7409 Hoewok 2 Fall 2010 1. Eueate the equivalece classes of siple gaphs o 5 vetices by usig the patte ivetoy as a guide. The cycle idex of S 5 actig o 5 vetices is 1 x 5 120 1 10 x 3 1 x 2 15 x 1

More information

Bounds on the expected entropy and KL-divergence of sampled multinomial distributions. Brandon C. Roy

Bounds on the expected entropy and KL-divergence of sampled multinomial distributions. Brandon C. Roy Bouds o the expected etropy ad KL-dvergece of sampled multomal dstrbutos Brado C. Roy bcroy@meda.mt.edu Orgal: May 18, 2011 Revsed: Jue 6, 2011 Abstract Iformato theoretc quattes calculated from a sampled

More information

A New Method for Solving Fuzzy Linear. Programming by Solving Linear Programming

A New Method for Solving Fuzzy Linear. Programming by Solving Linear Programming ppled Matheatcal Sceces Vol 008 o 50 7-80 New Method for Solvg Fuzzy Lear Prograg by Solvg Lear Prograg S H Nasser a Departet of Matheatcs Faculty of Basc Sceces Mazadara Uversty Babolsar Ira b The Research

More information

2SLS Estimates ECON In this case, begin with the assumption that E[ i

2SLS Estimates ECON In this case, begin with the assumption that E[ i SLS Estmates ECON 3033 Bll Evas Fall 05 Two-Stage Least Squares (SLS Cosder a stadard lear bvarate regresso model y 0 x. I ths case, beg wth the assumto that E[ x] 0 whch meas that OLS estmates of wll

More information

Chapter 9 Jordan Block Matrices

Chapter 9 Jordan Block Matrices Chapter 9 Jorda Block atrces I ths chapter we wll solve the followg problem. Gve a lear operator T fd a bass R of F such that the matrx R (T) s as smple as possble. f course smple s a matter of taste.

More information

Chapter 8. Linear Momentum, Impulse, and Collisions

Chapter 8. Linear Momentum, Impulse, and Collisions Chapte 8 Lnea oentu, Ipulse, and Collsons 8. Lnea oentu and Ipulse The lnea oentu p of a patcle of ass ovng wth velocty v s defned as: p " v ote that p s a vecto that ponts n the sae decton as the velocty

More information

GREEN S FUNCTION FOR HEAT CONDUCTION PROBLEMS IN A MULTI-LAYERED HOLLOW CYLINDER

GREEN S FUNCTION FOR HEAT CONDUCTION PROBLEMS IN A MULTI-LAYERED HOLLOW CYLINDER Joual of ppled Mathematcs ad Computatoal Mechacs 4, 3(3), 5- GREE S FUCTIO FOR HET CODUCTIO PROBLEMS I MULTI-LYERED HOLLOW CYLIDER Stasław Kukla, Uszula Sedlecka Isttute of Mathematcs, Czestochowa Uvesty

More information

STK3100 and STK4100 Autumn 2017

STK3100 and STK4100 Autumn 2017 SK3 ad SK4 Autum 7 Geeralzed lear models Part III Covers the followg materal from chaters 4 ad 5: Sectos 4..5, 4.3.5, 4.3.6, 4.4., 4.4., ad 4.4.3 Sectos 5.., 5.., ad 5.5. Ørulf Borga Deartmet of Mathematcs

More information

1 Solution to Problem 6.40

1 Solution to Problem 6.40 1 Soluto to Problem 6.40 (a We wll wrte T τ (X 1,...,X where the X s are..d. wth PDF f(x µ, σ 1 ( x µ σ g, σ where the locato parameter µ s ay real umber ad the scale parameter σ s > 0. Lettg Z X µ σ we

More information

Discrete Pseudo Almost Periodic Solutions for Some Difference Equations

Discrete Pseudo Almost Periodic Solutions for Some Difference Equations Advaces Pue Matheatcs 8-7 do:46/ a44 Publshed Ole July (htt://wwwscrpog/joual/a) Dscete Pseudo Alost Peodc Solutos fo Soe Dffeece Equatos Abstact Elhad At Dads * Khall Ezzb Lahce Lhach Uvesty Cad Ayyad

More information

PTAS for Bin-Packing

PTAS for Bin-Packing CS 663: Patter Matchg Algorthms Scrbe: Che Jag /9/00. Itroducto PTAS for B-Packg The B-Packg problem s NP-hard. If we use approxmato algorthms, the B-Packg problem could be solved polyomal tme. For example,

More information

Fairing of Parametric Quintic Splines

Fairing of Parametric Quintic Splines ISSN 46-69 Eglad UK Joual of Ifomato ad omputg Scece Vol No 6 pp -8 Fag of Paametc Qutc Sples Yuau Wag Shagha Isttute of Spots Shagha 48 ha School of Mathematcal Scece Fuda Uvesty Shagha 4 ha { P t )}

More information

Progression. CATsyllabus.com. CATsyllabus.com. Sequence & Series. Arithmetic Progression (A.P.) n th term of an A.P.

Progression. CATsyllabus.com. CATsyllabus.com. Sequence & Series. Arithmetic Progression (A.P.) n th term of an A.P. Pogessio Sequece & Seies A set of umbes whose domai is a eal umbe is called a SEQUENCE ad sum of the sequece is called a SERIES. If a, a, a, a 4,., a, is a sequece, the the expessio a + a + a + a 4 + a

More information

Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand DIS 10b

Discrete Mathematics and Probability Theory Fall 2016 Seshia and Walrand DIS 10b CS 70 Dscrete Mathematcs ad Probablty Theory Fall 206 Sesha ad Walrad DIS 0b. Wll I Get My Package? Seaky delvery guy of some compay s out delverg packages to customers. Not oly does he had a radom package

More information

= 5! 3! 2! = 5! 3! (5 3)!. In general, the number of different groups of r items out of n items (when the order is ignored) is given by n!

= 5! 3! 2! = 5! 3! (5 3)!. In general, the number of different groups of r items out of n items (when the order is ignored) is given by n! 0 Combiatoial Aalysis Copyight by Deiz Kalı 4 Combiatios Questio 4 What is the diffeece betwee the followig questio i How may 3-lette wods ca you wite usig the lettes A, B, C, D, E ii How may 3-elemet

More information

Part 4b Asymptotic Results for MRR2 using PRESS. Recall that the PRESS statistic is a special type of cross validation procedure (see Allen (1971))

Part 4b Asymptotic Results for MRR2 using PRESS. Recall that the PRESS statistic is a special type of cross validation procedure (see Allen (1971)) art 4b Asymptotc Results for MRR usg RESS Recall that the RESS statstc s a specal type of cross valdato procedure (see Alle (97)) partcular to the regresso problem ad volves fdg Y $,, the estmate at the

More information

Dr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur

Dr. Shalabh Department of Mathematics and Statistics Indian Institute of Technology Kanpur Aalyss of Varace ad Desg of Exermets-I MODULE II LECTURE - GENERAL LINEAR HYPOTHESIS AND ANALYSIS OF VARIANCE Dr Shalabh Deartmet of Mathematcs ad Statstcs Ida Isttute of Techology Kaur Tukey s rocedure

More information

Outline. Basic Components of a Queue. Queueing Notation. EEC 686/785 Modeling & Performance Evaluation of Computer Systems.

Outline. Basic Components of a Queue. Queueing Notation. EEC 686/785 Modeling & Performance Evaluation of Computer Systems. EEC 686/785 Modelg & Performace Evaluato of Computer Systems Lecture 5 Departmet of Electrcal ad Computer Egeerg Clevelad State Uversty webg@eee.org (based o Dr. Raj Ja s lecture otes) Outle Homework #5

More information

Module 7. Lecture 7: Statistical parameter estimation

Module 7. Lecture 7: Statistical parameter estimation Lecture 7: Statstcal parameter estmato Parameter Estmato Methods of Parameter Estmato 1) Method of Matchg Pots ) Method of Momets 3) Mamum Lkelhood method Populato Parameter Sample Parameter Ubased estmato

More information

Chapter 13, Part A Analysis of Variance and Experimental Design. Introduction to Analysis of Variance. Introduction to Analysis of Variance

Chapter 13, Part A Analysis of Variance and Experimental Design. Introduction to Analysis of Variance. Introduction to Analysis of Variance Chapter, Part A Aalyss of Varace ad Epermetal Desg Itroducto to Aalyss of Varace Aalyss of Varace: Testg for the Equalty of Populato Meas Multple Comparso Procedures Itroducto to Aalyss of Varace Aalyss

More information

Collapsing to Sample and Remainder Means. Ed Stanek. In order to collapse the expanded random variables to weighted sample and remainder

Collapsing to Sample and Remainder Means. Ed Stanek. In order to collapse the expanded random variables to weighted sample and remainder Collapg to Saple ad Reader Mea Ed Staek Collapg to Saple ad Reader Average order to collape the expaded rado varable to weghted aple ad reader average, we pre-ultpled by ( M C C ( ( M C ( M M M ( M M M,

More information

Introduction to Matrices and Matrix Approach to Simple Linear Regression

Introduction to Matrices and Matrix Approach to Simple Linear Regression Itroducto to Matrces ad Matrx Approach to Smple Lear Regresso Matrces Defto: A matrx s a rectagular array of umbers or symbolc elemets I may applcatos, the rows of a matrx wll represet dvduals cases (people,

More information