Complex Service Provisioning in Collaborative Cloud Markets

Size: px
Start display at page:

Download "Complex Service Provisioning in Collaborative Cloud Markets"

Transcription

1 Melane Sebenhaar, Ulrch Lampe, Tm Lehrg, Sebastan Zöller, Stefan Schulte, Ralf Stenmetz: Complex Servce Provsonng n Collaboratve Cloud Markets. In: W. Abramowcz et al. (Eds.): Proceedngs of the 4th European Conference ServceWave, no. LNCS 6994, p , Sprnger, October ISBN Complex Servce Provsonng n Collaboratve Cloud Markets Melane Sebenhaar, Ulrch Lampe, Tm Lehrg, Sebastan Zo ller, Stefan Schulte, and Ralf Stenmetz Multmeda Communcatons Lab (KOM) Technsche Unversta t Darmstadt, Germany Today s cloud consumers gan a hgh level of flexblty by usng externally provded cloud-based servces. However, they have no means for requestng combned servces from dfferent clouds or for enforcng an ndvdual qualty level. Layng the foundaton for market-based cloud collaboratons ncludng the negotaton of ndvdual qualty parameters s an mportant aspect for future cloud computng. Cloud consumers, especally enterprses are then able to request complex servces wth consumer-drven qualty guarantees accordng to ther ndvdual needs and are not concerned wth the problem on how to make the dfferent components work together. In ths paper, we present an approach for collaboratve complex servce provsonng n cloud computng and an evaluaton of selected mechansms for the negotaton of qualty parameters n such a collaboratve market-based scenaro. 1 Introducton Cloud computng has recently attracted a lot of attenton wth respect to IT archtectures and ams to provde computng resources n a hghly dynamc and flexble manner. In 2010, the cloud computng market reached a large market volume and ts sze wll grow further n the next years [11]. Nevertheless, cloud computng s stll n a very early stage concernng open standards and nterfaces [13], so that consumers cannot change selected cloud provders very easly. A vson amng at these ssues s a global cloud marketplace [1], whch does not depend on the specfcs of a certan vendor offerng standardzed nterfaces. Such a cloud marketplace would also facltate the combnaton of dfferent servces from varous cloud provders and enable cloud federaton scenaros [8]. Hence, t can be consdered as a frst step towards the Future Internet [7]. To realze the vson of a global cloud marketplace, several requrements have to be fulflled. Qualty parameters, such as relablty or avalablty, are especally crucal n a busness envronment. In order to retan control of the servce qualty, so-called Servce Level Agreements (SLAs) can be negotated between the servce consumer and the cloud provder to ensure a level of qualty consumers can rely on. Bascally, an SLA represents a contract between two partes and defnes the objectves (e.g., qualty parameters) the cloud provder has to fulfll and the The documents dstrbuted by ths server have been provded by the contrbutng authors as a means to ensure tmely dssemnaton of scholarly and techncal work on a non-commercal bass. Copyrght and all rghts theren are mantaned by the authors or by other copyrght holders, not wthstandng that they have offered ther works here electroncally. It s understood that all persons copyng ths nformaton wll adhere to the terms and constrants nvoked by each author's copyrght. These works may not be reposted wthout the explct permsson of the copyrght holder.

2 penaltes n case the provder volates the agreement. At present, cloud provders offer no or only lmted support for the negotaton of ndvdual qualty parameters [1]. Thus, consumers, especally enterprses are not able to obtan Qualty of Servce (QoS) guarantees accordng to ther specfc busness constrants. But enablng consumer-drven QoS guarantees would ncrease the flexblty and effcency when usng cloud-based servces. Furthermore, consumers wsh to dynamcally combne servces from dfferent cloud provders wthout further effort for the nterconnecton of the dfferent components. Ths requres the collaboraton between multple cloud provders. Hence, an automated mechansm s requred to negotate ndvdual QoS guarantees and to dynamcally select collaboraton partners from a set of multple cloud provders. In ths paper, we present a collaboratve cloud market model for complex servce provsonng. The collaboraton allows cloud provders to share ther resources and to offer complex servces on the cloud computng marketplace. Besdes the selecton of collaboraton partners, negotatng ndvdual QoS parameters s also a major ssue that we address n the paper. The remander of the paper s structured as follows. Secton 2 descrbes the requrements for collaboratve complex servce provsonng, Secton 3 ntroduces our collaboratve market model and Secton 4 presents ntal expermental results of our approach. The paper closes wth a dscusson of related approaches n Secton 5 and wth a concluson and future drectons n Secton 6. 2 Problem Statement Our work focuses on a mechansm for collaboratve complex servce provsonng, n whch servces from dfferent cloud provders can be combned to a bundle. Defnton 1 (Bundle) A bundle B s a set S of m dfferent functonal servces. Each component c n the bundle has communcaton relatonshps wth a subset of S\ {c},.e., wth some of the other components n the bundle. For example, an enterprse could request a set of servces from multple cloud provders to fulfll nternal busness actvtes, e.g., a Customer Relatonshp Management soluton, data storage, vrtual machnes for data processng, and a database [8]. In ths scenaro, multple provders offer heterogeneous servces on the envsoned global cloud marketplace, where the followng assumptons hold: Specalzaton: Each provder has specalzed n provdng specfc servce types. The provders partcpate n the market, because they are unable to provde all the requred servces on ther own [9]. Comparablty: We assume that the servces can be classfed accordng to ther functonalty. Hence, all provders n a sngle category are competng wth the other provders n the same category. Standardzed Interfaces: There are no consumer swtchng costs due to specfc servce propertes when changng cloud provders. The development of cloud standards s currently addressed by several actvtes 1. 1 An overvew can be obtaned from

3 Scalablty: In our basc model, we further neglect resource constrants n the frst nstance. Thus, we assume that each provder has unlmted resource capactes concernng the provder s specfc servce types. Collaboraton: After the determnaton of the collaboraton partners, the provders are responsble for provdng the bundle. Snce the several components n the bundle must be able to drectly communcate wth each other accordng to ther communcaton relatonshps, the provders must establsh connectons between the components comng from multple clouds. Such a so-called sky computng scenaro [5] typcally requres to lay a vrtual ste over the dstrbuted resources among the dfferent admnstratve domans. Adaptablty: Fnally, we assume that the cloud provders can vary the QoS levels that they provde accordng to ther cost functons. Snce they have prvate nformaton, e.g., concernng ther cost factors, a negotaton of QoS parameters s necessary. Relatonshps: Although cloud provders are located worldwde, they cannot establsh data centers everywhere. Thus, they may have dffcultes n fulfllng all QoS requrements, e.g., due to network delays. Hence, the relatonshps between the dfferent components must be taken nto account snce they have a drect mpact on the QoS parameters. Two major ssues that have to be addressed arse n such a collaboratve cloud market scenaro: How to negotate the QoS parameters of a bundle wth multple cloud provders and how to select the collaboratng partes? Cloud consumers must specfy ther requrements (e.g., upper or lower bounds) for the whole bundle and for each servce that s part of the bundle. A market model s requred to maxmze the consumer s utlty and the cloud provders utlty (n terms of cost), whle consderng the boundares for the dfferent parameters. 3 Approach 3.1 System Model and Notaton Our model conssts of three man actors: servce consumers, cloud provders and a market platform. Servce consumers SC can request a bundle of servces at the market platform and specfy ther requrements concernng the non-functonal propertes of the bundle,.e., QoS parameters and prce. These requrements are used by the market platform to compose the bundle. The composton s structured nto two phases: the negotaton between the market platform and the cloud provders and the selecton of the collaboraton partners for the provson of the bundle. The two phases are descrbed n the followng. To perform a frst analyss, we assume a sequental order of the m servces wthn the bundle B. The consderaton of more complex communcaton relatonshps wll be part of our future work. Furthermore, the servces can be grouped nto functonal categores Cat wth (1,..., m). Each category conssts of a set of cloud provders CP wth p elements, where each element represents a cloud provder offerng a servce wth the same functonalty. The cloud

4 SC SC SC Market platform Cat1 Cat Catm CP11... CP1... CPm1... CP1j... CPj... CPmj... CP1p CPp CPmp Propertes CPm1: CFQ1m1 and CFQ2m1 Servce Sm1: Prm1, Q1m1 and Q2m1 SC: Servce Consumer CP: Cloud Provder Bundle B Fg. 1. Market system provders are denoted wth CP,j and the servce a cloud provder CP,j delvers wth S,j, where (1,..., m) and j (1,..., p). We assume that a servce S,j s, besdes ts functonalty, descrbed wth three propertes: prce P r,j and two QoS parameters Q1,j and Q2,j, whch are generc representatons of possble QoS parameters (e.g., avalablty). From the servce consumers pont of vew, prce s a negatve attrbute and QoS parameters are postve attrbutes. Servce consumers specfy ther requrements wth two elements: thresholds and utlty functons. Both are provded for the functonal category level as well as for the whole bundle. The thresholds on category level are T hcatp r, T hcatq2 and T hcatq2 for prce and QoS parameters. In addton, the servce consumer uses a utlty functon U Cat (S,j ), whch shows the consumer s utlty dependent on the non-functonal propertes of a servce. The utlty functon s descrbed n Secton 3.2. Durng the negotaton, the goal of the market platform s to maxmze the utlty of the servce consumer for each functonal category whle keepng the provded thresholds. Analogously, the cloud provders have a cost functon, whch specfes what effort s requred to provde the QoS propertes at a certan qualty level for a gven servce. Therefore, each cloud provder CP,j has two cost factors CF Q1,j and CF Q2,j for the two QoS parameters. The cost functon U CP,j (S,j ) reflectng the utlty of a cloud provder s descrbed further n Secton 3.2. The overall model wth ts actors s shown n Fgure 1. It s not suffcent to specfy only the requrements of sngle servces of the bundle, but also the overall bundle must fulfll certan requrements. Therefore, the thresholds and an addtonal utlty functon for the servce consumer

5 are specfed at bundle level. Ths nformaton comprses the three thresholds T hbup r, T hbuq1 and T hbuq2 and the utlty functon of the servce consumer for the bundle UBu(B). The goal of the market platform for the composton of the overall bundle s to fulfll the thresholds and to maxmze the consumer s utlty for the bundle. Ths problem s based on the prevous negotatons n the functonal categores and deals wth the optmal selecton among the resultng offers of the negotaton process. 3.2 Negotaton of Qualty of Servce Negotaton takes place between the cloud provders and the market platform. The market platform uses the utlty functon of the servce consumer and the provded thresholds for the negotaton. A servce S,j fulflls all thresholds f: T hcatp r P r,j and T hcatq1 Q1,j and T hcatq2 Q2,j (1) The utlty functon s assumed to be addtve and has a decreasng margnal utlty (shown by the square roots) for both QoS parameters [2]. Each nonfunctonal property of a servce has an ndvdual weght. The weght of the prce s negatve, whereas the weghts of the QoS parameters are postve to express the utlty for the servce consumer. The weghts are denoted wth wcatp r, wcatq1 and wcatq2. The utlty functon of the servce consumer s as follows: UCat (S,j ) = wcatp r P r,j + wcatq1 Q1,j + wcatq2 Q2,j (2) As already stated, each cloud provder has a cost functon. In ths functon, every provder makes use of other cost factors to enforce certan QoS parameters, whch are both negatve, snce the cloud provders have hgher costs for provdng better (hgher) QoS values. Hence, the cost functon represents the utlty of the cloud provders. The utlty functon for the cloud provder CP,j s as follows: UCP,j (S,j ) = P r,j + CF Q1,j Q1,j + CF Q2,j Q2,j (3) The two partes fulfll the requrements for a negotaton, snce they have dfferent preferences for the gven propertes and want to maxmze ther utlty. For the negotaton, a mechansm s requred that specfes the protocol and the strategy of the partes on both sdes. The gven scenaro wth the market platform on the one sde and p cloud provders n a functonal category on the other sde and three negotaton domans (prce and QoS parameters) requres support for one-to-many negotatons and multple attrbutes. After an analyss of dfferent negotaton protocols based on [12], whch can be used n automated negotatons, we decded to use the contract net protocol [15] and the Englsh aucton [2] for an ntal evaluaton of the negotaton n the model. The contract net protocol s a smple protocol orgnally used for dstrbutng tasks n computer systems. The tasks are specfed by a central manager and sent to provders. The provders return an offer for the specfcaton wth the smallest prce they can provde. After one round, the central manager

6 assgns a task to the provder wth the best offer. Usng the contract net protocol, the prce of the offer s calculated as follows: P r CNP,j = CF Q1,j T hcatq1 CF Q2,j T hcatq2 (4) The cloud provders make a bd, f the QoS parameters they can provde meet the desred thresholds,.e., an offer s vald, f P r,j CNP T hcatp r. Snce the utlty functon of the servce consumer s prvate, the cloud provders only optmze the prce of ther offers accordng to the gven thresholds. The assumpton s that they are wllng to make a bd untl they gan no utlty from the offer anymore. Hence, the value of the utlty functon s mnmzed n order to maxmze the probablty for a bd to get accepted. In the Englsh aucton, bdders may bd for a partcular good durng several rounds, untl no bds can be made anymore. A bd s vald, f t exceeds the currently hghest ranked bd. Fnally, the hghest bd wns the aucton. We use the Englsh aucton as a reversed aucton (.e., the cloud provders makng offers whch can be accepted by the marketplace) wth a mult-attrbute extenson that enables the consderaton of all requrements. In the orgnal verson of the Englsh aucton, cloud provders can be outbd durng a sngle round. In our scenaro, the market platform chooses the best offer after each sngle round and sets t as lowest bd for the next round. The domnant strategy for the cloud provders s to ncrease ther offers n each round by a mnmal dfference DffOff between two offers. The ncrease does not refer to the prce, but to the utlty of the servce consumer. Ths enables to consder not only the prce, but all non-functonal attrbutes for the aucton. The calculaton of the values for the ncrease and the prces s adapted from [2]. The QoS parameters are calculated as follows: ( wcatq1 ) 2 ( wcatq2 ) 2 Q1 EA,j = and Q2 EA,j = (5) wcatp r 2 CF Q1,j wcatp r 2 CF Q2,j Based on these values and the utlty of the current best offer S BestOffer, the prce s calculated as follows: P r EA,j = wcatq1 2 wcatp r 2 CF Q1 + wcatq2 2 wcatp r 2 CF Q2 UCat (S BestOffer ) DffOff (6) wcatp r However, there s a major dfference between a standard Englsh aucton and the scenaro n ths work: the thresholds for the non-functonal propertes. These thresholds lmt the propertes and can lead to nvald solutons. Therefore, the approach used n ths work adjusts the QoS parameters, f the calculated values are below the thresholds, and uses the new values for the calculaton of the prce. Both negotaton protocols lead to a number of offers n each functonal category. These offers must be composed to a bundle n the next step, whch s descrbed n the next secton.

7 3.3 Partner Selecton for Collaboraton The second part of the collaboraton process s the selecton of collaboraton partners from the set of vald offers S V al for each Cat after the negotaton. The sze of S V al s less or equal p, because not every cloud provder must make an offer. The selecton of the collaboraton partners s desgned as optmzaton problem, whch selects one servce from each functonal category. Each vald servce S,j has a bnary decson varable x,j, whch s 1 f the servce s part of the optmal soluton and 0 f not. The selecton s based on the propertes of the servces as well as the connectons between the servces. Connectons between servces only exst f the servces are neghbors n the sequental order of the bundle. A connecton between servces S,j and S +1,k s denoted wth Con,j,+1,k and has the non-functonal propertes CP r,j,+1,k, CQ1,j,+1,k and CQ2,j,+1,k. The connectons have an addtonal decson varable y,j,+1,k, whch s 1 f each varable x,j and x +1,k s 1. The aggregaton operators of the non-functonal propertes are assumed to be summatons. The second QoS parameter uses two addtve functons to separate between servces and connectons. Other aggregaton operators lke multplcaton or mn-operators are also possble and can be consdered n future research. The utlty functon of the servce consumer for the bundle s as well addtve and uses dfferent weghts to ncrease the flexblty just as the utlty functon of the servce consumer for the functonal categores. The weghts wbup r( 0), wbuq1( 0) and wbuq2( 0) are used for both, servces and connectons. The weghted utlty and objectve functon and constrants are defned n Model 1, whch s a lnear optmzaton problem that can be solved optmally wth a branch-and-bound approach [4]. 4 Expermental Results For the evaluaton, the prevously descrbed model has been mplemented. The mplementaton s agent-based and descrbes the behavor of the market platform and the cloud provders durng the negotaton and soluton of the optmzaton problem. The evaluaton s a proof-of-concept for the developed model and, at the same tme, analyzes the nfluence of the amount of cloud provders on the negotaton. The tests have been performed on a laptop wth a 64bt dual core 2.53 GHz processor wth 4 GB RAM and Wndows 7 as operatng system. For the smulaton of the agents, Repast Smphony 2 has been used and the optmzaton problem has been modeled and solved wth LPSolve 3. The number of cloud provders wthn a category s vared between 2, 4, 6, 8, and 10 cloud provders. For each varaton, 20 test cases have been generated. The scenaro has been tested exemplary for 5 functonal categores. The values for the parameters of the followng evaluaton are shown n Table 1. The table shows the ranges of the random numbers or f no range s gven the fxed values of the parameters. Besdes these parameters, the Englsh aucton uses a mnmal dfference between offers of 0.5 utlty unts

8 Model 1 Collaboraton Partner Selecton Problem Objectve Functon (Maxmze): m =1 m 1 x,j(wbup r P r,j + wbuq1 Q1,j + wbuq2 Q2,j) + =1 k S V al +1 y,j,+1,k (wbup r CP r,j,+1,k + wbuq1 CQ1,j,+1,k + wbuq2 CQ2,j,+1,k ) (7) Constrants: T hbup r T hbuq1 m =1 m =1 T hbuq2 m 1 x,j P r,j + =1 m 1 x,j Q1,j + T hbuq2 m 1 =1 k S V al +1 =1 m =1 k S V al +1 k S V al +1 k S V al +1 y,j,+1,k CP r,j,+1,k (8) y,j,+1,k CQ1,j,+1,k (9) x,j Q2,j (10) y,j,+1,k CQ2,j,+1,k (11) x,j = 1 (1,..., m) (12) y,j,+1,k = 1 (1,..., m 1) (13) x,j + x +1,k y,j,+1,k 1 (1,..., m 1) j S V al k S V al +1 (14) The medan run tmes of the two negotaton protocols are shown n Fgure 2. They are dstrbuted from 1.9 to 13.6 ms. For both protocols, the run tme ncreases wth a growng number of cloud provders. The contract net protocol shows slghtly hgher run tmes than the Englsh aucton. The reason for ths s that the contract net protocol produces a larger set of vald servces than the Englsh aucton, whch ncreases the tme to solve the optmzaton problem. The servce consumer s utlty consdered n the problem s measured on two levels: for each category and for the overall bundle. For the former, the absolute and the relatve utlty of the consumer s measured and for the latter, we only measure the absolute utlty, snce the relatve utlty s 100% for all the offers. The relatve utlty s calculated by usng the Lagrange method [4] to evaluate the maxmal possble utlty a cloud provder can provde wthout gven boundares and wthout achevng an own utlty. The result s set as maxmum and the acheved utlty s set n relaton to t. The results for the relatve utlty are shown n Fgure 3(a). They show that the contract net protocol reaches a relatve

9 Run Tme (ms) Contract Net-Protocol Englsh Auc on Number of Cloud Provders n Category Fg. 2. Run tme of negotaton protocols utlty of 60% and remans on the same level for all scenaros. The Englsh aucton acheves a smlar level, but the relatve utlty decreases for a hgher number of cloud provders wthn the categores. The reason for ths decrease s that more provders lead to a hgher probablty that one provder cannot reach the optmal values for the non-functonal propertes. Thus, ths provder ncreases the utlty faster, whch leads to earler dscards of other provders and lowers the value. Another result, the best absolute utlty wthn a category, s shown n Fgure 3(b). Concernng the utlty, the contract net protocol does not depend on the number of cloud provders and remans on the same level. In contrast, the Englsh aucton shows a postve correlaton between the number of cloud provders and the best acheved utlty. The reason for ths s, that more provders lead to a hgher competton and, therefore, a hgher utlty value. The probablty that the two best provders have smlar cost factors and ncrease ther offers to the maxmum s hgher n scenaros wth many provders. The evaluaton of the servce consumer s utlty for the bundle s shown n fgure 4. The medan utlty acheved wth the Englsh aucton s much hgher for the chosen weghts than the utlty acheved wth the contract net protocol. Ths can be explaned wth the low values for the two QoS parameters resultng from the contract net protocol n contrast to the hgh values resultng from the Englsh aucton. Low values lead to a low utlty, snce the acheved prce cannot compensate them. Table 1. Values of the parameters for the evaluaton Category Bundle Parameter Values Parameter Values CF Q1,j and CF Q2,j [0; 1] wcatp r 1 wbup r 1 wcatq1 and wcatq2 2 wbuq1 and wbuq2 0.5 T hcatp r [15; 20] T hbup r [15; 20] m T hcatq1 [0; 5] T hbuq1 [0; 3] m T hcatq2 [0; 5] T hbuq2 [0; 1]

10 Rela ve U lty (%) Contract Net Protocol Englsh Auc on Servce Consumer U lty Contract Net-Protocol Englsh Auc on Number of Cloud Provders n Category Number of Cloud Provders n Category (a) Medan relatve utlty (b) Medan best utlty Fg. 3. Servce consumer medan utlty of negotaton protocols for categores Servce Consumer U lty Contract Net Protocol Englsh Auc on Number of Cloud Provders n Category Fg. 4. Servce consumer medan utlty of negotaton protocols for bundle It can be observed from the evaluaton that both negotaton protocols show small medan run tmes and thus, are applcable n a dynamc collaboratve envronment. Concernng the utlty of the bundle, the Englsh aucton acheves hgher medan utlty values than the contract net protocol. However, the Englsh aucton depends on the amount of the provders. In summary, the contract net protocol s preferable n scenaros, where the servces must only satsfy mnmal requrements and the prce s consdered as the most mportant crtera. In contrast, the Englsh aucton should be appled n case of a large number of provders n order to acheve a hgh utlty. Nevertheless, no negotaton mechansm outperforms the other n all settngs. 5 Related Work A lot of research has been done n cloud computng. Yet, only a few approaches focus on market-based scenaros. To the best of our knowledge, ths s the frst work that combnes the negotaton of ndvdual consumer-drven QoS guarantees and the selecton of collaboraton partners from sets of competng cloud provders n a market-based cloud computng scenaro. In contrast, Buyya et al. [1] present a vson of a cloud market for tradng resources n order to establsh a balance between supply and demand. The authors also consder the negotaton

11 of QoS parameters between a consumer and a provder. However, collaboratons are not consdered n ther work. Based on the market model of Buyya et al., Sm [14] focuses on QoS negotatons to allow for flexble prcng. He dvdes hs scenaro nto two dsjunct markets for cloud servces and cloud nfrastructure resources nterconnected va brokers. Agan, collaboratons are not part of hs work. Concernng the selecton of collaboraton partners, Hassan et al. [3] propose a mult-objectve optmzaton model wth multple target functons that depend on each other. The authors goal s to mnmze the prce and to maxmze the servce qualty and the performance of collaboratve past relatonshps. The collaboratons are ntated by prmary cloud provders, who dentfy a specfc busness opportunty and search for approprate partners. In the second step, the resultng groups of collaboratng cloud provders use the market to offer a set of servces to consumers, who can bd a prce for the set of servces. Negotatng ndvdual consumer-drven QoS guarantees s not consdered n ther approach. In ther work n [6], Brscoe and Marnos descrbe a communty cloud market model, where communty members provde and manage the resources. The authors also dscuss the enforcement of certan QoS levels wth the help of a communty currency servng as a means for admsson control. However, collaboratve resource provsonng s n the focus of ther work, dsregardng the negotaton of ndvdual QoS guarantees. 6 Concluson In ths paper, we have presented an approach for collaboratve complex servce provsonng n cloud computng and ntroduced a correspondng market model. The model provdes a good soluton for market-based collaboratons n cloud computng and consders ndvdual consumer-drven QoS guarantees. Furthermore, the model can be adapted to dfferent negotaton mechansms and consumer and/or provder requrements. Hence, t serves as a foundaton for future nvestgatons concernng collaboratve cloud markets. In addton, we have explored the applcablty of dfferent QoS negotaton mechansms n the desgned market model. The results revealed that both nvestgated negotaton mechansms are applcable n a dynamc collaboratve settng. Although each strategy offers advantages n some stuatons, no sngle negotaton mechansm outperforms the other n all settngs. Thus, further negotaton mechansms (e.g., Vckrey aucton 4 ) wll be explored n future work. Also, smaller cloud provders wll not be able to offer an unlmted amount of resources. Hence, a small amount of resources could also be consdered as an ncentve for collaboratons. Therefore, further drectons for future work are the consderaton of restrcted resource capactes of the provders as well as tme constrants, whch evolve through parallel consumer requests for the same resources and the temporary allocaton of the resources. 4 The Vckrey aucton s a sealed-prce sealed-bd aucton, where the best strategy s to bd the best estmate value of a good [10].

12 References 1. Buyya, R., Yeo, C.S., Venugopal, S., Broberg, J., Brandc, I.: Cloud Computng and Emergng IT Platforms: Vson, Hype, and Realty for Delverng Computng as the 5th Utlty. Future Generaton Computer Systems 25(6), pp (2009) 2. Davd, E., Azoulay-Schwartz, R., Kraus, S.: An Englsh Aucton Protocol for Multattrbute Items. In: Revsed Papers from the Workshop on Agent Medated Electronc Commerce on Agent-Medated Electronc Commerce IV, Desgnng Mechansms and Systems. pp Sprnger (2002) 3. Hassan, M.M., Song, B., Yoon, C., Lee, H.W., Huh, E.N.: A Novel Market Orented Dynamc Collaboratve Cloud Servce Infrastructure. In: 2009 World Conference on Servces - II (SERVICES-2 09). pp (2009) 4. Hller, F., Leberman, G.: Introducton to Operatons Research. McGraw-Hll, New York, 8th edn. (2005) 5. Keahey, K., Tsugawa, M., Matsunaga, A., Fortes, J.: Sky Computng. IEEE Internet Computng 13(5), pp (2009) 6. Marnos, A., Brscoe, G.: Communty Cloud Computng. In: 1st Internatonal Conference on Cloud Computng. pp Sprnger (2009) 7. Müller, P., Reuther, B.: Future Internet Archtecture A Servce-orented Approach. t Informaton Technology 50(6), pp (2008) 8. Nar, S.K., Porwal, S., Dmtrakos, T., Ferrer, A.J., Tordsson, J., Sharf, T., Sherdan, C., Rajarajan, M., Khan, A.U.: Towards Secure Cloud Burstng, Brokerage and Aggregaton. In: 8th IEEE European Conference on Web Servces (ECOWS 10). pp (2010) 9. Paletta, M., Herrero, P.: A MAS-Based Negotaton Mechansm to Deal wth Servce Collaboraton n Cloud Computng. In: 2009 Internatonal Conference on Intellgent Networkng and Collaboratve Systems (INCOS 09). pp (2009) 10. Parsons, S., Rodrguez-Agular, J.A., Klen, M.: Auctons and Bddng: A Gude for Computer Scentsts. ACM Computng Surveys 43(2), pp (2011) 11. Pettey, C., Tudor, B.: Gartner Says Worldwde Cloud Servces Market to Surpass $ 68 Bllon n 2010 (June 2010), d= , [last access: ] 12. Sandholm, T.: Dstrbuted Ratonal Decson Makng. In: Weß, G. (ed.) Multagent Systems: A Modern Introducton to Dstrbuted Artfcal Intellgence, chap. 5, pp MIT Press, Cambrdge (1999) 13. Schnedermann, R.: For Cloud Computng, the Sky s the Lmt. Sgnal Processng Magazne 28(1), pp (2011) 14. Sm, K.M.: Towards Complex Negotaton for Cloud Economy. In: 5th Internatonal Conference on Advances n Grd and Pervasve Computng (GPC 2010). pp (2010) 15. Smth, R.G.: The Contract Net Protocol: Hgh-Level Communcaton and Control n a Dstrbuted Problem Solver. IEEE Transactons on Computers 29(12), pp (1980)

Fault tolerance in cloud technologies presented as a service

Fault tolerance in cloud technologies presented as a service Internatonal Scentfc Conference Computer Scence 2015 Pavel Dzhunev, PhD student Fault tolerance n cloud technologes presented as a servce INTRODUCTION Improvements n technques for vrtualzaton and performance

More information

ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING

ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING Matthew J. Lberatore, Department of Management and Operatons, Vllanova Unversty, Vllanova, PA 19085, 610-519-4390,

More information

The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis

The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis The Development of Web Log Mnng Based on Improve-K-Means Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna wangtngzhong2@sna.cn Abstract.

More information

Feature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College

Feature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College Feature selecton for ntruson detecton Slobodan Petrovć NISlab, Gjøvk Unversty College Contents The feature selecton problem Intruson detecton Traffc features relevant for IDS The CFS measure The mrmr measure

More information

A Novel Auction Mechanism for Selling Time-Sensitive E-Services

A Novel Auction Mechanism for Selling Time-Sensitive E-Services A ovel Aucton Mechansm for Sellng Tme-Senstve E-Servces Juong-Sk Lee and Boleslaw K. Szymansk Optmaret Inc. and Department of Computer Scence Rensselaer Polytechnc Insttute 110 8 th Street, Troy, Y 12180,

More information

Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..

More information

On the Optimal Control of a Cascade of Hydro-Electric Power Stations

On the Optimal Control of a Cascade of Hydro-Electric Power Stations On the Optmal Control of a Cascade of Hydro-Electrc Power Statons M.C.M. Guedes a, A.F. Rbero a, G.V. Smrnov b and S. Vlela c a Department of Mathematcs, School of Scences, Unversty of Porto, Portugal;

More information

An Interest-Oriented Network Evolution Mechanism for Online Communities

An Interest-Oriented Network Evolution Mechanism for Online Communities An Interest-Orented Network Evoluton Mechansm for Onlne Communtes Cahong Sun and Xaopng Yang School of Informaton, Renmn Unversty of Chna, Bejng 100872, P.R. Chna {chsun,yang}@ruc.edu.cn Abstract. Onlne

More information

A Replication-Based and Fault Tolerant Allocation Algorithm for Cloud Computing

A Replication-Based and Fault Tolerant Allocation Algorithm for Cloud Computing A Replcaton-Based and Fault Tolerant Allocaton Algorthm for Cloud Computng Tork Altameem Dept of Computer Scence, RCC, Kng Saud Unversty, PO Box: 28095 11437 Ryadh-Saud Araba Abstract The very large nfrastructure

More information

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ). REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or

More information

Data Broadcast on a Multi-System Heterogeneous Overlayed Wireless Network *

Data Broadcast on a Multi-System Heterogeneous Overlayed Wireless Network * JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 24, 819-840 (2008) Data Broadcast on a Mult-System Heterogeneous Overlayed Wreless Network * Department of Computer Scence Natonal Chao Tung Unversty Hsnchu,

More information

Institute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic

Institute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic Lagrange Multplers as Quanttatve Indcators n Economcs Ivan Mezník Insttute of Informatcs, Faculty of Busness and Management, Brno Unversty of TechnologCzech Republc Abstract The quanttatve role of Lagrange

More information

Methodology to Determine Relationships between Performance Factors in Hadoop Cloud Computing Applications

Methodology to Determine Relationships between Performance Factors in Hadoop Cloud Computing Applications Methodology to Determne Relatonshps between Performance Factors n Hadoop Cloud Computng Applcatons Lus Eduardo Bautsta Vllalpando 1,2, Alan Aprl 1 and Alan Abran 1 1 Department of Software Engneerng and

More information

Cloud Auto-Scaling with Deadline and Budget Constraints

Cloud Auto-Scaling with Deadline and Budget Constraints Prelmnary verson. Fnal verson appears In Proceedngs of 11th ACM/IEEE Internatonal Conference on Grd Computng (Grd 21). Oct 25-28, 21. Brussels, Belgum. Cloud Auto-Scalng wth Deadlne and Budget Constrants

More information

Calculation of Sampling Weights

Calculation of Sampling Weights Perre Foy Statstcs Canada 4 Calculaton of Samplng Weghts 4.1 OVERVIEW The basc sample desgn used n TIMSS Populatons 1 and 2 was a two-stage stratfed cluster desgn. 1 The frst stage conssted of a sample

More information

A Dynamic Energy-Efficiency Mechanism for Data Center Networks

A Dynamic Energy-Efficiency Mechanism for Data Center Networks A Dynamc Energy-Effcency Mechansm for Data Center Networks Sun Lang, Zhang Jnfang, Huang Daochao, Yang Dong, Qn Yajuan A Dynamc Energy-Effcency Mechansm for Data Center Networks 1 Sun Lang, 1 Zhang Jnfang,

More information

An Alternative Way to Measure Private Equity Performance

An Alternative Way to Measure Private Equity Performance An Alternatve Way to Measure Prvate Equty Performance Peter Todd Parlux Investment Technology LLC Summary Internal Rate of Return (IRR) s probably the most common way to measure the performance of prvate

More information

METHODOLOGY TO DETERMINE RELATIONSHIPS BETWEEN PERFORMANCE FACTORS IN HADOOP CLOUD COMPUTING APPLICATIONS

METHODOLOGY TO DETERMINE RELATIONSHIPS BETWEEN PERFORMANCE FACTORS IN HADOOP CLOUD COMPUTING APPLICATIONS METHODOLOGY TO DETERMINE RELATIONSHIPS BETWEEN PERFORMANCE FACTORS IN HADOOP CLOUD COMPUTING APPLICATIONS Lus Eduardo Bautsta Vllalpando 1,2, Alan Aprl 1 and Alan Abran 1 1 Department of Software Engneerng

More information

Pricing Model of Cloud Computing Service with Partial Multihoming

Pricing Model of Cloud Computing Service with Partial Multihoming Prcng Model of Cloud Computng Servce wth Partal Multhomng Zhang Ru 1 Tang Bng-yong 1 1.Glorous Sun School of Busness and Managment Donghua Unversty Shangha 251 Chna E-mal:ru528369@mal.dhu.edu.cn Abstract

More information

Efficient Bandwidth Management in Broadband Wireless Access Systems Using CAC-based Dynamic Pricing

Efficient Bandwidth Management in Broadband Wireless Access Systems Using CAC-based Dynamic Pricing Effcent Bandwdth Management n Broadband Wreless Access Systems Usng CAC-based Dynamc Prcng Bader Al-Manthar, Ndal Nasser 2, Najah Abu Al 3, Hossam Hassanen Telecommuncatons Research Laboratory School of

More information

What is Candidate Sampling

What is Candidate Sampling What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble

More information

Multiple-Period Attribution: Residuals and Compounding

Multiple-Period Attribution: Residuals and Compounding Multple-Perod Attrbuton: Resduals and Compoundng Our revewer gave these authors full marks for dealng wth an ssue that performance measurers and vendors often regard as propretary nformaton. In 1994, Dens

More information

Forecasting the Direction and Strength of Stock Market Movement

Forecasting the Direction and Strength of Stock Market Movement Forecastng the Drecton and Strength of Stock Market Movement Jngwe Chen Mng Chen Nan Ye cjngwe@stanford.edu mchen5@stanford.edu nanye@stanford.edu Abstract - Stock market s one of the most complcated systems

More information

An Optimal Model for Priority based Service Scheduling Policy for Cloud Computing Environment

An Optimal Model for Priority based Service Scheduling Policy for Cloud Computing Environment An Optmal Model for Prorty based Servce Schedulng Polcy for Cloud Computng Envronment Dr. M. Dakshayn Dept. of ISE, BMS College of Engneerng, Bangalore, Inda. Dr. H. S. Guruprasad Dept. of ISE, BMS College

More information

Survey on Virtual Machine Placement Techniques in Cloud Computing Environment

Survey on Virtual Machine Placement Techniques in Cloud Computing Environment Survey on Vrtual Machne Placement Technques n Cloud Computng Envronment Rajeev Kumar Gupta and R. K. Paterya Department of Computer Scence & Engneerng, MANIT, Bhopal, Inda ABSTRACT In tradtonal data center

More information

Multi-Source Video Multicast in Peer-to-Peer Networks

Multi-Source Video Multicast in Peer-to-Peer Networks ult-source Vdeo ultcast n Peer-to-Peer Networks Francsco de Asís López-Fuentes*, Eckehard Stenbach Technsche Unverstät ünchen Insttute of Communcaton Networks, eda Technology Group 80333 ünchen, Germany

More information

A Design Method of High-availability and Low-optical-loss Optical Aggregation Network Architecture

A Design Method of High-availability and Low-optical-loss Optical Aggregation Network Architecture A Desgn Method of Hgh-avalablty and Low-optcal-loss Optcal Aggregaton Network Archtecture Takehro Sato, Kuntaka Ashzawa, Kazumasa Tokuhash, Dasuke Ish, Satoru Okamoto and Naoak Yamanaka Dept. of Informaton

More information

The OC Curve of Attribute Acceptance Plans

The OC Curve of Attribute Acceptance Plans The OC Curve of Attrbute Acceptance Plans The Operatng Characterstc (OC) curve descrbes the probablty of acceptng a lot as a functon of the lot s qualty. Fgure 1 shows a typcal OC Curve. 10 8 6 4 1 3 4

More information

Project Networks With Mixed-Time Constraints

Project Networks With Mixed-Time Constraints Project Networs Wth Mxed-Tme Constrants L Caccetta and B Wattananon Western Australan Centre of Excellence n Industral Optmsaton (WACEIO) Curtn Unversty of Technology GPO Box U1987 Perth Western Australa

More information

Activity Scheduling for Cost-Time Investment Optimization in Project Management

Activity Scheduling for Cost-Time Investment Optimization in Project Management PROJECT MANAGEMENT 4 th Internatonal Conference on Industral Engneerng and Industral Management XIV Congreso de Ingenería de Organzacón Donosta- San Sebastán, September 8 th -10 th 010 Actvty Schedulng

More information

PAS: A Packet Accounting System to Limit the Effects of DoS & DDoS. Debish Fesehaye & Klara Naherstedt University of Illinois-Urbana Champaign

PAS: A Packet Accounting System to Limit the Effects of DoS & DDoS. Debish Fesehaye & Klara Naherstedt University of Illinois-Urbana Champaign PAS: A Packet Accountng System to Lmt the Effects of DoS & DDoS Debsh Fesehaye & Klara Naherstedt Unversty of Illnos-Urbana Champagn DoS and DDoS DDoS attacks are ncreasng threats to our dgtal world. Exstng

More information

QoS-based Scheduling of Workflow Applications on Service Grids

QoS-based Scheduling of Workflow Applications on Service Grids QoS-based Schedulng of Workflow Applcatons on Servce Grds Ja Yu, Rakumar Buyya and Chen Khong Tham Grd Computng and Dstrbuted System Laboratory Dept. of Computer Scence and Software Engneerng The Unversty

More information

General Auction Mechanism for Search Advertising

General Auction Mechanism for Search Advertising General Aucton Mechansm for Search Advertsng Gagan Aggarwal S. Muthukrshnan Dávd Pál Martn Pál Keywords game theory, onlne auctons, stable matchngs ABSTRACT Internet search advertsng s often sold by an

More information

Robert Wilson for their comments on the a predecessor version of this paper.

Robert Wilson for their comments on the a predecessor version of this paper. Procurng Unversal Telephone ervce Paul Mlgrom 1 tanford Unversty, August, 1997 Reprnted from 1997 Industry Economcs Conference Proceedngs, AGP Canberra Introducton One of the hallmarks of modern socety

More information

BUSINESS PROCESS PERFORMANCE MANAGEMENT USING BAYESIAN BELIEF NETWORK. 0688, dskim@ssu.ac.kr

BUSINESS PROCESS PERFORMANCE MANAGEMENT USING BAYESIAN BELIEF NETWORK. 0688, dskim@ssu.ac.kr Proceedngs of the 41st Internatonal Conference on Computers & Industral Engneerng BUSINESS PROCESS PERFORMANCE MANAGEMENT USING BAYESIAN BELIEF NETWORK Yeong-bn Mn 1, Yongwoo Shn 2, Km Jeehong 1, Dongsoo

More information

Luby s Alg. for Maximal Independent Sets using Pairwise Independence

Luby s Alg. for Maximal Independent Sets using Pairwise Independence Lecture Notes for Randomzed Algorthms Luby s Alg. for Maxmal Independent Sets usng Parwse Independence Last Updated by Erc Vgoda on February, 006 8. Maxmal Independent Sets For a graph G = (V, E), an ndependent

More information

Second-Best Combinatorial Auctions The Case of the Pricing-Per-Column Mechanism

Second-Best Combinatorial Auctions The Case of the Pricing-Per-Column Mechanism Proceedngs of the 4th Hawa Internatonal Conference on System Scences - 27 Second-Best Combnatoral Auctons The Case of the Prcng-Per-Column Mechansm Drk Neumann, Börn Schnzler, Ilka Weber, Chrstof Wenhardt

More information

Construction Rules for Morningstar Canada Target Dividend Index SM

Construction Rules for Morningstar Canada Target Dividend Index SM Constructon Rules for Mornngstar Canada Target Dvdend Index SM Mornngstar Methodology Paper October 2014 Verson 1.2 2014 Mornngstar, Inc. All rghts reserved. The nformaton n ths document s the property

More information

Course outline. Financial Time Series Analysis. Overview. Data analysis. Predictive signal. Trading strategy

Course outline. Financial Time Series Analysis. Overview. Data analysis. Predictive signal. Trading strategy Fnancal Tme Seres Analyss Patrck McSharry patrck@mcsharry.net www.mcsharry.net Trnty Term 2014 Mathematcal Insttute Unversty of Oxford Course outlne 1. Data analyss, probablty, correlatons, vsualsaton

More information

Fair Virtual Bandwidth Allocation Model in Virtual Data Centers

Fair Virtual Bandwidth Allocation Model in Virtual Data Centers Far Vrtual Bandwdth Allocaton Model n Vrtual Data Centers Yng Yuan, Cu-rong Wang, Cong Wang School of Informaton Scence and Engneerng ortheastern Unversty Shenyang, Chna School of Computer and Communcaton

More information

How To Understand The Results Of The German Meris Cloud And Water Vapour Product

How To Understand The Results Of The German Meris Cloud And Water Vapour Product Ttel: Project: Doc. No.: MERIS level 3 cloud and water vapour products MAPP MAPP-ATBD-ClWVL3 Issue: 1 Revson: 0 Date: 9.12.1998 Functon Name Organsaton Sgnature Date Author: Bennartz FUB Preusker FUB Schüller

More information

Feasibility of Using Discriminate Pricing Schemes for Energy Trading in Smart Grid

Feasibility of Using Discriminate Pricing Schemes for Energy Trading in Smart Grid Feasblty of Usng Dscrmnate Prcng Schemes for Energy Tradng n Smart Grd Wayes Tushar, Chau Yuen, Bo Cha, Davd B. Smth, and H. Vncent Poor Sngapore Unversty of Technology and Desgn, Sngapore 138682. Emal:

More information

Recurrence. 1 Definitions and main statements

Recurrence. 1 Definitions and main statements Recurrence 1 Defntons and man statements Let X n, n = 0, 1, 2,... be a MC wth the state space S = (1, 2,...), transton probabltes p j = P {X n+1 = j X n = }, and the transton matrx P = (p j ),j S def.

More information

Open Access A Load Balancing Strategy with Bandwidth Constraint in Cloud Computing. Jing Deng 1,*, Ping Guo 2, Qi Li 3, Haizhu Chen 1

Open Access A Load Balancing Strategy with Bandwidth Constraint in Cloud Computing. Jing Deng 1,*, Ping Guo 2, Qi Li 3, Haizhu Chen 1 Send Orders for Reprnts to reprnts@benthamscence.ae The Open Cybernetcs & Systemcs Journal, 2014, 8, 115-121 115 Open Access A Load Balancng Strategy wth Bandwdth Constrant n Cloud Computng Jng Deng 1,*,

More information

IMPACT ANALYSIS OF A CELLULAR PHONE

IMPACT ANALYSIS OF A CELLULAR PHONE 4 th ASA & μeta Internatonal Conference IMPACT AALYSIS OF A CELLULAR PHOE We Lu, 2 Hongy L Bejng FEAonlne Engneerng Co.,Ltd. Bejng, Chna ABSTRACT Drop test smulaton plays an mportant role n nvestgatng

More information

iavenue iavenue i i i iavenue iavenue iavenue

iavenue iavenue i i i iavenue iavenue iavenue Saratoga Systems' enterprse-wde Avenue CRM system s a comprehensve web-enabled software soluton. Ths next generaton system enables you to effectvely manage and enhance your customer relatonshps n both

More information

The Greedy Method. Introduction. 0/1 Knapsack Problem

The Greedy Method. Introduction. 0/1 Knapsack Problem The Greedy Method Introducton We have completed data structures. We now are gong to look at algorthm desgn methods. Often we are lookng at optmzaton problems whose performance s exponental. For an optmzaton

More information

Software project management with GAs

Software project management with GAs Informaton Scences 177 (27) 238 241 www.elsever.com/locate/ns Software project management wth GAs Enrque Alba *, J. Francsco Chcano Unversty of Málaga, Grupo GISUM, Departamento de Lenguajes y Cencas de

More information

Simulation and optimization of supply chains: alternative or complementary approaches?

Simulation and optimization of supply chains: alternative or complementary approaches? Smulaton and optmzaton of supply chans: alternatve or complementary approaches? Chrstan Almeder Margaretha Preusser Rchard F. Hartl Orgnally publshed n: OR Spectrum (2009) 31:95 119 DOI 10.1007/s00291-007-0118-z

More information

APPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT

APPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT APPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT Toshhko Oda (1), Kochro Iwaoka (2) (1), (2) Infrastructure Systems Busness Unt, Panasonc System Networks Co., Ltd. Saedo-cho

More information

Power-of-Two Policies for Single- Warehouse Multi-Retailer Inventory Systems with Order Frequency Discounts

Power-of-Two Policies for Single- Warehouse Multi-Retailer Inventory Systems with Order Frequency Discounts Power-of-wo Polces for Sngle- Warehouse Mult-Retaler Inventory Systems wth Order Frequency Dscounts José A. Ventura Pennsylvana State Unversty (USA) Yale. Herer echnon Israel Insttute of echnology (Israel)

More information

Availability-Based Path Selection and Network Vulnerability Assessment

Availability-Based Path Selection and Network Vulnerability Assessment Avalablty-Based Path Selecton and Network Vulnerablty Assessment Song Yang, Stojan Trajanovsk and Fernando A. Kupers Delft Unversty of Technology, The Netherlands {S.Yang, S.Trajanovsk, F.A.Kupers}@tudelft.nl

More information

RequIn, a tool for fast web traffic inference

RequIn, a tool for fast web traffic inference RequIn, a tool for fast web traffc nference Olver aul, Jean Etenne Kba GET/INT, LOR Department 9 rue Charles Fourer 90 Evry, France Olver.aul@nt-evry.fr, Jean-Etenne.Kba@nt-evry.fr Abstract As networked

More information

Master s Thesis. Configuring robust virtual wireless sensor networks for Internet of Things inspired by brain functional networks

Master s Thesis. Configuring robust virtual wireless sensor networks for Internet of Things inspired by brain functional networks Master s Thess Ttle Confgurng robust vrtual wreless sensor networks for Internet of Thngs nspred by bran functonal networks Supervsor Professor Masayuk Murata Author Shnya Toyonaga February 10th, 2014

More information

Outsourcing inventory management decisions in healthcare: Models and application

Outsourcing inventory management decisions in healthcare: Models and application European Journal of Operatonal Research 154 (24) 271 29 O.R. Applcatons Outsourcng nventory management decsons n healthcare: Models and applcaton www.elsever.com/locate/dsw Lawrence Ncholson a, Asoo J.

More information

Effective Network Defense Strategies against Malicious Attacks with Various Defense Mechanisms under Quality of Service Constraints

Effective Network Defense Strategies against Malicious Attacks with Various Defense Mechanisms under Quality of Service Constraints Effectve Network Defense Strateges aganst Malcous Attacks wth Varous Defense Mechansms under Qualty of Servce Constrants Frank Yeong-Sung Ln Department of Informaton Natonal Tawan Unversty Tape, Tawan,

More information

Cost-based Scheduling of Scientific Workflow Applications on Utility Grids

Cost-based Scheduling of Scientific Workflow Applications on Utility Grids Cost-based Schedulng of Scentfc Workflow Applcatons on Utlty Grds Ja Yu, Rakumar Buyya and Chen Khong Tham Grd Computng and Dstrbuted Systems Laboratory Dept. of Computer Scence and Software Engneerng

More information

IWFMS: An Internal Workflow Management System/Optimizer for Hadoop

IWFMS: An Internal Workflow Management System/Optimizer for Hadoop IWFMS: An Internal Workflow Management System/Optmzer for Hadoop Lan Lu, Yao Shen Department of Computer Scence and Engneerng Shangha JaoTong Unversty Shangha, Chna lustrve@gmal.com, yshen@cs.sjtu.edu.cn

More information

A hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm

A hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm Avalable onlne www.ocpr.com Journal of Chemcal and Pharmaceutcal Research, 2014, 6(7):1884-1889 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCPRC5 A hybrd global optmzaton algorthm based on parallel

More information

DBA-VM: Dynamic Bandwidth Allocator for Virtual Machines

DBA-VM: Dynamic Bandwidth Allocator for Virtual Machines DBA-VM: Dynamc Bandwdth Allocator for Vrtual Machnes Ahmed Amamou, Manel Bourguba, Kamel Haddadou and Guy Pujolle LIP6, Perre & Mare Cure Unversty, 4 Place Jusseu 755 Pars, France Gand SAS, 65 Boulevard

More information

M3S MULTIMEDIA MOBILITY MANAGEMENT AND LOAD BALANCING IN WIRELESS BROADCAST NETWORKS

M3S MULTIMEDIA MOBILITY MANAGEMENT AND LOAD BALANCING IN WIRELESS BROADCAST NETWORKS M3S MULTIMEDIA MOBILITY MANAGEMENT AND LOAD BALANCING IN WIRELESS BROADCAST NETWORKS Bogdan Cubotaru, Gabrel-Mro Muntean Performance Engneerng Laboratory, RINCE School of Electronc Engneerng Dubln Cty

More information

To manage leave, meeting institutional requirements and treating individual staff members fairly and consistently.

To manage leave, meeting institutional requirements and treating individual staff members fairly and consistently. Corporate Polces & Procedures Human Resources - Document CPP216 Leave Management Frst Produced: Current Verson: Past Revsons: Revew Cycle: Apples From: 09/09/09 26/10/12 09/09/09 3 years Immedately Authorsaton:

More information

Answer: A). There is a flatter IS curve in the high MPC economy. Original LM LM after increase in M. IS curve for low MPC economy

Answer: A). There is a flatter IS curve in the high MPC economy. Original LM LM after increase in M. IS curve for low MPC economy 4.02 Quz Solutons Fall 2004 Multple-Choce Questons (30/00 ponts) Please, crcle the correct answer for each of the followng 0 multple-choce questons. For each queston, only one of the answers s correct.

More information

A New Task Scheduling Algorithm Based on Improved Genetic Algorithm

A New Task Scheduling Algorithm Based on Improved Genetic Algorithm A New Task Schedulng Algorthm Based on Improved Genetc Algorthm n Cloud Computng Envronment Congcong Xong, Long Feng, Lxan Chen A New Task Schedulng Algorthm Based on Improved Genetc Algorthm n Cloud Computng

More information

Dynamic Pricing for Smart Grid with Reinforcement Learning

Dynamic Pricing for Smart Grid with Reinforcement Learning Dynamc Prcng for Smart Grd wth Renforcement Learnng Byung-Gook Km, Yu Zhang, Mhaela van der Schaar, and Jang-Won Lee Samsung Electroncs, Suwon, Korea Department of Electrcal Engneerng, UCLA, Los Angeles,

More information

A Novel Methodology of Working Capital Management for Large. Public Constructions by Using Fuzzy S-curve Regression

A Novel Methodology of Working Capital Management for Large. Public Constructions by Using Fuzzy S-curve Regression Novel Methodology of Workng Captal Management for Large Publc Constructons by Usng Fuzzy S-curve Regresson Cheng-Wu Chen, Morrs H. L. Wang and Tng-Ya Hseh Department of Cvl Engneerng, Natonal Central Unversty,

More information

Enabling P2P One-view Multi-party Video Conferencing

Enabling P2P One-view Multi-party Video Conferencing Enablng P2P One-vew Mult-party Vdeo Conferencng Yongxang Zhao, Yong Lu, Changja Chen, and JanYn Zhang Abstract Mult-Party Vdeo Conferencng (MPVC) facltates realtme group nteracton between users. Whle P2P

More information

Overview of monitoring and evaluation

Overview of monitoring and evaluation 540 Toolkt to Combat Traffckng n Persons Tool 10.1 Overvew of montorng and evaluaton Overvew Ths tool brefly descrbes both montorng and evaluaton, and the dstncton between the two. What s montorng? Montorng

More information

FORMAL ANALYSIS FOR REAL-TIME SCHEDULING

FORMAL ANALYSIS FOR REAL-TIME SCHEDULING FORMAL ANALYSIS FOR REAL-TIME SCHEDULING Bruno Dutertre and Vctora Stavrdou, SRI Internatonal, Menlo Park, CA Introducton In modern avoncs archtectures, applcaton software ncreasngly reles on servces provded

More information

AN APPROACH TO WIRELESS SCHEDULING CONSIDERING REVENUE AND USERS SATISFACTION

AN APPROACH TO WIRELESS SCHEDULING CONSIDERING REVENUE AND USERS SATISFACTION The Medterranean Journal of Computers and Networks, Vol. 2, No. 1, 2006 57 AN APPROACH TO WIRELESS SCHEDULING CONSIDERING REVENUE AND USERS SATISFACTION L. Bada 1,*, M. Zorz 2 1 Department of Engneerng,

More information

How To Know The Components Of Mean Squared Error Of Herarchcal Estmator S

How To Know The Components Of Mean Squared Error Of Herarchcal Estmator S S C H E D A E I N F O R M A T I C A E VOLUME 0 0 On Mean Squared Error of Herarchcal Estmator Stans law Brodowsk Faculty of Physcs, Astronomy, and Appled Computer Scence, Jagellonan Unversty, Reymonta

More information

Abteilung für Stadt- und Regionalentwicklung Department of Urban and Regional Development

Abteilung für Stadt- und Regionalentwicklung Department of Urban and Regional Development Abtelung für Stadt- und Regonalentwcklung Department of Urban and Regonal Development Gunther Maer, Alexander Kaufmann The Development of Computer Networks Frst Results from a Mcroeconomc Model SRE-Dscusson

More information

A Probabilistic Theory of Coherence

A Probabilistic Theory of Coherence A Probablstc Theory of Coherence BRANDEN FITELSON. The Coherence Measure C Let E be a set of n propostons E,..., E n. We seek a probablstc measure C(E) of the degree of coherence of E. Intutvely, we want

More information

INVESTIGATION OF VEHICULAR USERS FAIRNESS IN CDMA-HDR NETWORKS

INVESTIGATION OF VEHICULAR USERS FAIRNESS IN CDMA-HDR NETWORKS 21 22 September 2007, BULGARIA 119 Proceedngs of the Internatonal Conference on Informaton Technologes (InfoTech-2007) 21 st 22 nd September 2007, Bulgara vol. 2 INVESTIGATION OF VEHICULAR USERS FAIRNESS

More information

Research on Privacy Protection Approach for Cloud Computing Environments

Research on Privacy Protection Approach for Cloud Computing Environments , pp. 113-120 http://dx.do.org/10.14257/jsa.2015.9.3.11 Research on Prvacy Protecton Approach for Cloud Computng Envronments Xaohu L 1,2, Hongxng Lang 3 and Dan Ja 1 1 College of Electrcal and Informaton

More information

A Resource-trading Mechanism for Efficient Distribution of Large-volume Contents on Peer-to-Peer Networks

A Resource-trading Mechanism for Efficient Distribution of Large-volume Contents on Peer-to-Peer Networks A Resource-tradng Mechansm for Effcent Dstrbuton of Large-volume Contents on Peer-to-Peer Networks SmonG.M.Koo,C.S.GeorgeLee, Karthk Kannan School of Electrcal and Computer Engneerng Krannet School of

More information

Online Auctions in IaaS Clouds: Welfare and Profit Maximization with Server Costs

Online Auctions in IaaS Clouds: Welfare and Profit Maximization with Server Costs Onlne Auctons n IaaS Clouds: Welfare and roft Maxmzaton wth Server Costs aox Zhang Dept. of Computer Scence The Unvety of Hong Kong xxzhang@cs.hku.hk Zongpeng L Dept. of Computer Scence Unvety of Calgary

More information

Vembu StoreGrid Windows Client Installation Guide

Vembu StoreGrid Windows Client Installation Guide Ser v cepr ov dered t on Cl enti nst al l at ongu de W ndows Vembu StoreGrd Wndows Clent Installaton Gude Download the Wndows nstaller, VembuStoreGrd_4_2_0_SP_Clent_Only.exe To nstall StoreGrd clent on

More information

J. Parallel Distrib. Comput. Environment-conscious scheduling of HPC applications on distributed Cloud-oriented data centers

J. Parallel Distrib. Comput. Environment-conscious scheduling of HPC applications on distributed Cloud-oriented data centers J. Parallel Dstrb. Comput. 71 (2011) 732 749 Contents lsts avalable at ScenceDrect J. Parallel Dstrb. Comput. ournal homepage: www.elsever.com/locate/pdc Envronment-conscous schedulng of HPC applcatons

More information

Staff Paper. Farm Savings Accounts: Examining Income Variability, Eligibility, and Benefits. Brent Gloy, Eddy LaDue, and Charles Cuykendall

Staff Paper. Farm Savings Accounts: Examining Income Variability, Eligibility, and Benefits. Brent Gloy, Eddy LaDue, and Charles Cuykendall SP 2005-02 August 2005 Staff Paper Department of Appled Economcs and Management Cornell Unversty, Ithaca, New York 14853-7801 USA Farm Savngs Accounts: Examnng Income Varablty, Elgblty, and Benefts Brent

More information

Joint Optimization of Bid and Budget Allocation in Sponsored Search

Joint Optimization of Bid and Budget Allocation in Sponsored Search Jont Optmzaton of Bd and Budget Allocaton n Sponsored Search Wenan Zhang Shangha Jao Tong Unversty Shangha, 224, P. R. Chna wnzhang@apex.sjtu.edu.cn Yong Yu Shangha Jao Tong Unversty Shangha, 224, P. R.

More information

DEFINING %COMPLETE IN MICROSOFT PROJECT

DEFINING %COMPLETE IN MICROSOFT PROJECT CelersSystems DEFINING %COMPLETE IN MICROSOFT PROJECT PREPARED BY James E Aksel, PMP, PMI-SP, MVP For Addtonal Informaton about Earned Value Management Systems and reportng, please contact: CelersSystems,

More information

Scalable and Secure Architecture for Digital Content Distribution

Scalable and Secure Architecture for Digital Content Distribution Valer Bocan Scalable and Secure Archtecture for Dgtal Content Dstrbuton Mha Fagadar-Cosma Department of Computer Scence and Engneerng Informaton Technology Department Poltehnca Unversty of Tmsoara Alcatel

More information

Enterprise Master Patient Index

Enterprise Master Patient Index Enterprse Master Patent Index Healthcare data are captured n many dfferent settngs such as hosptals, clncs, labs, and physcan offces. Accordng to a report by the CDC, patents n the Unted States made an

More information

Number of Levels Cumulative Annual operating Income per year construction costs costs ($) ($) ($) 1 600,000 35,000 100,000 2 2,200,000 60,000 350,000

Number of Levels Cumulative Annual operating Income per year construction costs costs ($) ($) ($) 1 600,000 35,000 100,000 2 2,200,000 60,000 350,000 Problem Set 5 Solutons 1 MIT s consderng buldng a new car park near Kendall Square. o unversty funds are avalable (overhead rates are under pressure and the new faclty would have to pay for tself from

More information

SUPPLIER FINANCING AND STOCK MANAGEMENT. A JOINT VIEW.

SUPPLIER FINANCING AND STOCK MANAGEMENT. A JOINT VIEW. SUPPLIER FINANCING AND STOCK MANAGEMENT. A JOINT VIEW. Lucía Isabel García Cebrán Departamento de Economía y Dreccón de Empresas Unversdad de Zaragoza Gran Vía, 2 50.005 Zaragoza (Span) Phone: 976-76-10-00

More information

Distributed Multi-Target Tracking In A Self-Configuring Camera Network

Distributed Multi-Target Tracking In A Self-Configuring Camera Network Dstrbuted Mult-Target Trackng In A Self-Confgurng Camera Network Crstan Soto, B Song, Amt K. Roy-Chowdhury Department of Electrcal Engneerng Unversty of Calforna, Rversde {cwlder,bsong,amtrc}@ee.ucr.edu

More information

J. Parallel Distrib. Comput.

J. Parallel Distrib. Comput. J. Parallel Dstrb. Comput. 71 (2011) 62 76 Contents lsts avalable at ScenceDrect J. Parallel Dstrb. Comput. journal homepage: www.elsever.com/locate/jpdc Optmzng server placement n dstrbuted systems n

More information

Robust Design of Public Storage Warehouses. Yeming (Yale) Gong EMLYON Business School

Robust Design of Public Storage Warehouses. Yeming (Yale) Gong EMLYON Business School Robust Desgn of Publc Storage Warehouses Yemng (Yale) Gong EMLYON Busness School Rene de Koster Rotterdam school of management, Erasmus Unversty Abstract We apply robust optmzaton and revenue management

More information

Linear Circuits Analysis. Superposition, Thevenin /Norton Equivalent circuits

Linear Circuits Analysis. Superposition, Thevenin /Norton Equivalent circuits Lnear Crcuts Analyss. Superposton, Theenn /Norton Equalent crcuts So far we hae explored tmendependent (resste) elements that are also lnear. A tmendependent elements s one for whch we can plot an / cure.

More information

Frequency Selective IQ Phase and IQ Amplitude Imbalance Adjustments for OFDM Direct Conversion Transmitters

Frequency Selective IQ Phase and IQ Amplitude Imbalance Adjustments for OFDM Direct Conversion Transmitters Frequency Selectve IQ Phase and IQ Ampltude Imbalance Adjustments for OFDM Drect Converson ransmtters Edmund Coersmeer, Ernst Zelnsk Noka, Meesmannstrasse 103, 44807 Bochum, Germany edmund.coersmeer@noka.com,

More information

A Secure Password-Authenticated Key Agreement Using Smart Cards

A Secure Password-Authenticated Key Agreement Using Smart Cards A Secure Password-Authentcated Key Agreement Usng Smart Cards Ka Chan 1, Wen-Chung Kuo 2 and Jn-Chou Cheng 3 1 Department of Computer and Informaton Scence, R.O.C. Mltary Academy, Kaohsung 83059, Tawan,

More information

Can Auto Liability Insurance Purchases Signal Risk Attitude?

Can Auto Liability Insurance Purchases Signal Risk Attitude? Internatonal Journal of Busness and Economcs, 2011, Vol. 10, No. 2, 159-164 Can Auto Lablty Insurance Purchases Sgnal Rsk Atttude? Chu-Shu L Department of Internatonal Busness, Asa Unversty, Tawan Sheng-Chang

More information

How To Plan A Network Wide Load Balancing Route For A Network Wde Network (Network)

How To Plan A Network Wide Load Balancing Route For A Network Wde Network (Network) Network-Wde Load Balancng Routng Wth Performance Guarantees Kartk Gopalan Tz-cker Chueh Yow-Jan Ln Florda State Unversty Stony Brook Unversty Telcorda Research kartk@cs.fsu.edu chueh@cs.sunysb.edu yjln@research.telcorda.com

More information

Performance Analysis and Comparison of QoS Provisioning Mechanisms for CBR Traffic in Noisy IEEE 802.11e WLANs Environments

Performance Analysis and Comparison of QoS Provisioning Mechanisms for CBR Traffic in Noisy IEEE 802.11e WLANs Environments Tamkang Journal of Scence and Engneerng, Vol. 12, No. 2, pp. 143149 (2008) 143 Performance Analyss and Comparson of QoS Provsonng Mechansms for CBR Traffc n Nosy IEEE 802.11e WLANs Envronments Der-Junn

More information

Politecnico di Torino. Porto Institutional Repository

Politecnico di Torino. Porto Institutional Repository Poltecnco d Torno Porto Insttutonal Repostory [Artcle] A cost-effectve cloud computng framework for acceleratng multmeda communcaton smulatons Orgnal Ctaton: D. Angel, E. Masala (2012). A cost-effectve

More information

Traffic State Estimation in the Traffic Management Center of Berlin

Traffic State Estimation in the Traffic Management Center of Berlin Traffc State Estmaton n the Traffc Management Center of Berln Authors: Peter Vortsch, PTV AG, Stumpfstrasse, D-763 Karlsruhe, Germany phone ++49/72/965/35, emal peter.vortsch@ptv.de Peter Möhl, PTV AG,

More information

A New Quality of Service Metric for Hard/Soft Real-Time Applications

A New Quality of Service Metric for Hard/Soft Real-Time Applications A New Qualty of Servce Metrc for Hard/Soft Real-Tme Applcatons Shaoxong Hua and Gang Qu Electrcal and Computer Engneerng Department and Insttute of Advanced Computer Study Unversty of Maryland, College

More information

A Programming Model for the Cloud Platform

A Programming Model for the Cloud Platform Internatonal Journal of Advanced Scence and Technology A Programmng Model for the Cloud Platform Xaodong Lu School of Computer Engneerng and Scence Shangha Unversty, Shangha 200072, Chna luxaodongxht@qq.com

More information

Economic-Robust Transmission Opportunity Auction in Multi-hop Wireless Networks

Economic-Robust Transmission Opportunity Auction in Multi-hop Wireless Networks Economc-Robust Transmsson Opportunty Aucton n Mult-hop Wreless Networks Mng L, Pan L, Mao Pan, and Jnyuan Sun Department of Electrcal and Computer Engneerng, Msssspp State Unversty, Msssspp State, MS 39762

More information