QoS-Assured Service Composition in Managed Service Overlay Networks
|
|
- Augustus Sparks
- 8 years ago
- Views:
Transcription
1 QoS-Assued Sevie Compositio i Maaged Sevie Ovelay Netwoks Xiaoui Gu, Klaa Nastedt epatmet of Compute Siee Uivesity of Illiois at Ubaa-Campaig xgu, s.uiu.edu Rog N. Cag, Cistope Wad Netwok Hosted Appliatio Sevies IBM T.J. Watso Resea Cete og, us.ibm.om Abstat May value-added ad otet delivey sevies ae beig offeed via sevie level ageemets (SLAs. Tese sevies a be iteoeted to fom a sevie ovelay etwok ( ove te Iteet. Sevie ompositio i as emeged as a ost-effetive appoa to quikly eatig ew sevies. Pevious esea as addessed te eliability, adaptability, ad ompatibility issues fo omposed sevies. Howeve, little as bee doe to maage geei quality-of-sevie (QoS povisioig fo omposed sevies, based o te SLA otats of idividual sevies. I tis pape, we peset QUEST, a QoS assued omposeable Sevie ifastutue, to addess te poblem. QUEST famewok povides: (1 iitial sevie ompositio, wi a ompose a qualified sevie pat ude multiple QoS ostaits (e.g., espose time, availability. If multiple qualified sevie pats exist, QUEST ooses te best oe aodig to te load balaig meti; ad (2 dyami sevie ompositio, wi a dyamially eompose te sevie pat to quikly eove fom sevie outages ad QoS violatios. iffeet fom te pevious wok, QUEST a simultaeously aieve QoS assuaes ad good load balaig i. 1 Itodutio Te Iteet as evolved to beome a ommeial ifastutue of sevie delivey istead of meely povidig ost oetivity. iffeet foms of ovelay etwoks ave bee developed to povide attative sevie povisioig solutios, wi ae diffiult to be implemeted ad deployed i te IP-laye, su as otet delivey ovelays [1] Tis wok was suppoted i pat by te NASA gat ude otat umbe NASA NAG , Natioal Siee Foudatio ude otat umbe , , ad EIA EQ. Ay opiios, fidigs, ad olusios o eommedatios expessed i tis mateial ae tose of te autos ad do ot eessaily eflet te views of te Natioal Siee Foudatio (NSF, NASA o U.S. Govemet. Aess omai Potal Potal Aess omai Sevie Ovelay Netwok ( Potal Sevie Povide: XXX.om sevie istae X sevie istae Y Aess omai sevie istae Z Figue 1. Illustatio of te Sevie Ovelay Netwok Model. ad pee-to-pee file saig ovelays [2]. Beyod tis, we evisio te emegee of sevie ovelay etwoks (, illustated by Figue 1. Ea ode povides ot oly appliatio-level data outig but also a set of value-added sevies (e.g., media tasodig, data eyptio. Ea sevie ompoet is offeed via a sevie level ageemet (SLA otat [15]. Sevie ompositio i as beome eessay i ode to ost-effetively eate ew Iteet sevies [8]. Tus, a allegig poblem is to povide a sevie ifastutue to eable effiiet sevie ompositio wit quality-of-sevie (QoS assuaes. Mu esea wok as addessed te sevie ompositio poblem. Te SAHARA poet [8] addessed te fault-esiliee poblem i wide-aea sevie ompositio. Te CANS poet [9] addessed te adaptability poblem i sevie ompositio. Te SPY-Net [17, 18] famewok addessed te poblem of esoue otetio wile fidig a multimedia sevie pat. I te Gaia poet [11], we addessed te QoS osistey ad load patitio issues fo omposig sevie pat i ubiquitous omputig eviomets. Howeve, little as bee doe to suppot geei 1
2 QoS povisioig fo omposed sevies, based o te SLA otats of idividual sevie ompoets. I tis pape, we peset QUEST, a QoS assued omposeable Sevie ifastutue, wi a povide bot QoS assuaes ude multiple QoS ostaits, ad load balaig i. Sevie ompositio is pefomed by te sevie ompose (SC usig a omposed sevie povisioig potool. Te potool is desiged based o a etwok-eti liet-service model [4]. Istead of otatig sevie povides dietly, te liet otats SC toug a well-kow addess ad speifies its desied sevies ad QoS equiemets. Te, SC, as a itemediate aget, omposes ad istatiates a qualified sevie pat i. Te key algoitms used by SC ilude: (1 iitial sevie ompositio, ad (2 dyami sevie ompositio. Te iitial sevie ompositio algoitm popely ooses ad omposes te sevie istaes, based o tei SLA otats ad uet pefomaes i ode to best mat te QoS ostaits of te use. QUEST aieves ot oly QoS assuaes but also load balaig i by ompeesively osideig bot QoS ad esoues of diffeet sevie istaes. Moeove, QUEST povides dyami sevie ompositio, wi is used duig utime we sevie outages o QoS violatios ou. Te algoitm fids a alteative sevie pat i, wi a quikly eove te failed omposed sevie delivey. Extesive simulatio esults sow tat QUEST a povide mu bette QoS assuaes ad load balaig fo omposed sevies i ta ote ommo euistis. Te est of te pape is ogaized as follows. Setio 2 itodues te oveall system desig. Setio 3 desibes te desig details ad te key sevie ompositio algoitms. Setio 4 pesets te pefomae evaluatios. Setio 5 disusses elated wok. Fially, te pape oludes i Setio 6. 2 System Oveview I QUEST, osists of vaious sevie ompoets 1, alled odes. Ea ode epesets a sevie ompoet, wi is maaged by idividual ompoet sevie povide (CSP. Te oetios betwee odes ae alled liks, wi ae appliatio-level vitual liks. We assume tat ea CSP a maage ad otol te quality levels of its ow sevies i aodae to te SLA otat wit te sevie povide (PSP. O te ote ad, te PSP as a SLA otat wit te use fo ea omposed sevie. I ode to allow PSP to moito ad maage te quality levels of te omposed sevie, we itodue s tat seve as te etae/ poits of te. I QUEST, s 1 seveal sevie istaes a o-loated o te same pysial ost. Figue 2. Illustatio of te QUEST s sevie ompositio model. defie te maagemet bouday of QoS povisioig fo omposed appliatios. We all su a wit s a maaged. Te QUEST sevie ompositio model iludes two mappig steps, illustated by Figue 2 (a. Fo ea use equest, te sevie ompose (SC fist maps it to a omposite sevie template, ad te maps te template to a istatiated sevie pat. Te mappig fom te use equest to diffeet omposite sevie templates (mappig- 1 is ostaied by te use s appliatio-speifi quality equiemets ad diffeet pevasive liet devies, su as PAs ad ell-poes. Mappig-1 as bee addessed by seveal esea wok [11, 9]. It a be pefomed based o te appliatio-speifi QoS speifiatios [12] o usig automati ompositio pla tools [13]. Te mappig fom te omposite sevie template to a istatiated sevie pat (mappig-2 is ostaied by distibuted pefomae (e.g., espose time ad esoue availability oditios. Little esea as addessed te mappig-2 tat is te fous of tis pape. I QUEST, te omposed sevie delivey, witi, stats fom te etae, taveses toug te ose sevie istaes, eds at te, illustated by Figue 2 (b. We assume tat ea sevie istae (o ovelay lik is assoiated wit a SLA otat speifyig its QoS assuaes su as espose time 2
3 Y e E Q i f i f N Y Y \ (o delay ad availability (o. Te availability is alulated by "!#%$ &'(*+ &,-&/.01 '(('( 2'435 2" 687:9*+;2(<*= <!#. Te oetio betwee two sevie istaes is alled te sevie lik, wi is mapped to a ovelay outig pat?>a@cb FE GHGIGJE K. Te availability MLON of te sevie lik (HP is alulated as <R/S ; ad te delay L N of te sevie lik ( P is deived usig T R/S. Ea CSP povides a SLA otat to te PSP ad is esposible fo maagig its ow sevie ompoets o ovelay liks. Te omposed sevie U is also assoiated wit a SLA otat speifyig te QoS assuae tat te PSP pomises to te use. 3 Iitial Sevie Compositio I tis setio, we peset te iitial sevie ompositio solutio, wi ae used duig te setup pase of te omposed sevie delivey. Suppose ea sevie istae (o sevie lik P is offeed to te PSP via a SLA otat speifyig its povisioig QoS: availability (o VLWN ad espose time (o delay XLON. Te QoS assuaes (availability: Y ad espose time: Y of te omposed appliatio U :Z GIGHG[E \/] a be deived as follows 2, fg; ^I_a` i bd e ^H_C` b-m o ^H_q` kl p b- kl fg; sdt i sdt m kl p kl8u vdwyx{zx} l-~ x _4 z _8 x (ƒz ^ fg; ~ x{ y yƒz ^ (1 N (2 Suppose also tat te PSP as a SLA otat wit te use to speify its povisioig QoS fo te omposed sevie X (availability ˆ2 {ŠŒ <ˆ 0 ad espose time Y ˆ2 {ŠŽ <ˆ. I ode to guaatee a suessful sevie delivey, te esoue equiemets of te istatiated sevie pat ave to be satisfied. Fo simpliity, we oly oside te CPU esoue fo ed osts ad badwidt fo ovelay liks. We defie te tem pu atio fo te sevie istae as > ;Š: Œ Š5 9, { IL L. Te ;Š5 Š: epesets te equied CPU esoue fo uig a ew poess. Te { IL L epesets te available CPU esoue i te pysial ostig eviomet of. If 1, te te sevie equest a be admitted. Otewise, te sevie equest will be deied. Te smalle te, te moe advatageous we oose te sevie istae i tems of CPU load balaig beause we stat te ew 2 I ode to make te meti availability beomes additive ad miimum-optimal, we apply te logitm ad ivese opeatios o te meti availability. We assume tat š m ad œ N ae measued fo a appliatio data uit (e.g., a video fame. sevie poess o a ligtly loaded ost. Similaly, we defie te tem badwidt atio fo te sevie lik P as ž L NV>Ÿ3{'(1 V Œ LŠ5 N Š: 9 3{'(1 M<Œ { LON IL L. Wit te above otatios, we a fomulate te QoS-assued sevie ompositio poblem as follows, EFINITION 1. QoS-assued Sevie Compositio (QSC Poblem Suppose we ae give a dieted gap epesetig a sevie ovelay etwok ( topology, G = (V, E, wee V ad E ae te sets of N odes ad M liks, espetively. Suppose also ea ode is aateized by oegative values of 2 additive QoS attibutes (21 0,, i = 1...N. Ea lik is also aateized by oegative values of 2 additive QoS attibutes ( 1 ;,, i = 1...M. Give te template fo a omposed 0 sevie X ad use QoS equiemets 1 ª «ad ˆ2 {ŠŽ <ˆ, te poblem of QoS-assued sevie ompositio is to ompose a sevie pat p E GIGHḠ E fom Z (etae to \/] (, su tat 1 ª «2 1 0 (equ.(1 ad ˆ2 {ŠŽ <ˆ 0 Y (equ. (2, ad also J ž 1, i = , ad L N 1, = 0... We ow pove tat te QSC poblem is NP-omplete. Teoem 1 QSC poblem is NP-omplete. Poof: We pove tis by sowig tat te Multiple Costaied Pat seletio (MCP poblem, wi is kow to be NP-omplete [] maps dietly to a speial ase of te QSC poblem. Te detailed poof is omitted due to te page limitatio. Besides its NP-ompleteess, te above QSC poblem defiitio also eglets seveal impotat patial issues. Fist, i te eal wold SLA otat, te QoS attibutes ae ofte speified usig aveage values measued ove a log time peiod su as a mot o a yea [15]. Howeve, te omposed sevie sessio a last fo oly seveal miutes o ous. Hee, we eed to oside ot oly SLA otat values but also eet pefomae oditios of sevie istaes/liks. Seod, te PSP a ouetly seve tousads of use equests by omposig available sevie istaes. To aieve best aggegate QoS assuaes fo all uses, we also eed to oside te load balaig poblem. Tid, beause is igly dyami, QoS violatios a appe sometimes. Commeial SLA otats usually make te PSP lose moey we QoS violatio appes [15]. Hee, te goal of ou QSC algoitms is to ompose a sevie pat tat a best avoid QoS violatios o miimize te QoS violatio degee if a violatio ous. We ow povide a polyomial euisti algoitm, alled QSC-basi, fo te QSC poblem. Te basi idea is to use a modified iksta algoitm by ompeesively osideig multiple ostaits (e.g., SLA otats, eet pefomae, system load. Te QSC-basi pimaily ivolves two steps: (1 Geeate te weigted adidate 3
4 e u u u N ' ' T B f 5. m N ' N M. S M M M e Z Z S0 (S0, etae (S0, (, S12 (, (a (, (,S4 (,S4 (S0, S4 S0 etae (S0, (, S12 (, (b (, (,S4 (,S4 Figue 3. Illustatio of te QSC-basi algoitm. S4 gap. Istead of seaig te sevie pat i te etie, we fist geeate a adidate gap, illustated by Figue 3 (a, to miimize te seaig age. Te "Œ olum i te adidate gap iludes all te sevie istae adidates povidig te <Œ sevie futio i te appliatio template. Te ost value o te edge 0> P 7 P is defied usig te followig itegated meti: ^H_ ^ ^H_C ^H_ N ^H_ sdt m s t f* f+-, f.!. m ^H_ f*.! "#%$! &'( ( / ( ^I_ f*. N ^H_ 01 ^H_ ( f. sdt f*. u sdt f. f* ( $! &' ( 2 s m 2 s 4Ms 4Ms 3 f m '(5 Ituitively, te atio (9 epesets ay of te above paametes epesets te omalized ost of seletig a potio of te sevie pat i tems of oe speifi fato (e.g., QoS assuaes o load balaig; ad (2 Ru te iksta algoitm to fid te sotest pat, wi is etued as te esult of te QoS-assued sevie ompositio, illustated by Figue 3 (b. Howeve, te above QSC-basi algoitm does ot oside ea idividual QoS ostait wile omposig a sevie pat. We ow peset a eaed algoitm, alled QSC-eaed. Afte geeatig te adidate gap, we assoiate ea edge > P*7: ; P< = wit a ost value, wi modifies te equatio (3 by multiplyig a o-egative value?> >FE7 wit Ã@ C Z ea atio 6. Te weigt epesets te sigifiae of te "HIŒ fato 6G7 wile seletig te sevie istae duig ea EXTRACT Mi step i te iksta algoitm. Te ige te value, te moe impotat te (HIŒ fato. iffeet fom te QSC-basi, te QSC-eaed algoitm dyamially ages te impotae of diffeet fatos by adustig aodigly. Te adustmet of is based (3 o te pessue of diffeet QoS ostaits. Ituitively, if te uet aumulated value of a QoS attibute (e.g., espose time appoaes its ostait, we iease its weigt i ope tat its aumulatio will at up i te late stage of te sevie pat ompositio. Suppose is te uet ose ode by Extat Mi, wose fial sotest pat fom te soue Z is ust detemied. We defie te espose time pessue IKJ/L, availability pessue I { WL, ad te weigt adustmet futios as follows, MON%P s t m!q1rm ^I_ Q1T e sdt. ^H_ "# ª «v l e v e vvu e vxw e ` Y[Z `V\ vv] \ vv^ vx_ e vv` e vva e vxb e ` Y[Z (4 M N%P (5 M N%P `V\ vv] \ vv^ M N%P (6 Bot QSC-basi ad QSC-eaed algoitms ave te same omputatioal omply ed 7, wee d is te umbe of odes i te adidate gap. 4 yami Sevie Compositio is a igly dyami system ompaed to te IP etwok ifastutue. Fist, ulike outes, osts a dyamially oi o leave ove log time sales. Seod, osts o udelyig IP etwok pat a expeiee pefomae failues, outages, o degadatios ove sot time sales [3]. Hee, duig utime, a establised sevie pat a beome boke o violate QoS ostaits, patiulaly fo te log-lived appliatio sessio su as multimedia steamig. We te sevie istae (o lik expeiees outage o sigifiat quality degadatios, te SC is otified. It eoves all te affeted sessios usig te dyami sevie ompositio algoitms. We ave desiged two dyami sevie ompositio algoitms: (1 QSC-omplete, wi ompletely e-omposes te sevie pat witout osideig te oigial sevie pat, to eove fom failues; ad (2 QSC-patial, wi patially e-omposes te sevie pat based o te oigial sevie pat. Figue 4 illustates te omplete sevie e-ompositio algoitm QSC-omplete. Figue 4 (a sows te adidate gap ad te oigial sevie pat, o wi te sevie istae is failed ad te sevie lik betwee adf is boke. Te QSC-omplete algoitm fist modifies te adidate gap by emovig tose failed o pooly-pefomig sevie istaes, ad also eplaig te boke sevie liks wit alteate outig pats we it is possible, illustated by Figue 4 (b. I tis example, is emoved fom te seod olum of te adidate gap. Te failue sevie lik betwee ad f is eplaed wit a alteative pat. Te eoveed sevie lik is illustated as a dotted lie i Figue 4 (b. Te, we use 4
5 E f E etae etae S12 etae etae (a (b ( Figue 4. Illustatio of te omplete sevie e-ompositio algoitm QSC-omplete. S12 etae (a (b ( Figue 5. Illustatio of te patial sevie eompositio algoitm QSC-patial. etae Reoveed Sevie Lik Reoveed Sevie Lik quikly e-ompose a ew sevie pat to eove fom failues o QoS violatios. Howeve, ea of tem as bot advatages ad disadvatages. Te advatage of te QSComplete algoitm is tat it a e-ompose a bette sevie pat i tems of QoS assuaes ta te QSC-patial algoitm, sie it as moe oies of sevie istaes. Te disadvatage of te QSC-omplete algoitm is tat te sevie e-ompositio takes loge time sie it eomposes te etie sevie pat. O te ote ad, te advatage of te QSC-patial algoitm is tat it is quike ad easie to implemet sie it oly ages pat of te sevie pat. Howeve, its disadvatage is tat te ew omposed sevie pat may ot be optimal. We will fute ompae tese two diffeet dyami sevie ompositio appoaes i te ext setio. 5 Pefomae Evaluatio 5.1 Evaluatio metodology te QSC-eaed algoitm, desibed i Setio 3.1, to ompose a ew qualified sevie pat. Tus, te sevie sessio a quikly eove fom failues o QoS violatios by switig fom te old sevie pat to te ew oe 3. Cotastig wit te QSC-omplete algoitm, QSCpatial algoitm patially e-omposes te sevie pat based o te oigial sevie pat. Figue 5 (a sows te same sevie pat example as Figue 4 (a. I te oigial de E sevie pat etae, sevie istae is failed ad sevie lik betwee ad f is boke. I Figue 5 (b, oweve, we modify te adidate gap by ot oly emovig te pooly-pefomig o failed sevie istaes (e.g., ad eoveig te boke sevie liks (e.g., te sevie lik betwee ad f, but also emovig, i te olum wee te old sevie istae is good, te ote adidate sevie istaes. I tis example, adf still pefom well. Tus, we emove Ž ad f i te tid olum of te adidate gap, ad f adf1f i te fout olum. Te, we use te QSC-eaed algoitm to ompose a ew sevie pat o te modified adidate gap, illustated by Figue 5 (. Te pupose of su a appoa is to keep tose oigial well-pefomig sevie istaes i te ew sevie pat. Hee, we a edue te migatio oveead fo switig fom te old sevie pat to te ew oe. Te omputatioal omply of QSComplete ad QSC-patial is still ed 7, wee d is te umbe of odes i te adidate gap. Bot QSC-omplete ad QSC-patial algoitms a 3 We assume tat te states of all te sevie istaes a be eoveed by softwae. We evaluate te pefomae of te iitial ad dyami QoS-assued sevie ompositio algoitms usig extesive simulatios. We fist use te degee-based Iteet topology geeato Iet 3.0 [16] to geeate a powe-law adom gap topology wit 3200 odes to epeset te Iteet topology. We te adomly selet 500 odes as te odes ad 40 ote odes as te s. We assume a equal-degee adom gap topology fo te. Ea ode is adomly assiged 5 ote odes as its eigbos. Hee, te pobig oveead of ea ode is witi 9 >8>J> E. Te iitial esoue availability of ea IP lik ad sevie istae is uifomly distibuted i a etai age. Te SLA values of ea IP lik o sevie istae ae also uifomly distibuted witi etai age. iffeet values eflet te eteogeeity ad divesified quality guaatees i. Moeove, to simulate te pefomae vaiatio i te eal wold, te QoS attibutes of ea IP lik ad sevie istae ae set by uifom distibutio futios, wit SLA values as te mea values. We assume te iksta sotest pat algoitm fo bot te IP laye ad ovelay laye outig, usig te istataeous value of delay as te outig meti. Te badwidt of a ovelay lik is te bottleek badwidt alog te IP etwok pat. Te delay of a ovelay lik is te additio of te delays alog te IP etwok pat. uig ea miute, etai umbe of use equests ae geeated. Te use equest is epeseted by ay of 40 omposite sevie templates tat ompise 2 to 6 sevies. Ea use sessio lasts fom 15 to 60 miutes. Te metis we use fo evaluatig te QoS assuaes ilude QoS violatio ate ad QoS violatio degee. Te QoS violatio ate is measued by te atio of te sessios duig 5
6 wi QoS violatio appes ove te total sessios. Fo ea sessio, te QoS violatio is said to appe if te measued aveage QoS attibute values (i.e., availability, espose time is wose ta tat speified i te SLA otat. Te QoS violatio degee measues tat if a QoS violatio ous, ow sevee te QoS violatio is. It is measued by te atio of diffeee betwee te measued QoS attibute value ad its taget value, ove te taget value. Tose two metis ae ofte assoiated wit te fiaial efud/pealty poliies speified i te eal wold SLA otats. Te miimizatio of tose two metis meas to edue te fiaial loss of te sevie povide. Te meti we use fo evaluatig te load balaig is te povisioig suess ate. A omposed sevie povisioig is said to be suessful if ad oly if duig its etie sessio, all te sevie istaes ad liks esoue equiemets o te sevie pat ae always satisfied. Te omposed sevie povisioig suess ate is defied as te umbe of suessful equests ove te total umbe of all equests. Give te total amout of esoue i, ige povisioig suess ate epesets bette load balaig i. Fo ompaiso, we also implemet two ommo euisti algoitms fo omposig sevie pat: fixed ad adom algoitms.te fixed algoitm always ooses te same sevie istaes fo a omposed appliatio. Te adom algoitm adomly ooses sevie istaes to ompose te sevie pat. Availability Violatio Rate [%] QSC-Basi QSC-Eaed QSC-Patial QSC-Complete Load: Sessio Request Rate [sessios/mi] Figue 6. Aveage availability QoS violatio ate ude diffeet system load. 5.2 Results ad aalysis Figue 6 ad Figue 7 sow te simulatio esults about te violatio ates of two QoS attibutes: availability ad espose time, espetively. I Figue 6, te X axis epesets diffeet sessio equest ate, alulated by te umbe of omposed sevie sessio equests pe miute. Te age of sessio equest ate is seleted to eflet Respose Time Violatio Rate [%] QSC-Basi QSC-Eaed QSC-Patial QSC-Complete Load: Sessio Request Rate [sessios/mi] Figue 7. Aveage espose time QoS violatio ate ude diffeet system load. diffeet system wokload put o te. Te Y axis sows te aveage QoS violatio ate fo te availability attibute, aieved by te fixed, adom ad ou fou QSC (QoS-assued sevie ompositio algoitms. QSC- Basi ad QSC-Eaed epeset te two iitial sevie ompositio algoitms. Bot of tem do ot ilude ay dyami sevie e-ompositio meaisms. Bot QSC- Complete ad QSC-Patial use te QSC-Eaed fo te iitial sevie ompositio ad also dyamially eoves fom te sevie outage/quality degadatios by ompletely o patially e-omposig te sevie pat. Ea aveage availability QoS violatio ate ( value is alulated ad aveaged ove a peiod of 200 miutes fo all suessfully omposed sessios. Te esults sow tat all te fou QSC algoitms aieve mu lowe ta te fixed ad adom algoitms. Te QSC-Eaed as as mu as 20% impovemets ta te QSC-Basi. Bot QSC- Complete ad QSC-Patial fute edue ( to almost 0% lowe. Te easo is tat te appliatio-level sevie outage eovey a quikly fiis i a few seods wile te IP-laye Iteet pat eovey may take seveal miutes o eve ous [3]. Howeve, te pefomae diffeee betwee QSC-Complete ad QSC-Patial is vey small. Similaly, Figue 7 sows te esults of te QoS violatio ate fo te espose time (. Agai, te QSC algoitms aieve mu lowe ta fixed ad adom. Te pefomae ode of diffeet QSC algoitms is QSC-Basi (wose ta QSC-Eaed QSC- Patial QSC-Complete. Te easo wy te QSC algoitms ae bette ta te QSC-Eaed is tat sevie e-ompositio always uses te most eet pefomae ad load ifomatio, wi allows it to make bette sevie istae oies i tems of espose time. Figue 8 ad Figue 9 sow te esults about te QoS violatio degee. Figue 8 sows te availability QoS violatio degee ( f. Oe agai, te QSC algoitms osistetly aieve bette pefomae ta fixed ad adom. Figue 6
7 Aveage Violatio egee [%] QSC-Basi QSC-Eaed QSC-Patial QSC-Complete Load: Sessio Request Rate [sessios/mi] Figue 8. Aveage availability QoS violatio degee ude diffeet system load. Suess Rate [%] QSC-Basi QSC-Eaed QSC-Patial QSC-Complete Load: Sessio Request Rate [sessiois/mi] Figue. Aveage povisioig suess ate ude diffeet system load (load balaig. Aveage Respose Time Violatio egee [%] QSC-Basi QSC-Eaed QSC-Patial QSC-Complete Load: Sessio Request Rate [sessios/mi] Figue 9. Aveage espose time QoS violatio degee ude diffeet system load. 9 sows simila esults fo te espose time QoS violatio degee. Hee, te simulatio esults fute validate ou algoitms by sowig tat QSC algoitms a ot oly geatly edue te violatio ate but also aieve lowe violatio degee we QoS violatios ou. Figue sows te esults about te omposed sevie povisioig suess ate. Simila to te above expeimets, ea povisioig suess ate value is alulated ad aveaged ove a peiod of 200 miutes. Te esults sow tat all fou QSC algoitms a similaly aieve mu ige povisioig suess ate, amely bette load balaig, ta te fixed ad adom. I all of te above expeimets, we obseve tat te pefomae gais of te QSC-Complete ae vey small ompaed to te QSC-Patial. Te easo is tat te iitial sevie ompositio algoitm QSC-Eaed is aleady vey good. Hee, te seleted sevie istaes i te old sevie pat ae still, by lage pobability, te best oes we we e-ompose te sevie pat. Hee, it is a ea optimal solutio tat we keep te old good sevie istaes i te ew sevie pat, wi is exatly te QSC-Patial algoitm. 6 Related Wok Besides to te elated wok metioed i te Itodutio, mu ote esea wok as also addessed te sevie ompositio poblem. Te SWOR poet at Stafod [13] povided a develope toolkit fo te web sevie ompositio. It a automatially geeate a futioal ompositio pla give te futioal equiemets fo te omposed appliatio. Howeve, SWOR oly addessed te mappig-1 poblem defied i ou famewok. Te eflow poet at HP labs [7] povided a adaptive ad dyami sevie ompositio meaism fo te ommeial e-busiess poess maagemet. It did ot addess te edto-ed QoS assuaes fo te omposed sevie. Ou wok is also diffeet fom te taditioal IP-laye QoS outig poblem [5] beause: (1 Te goal of IP-laye QoS outig is to fid a etwok outig pat satisfyig QoS ostaits wile QUEST addesses two mappig poblems to aieve ot oly QoS assuaes but also load balaig ad faulttoleae; ad (2 IP-laye QoS outig oly osides te etwok esoue wile QUEST osides ot oly etwok esoues but also ed-system esoues (e.g., CPU. Ote losely elated wok iludes vaious ovelay etwoks. Adeso et al. poposed a esiliet ovelay etwok (RON aitetue [3] to allow distibuted appliatios to quikly detet ad eove fom te Iteet pat failue. RON a eove fom etwok pat outage witi seveal seods usig te appliatio-level outig. RON is useful ad beefiial to QUEST altoug it oly solved a subset of te dyami sevie ompositio poblems. I [6], ua et. al. also poposed te oept of, wi a povide value-added sevies wit QoS assuaes to te use via SLA otats. Howeve, tey oly addessed te badwidt povisioig poblem fo, wile QUEST osides ot oly esoue povisioig (e.g., badwidt ad CPU, but also vaious sevie QoS (e.g., espose time ad availability. Te OveQoS [14] poposed a aite- 7
8 tue to povide Iteet QoS (e.g., statistial badwidt ad loss ate assuaes usig ovelay etwoks. QUEST is diffeet fom OveQoS by povidig QoS assuaes fo omposed sevies, based o SLA otats of idividual sevie ompoets. 7 Colusio We ave peseted a QoS-assued omposed sevie delivey famewok, alled QUEST, fo a maaged sevie ovelay etwok (. Te mao otibutios of tis pape ilude: (1 fomally defie te QoS-assued sevie ompositio poblem ad pove tat it is NP-omplete. We te desig effiiet appoximate optimal algoitms to ompose sevie pats ude multiple QoS ostaits. Moeove, QUEST a aieve soud load balaig i to povide best possible QoS fo all uses; (2 povide bot patial ad omplete dyami sevie eompositio algoitms, wi a quikly eove te sevie pat fom failues o QoS violatios. We ave implemeted a lage-sale simulatio test-bed ad ou extesive simulatio esults sow tat QUEST a povide bot QoS assuaes ad load balaig fo omposed sevies i. Te simulatio esults also idiate tat ou patial dyami sevie e-ompositio algoitm a aieve almost te same level of QoS assuae as te omplete e-ompositio algoitm, but wit mu lowe oveead. 8 Akowledgmet We would like to tak. Ei Wu at IBM T.J. Watso esea ete fo is elpful iput to ou wok. We wis to tak aoymous eviewes fo tei elpful suggestios. Refeees [1] Akamai I. ttp:// [2] Gutella. ttp://gutella.wego.om/. [3]. Adese, H. Balakisa, F. Kaasoek, ad R. Mois. Resiliet Ovelay Netwoks. Po. of 18t ACM SOSP 2001, Baff, Caada, Otobe [4] R. Cag ad C. Ravisaka. A Sevie Aquisitio Meamism fo Seve-Based Heteogeeous istibuted Systems. IEEE Tasatios o Paallel ad istibuted Systems, 5(2, Febuay [5] S. Ce ad K. Nastedt. A Oveview of Quality-of- Sevie Routig fo te Next Geeatio Hig-Speed Netwoks: Poblems ad Solutios. IEEE Netwok Magazie, Speial Issue o Tasmissio ad istibutio of igital Video, 12(6, pp , [6] Z. ua, Z.-L. Zag, ad T. Hou. Sevie Ovelay etwoks : SLAs, QoS ad Badwidt Povisioig. Po. of t IEEE Iteatioal Cofeee o Netwok Potools(ICNP2002, Pais, Fae, Novembe [7] B. Rama et. al. Te SAHARA Model fo Sevie Compositio Aoss Multiple Povides. Po. of Iteatioal Cofeee o Pevasive Computig (Pevasive 2002, Aug [8] F. Casati et. al. Adaptive ad yami Sevie Compositio i eflow. HP teial Repot HPL , Ma [9] X. Fu, W. Si, A. Akkema, ad V. Kaameti. CANS: Composable, Adaptive Netwok Sevies Ifastutue. Po. of 3d USENIX Symposium o Iteet Teologies ad Systems, Ma [] M. R. Gaey ad. S. Joso. Computes ad Itatability. A Guide to te Teoy of NP-Completeess, Feema, Sa Faiso, [11] X. Gu ad K. Nastedt. yami QoS-Awae Multimedia Sevie Cofiguatio i Ubiquitous Computig Eviomets. Po. of IEEE 22d Iteatioal Cofeee o istibuted Computig Systems (ICCS 2002, July [12] X. Gu, K. Nastedt, W. Yua,. Wiadakul, ad. Xu. A XML-based Quality of Sevie Eablig Laguage fo te Web. Joual of Visual Laguage ad Computig, Speial Issue o Multimedia Laguage fo te Web, 13(1, pp , Febuay [13] S.R. Poekati ad A. Fox. SWOR: A evelope Toolkit fo Buildig Composite Web Sevies. Po. of te Elevet Wold Wide Web Cofeee (Web Egieeig Tak, Hoolulu, Hawaii, May [14] L. Subamaia, I. Stoia, H. Balakisa, ad R. H. Katz. OveQoS: Offeig QoS usig Ovelays. Po. of Fist Woksop o Hop Topis i Netwoks (HotNets-I, Pieto, New Jesey, Otobe [15] C. Wad, M. Buo, R. Cag, ad L. Lua. A Geei SLA Semati Model fo te Exeutio Maagemet of e- Bussiess Outsouig Cotats. Po. of 3d Iteatioal Cofeee o e-commee ad Web Teologies (EC-Web 2002, Septembe [16] J. Wiik ad S. Jami. Iet3.0: Iteet Topology Geeato. Te Repot UM-CSE-TR (ttp://il.ees.umi.edu/ami/, [17]. Xu ad K. Nastedt. Fidig Sevie Pats i a Media Sevie Poxy Netwok. Po. of SPIE/ACM Multimedia Computig ad Netwokig Cofeee, Sa Jose, CA, Jauay [18]. Xu, K. Nastedt, ad. Wiadakul. QoS ad Cotetio Awae Multi-Resoue Resevatio. Cluste Computig, te Joual of Netwoks, Softwae Tools ad Appliatios, 4(2, Kluwe Aademi Publises,
Strategic Remanufacturing Decision in a Supply Chain with an External Local Remanufacturer
Assoiatio fo Ifomatio Systems AIS Eletoi Libay (AISeL) WHICEB 013 Poeedigs Wuha Iteatioal Cofeee o e-busiess 5-5-013 Stategi Remaufatuig Deisio i a Supply Chai with a Exteal Loal Remaufatue Xu Tiatia Shool
More informationUnderstanding Financial Management: A Practical Guide Guideline Answers to the Concept Check Questions
Udestadig Fiacial Maagemet: A Pactical Guide Guidelie Aswes to the Cocept Check Questios Chapte 4 The Time Value of Moey Cocept Check 4.. What is the meaig of the tems isk-etu tadeoff ad time value of
More informationPeriodic Review Probabilistic Multi-Item Inventory System with Zero Lead Time under Constraints and Varying Order Cost
Ameica Joual of Applied Scieces (8: 3-7, 005 ISS 546-939 005 Sciece Publicatios Peiodic Review Pobabilistic Multi-Item Ivetoy System with Zeo Lead Time ude Costaits ad Vayig Ode Cost Hala A. Fegay Lectue
More informationANNUITIES SOFTWARE ASSIGNMENT TABLE OF CONTENTS... 1 ANNUITIES SOFTWARE ASSIGNMENT... 2 WHAT IS AN ANNUITY?... 2 EXAMPLE 1... 2 QUESTIONS...
ANNUITIES SOFTWARE ASSIGNMENT TABLE OF CONTENTS ANNUITIES SOFTWARE ASSIGNMENT TABLE OF CONTENTS... 1 ANNUITIES SOFTWARE ASSIGNMENT... WHAT IS AN ANNUITY?... EXAMPLE 1... QUESTIONS... EXAMPLE BRANDON S
More informationMoney Math for Teens. Introduction to Earning Interest: 11th and 12th Grades Version
Moey Math fo Tees Itoductio to Eaig Iteest: 11th ad 12th Gades Vesio This Moey Math fo Tees lesso is pat of a seies ceated by Geeatio Moey, a multimedia fiacial liteacy iitiative of the FINRA Ivesto Educatio
More informationFinance Practice Problems
Iteest Fiace Pactice Poblems Iteest is the cost of boowig moey. A iteest ate is the cost stated as a pecet of the amout boowed pe peiod of time, usually oe yea. The pevailig maket ate is composed of: 1.
More informationOn the Optimality and Interconnection of Valiant Load-Balancing Networks
O the Optimality ad Itecoectio of Valiat Load-Balacig Netwoks Moshe Babaioff ad Joh Chuag School of Ifomatio Uivesity of Califoia at Bekeley Bekeley, Califoia 94720 4600 {moshe,chuag}@sims.bekeley.edu
More informationA Note on Risky Bond Valuation
A Note on Risky Bond Valuation C. H. Hui Banking Poliy Depatment Hong Kong Monetay Authoity 0th Floo,, Gaden Road, Hong Kong Email: Cho-Hoi_Hui@hkma.gov.hk C. F. Lo Physis Depatment The Chinese Univesity
More informationTwo degree of freedom systems. Equations of motion for forced vibration Free vibration analysis of an undamped system
wo degee of feedom systems Equatios of motio fo foced vibatio Fee vibatio aalysis of a udamped system Itoductio Systems that equie two idepedet d coodiates to descibe thei motio ae called two degee of
More informationAnnuities and loan. repayments. Syllabus reference Financial mathematics 5 Annuities and loan. repayments
8 8A Futue value of a auity 8B Peset value of a auity 8C Futue ad peset value tables 8D Loa epaymets Auities ad loa epaymets Syllabus efeece Fiacial mathematics 5 Auities ad loa epaymets Supeauatio (othewise
More informationQuestions & Answers Chapter 10 Software Reliability Prediction, Allocation and Demonstration Testing
M13914 Questions & Answes Chapte 10 Softwae Reliability Pediction, Allocation and Demonstation Testing 1. Homewok: How to deive the fomula of failue ate estimate. λ = χ α,+ t When the failue times follow
More informationbetween Modern Degree Model Logistics Industry in Gansu Province 2. Measurement Model 1. Introduction 2.1 Synergetic Degree
www.ijcsi.og 385 Calculatio adaalysis alysis of the Syegetic Degee Model betwee Mode Logistics ad Taspotatio Idusty i Gasu Povice Ya Ya 1, Yogsheg Qia, Yogzhog Yag 3,Juwei Zeg 4 ad Mi Wag 5 1 School of
More informationTHE DINNER TABLE PROBLEM: THE RECTANGULAR CASE. Roberto Tauraso Dipartimento di Matematica, Università di Roma Tor Vergata, 00133 Roma, Italy
INTEGERS: ELECTRONIC JOURNAL OF COMBINATORIAL NUMBER THEORY 6 006, #A THE DINNER TABLE PROBLEM: THE RECTANGULAR CASE Robeto Tauaso Dipatimeto di Matematia, Uivesità di Roma To Vegata, 00 Roma, Italy tauaso@matuiomait
More informationLearning Objectives. Chapter 2 Pricing of Bonds. Future Value (FV)
Leaig Objectives Chapte 2 Picig of Bods time value of moey Calculate the pice of a bod estimate the expected cash flows detemie the yield to discout Bod pice chages evesely with the yield 2-1 2-2 Leaig
More informationLong-Term Trend Analysis of Online Trading --A Stochastic Order Switching Model
Asia Pacific Maagemet Review (24) 9(5), 893-924 Log-Tem Ted Aalysis of Olie Tadig --A Stochastic Ode Switchig Model Shalig Li * ad Zili Ouyag ** Abstact Olie bokeages ae eplacig bokes ad telephoes with
More informationDecision models of Multi Periods Closed Loop Supply Chain with Remanufacturing under Centralized and Decentralized Decision Making
dvaed iee ad Tehology Lettes Vol. NGCIT 05.3- htt://dx.doi.og/0.457/astl.05..04 eisio models of Multi Peiods Closed Loo uly Chai ith Remaufatuig ude Cetalized ad eetalized eisio Makig JiagJu YUN eatmet
More informationBreakeven Holding Periods for Tax Advantaged Savings Accounts with Early Withdrawal Penalties
Beakeve Holdig Peiods fo Tax Advataged Savigs Accouts with Ealy Withdawal Pealties Stephe M. Hoa Depatmet of Fiace St. Boavetue Uivesity St. Boavetue, New Yok 4778 Phoe: 76-375-209 Fax: 76-375-29 e-mail:
More informationMulticriteria Decision Model for Information Systems Priorities Based on Business Process Management
Multiiteia Deision Model fo Infomation Systems Pioities Based on Business Poess Management Adiel Teixei de Almeida* and Mila Neves Souza** The pape pesents a multiiteia deision model fo infomation system
More informationEffect of Contention Window on the Performance of IEEE 802.11 WLANs
Effect of Contention Window on the Pefomance of IEEE 82.11 WLANs Yunli Chen and Dhama P. Agawal Cente fo Distibuted and Mobile Computing, Depatment of ECECS Univesity of Cincinnati, OH 45221-3 {ychen,
More informationDerivation of Annuity and Perpetuity Formulae. A. Present Value of an Annuity (Deferred Payment or Ordinary Annuity)
Aity Deivatios 4/4/ Deivatio of Aity ad Pepetity Fomlae A. Peset Vale of a Aity (Defeed Paymet o Odiay Aity 3 4 We have i the show i the lecte otes ad i ompodi ad Discoti that the peset vale of a set of
More informationMASS DIFFUSION INSIDE PROLATE SPHERICAL SOLIDS: AN ANALYTICAL SOLUTION
Revista Basileia e Poutos Agoiustiais, Campia Gae, v.4,., p.4-5, 4 ASS DIFFUSION INSIDE PROATE SPHERICA SOIDS: AN ANAYTICA SOUTION Vital Aaújo Babosa e Oliveia, Atoio Gilso Babosa e ima ABSTRACT The aaltial
More informationA Capacity Supply Model for Virtualized Servers
96 Iformatia Eoomiă vol. 3, o. 3/009 A apaity upply Model for Virtualized ervers Alexader PINNOW, tefa OTERBURG Otto-vo-Guerike-Uiversity, Magdeburg, Germay {alexader.piow stefa.osterburg}@iti.s.ui-magdeburg.de
More informationAn Approach to Optimized Resource Allocation for Cloud Simulation Platform
An Appoach to Optimized Resouce Allocation fo Cloud Simulation Platfom Haitao Yuan 1, Jing Bi 2, Bo Hu Li 1,3, Xudong Chai 3 1 School of Automation Science and Electical Engineeing, Beihang Univesity,
More informationChapter 3 Savings, Present Value and Ricardian Equivalence
Chapte 3 Savings, Pesent Value and Ricadian Equivalence Chapte Oveview In the pevious chapte we studied the decision of households to supply hous to the labo maket. This decision was a static decision,
More informationValuation of Floating Rate Bonds 1
Valuation of Floating Rate onds 1 Joge uz Lopez us 316: Deivative Secuities his note explains how to value plain vanilla floating ate bonds. he pupose of this note is to link the concepts that you leaned
More informationTHE PRINCIPLE OF THE ACTIVE JMC SCATTERER. Seppo Uosukainen
THE PRINCIPLE OF THE ACTIVE JC SCATTERER Seppo Uoukaie VTT Buildig ad Tapot Ai Hadlig Techology ad Acoutic P. O. Bo 1803, FIN 02044 VTT, Filad Seppo.Uoukaie@vtt.fi ABSTRACT The piciple of fomulatig the
More informationCloud Service Reliability: Modeling and Analysis
Cloud Sevice eliability: Modeling and Analysis Yuan-Shun Dai * a c, Bo Yang b, Jack Dongaa a, Gewei Zhang c a Innovative Computing Laboatoy, Depatment of Electical Engineeing & Compute Science, Univesity
More informationProject Request & Project Plan
Poject Request & Poject Pla ITS Platfoms Cofiguatio Maagemet Pla Vesio: 0.3 Last Updated: 2009/01/07 Date Submitted: 2008/11/20 Submitted by: Stephe Smooge Executive Sposo: Gil Gozales/Moia Geety Expected
More informationEnd-to-end Delay of Videoconferencing over Packet Switched Networks. Videoconferencing Requirements. Goals. Nota di Copyright.
ota i opyight E-to-e Delay o Vieooeeig ove aket withe etwoks aio ali Tehial Uivesity o Toio ompute Egieeig Depatmet (Joit wok with D Yoam Oek) This set o taspaeies, heeiate eee to as slies, is potete by
More informationDecision models of Multi Periods Closed Loop Supply Chain with Remanufacturing under Centralized and Decentralized Decision Making
Iteatioal Joual of u- ad e- Sevie Siee ad Tehology Vol.8 No. 0 (05.7-5 htt://dx.doi.og/0.57/ijuesst.05.8.0. eisio models of Multi Peiods Closed Loo Suly Chai ith Remaufatuig ude Cetalized ad eetalized
More informationSoving Recurrence Relations
Sovig Recurrece Relatios Part 1. Homogeeous liear 2d degree relatios with costat coefficiets. Cosider the recurrece relatio ( ) T () + at ( 1) + bt ( 2) = 0 This is called a homogeeous liear 2d degree
More informationEfficient Redundancy Techniques for Latency Reduction in Cloud Systems
Efficient Redundancy Techniques fo Latency Reduction in Cloud Systems 1 Gaui Joshi, Emina Soljanin, and Gegoy Wonell Abstact In cloud computing systems, assigning a task to multiple seves and waiting fo
More informationConverting knowledge Into Practice
Conveting knowledge Into Pactice Boke Nightmae srs Tend Ride By Vladimi Ribakov Ceato of Pips Caie 20 of June 2010 2 0 1 0 C o p y i g h t s V l a d i m i R i b a k o v 1 Disclaime and Risk Wanings Tading
More informationHigh Availability Replication Strategy for Deduplication Storage System
Zhengda Zhou, Jingli Zhou College of Compute Science and Technology, Huazhong Univesity of Science and Technology, *, zhouzd@smail.hust.edu.cn jlzhou@mail.hust.edu.cn Abstact As the amount of digital data
More informationPresent Value Factor To bring one dollar in the future back to present, one uses the Present Value Factor (PVF): Concept 9: Present Value
Cocept 9: Preset Value Is the value of a dollar received today the same as received a year from today? A dollar today is worth more tha a dollar tomorrow because of iflatio, opportuity cost, ad risk Brigig
More informationStrength Analysis and Optimization Design about the key parts of the Robot
Intenational Jounal of Reseach in Engineeing and Science (IJRES) ISSN (Online): 2320-9364, ISSN (Pint): 2320-9356 www.ijes.og Volume 3 Issue 3 ǁ Mach 2015 ǁ PP.25-29 Stength Analysis and Optimization Design
More informationDefine What Type of Trader Are you?
Define What Type of Tade Ae you? Boke Nightmae srs Tend Ride By Vladimi Ribakov Ceato of Pips Caie 20 of June 2010 1 Disclaime and Risk Wanings Tading any financial maket involves isk. The content of this
More informationComparing Availability of Various Rack Power Redundancy Configurations
Compaing Availability of Vaious Rack Powe Redundancy Configuations By Victo Avela White Pape #48 Executive Summay Tansfe switches and dual-path powe distibution to IT equipment ae used to enhance the availability
More informationEstimating Surface Normals in Noisy Point Cloud Data
Estiatig Suface Noals i Noisy Poit Cloud Data Niloy J. Mita Stafod Gaphics Laboatoy Stafod Uivesity CA, 94305 iloy@stafod.edu A Nguye Stafod Gaphics Laboatoy Stafod Uivesity CA, 94305 aguye@cs.stafod.edu
More informationA Comparative Analysis of Data Center Network Architectures
A Compaative Analysis of Data Cente Netwok Achitectues Fan Yao, Jingxin Wu, Guu Venkataamani, Suesh Subamaniam Depatment of Electical and Compute Engineeing, The Geoge Washington Univesity, Washington,
More informationAdaptive Queue Management with Restraint on Non-Responsive Flows
Adaptive Queue Management wi Restaint on Non-Responsive Flows Lan Li and Gyungho Lee Depatment of Electical and Compute Engineeing Univesity of Illinois at Chicago 85 S. Mogan Steet Chicago, IL 667 {lli,
More informationHigh-Performance Computing and Quantum Processing
HPC-UA (Україна, Київ, - жовтня року High-Pefomace Computig ad Quatum Pocessig Segey Edwad Lyshevski Depatmet of Electical ad Micoelectoic Egieeig, Rocheste Istitute of Techology, Rocheste, NY 3, USA E-mail:
More informationOPTIMALLY EFFICIENT MULTI AUTHORITY SECRET BALLOT E-ELECTION SCHEME
OPTIMALLY EFFICIENT MULTI AUTHORITY SECRET BALLOT E-ELECTION SCHEME G. Aja Babu, 2 D. M. Padmavathamma Lectue i Compute Sciece, S.V. Ats College fo Me, Tiupati, Idia 2 Head, Depatmet of Compute Applicatio.
More informationThe dinner table problem: the rectangular case
The ie table poblem: the ectagula case axiv:math/009v [mathco] Jul 00 Itouctio Robeto Tauaso Dipatimeto i Matematica Uivesità i Roma To Vegata 00 Roma, Italy tauaso@matuiomait Decembe, 0 Assume that people
More informationDevelopment of Customer Value Model for Healthcare Services
96 Developmet of Custome Value Model fo Healthcae Sevices Developmet of Custome Value Model fo Healthcae Sevices Wa-I Lee ad Bih-Yaw Shih Depatmet of Maetig ad Distibutio Maagemet, Natioal Kaohsiug Fist,
More informationLogistic Regression, AdaBoost and Bregman Distances
A exteded abstact of this joual submissio appeaed ipoceedigs of the Thiteeth Aual Cofeece o ComputatioalLeaig Theoy, 2000 Logistic Regessio, Adaoost ad egma istaces Michael Collis AT&T Labs Reseach Shao
More informationMaximum Entropy, Parallel Computation and Lotteries
Maximum Etopy, Paallel Computatio ad Lotteies S.J. Cox Depatmet of Electoics ad Compute Sciece, Uivesity of Southampto, UK. G.J. Daiell Depatmet of Physics ad Astoomy, Uivesity of Southampto, UK. D.A.
More informationOptimizing Content Retrieval Delay for LT-based Distributed Cloud Storage Systems
Optimizing Content Retieval Delay fo LT-based Distibuted Cloud Stoage Systems Haifeng Lu, Chuan Heng Foh, Yonggang Wen, and Jianfei Cai School of Compute Engineeing, Nanyang Technological Univesity, Singapoe
More informationEvaluating the impact of Blade Server and Virtualization Software Technologies on the RIT Datacenter
Evaluating the impact of and Vitualization Softwae Technologies on the RIT Datacente Chistophe M Butle Vitual Infastuctue Administato Rocheste Institute of Technology s Datacente Contact: chis.butle@it.edu
More informationLesson 15 ANOVA (analysis of variance)
Outlie Variability -betwee group variability -withi group variability -total variability -F-ratio Computatio -sums of squares (betwee/withi/total -degrees of freedom (betwee/withi/total -mea square (betwee/withi
More informationData Center Demand Response: Avoiding the Coincident Peak via Workload Shifting and Local Generation
(213) 1 28 Data Cente Demand Response: Avoiding the Coincident Peak via Wokload Shifting and Local Geneation Zhenhua Liu 1, Adam Wieman 1, Yuan Chen 2, Benjamin Razon 1, Niangjun Chen 1 1 Califonia Institute
More informationAn Efficient Group Key Agreement Protocol for Ad hoc Networks
An Efficient Goup Key Ageement Potocol fo Ad hoc Netwoks Daniel Augot, Raghav haska, Valéie Issany and Daniele Sacchetti INRIA Rocquencout 78153 Le Chesnay Fance {Daniel.Augot, Raghav.haska, Valéie.Issany,
More informationTracking/Fusion and Deghosting with Doppler Frequency from Two Passive Acoustic Sensors
Tacking/Fusion and Deghosting with Dopple Fequency fom Two Passive Acoustic Sensos Rong Yang, Gee Wah Ng DSO National Laboatoies 2 Science Pak Dive Singapoe 11823 Emails: yong@dso.og.sg, ngeewah@dso.og.sg
More informationContact Us The College of Management - Academic Studies (COMAS ) Office of International Programs 7 Yitzhak Rabin Blvd. Rishon LeZion 7502501 Israel
m a g o P Study hip e t I ad g i e i D m oga P l a ig atio i p e t A I el fo e a I i Lead g i De Cotact U The College of Maagemet - Academic Studie (COMAS ) Office of Iteatioal Pogam 7 Yitzhak Rabi Blvd.
More informationTHE DISTRIBUTED LOCATION RESOLUTION PROBLEM AND ITS EFFICIENT SOLUTION
IADIS Intenational Confeence Applied Computing 2006 THE DISTRIBUTED LOCATION RESOLUTION PROBLEM AND ITS EFFICIENT SOLUTION Jög Roth Univesity of Hagen 58084 Hagen, Gemany Joeg.Roth@Fenuni-hagen.de ABSTRACT
More informationIlona V. Tregub, ScD., Professor
Investment Potfolio Fomation fo the Pension Fund of Russia Ilona V. egub, ScD., Pofesso Mathematical Modeling of Economic Pocesses Depatment he Financial Univesity unde the Govenment of the Russian Fedeation
More informationResearch on Risk Assessment of the Transformer Based on Life Cycle Cost
ntenational Jounal of Smat Gid and lean Enegy eseach on isk Assessment of the Tansfome Based on Life ycle ost Hui Zhou a, Guowei Wu a, Weiwei Pan a, Yunhe Hou b, hong Wang b * a Zhejiang Electic Powe opoation,
More informationUNIT CIRCLE TRIGONOMETRY
UNIT CIRCLE TRIGONOMETRY The Unit Cicle is the cicle centeed at the oigin with adius unit (hence, the unit cicle. The equation of this cicle is + =. A diagam of the unit cicle is shown below: + = - - -
More informationIBM Research Smarter Transportation Analytics
IBM Reseach Smate Tanspotation Analytics Laua Wynte PhD, Senio Reseach Scientist, IBM Watson Reseach Cente lwynte@us.ibm.com INSTRUMENTED We now have the ability to measue, sense and see the exact condition
More informationSTUDENT RESPONSE TO ANNUITY FORMULA DERIVATION
Page 1 STUDENT RESPONSE TO ANNUITY FORMULA DERIVATION C. Alan Blaylock, Hendeson State Univesity ABSTRACT This pape pesents an intuitive appoach to deiving annuity fomulas fo classoom use and attempts
More informationCLOSE RANGE PHOTOGRAMMETRY WITH CCD CAMERAS AND MATCHING METHODS - APPLIED TO THE FRACTURE SURFACE OF AN IRON BOLT
CLOSE RANGE PHOTOGRAMMETR WITH CCD CAMERAS AND MATCHING METHODS - APPLIED TO THE FRACTURE SURFACE OF AN IRON BOLT Tim Suthau, John Moé, Albet Wieemann an Jens Fanzen Technical Univesit of Belin, Depatment
More informationSoftware Engineering and Development
I T H E A 67 Softwae Engineeing and Development SOFTWARE DEVELOPMENT PROCESS DYNAMICS MODELING AS STATE MACHINE Leonid Lyubchyk, Vasyl Soloshchuk Abstact: Softwae development pocess modeling is gaining
More informationComparing Availability of Various Rack Power Redundancy Configurations
Compaing Availability of Vaious Rack Powe Redundancy Configuations White Pape 48 Revision by Victo Avela > Executive summay Tansfe switches and dual-path powe distibution to IT equipment ae used to enhance
More information1D STEADY STATE HEAT
D SEADY SAE HEA CONDUCION () Pabal alukda Aociate Pofeo Depatment of Mecanical Engineeing II Deli E-mail: pabal@mec.iitd.ac.in Palukda/Mec-IID emal Contact eitance empeatue ditibution and eat flow line
More informationStreamline Compositional Simulation of Gas Injections Dacun Li, University of Texas of the Permian Basin
Abstact Steamlie Comositioal Simulatio of Gas jectios Dacu L Uivesity of Texas of the Pemia Basi Whe esevoi temeatues ae lowe tha o F ad essue is lowe tha 5sia, gas ijectios, esecially whe ijectats iclude
More informationVoltage ( = Electric Potential )
V-1 of 9 Voltage ( = lectic Potential ) An electic chage altes the space aound it. Thoughout the space aound evey chage is a vecto thing called the electic field. Also filling the space aound evey chage
More informationCONCEPT OF TIME AND VALUE OFMONEY. Simple and Compound interest
CONCEPT OF TIME AND VALUE OFMONEY Simple and Compound inteest What is the futue value of shs 10,000 invested today to ean an inteest of 12% pe annum inteest payable fo 10 yeas and is compounded; a. Annually
More informationChapter 6: Variance, the law of large numbers and the Monte-Carlo method
Chapter 6: Variace, the law of large umbers ad the Mote-Carlo method Expected value, variace, ad Chebyshev iequality. If X is a radom variable recall that the expected value of X, E[X] is the average value
More informationUPS Virginia District Package Car Fleet Optimization
UPS Viginia Distit Pakage Ca Fleet Otimization Tavis Manning, Divaka Mehta, Stehen Sheae, Malloy Soldne, and Bian Togesen Abstat United Pael Sevie (UPS) is onstantly haged with ealigning its akage a fleet
More informationConcept and Experiences on using a Wiki-based System for Software-related Seminar Papers
Concept and Expeiences on using a Wiki-based System fo Softwae-elated Semina Papes Dominik Fanke and Stefan Kowalewski RWTH Aachen Univesity, 52074 Aachen, Gemany, {fanke, kowalewski}@embedded.wth-aachen.de,
More informationUncertain Version Control in Open Collaborative Editing of Tree-Structured Documents
Uncetain Vesion Contol in Open Collaboative Editing of Tee-Stuctued Documents M. Lamine Ba Institut Mines Télécom; Télécom PaisTech; LTCI Pais, Fance mouhamadou.ba@ telecom-paistech.f Talel Abdessalem
More informationScheduling Hadoop Jobs to Meet Deadlines
Scheduling Hadoop Jobs to Meet Deadlines Kamal Kc, Kemafo Anyanwu Depatment of Compute Science Noth Caolina State Univesity {kkc,kogan}@ncsu.edu Abstact Use constaints such as deadlines ae impotant equiements
More informationContinuous Compounding and Annualization
Continuous Compounding and Annualization Philip A. Viton Januay 11, 2006 Contents 1 Intoduction 1 2 Continuous Compounding 2 3 Pesent Value with Continuous Compounding 4 4 Annualization 5 5 A Special Poblem
More informationExperiment 6: Centripetal Force
Name Section Date Intoduction Expeiment 6: Centipetal oce This expeiment is concened with the foce necessay to keep an object moving in a constant cicula path. Accoding to Newton s fist law of motion thee
More informationPHYSICS 111 HOMEWORK SOLUTION #13. May 1, 2013
PHYSICS 111 HOMEWORK SOLUTION #13 May 1, 2013 0.1 In intoductoy physics laboatoies, a typical Cavendish balance fo measuing the gavitational constant G uses lead sphees with masses of 2.10 kg and 21.0
More informationCooley-Tukey. Tukey FFT Algorithms. FFT Algorithms. Cooley
Cooley Cooley-Tuey Tuey FFT Algorithms FFT Algorithms Cosider a legth- sequece x[ with a -poit DFT X[ where Represet the idices ad as +, +, Cooley Cooley-Tuey Tuey FFT Algorithms FFT Algorithms Usig these
More informationABSTRACT INTRODUCTION MATERIALS AND METHODS
INTENATIONAL JOUNAL OF AGICULTUE & BIOLOGY 156 853/6/8 1 5 9 http://www.fspublishers.org Multiplate Peetratio Tests to Predit Soil Pressure-siage Behaviour uder etagular egio M. ASHIDI 1, A. KEYHANI AND
More informationAn Analysis of Manufacturer Benefits under Vendor Managed Systems
An Analysis of Manufactue Benefits unde Vendo Managed Systems Seçil Savaşaneil Depatment of Industial Engineeing, Middle East Technical Univesity, 06531, Ankaa, TURKEY secil@ie.metu.edu.t Nesim Ekip 1
More informationMethod of Extracting Is-A and Part-Of Relations Using Pattern Pairs in Mass Corpus
Method of Etating Is-A and at-of Relations Using atten ais in Mass Cous Se-Jong Kim Yong-Hun Lee and Jong-Heok Lee Deatment of Comute Siene and Engineeing ohang Univesit of Siene and ehnolog (OSECH) San
More informationApproximation Algorithms for Data Management in Networks
Appoximation Algoithms fo Data Management in Netwoks Chistof Kick Heinz Nixdof Institute and Depatment of Mathematics & Compute Science adebon Univesity Gemany kueke@upb.de Haald Räcke Heinz Nixdof Institute
More informationYour organization has a Class B IP address of 166.144.0.0 Before you implement subnetting, the Network ID and Host ID are divided as follows:
Subettig Subettig is used to subdivide a sigle class of etwork i to multiple smaller etworks. Example: Your orgaizatio has a Class B IP address of 166.144.0.0 Before you implemet subettig, the Network
More informationSupplementary Material for EpiDiff
Supplementay Mateial fo EpiDiff Supplementay Text S1. Pocessing of aw chomatin modification data In ode to obtain the chomatin modification levels in each of the egions submitted by the use QDCMR module
More informationest using the formula I = Prt, where I is the interest earned, P is the principal, r is the interest rate, and t is the time in years.
9.2 Inteest Objectives 1. Undestand the simple inteest fomula. 2. Use the compound inteest fomula to find futue value. 3. Solve the compound inteest fomula fo diffeent unknowns, such as the pesent value,
More informationCLASS XI CHAPTER 3. Theorem 1 (sine formula) In any triangle, sides are proportional to the sines of the opposite angles. That is, in a triangle ABC
CLASS XI Anneue I CHAPTER.6. Poofs and Simple Applications of sine and cosine fomulae Let ABC be a tiangle. By angle A we mean te angle between te sides AB and AC wic lies between 0 and 80. Te angles B
More informationThe transport performance evaluation system building of logistics enterprises
Jounal of Industial Engineeing and Management JIEM, 213 6(4): 194-114 Online ISSN: 213-953 Pint ISSN: 213-8423 http://dx.doi.og/1.3926/jiem.784 The tanspot pefomance evaluation system building of logistics
More informationEnergy Efficient Cache Invalidation in a Mobile Environment
Enegy Efficient Cache Invalidation in a Mobile Envionment Naottam Chand, Ramesh Chanda Joshi, Manoj Misa Electonics & Compute Engineeing Depatment Indian Institute of Technology, Rookee - 247 667. INDIA
More informationNegotiation Programs
Negotiatio Pogams Javie Espaza 1 ad Jög Desel 2 1 Fakultät fü Ifomatik, Techische Uivesität Müche, Gemay espaza@tum.de 2 Fakultät fü Mathematik ud Ifomatik, FeUivesität i Hage, Gemay joeg.desel@feui-hage.de
More informationSecure Smartcard-Based Fingerprint Authentication
Secue Smatcad-Based Fingepint Authentication [full vesion] T. Chales Clancy Compute Science Univesity of Mayland, College Pak tcc@umd.edu Nega Kiyavash, Dennis J. Lin Electical and Compute Engineeing Univesity
More informationSolar wind speed theory and the nonextensivity of solar corona
AXiv:080.170 Sola wind speed theoy and the nonextensivity of sola oona Du Jiulin *, Song Yeli Depatment of Physis, Shool of Siene, Tianjin Univesity, Tianjin 30007, China Abstat. The sola oona is a omplex
More informationEngineering Data Management
BaaERP 5.0c Maufacturig Egieerig Data Maagemet Module Procedure UP128A US Documetiformatio Documet Documet code : UP128A US Documet group : User Documetatio Documet title : Egieerig Data Maagemet Applicatio/Package
More informationON THE (Q, R) POLICY IN PRODUCTION-INVENTORY SYSTEMS
ON THE R POLICY IN PRODUCTION-INVENTORY SYSTEMS Saifallah Benjaafa and Joon-Seok Kim Depatment of Mechanical Engineeing Univesity of Minnesota Minneapolis MN 55455 Abstact We conside a poduction-inventoy
More informationAn application of stochastic programming in solving capacity allocation and migration planning problem under uncertainty
An application of stochastic pogamming in solving capacity allocation and migation planning poblem unde uncetainty Yin-Yann Chen * and Hsiao-Yao Fan Depatment of Industial Management, National Fomosa Univesity,
More informationHow to recover your Exchange 2003/2007 mailboxes and emails if all you have available are your PRIV1.EDB and PRIV1.STM Information Store database
AnswesThatWok TM Recoveing Emails and Mailboxes fom a PRIV1.EDB Exchange 2003 IS database How to ecove you Exchange 2003/2007 mailboxes and emails if all you have available ae you PRIV1.EDB and PRIV1.STM
More informationHEALTHCARE INTEGRATION BASED ON CLOUD COMPUTING
U.P.B. Sci. Bull., Seies C, Vol. 77, Iss. 2, 2015 ISSN 2286-3540 HEALTHCARE INTEGRATION BASED ON CLOUD COMPUTING Roxana MARCU 1, Dan POPESCU 2, Iulian DANILĂ 3 A high numbe of infomation systems ae available
More informationDomain 1: Designing a SQL Server Instance and a Database Solution
Maual SQL Server 2008 Desig, Optimize ad Maitai (70-450) 1-800-418-6789 Domai 1: Desigig a SQL Server Istace ad a Database Solutio Desigig for CPU, Memory ad Storage Capacity Requiremets Whe desigig a
More informationA framework for the selection of enterprise resource planning (ERP) system based on fuzzy decision making methods
A famewok fo the selection of entepise esouce planning (ERP) system based on fuzzy decision making methods Omid Golshan Tafti M.s student in Industial Management, Univesity of Yazd Omidgolshan87@yahoo.com
More informationNontrivial lower bounds for the least common multiple of some finite sequences of integers
J. Numbe Theoy, 15 (007), p. 393-411. Nontivial lowe bounds fo the least common multiple of some finite sequences of integes Bai FARHI bai.fahi@gmail.com Abstact We pesent hee a method which allows to
More informationRunning Time ( 3.1) Analysis of Algorithms. Experimental Studies ( 3.1.1) Limitations of Experiments. Pseudocode ( 3.1.2) Theoretical Analysis
Ruig Time ( 3.) Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects.
More informationOutput Analysis (2, Chapters 10 &11 Law)
B. Maddah ENMG 6 Simulatio 05/0/07 Output Aalysis (, Chapters 10 &11 Law) Comparig alterative system cofiguratio Sice the output of a simulatio is radom, the comparig differet systems via simulatio should
More information30 H. N. CHIU 1. INTRODUCTION. Recherche opérationnelle/operations Research
RAIRO Rech. Opé. (vol. 33, n 1, 1999, pp. 29-45) A GOOD APPROXIMATION OF THE INVENTORY LEVEL IN A(Q ) PERISHABLE INVENTORY SYSTEM (*) by Huan Neng CHIU ( 1 ) Communicated by Shunji OSAKI Abstact. This
More information