A multi objective virtual machine placement method for reduce operational costs in cloud computing by genetic

Size: px
Start display at page:

Download "A multi objective virtual machine placement method for reduce operational costs in cloud computing by genetic"

Transcription

1 International Journal of Couter Networs and Counications Security VOL. 2, NO. 8, AUGUST 2014, Available online at: ISSN C N C S A ulti obective virtual achine laceent ethod for reduce oerational costs in cloud couting by genetic Reza Soohtsaraei 1, Mirorsal Madani 2, Atena Kavian 3 1 Faculty eber of Paya Noor University, eartent of couter engineering and inforation technology, Tehran, Iran 2 Faculty eber of Korduy Islaic Azad University, earten of Couter Engineering, Korduy, Iran 3 Airabir University, eartent of Couter Engineering, Tehran, Iran E-ail: ASTRACT Increase of deand in using cloud couting caused increase of oerational costs consution energy and resources consued. As a result oreover satisfying services with quality requested through service level agreeent SLA, we ust reduce consuing energy and cost resulting fro resources used. According to too uch researches conducted on reducing consution energy, in this article we will focus on reducing oerational costs resulting fro wasting resources using technique of aing virtual achines to service roviders whose the ost iortant one is using on deand rovisioning odel which will revent fro wasting resources and ore exloitation of cloud couting and reduction in oerational costs. One of the ey asects of the rocess is considering load feature of virtual achines. ut ost tass done in this field do not care about it and on the other hand only otiization is noticed. ue to existence of faults and also high level of exloitation of genetic algoriths in finding fine results in searching sace, in this article a ethod was resented based on ulti-urose genetic algorith, where by considering tas feature of virtual achines. Several obectives are considered for otiizing during aing rocess. Coaring results gained fro algorith suggested with a rando algorith and one algorith in the first ultiurose choice, we can coe to this conclusion that the algorith suggested will establish better results on rovidence in resources and reducing oerational costs. Keywords: Cloud couting, virtual achine, ulti-urose genetic algorith, otiization. 1 INTROUCTION In recent years cloud couting has been nown as the ost oular calculation bed for hosting and roviding services based on internet [1], so that ost organizations chose this technology as their calculation atterns in solving robles related to IT[2]. To aintain accetance established in alying cloud couting, we have to tae u soe easures so that two sides (roviders and clients) involved in this technology can reach the axiu level of satisfaction in using it. ased on this, to reach client satisfaction and for eeting service quality requested by the, big cloud couting roviders such as Aazon, Google, Microsoft, IM and so on created new data centers in different geograhical areas so that by establishing redundancy and trust caability they can reove errors ade during resenting services and this way they can irove quality level and reliability in these services. On the other hand, as deand in using cloud couting is increased, gaining roviders` satisfaction is not an easy tas due to increase of oerational costs (consuing energy, resources consued). In [3] it is shown that with increase of deand energy consution in data center of cloud couting had a 400-ercent increase coared to the revious decade. As a result, to control oerational costs, roviders of cloud couting have to reduce consuing energy

2 251 R. Soohtsaraei et. al / International Journal of Couter Networs and Counications Security, 2 (8), August 2014 and costs resulting fro resources used, oreover eeting services with the quality requested through SLA. Since too uch research investigated energy consution reduction in cloud couting [4-10], we focus on reducing oerational costs resulting fro wasting resources. One of the ost iortant technologies along with cloud couting is virtualization. In this technology we can share resources of a achine between several alications by using erforance isolated latfors called virtual achines. One of the ost roinent advantages of virtualization is alying on deand rovisioning odel. The odel guarantees that users ust be rovided the resources they need whose results will be reventing fro waste of resources and ore exloitation of cloud couting and also reduction in oerational costs. esite virtualization, one of the subects raised is rocess of aing virtual achines to service roviders. The rocess is highly iortant since it has a great effect on exloitation of resources. If the rocess of aing virtual achines to service roviders is not conducted accurately and with full awareness with resource condition, then oerational costs will increase due to waste of resources. As a result, the rocess was raised as one of the ost iortant research fields on cloud couting [4,9-11,13-22] and to solve it various ethods are used such as linear rograing[13,14,5], constraint rograing [16,17], bin acing [18,19,20], Ant colony algorith[4] and genetic algorith. One of the ey asects in aing virtual achines to service roviders which can cause increase of efficient in cloud couting is considering feature of woring load of virtual achines during the rocess [12], but ost of tass done on this do not care about it. Also in ost researches conducted on this, only otiization is cared, while in real robles we can consider various obectives. ue to defects entioned earlier, a ethod was resented in this article which cares about several goals for otiization by considering feature of woring load of virtual achines. Since ultiurose otiization roble is aong NP-hard robles, due to high level of genetic algoriths in finding desirable results in searching sace we used this tye of algorith for finding the best resonse in this article. y coaring results gained fro siulating suggested ulti-urose genetic algorith with a rando algorith and one ultiurose algorith, we can coe to this conclusion that suggested algorith can establish better results on resource rovidence and in reducing oerational costs. Next, the article is organized as follows: in section 2 several recent activities conducted on aing virtual achines to service roviders were resented and their faults are entioned. In section3, rocess of aing and forulas used is resented officially. In section4, suggested ultiurose genetic algorith is shown. In secton5, siulation results are resented and in the end the article is finished by roviding conclusion and exressing future wors. 2 WORK RELATE In this section several researches conducted on relacing virtual achines to hysical ones are resented. We investigate wors done in this section fro three views: a) Wors in which overloading of hysical achines are not considered: In [4], an Ant colony algorith is resented which deals with aing roble in erutation for fro virtual achines to hysical ones. The ai of the algorith is to resent a solution so that it can reduce level of consued energy and resources wasted siultaneously. In this algorith, virtual achines are aed based on level of desirability and robability of oveent to hysical achines which are selected randoly. In [23], an algorith of dynaic resource allocation was resented which was based on threshold where it allocates virtual achines based on their worload changes to hysical achines. To do this it alies a ethod based on threshold for otiizing the rocess. The algorith reestablishes virtual achines in dynaic for based on needed worload changes in cloud alications and based on this it creates rovidence in using resources and can increase efficiency. b) Wors in which rovidence in wasted resources is not considered: In [24]a develoed algorith First Fit ecreasing (FF) was suggested in which each hysical achine was rovided one grade as an advantage and based on this virtual achines are aed to hysical achines with higher level of score. To revent fro deficient iigration, two values of threshold are deterined as Rlow and Rhigh. If a hysical achine consues ore than Rhigh, it is called Highly-loaded and if it consues less than Rlow, it is called Lowly-loaded. Then virtual achines which are only laced in these two tyes of achines will have the erission to igrate. In [12] a odified bin acing algorith is suggested in which virtual achines can be divided into two sets of Cu intensive and ata intensive. The algorith as virtual achines to hysical achines ased on two rules so that the least nuber of hysical achines can be deterined.

3 252 R. Soohtsaraei et. al / International Journal of Couter Networs and Counications Security, 2 (8), August 2014 The first rule is in this way that the axiu nuber of virtual achine which is focused on data aed on a hysical achine should not be ore than, since too uch aing this tye of virtual achine to a hysical one can increase coetition for availability to dis. The second rule is that the axiu resource deanded by virtual achines should not be ore than the axiu nuber of resources resent in hysical achines. C) Activities in which hysical achine being overhead and rovidence in wasted resources are not considered: In [25] algoriths of Hybrid and ynaic Round Robin (RR) are resented whose ai is rovidence in consuing energy using ixture. RR has been an iroveent in algorith RR in which two rules are used for cobining virtual achines. The first rule is so that if a virtual achine ended and other virtual achines are being erfored on that hysical achine then the hysical achine does not establish a new virtual achine. The second rule indicates that if one hysical achine does not accet a new virtual achine for a long tie, then all the virtual achines will ove into anther hysical achine and the achines will turn off. In[26] Green couting algorith is resented in which condition of all the virtual achines are suervised and added hysical achines will turn off, if the syste efficiency does not becoe low. In [27] an architecture called Green Cloud is shown which can reduce consuing energy of data centers. This architecture is caable of suervising cloud eleents in on-line for and corehensively, it can ae virtual achines ove in live for and also it can otiize aing of virtual achines. In[23] a Fraewor called VM lanner was suggested for reducing energy costs resulting fro the networ eleents resent in data center (lins and routing ). Using dynaic igration of virtual achines and routing based on rograable flow-based routing resent in odern data centers, this fraewor can reduce the consution resulting fro networ eleents oreover eeting traffic needs. To reduce consuing energy, VM lanner considers toological features and traffic atterns and based on this it tries to turn off unnecessary networ eleents as uch as ossible. In [10] an architecture called Energy and Carbon- Efficient (ECE) was resented in which an interface called ECE Cloud roer can a virtual achines to hysical achines so that consuing energy of data center can be otiized and as a result Carbon Footrint is reduced. roer does the aing rocess based on data such as consued energy and rate of carbon roduction by energy resources in a data center. The activity conducted in this article is different with revious ones. In aing virtual achines to service roviders we suggest a ultiurose genetic algorith using it we can reduce nuber of overloaded service roviders and also the level of wasted resources. 3 PROLEM EXPRESSING In a cloud, alications are erfored in storage of service roviders which were virtualized totally. The tas of aing virtual achines to storage of service roviders can be considered a tye of in acing roble in which virtual achines are in fact ites and service roviders are ins. Feature of each ite and bin can be described with a leash set in for of CPU, Meory and andwidth all of which indicate resources requested and leash of each bin indicates level of resources resent. Next we will rovide forulas used in aing rocess and the reason of using it, also sybols used are shown in table 1. Variable S S TR TR UR UR ` RR RR l U i i Table1. araeters used efinition Set all servers All of virtual achines that are assigned to the - server The total rocessing caacity of -server The total ain eory caacity of -server Used -server rocessing caacity Used -server ain eory caacity The reaining rocessing caacity of -server The reaining ain eory caacity of -server The threshold for all rocessors The threshold for the ain eory of all the servers Required bandwidth between and l virtual achine andwidth allocated between i and virtual achine Available bandwidth between i and servers Processing caacity required by the -virtual achine A eory request by -virtual achine andwidth threshold

4 253 R. Soohtsaraei et. al / International Journal of Couter Networs and Counications Security, 2 (8), August 2014 a) Obective functions Assue that we laced n virtual achines in three naes of Cu_VMset, Meory_VMset and I/O_VMset which indicate set of virtual achines focused on rocessor, focused on eory and inut and outut, resectively. These sets are deendent on each other, in other words a virtual achine ay include features of all three sets. n of virtual achine ust be aed on service. For silicity we assue that resources requested of a virtual achine are not ore than resources which a service rovider rovides. The ai of aing virtual achines to service roviders in this article is siultaneous otiization of three following forulas (1, 2, 3) Min S 1 RR RR (1) Using forula (1), we can gain level of wasted resource. The ore iniu the forula (1), the less the value. e.g. if in a service rovider level of using the ain eory is ore than rocessor, then aing of the other virtual achine to this service rovider will face sae robles due to eory shortage and if the roble still exits the reaining rocessing resource in this service rovider ay not be usable and it will be considered as wasted resource. Using forula (2) we can identify service roviders overloaded and calculate level of overloading. For calculating value of this forula, service rovider is divided into five grous. The way of calculating level of overload for each grou is different to other grou. This grouing is conducted based on hrases of (4) to (13). Feature of each grou is u next. Min S O 1 M ( ) TR 1 TR M ( i) M ( ) 1 l 1 i M ( ) i TR 1 TR and (3) and (4) i, S M ( ) TR 1 S (1) and (5) TR M ( ) TR 1 S (2) and (7) TR M ( i) M ( ) i, 1 l 1 l O i, S (3) and (6) i M ( ) M ( i) M ( ) M ( ) TR TR i 1 1 l 1 l 1 TR i TR i, S, and and [0,0.5] ((1) and (8)) or ((3) and (9)) or ((2) and (10)) 0 else 1 M ( ) 0 S X X Min 1 0 else (3) l (1) and (2)

5 254 R. Soohtsaraei et. al / International Journal of Couter Networs and Counications Security, 2 (8), August 2014 These five grous include: The first grous include service roviders whose level of used resources was ore than valid value and also soe virtual achines focused on rocessor, focused on eory and I/O are aed on the. This grou is deterined based on forulas (4) to (7). The second grous include service roviders whose level of rocessor usage was ore than threshold and also they have soe virtual achines focused on rocessor. These grous can be deterined using stateents (4) and (8). The third grous includes service roviders whose level of eory usage was ore than level deterined and also they have soe virtual achines focused on eory. This grou can be secified using stateents (5) and (10). The forth grou includes service roviders whose connection lins are ore than threshold level and also soe virtual achines with deand of counication (focused on I/O) are aed on the. This grou is secified based on stateents (6) and (9). The fifth grou (using stateents (4),(11),(6),(12),(5) and (13)) includes service roviders in which one or several resources in the ay be ore than authorized level. They don`t have virtual achines to be able to influence on those resources. TR UR TR UR M( i) M( ) i, S, i 1 l 1 l, l, z M ( ), I / O _ VMset and l Cu _ VMset and z Meory_ VMset l z or l z M( ), Cu _ VMset S M( ), I / O _ VMset S M( ), Meory_ VMset S M( ), Cu_ VMset S M( ), I / O _ VMset S M( ), Meory_ VMset S (4) (5) (6) (7) (8) (9) (10) (11) (12) (13) The oint that is worth to ention is that soe service roviders ay have feature of several grous together which in this situation value of all of these grous in forula (2) should be calculated for the service rovider. Next art ulti-urose genetic algorith is resented. 4 ESCRIING SUGGESTE MULTI- PURPOSE GENETIC ALGORIM Since aing of virtual achines to service roviders is a tye of bin acing, we can aly grou genetic algorith (GGA) which was suggested by Falenauer [28]. As the nae of GGA suggests, it is a develoent of noral genetic algorith which was coared for solving grouing robles. There are also other tyes of genetic algorith for solving grouing robles but what ade GGA roinent is a secial coding which was suggested by Falenauer. As a result, in this article we used GGA. Suggested ulti-urose genetic algorith code is whons u next Inut: Set of VMs with their associated resource deands (Cu, Meory, andwidth ) and set of hosts with their existing resources(cu E, Meory E, andwidth E ) Outut: Set P contains the aing inforation of virtual achines to servers /* Initialization Phase* 1. Set Values of araeters, P,,,,,, NV ( nuber of virtual achines), NI( nuber of iteration), NC( nuber of chroosoes in each 2. Grouing virtual achines in three categories. ( Cu _ VMset, Meory _ VMset, I / O _ VMset ) 3. escending sorting virtual achines based on the forula Creating initial oulation based on aing of resorted virtual achines to servers that are randoly selected. 5. For all Chroosoes in first oulation calculate ran of each Chroosoes based on su of forulas (1),(2),(3) and save the in oldran array /* Iterative Phase*/ 6. While (nuber of iteration<=ni) 7. For all Chroosoes in re oulation 8. Randoly select two Chroosoes. 9. Merge two chroosoes are selected based on the grouing crossover *. 10. Iort two new chroosoes in a teorary oulation. 11. End for oulation)

6 255 R. Soohtsaraei et. al / International Journal of Couter Networs and Counications Security, 2 (8), August o the grouing utation * oeration for all chroosoes in teorary oulation. 13. For all Chroosoes in teorary oulation calculate ran of each Chroosoes based on su of forulas (1),(2),(3) 14. For new oulation: Select K 1 % of new oulation fro to raning chroosoes of teorary oulation. Select K 2 % of new oulation fro to raning chroosoes of old oulation. Select K 3 % of new oulation randoly generated chroosoes. 15. End while /* Solution Phase */ 16. Select toost chroosoe fro final oulation as Solution * Grouing crossover and grouing utation has been roosed in [28]. Figure 1. Suggested ulti-urose genetic algorith S TR 1 S TR 1 S S 1i 1 i VM _ List (14) Figure suggested ulti-urose genetic algorith is shown. Fro now on suggested algorith is called CMPGGA. This algorith is fored on three stes of initialization, iterative and solution. In the first ste at first araeters needed are valued and then three grous of virtual achines are created. next oblivious of grouing of revious ste and based on forula 14, all the virtual achines are ordered in falling for. After arranging, virtual achines are aed to service roviders who were selected randoly and those with enough resources needed by virtual achines so that the first oulation can be gained. In the last hase of initialization, ran of each chroosoe is calculated and saved in the first oulation. In the iterative ste in each reetition a new oulation is created. In each reetition for all chroosoes of the revious generation, act of grou ixing is done. Selection of each chroosoe for ixing is in rando fro. Two chroosoes created in each ixture activity, enter a teorary oulation. After the end of ixing and entrance of all the chroosoes created in teorary oulation, act of grou utation will be done for all the chroosoes of the oulation. Then ran of each chroosoes of teorary oulation is calculated and saved. The last hase of Iterative ste, is establishing new oulation. Selection of chroosoes of new oulation is based on figure3. The reason behind rando selection of the new oulation is not lacing in the local iniu and creation of generations so that we can cover ore areas of searching doain. Fig. 2. Foring new oulation In the final stage; Solution, aong chroosoes of final oulation, the chroosoes with the highest level of significance is selected as the best VMPGGA solution. 5 ANALYSIS OF EFFICIENCY To analyze efficiency of VMPGGA we created a siulator based on Java. To this, we consider a data center with 20 single-ato hysical service. Features of these hysical service roviders are selected based on unifor distribution of values shown in table 2. Table2. Features of hysical service roviders Resource CPU (MIPS) Meory (G) Networ andwidth (Gbs) Caacity Also 50to100virtual achines are considered for aing on this data center. Features of virtual achines are also selected based on the sae distribution of values resented in table 3. Table 3. Features of virtual achines Resource CPU (MIPS) Meory (M) Networ andwidth (Mbs) eand

7 256 R. Soohtsaraei et. al / International Journal of Couter Networs and Counications Security, 2 (8), August 2014 Reaining needed araeters are selected based on table4 Table 4. Values of reaining araeters used Paraeters,, NC ( nuber of chroosoes in each oulation NI ( nuber of iteration) Values TR i 0.005TR i i Fig. 4. level of wasted eory to various nubers of virtual achine To analyze efficiency of VMPGA, we coare it with two algoriths of Multi Obective First Fid ecreasing and Rando. In latter algorith first virtual achines are ordered based on value gained out of forula 14 in falling for and then in the list of service roviders which are ordered in falling for and based on a forula siilar to forula 14, the first service rovider with sufficient sace for the virtual achine is selected and then virtual achine will be aed in it. Next, results gained out of assessent will be resented. Fig. 5. Level of wasted bandwidth to various nubers of virtual achine Fig. 3. level of wasted rocessing to various nubers of virtual achine Fig. 6. Nuber of service roviders used to various nubers of virtual achine

8 257 R. Soohtsaraei et. al / International Journal of Couter Networs and Counications Security, 2 (8), August CONCLUSION Fig. 7. Level of request of overload creator in using rocessor in service roviders used to various nubers of virtual achine. Since ost of tass done in cloud couting do not care about worload of virtual achines and only care about otiization of an obective, in this article we focused our discussion on reducing oerational costs resulting fro wasting resource. y investigating tass in which overloading of hysical achines are not considered [4] [23], rovidence in resources wasted is not iosed [12] [4] also by activities in which overloading of hysical achines and rovidence in resources wasted are not iosed [23] [25] [26] [27] we resented a ethod which deals with several goals for otiizing in aing rocess by considering feature of worload of virtual achines. Then by coaring results gained fro siulating suggested ulti-urose genetic algorith with a rando algorith and an algorith of the first ulti-urose choice based on factors such as level of rocessing loss, eory and bandwidth, nuber of service roviders and also level of request of overload creator in using rocessor and service roviders, we cae to this conclusion that the algorith suggested can establish better results on rovidence in resources and reducing oerational costs by resenting an efficient ethod we hoe to be able to achieve soe results with less oerational overload, less level of resources usage and at the sae tie the least energy consution in cloud couting. 7 REFERENCES Fig. 8. Level of request of overload creator in using eory in service roviders used to various nubers of virtual achine. Fig. 9. Level of request of overload creator in using bandwidth in service roviders used to various nubers of virtual achine. [1] A. eloglazov, J. Abaway, R. uyya, Energy-aware resource allocation heuristics for efficient anageent of data centers for cloud couting, Future Generation Couter Systes, vol. 28, no. 5, , Elsevier Science, [2] A. asterdi, S. Garg, R. uyya, QoS-aware deloyent of networ of virtual aliances across ultile clouds, Proceedings of the 3th IEEE International Conference on Cloud Couting Technology and Science, [3] A. Khosravi, S. Garg, R. uyya, Energy and carbon-efficient laceent of virtual achines in distributed cloud data centers, Proceedings of the 19th International Euroean Conference on Parallel and istributed Couting, [4]. Seita, M. ichler, A atheatical rograing aroach for server consolidation robles in virtualized data centers, IEEE Trans. Services Couting, vol. 3, no. 4, ,

9 258 R. Soohtsaraei et. al / International Journal of Couter Networs and Counications Security, 2 (8), August 2014 [5]. Li, J. Li, J. Huai, T. Wo, Q. Li, L. Zhong, Enacloud: an energy-saving alication live laceent aroach for cloud couting environents, in Proceedings of the IEEE International Conference on Cloud Couting, [6] C. Lin, P. Liu, J, Wu, Energy-efficient virtual achine rovision algoriths for cloud systes, in Proceedings of the 4th IEEE International Conference on Utility and Cloud Couting, [7]. FILANI, J. HE, S. GAO, M. RAJAPPA, A. KUMAR, R. SHAH, R. NAAPPAN, ynaic data center ower anageent:trends, issues and solutions., Intel Technology Journal, vol. 12, , [8] E. Feller, L. Rilling, C. Morin, Energy-aware ant colony based worload laceent in clouds, in Proceedings of the IEEE/ACM International Conference on Grid Couting (GRI), [9] Eanuel Falenauer: Genetic Algoriths and Grouing Probles. John Wiley, [10] F. Herenier, X. Lorca, J. Menaud, G. Muller, J. Lawall, Entroy: a consolidation anager for clusters, in Proceedings of the ACM SIGPLAN/SIGOPS International Conference on Virtual Execution Environents, [11] G. Chen, W. He, J. Liu, S. Nath, L. Rigas, L. Xiao, F. Zhao, Energy-aware server rovisioning and load disatching for connection-intensive internet services, in Proceedings of the 5th ACM USENIX Syosiu on Networed Systes esign and Ileentation, [12] H. Mi, H. Wang, G. Yin, Y. Zhou,. Shi, L. Yuan, Online self-reconfiguration with erforance guarantee for energy-efficient large-scale cloud couting data centers, in Proceedings of the IEEE International Conference on Services Couting, [13] H. Van, F. Tran, J. Menaud, Perforance and ower anageent for cloud infrastructures, in Proceedings of the IEEE 3th International Conference on Cloud Couting, [14] J. Chase,. Anderson, P. Thaar, A. Vahdat, R. oyle, Managing energy and server resources in hosting centers, in Proceedings of the 8th ACM syosiu on Oerating systes rinciles, USA: ACM, [15] J. Xu, J. Fortes, Multi-obective virtual achine laceent in virtualized data center environents, in Proceedings of the IEEE/ACM International Conference on Green Couting and Counications, [16] J. Yang, P. Liu, J. Wu, Worload characteristics-aware virtual achine consolidation algoriths, Proceedings of the 4th IEEE International Conference on Cloud Couting Technology and Science, [17] K. Ki, A. eloglazov, R. uyya, Poweraware rovisioning of virtual achines for real-tie cloud services, Concurrency and Coutation: Practice and Exerience, vol. 23, no. 13, , Wiley Press, [18] L. Hu, H. Jin, X. Liao, X. Xiong, H. Liu, Magnet: A novel scheduling olicy for ower reduction in cluster with virtual achines., in Proceedings of the IEEE international conference on cluster couting, [19] L. Liu, H. Wang, X. Liu, X. Jin, W. He, Q. Wang, Y. Chen, Greencloud: a new architecture for green data center, in Proceedings of the 6th international conference industry session on Autonoic couting and counications industry session, USA: ACM, [20] M. ichler, T. Setzer,. Seita, Caacity lanning for virtualized servers, in Proceedings of Worsho on Inforation Technologies and Systes (WITS), [21] Q. Zhang, L. Cheng, R. outaba, Cloud couting: state-of-the-art and research challenges, J. Internet Services Al, vol. 1, no. 1,. 7 18, [22] S. Chaisiri,. Lee,. Niyato, Otial virtual achine laceent across ultile cloud roviders, in: Proceedings of the IEEE Asia- Pacific Services Couting Conference, [23] S. Sriantaiah, A. Kansal, F. Zhao, Energy aware consolidation for cloud couting, in Proceedings of HotPower 08 Worsho on Power Aware Couting and Systes, [24] S. Taeda, T. Taeura, A ran-based v consolidation ethod for ower saving in datacenters, Inforation and Media Technologies, vol. 5, , [25] S. Taeda, T. Taeura, A ran-based v consolidation ethod for ower saving in datacenters, Inforation and Media Technologies, vol. 5, no. 3, , [26] V. Tosic, H. Wada, A. Guabtni, K. Le-e, A. Liu, Manageent towards reducing cloud usage costs, in Proceedings of the 7th IEEE Networ Oerations and Manageent Syosiu (LANOMS), [27] W. Lin, J. Wang, Ch. Liang,. Qi, A. Threshold-based ynaic Resource Allocation

10 259 R. Soohtsaraei et. al / International Journal of Couter Networs and Counications Security, 2 (8), August 2014 Schee for Cloud Couting, Procedia Engineering, vol. 23, , Elsevier, [28] Y. Gao, H. Guan, Z. Qi, Y. Hou, L. Liu, A ulti-obective ant colony syste algorith for virtual achine laceent in cloud couting, Journal of Couter and Syste Sciences, vol. 79, no. 8, , 2013.

GRADUAL OPTIMIZATION OF URBAN FIRE STATION LOCATIONS BASED ON GEOGRAPHICAL NETWORK MODEL

GRADUAL OPTIMIZATION OF URBAN FIRE STATION LOCATIONS BASED ON GEOGRAPHICAL NETWORK MODEL GRADUAL OPTIMIZATION OF URBAN FIRE STATION LOCATIONS BASED ON GEOGRAPHICAL NETWORK MODEL Yu Yan a, b, Guo Qingsheng a, Tang Xining c a School of Resource and Environent Science, Wuhan University, 29 Luoyu

More information

SCIENTIFIC simulations executed on parallel computing

SCIENTIFIC simulations executed on parallel computing IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 20, NO. X, XXX 2009 1 Scheduling Parallel Task Grahs on (Alost) Hoogeneous Multicluster Platfors Pierre-François Dutot, Tchiou N Také, Frédéric

More information

1 Adaptive Control. 1.1 Indirect case:

1 Adaptive Control. 1.1 Indirect case: Adative Control Adative control is the attet to redesign the controller while online, by looking at its erforance and changing its dynaic in an autoatic way. Adative control is that feedback law that looks

More information

An Innovate Dynamic Load Balancing Algorithm Based on Task

An Innovate Dynamic Load Balancing Algorithm Based on Task An Innovate Dynaic Load Balancing Algorith Based on Task Classification Hong-bin Wang,,a, Zhi-yi Fang, b, Guan-nan Qu,*,c, Xiao-dan Ren,d College of Coputer Science and Technology, Jilin University, Changchun

More information

A Virtual Machine Dynamic Migration Scheduling Model Based on MBFD Algorithm

A Virtual Machine Dynamic Migration Scheduling Model Based on MBFD Algorithm International Journal of Comuter Theory and Engineering, Vol. 7, No. 4, August 2015 A Virtual Machine Dynamic Migration Scheduling Model Based on MBFD Algorithm Xin Lu and Zhuanzhuan Zhang Abstract This

More information

arxiv:0805.1434v1 [math.pr] 9 May 2008

arxiv:0805.1434v1 [math.pr] 9 May 2008 Degree-distribution stability of scale-free networs Zhenting Hou, Xiangxing Kong, Dinghua Shi,2, and Guanrong Chen 3 School of Matheatics, Central South University, Changsha 40083, China 2 Departent of

More information

Analysis of a Secure Software Upload Technique in Advanced Vehicles using Wireless Links

Analysis of a Secure Software Upload Technique in Advanced Vehicles using Wireless Links Proceedings of the 007 IEEE Intelligent Transortation Systes Conference Seattle, WA, USA, Set. 30 - Oct. 3, 007 WeC4.3 Analysis of a Secure Uload Technique in Advanced Vehicles using Wireless Links Irina

More information

CLOUD computing is quickly becoming an effective and

CLOUD computing is quickly becoming an effective and IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, VOL. 24, NO. 6, YEAR 203 Otial Multiserver Configuration for Profit Maxiization in Cloud Couting Junwei Cao, Senior Meber, IEEE, Kai Hwang, Fellow,

More information

Software Quality Characteristics Tested For Mobile Application Development

Software Quality Characteristics Tested For Mobile Application Development Thesis no: MGSE-2015-02 Software Quality Characteristics Tested For Mobile Application Developent Literature Review and Epirical Survey WALEED ANWAR Faculty of Coputing Blekinge Institute of Technology

More information

Applying Multiple Neural Networks on Large Scale Data

Applying Multiple Neural Networks on Large Scale Data 0 International Conference on Inforation and Electronics Engineering IPCSIT vol6 (0) (0) IACSIT Press, Singapore Applying Multiple Neural Networks on Large Scale Data Kritsanatt Boonkiatpong and Sukree

More information

Load balancing over redundant wireless sensor networks based on diffluent

Load balancing over redundant wireless sensor networks based on diffluent Load balancing over redundant wireless sensor networks based on diffluent Abstract Xikui Gao Yan ai Yun Ju School of Control and Coputer Engineering North China Electric ower University 02206 China Received

More information

Energy Efficient VM Scheduling for Cloud Data Centers: Exact allocation and migration algorithms

Energy Efficient VM Scheduling for Cloud Data Centers: Exact allocation and migration algorithms Energy Efficient VM Scheduling for Cloud Data Centers: Exact allocation and igration algoriths Chaia Ghribi, Makhlouf Hadji and Djaal Zeghlache Institut Mines-Téléco, Téléco SudParis UMR CNRS 5157 9, Rue

More information

Analyzing Spatiotemporal Characteristics of Education Network Traffic with Flexible Multiscale Entropy

Analyzing Spatiotemporal Characteristics of Education Network Traffic with Flexible Multiscale Entropy Vol. 9, No. 5 (2016), pp.303-312 http://dx.doi.org/10.14257/ijgdc.2016.9.5.26 Analyzing Spatioteporal Characteristics of Education Network Traffic with Flexible Multiscale Entropy Chen Yang, Renjie Zhou

More information

Dynamic Placement for Clustered Web Applications

Dynamic Placement for Clustered Web Applications Dynaic laceent for Clustered Web Applications A. Karve, T. Kibrel, G. acifici, M. Spreitzer, M. Steinder, M. Sviridenko, and A. Tantawi IBM T.J. Watson Research Center {karve,kibrel,giovanni,spreitz,steinder,sviri,tantawi}@us.ib.co

More information

The Research of Measuring Approach and Energy Efficiency for Hadoop Periodic Jobs

The Research of Measuring Approach and Energy Efficiency for Hadoop Periodic Jobs Send Orders for Reprints to reprints@benthascience.ae 206 The Open Fuels & Energy Science Journal, 2015, 8, 206-210 Open Access The Research of Measuring Approach and Energy Efficiency for Hadoop Periodic

More information

Cooperative Caching for Adaptive Bit Rate Streaming in Content Delivery Networks

Cooperative Caching for Adaptive Bit Rate Streaming in Content Delivery Networks Cooperative Caching for Adaptive Bit Rate Streaing in Content Delivery Networs Phuong Luu Vo Departent of Coputer Science and Engineering, International University - VNUHCM, Vietna vtlphuong@hciu.edu.vn

More information

Transient Performance of PacketScore for blocking DDoS attacks

Transient Performance of PacketScore for blocking DDoS attacks Transient Perforance of PacketScore for blocking DDoS attacks Mooi Choo Chuah 1 Wing Cheong Lau Yoohwan Ki H. Jonathan Chao CSE Deartent Bell Laboratories EECS Deartent ECE Deartent Lehigh Univ. Lucent

More information

Dynamic Price Quotation in a Responsive Supply Chain for One-of-a-K ind Production

Dynamic Price Quotation in a Responsive Supply Chain for One-of-a-K ind Production Dynaic Price Quotation in a Resonsive Suly Chain for One-of-a-K ind Production Jian (Ray) Zhang Deartent of Mechanical and Manufacturing Engineering, University of Calgary, 5 University Drive NW, Calgary,

More information

CLOSED-LOOP SUPPLY CHAIN NETWORK OPTIMIZATION FOR HONG KONG CARTRIDGE RECYCLING INDUSTRY

CLOSED-LOOP SUPPLY CHAIN NETWORK OPTIMIZATION FOR HONG KONG CARTRIDGE RECYCLING INDUSTRY CLOSED-LOOP SUPPLY CHAIN NETWORK OPTIMIZATION FOR HONG KONG CARTRIDGE RECYCLING INDUSTRY Y. T. Chen Departent of Industrial and Systes Engineering Hong Kong Polytechnic University, Hong Kong yongtong.chen@connect.polyu.hk

More information

LAB VIII. LOW FREQUENCY CHARACTERISTICS OF JUNCTION FIELD EFFECT TRANSISTORS

LAB VIII. LOW FREQUENCY CHARACTERISTICS OF JUNCTION FIELD EFFECT TRANSISTORS LAB V. LOW FREQUENCY CHARACTERSTCS OF JUNCTON FELD EFFECT TRANSSTORS 1. OBJECTVE n this lab, you will study the -V characteristics and sall-signal odel of Junction Field Effect Transistors (JFET).. OVERVEW

More information

An Integrated Approach for Monitoring Service Level Parameters of Software-Defined Networking

An Integrated Approach for Monitoring Service Level Parameters of Software-Defined Networking International Journal of Future Generation Counication and Networking Vol. 8, No. 6 (15), pp. 197-4 http://d.doi.org/1.1457/ijfgcn.15.8.6.19 An Integrated Approach for Monitoring Service Level Paraeters

More information

The Application of Bandwidth Optimization Technique in SLA Negotiation Process

The Application of Bandwidth Optimization Technique in SLA Negotiation Process The Application of Bandwidth Optiization Technique in SLA egotiation Process Srecko Krile University of Dubrovnik Departent of Electrical Engineering and Coputing Cira Carica 4, 20000 Dubrovnik, Croatia

More information

An Optimal Task Allocation Model for System Cost Analysis in Heterogeneous Distributed Computing Systems: A Heuristic Approach

An Optimal Task Allocation Model for System Cost Analysis in Heterogeneous Distributed Computing Systems: A Heuristic Approach An Optial Tas Allocation Model for Syste Cost Analysis in Heterogeneous Distributed Coputing Systes: A Heuristic Approach P. K. Yadav Central Building Research Institute, Rooree- 247667, Uttarahand (INDIA)

More information

An Approach to Combating Free-riding in Peer-to-Peer Networks

An Approach to Combating Free-riding in Peer-to-Peer Networks An Approach to Cobating Free-riding in Peer-to-Peer Networks Victor Ponce, Jie Wu, and Xiuqi Li Departent of Coputer Science and Engineering Florida Atlantic University Boca Raton, FL 33431 April 7, 2008

More information

Exploiting Hardware Heterogeneity within the Same Instance Type of Amazon EC2

Exploiting Hardware Heterogeneity within the Same Instance Type of Amazon EC2 Exploiting Hardware Heterogeneity within the Sae Instance Type of Aazon EC2 Zhonghong Ou, Hao Zhuang, Jukka K. Nurinen, Antti Ylä-Jääski, Pan Hui Aalto University, Finland; Deutsch Teleko Laboratories,

More information

A Novel Architecture Style: Diffused Cloud for Virtual Computing Lab

A Novel Architecture Style: Diffused Cloud for Virtual Computing Lab A Novel Architecture Style: Diffused Cloud for Virtual Comuting Lab Deven N. Shah Professor Terna College of Engg. & Technology Nerul, Mumbai Suhada Bhingarar Assistant Professor MIT College of Engg. Paud

More information

Use of extrapolation to forecast the working capital in the mechanical engineering companies

Use of extrapolation to forecast the working capital in the mechanical engineering companies ECONTECHMOD. AN INTERNATIONAL QUARTERLY JOURNAL 2014. Vol. 1. No. 1. 23 28 Use of extrapolation to forecast the working capital in the echanical engineering copanies A. Cherep, Y. Shvets Departent of finance

More information

International Journal of Management & Information Systems First Quarter 2012 Volume 16, Number 1

International Journal of Management & Information Systems First Quarter 2012 Volume 16, Number 1 International Journal of Manageent & Inforation Systes First Quarter 2012 Volue 16, Nuber 1 Proposal And Effectiveness Of A Highly Copelling Direct Mail Method - Establishent And Deployent Of PMOS-DM Hisatoshi

More information

PERFORMANCE METRICS FOR THE IT SERVICES PORTFOLIO

PERFORMANCE METRICS FOR THE IT SERVICES PORTFOLIO Bulletin of the Transilvania University of Braşov Series I: Engineering Sciences Vol. 4 (53) No. - 0 PERFORMANCE METRICS FOR THE IT SERVICES PORTFOLIO V. CAZACU I. SZÉKELY F. SANDU 3 T. BĂLAN Abstract:

More information

Online Bagging and Boosting

Online Bagging and Boosting Abstract Bagging and boosting are two of the ost well-known enseble learning ethods due to their theoretical perforance guarantees and strong experiental results. However, these algoriths have been used

More information

PREDICTION OF POSSIBLE CONGESTIONS IN SLA CREATION PROCESS

PREDICTION OF POSSIBLE CONGESTIONS IN SLA CREATION PROCESS PREDICTIO OF POSSIBLE COGESTIOS I SLA CREATIO PROCESS Srećko Krile University of Dubrovnik Departent of Electrical Engineering and Coputing Cira Carica 4, 20000 Dubrovnik, Croatia Tel +385 20 445-739,

More information

RECURSIVE DYNAMIC PROGRAMMING: HEURISTIC RULES, BOUNDING AND STATE SPACE REDUCTION. Henrik Kure

RECURSIVE DYNAMIC PROGRAMMING: HEURISTIC RULES, BOUNDING AND STATE SPACE REDUCTION. Henrik Kure RECURSIVE DYNAMIC PROGRAMMING: HEURISTIC RULES, BOUNDING AND STATE SPACE REDUCTION Henrik Kure Dina, Danish Inforatics Network In the Agricultural Sciences Royal Veterinary and Agricultural University

More information

Modeling Parallel Applications Performance on Heterogeneous Systems

Modeling Parallel Applications Performance on Heterogeneous Systems Modeling Parallel Applications Perforance on Heterogeneous Systes Jaeela Al-Jaroodi, Nader Mohaed, Hong Jiang and David Swanson Departent of Coputer Science and Engineering University of Nebraska Lincoln

More information

ESTIMATION OF THE DEMAND FOR RESIDENTIAL WATER IN A STONE- GEARY FORM AND THE CHOICE OF THE PRICE VARIABLE MARIE-ESTELLE BINET. Associate Professor

ESTIMATION OF THE DEMAND FOR RESIDENTIAL WATER IN A STONE- GEARY FORM AND THE CHOICE OF THE PRICE VARIABLE MARIE-ESTELLE BINET. Associate Professor ESTIMATION OF THE DEMAND FOR RESIDENTIAL WATER IN A STONE- GEARY FORM AND THE CHOICE OF THE PRICE VARIABLE MARIE-ESTELLE BINET Associate Professor arie-estelle.binet@univ-rennes1.fr CREM (UMR 611 CNRS),

More information

REQUIREMENTS FOR A COMPUTER SCIENCE CURRICULUM EMPHASIZING INFORMATION TECHNOLOGY SUBJECT AREA: CURRICULUM ISSUES

REQUIREMENTS FOR A COMPUTER SCIENCE CURRICULUM EMPHASIZING INFORMATION TECHNOLOGY SUBJECT AREA: CURRICULUM ISSUES REQUIREMENTS FOR A COMPUTER SCIENCE CURRICULUM EMPHASIZING INFORMATION TECHNOLOGY SUBJECT AREA: CURRICULUM ISSUES Charles Reynolds Christopher Fox reynolds @cs.ju.edu fox@cs.ju.edu Departent of Coputer

More information

A Case Study of Bee Algorithm for Ready Mixed Concrete Problem W. Wongthatsanekorn, N. Matheekrieangkrai

A Case Study of Bee Algorithm for Ready Mixed Concrete Problem W. Wongthatsanekorn, N. Matheekrieangkrai A Case Study of ee Algorith for Ready Mixed Concrete Proble W. Wongthatsanekorn, N. Matheekrieangkrai Abstract This research proposes ee Algorith (A) to optiize Ready Mixed Concrete (RMC) truck scheduling

More information

LOAD BALANCING USING ANT COLONY IN CLOUD COMPUTING

LOAD BALANCING USING ANT COLONY IN CLOUD COMPUTING LOAD BALANCING USING ANT COLONY IN CLOUD COMPUTING Ranjan Kumar 1 and G Sahoo 2 1 Deartment of Comuter Science & Engineering, C.I.T Tatisilwai, Ranchi, India 2 Deartment of Information Technology, B.I.T

More information

The AGA Evaluating Model of Customer Loyalty Based on E-commerce Environment

The AGA Evaluating Model of Customer Loyalty Based on E-commerce Environment 6 JOURNAL OF SOFTWARE, VOL. 4, NO. 3, MAY 009 The AGA Evaluating Model of Custoer Loyalty Based on E-coerce Environent Shaoei Yang Econoics and Manageent Departent, North China Electric Power University,

More information

Evaluating Inventory Management Performance: a Preliminary Desk-Simulation Study Based on IOC Model

Evaluating Inventory Management Performance: a Preliminary Desk-Simulation Study Based on IOC Model Evaluating Inventory Manageent Perforance: a Preliinary Desk-Siulation Study Based on IOC Model Flora Bernardel, Roberto Panizzolo, and Davide Martinazzo Abstract The focus of this study is on preliinary

More information

Markov Models and Their Use for Calculations of Important Traffic Parameters of Contact Center

Markov Models and Their Use for Calculations of Important Traffic Parameters of Contact Center Markov Models and Their Use for Calculations of Iportant Traffic Paraeters of Contact Center ERIK CHROMY, JAN DIEZKA, MATEJ KAVACKY Institute of Telecounications Slovak University of Technology Bratislava

More information

A framework for performance monitoring, load balancing, adaptive timeouts and quality of service in digital libraries

A framework for performance monitoring, load balancing, adaptive timeouts and quality of service in digital libraries Int J Digit Libr (2000) 3: 9 35 INTERNATIONAL JOURNAL ON Digital Libraries Springer-Verlag 2000 A fraework for perforance onitoring, load balancing, adaptive tieouts and quality of service in digital libraries

More information

Mathematical Model for Glucose-Insulin Regulatory System of Diabetes Mellitus

Mathematical Model for Glucose-Insulin Regulatory System of Diabetes Mellitus Advances in Applied Matheatical Biosciences. ISSN 8-998 Volue, Nuber (0), pp. 9- International Research Publication House http://www.irphouse.co Matheatical Model for Glucose-Insulin Regulatory Syste of

More information

A Scalable Application Placement Controller for Enterprise Data Centers

A Scalable Application Placement Controller for Enterprise Data Centers W WWW 7 / Track: Perforance and Scalability A Scalable Application Placeent Controller for Enterprise Data Centers Chunqiang Tang, Malgorzata Steinder, Michael Spreitzer, and Giovanni Pacifici IBM T.J.

More information

Machine Learning Applications in Grid Computing

Machine Learning Applications in Grid Computing Machine Learning Applications in Grid Coputing George Cybenko, Guofei Jiang and Daniel Bilar Thayer School of Engineering Dartouth College Hanover, NH 03755, USA gvc@dartouth.edu, guofei.jiang@dartouth.edu

More information

Real Time Target Tracking with Binary Sensor Networks and Parallel Computing

Real Time Target Tracking with Binary Sensor Networks and Parallel Computing Real Tie Target Tracking with Binary Sensor Networks and Parallel Coputing Hong Lin, John Rushing, Sara J. Graves, Steve Tanner, and Evans Criswell Abstract A parallel real tie data fusion and target tracking

More information

Implementation of Active Queue Management in a Combined Input and Output Queued Switch

Implementation of Active Queue Management in a Combined Input and Output Queued Switch pleentation of Active Queue Manageent in a obined nput and Output Queued Switch Bartek Wydrowski and Moshe Zukeran AR Special Research entre for Ultra-Broadband nforation Networks, EEE Departent, The University

More information

CRM FACTORS ASSESSMENT USING ANALYTIC HIERARCHY PROCESS

CRM FACTORS ASSESSMENT USING ANALYTIC HIERARCHY PROCESS 641 CRM FACTORS ASSESSMENT USING ANALYTIC HIERARCHY PROCESS Marketa Zajarosova 1* *Ph.D. VSB - Technical University of Ostrava, THE CZECH REPUBLIC arketa.zajarosova@vsb.cz Abstract Custoer relationship

More information

Load Control for Overloaded MPLS/DiffServ Networks during SLA Negotiation

Load Control for Overloaded MPLS/DiffServ Networks during SLA Negotiation Int J Counications, Network and Syste Sciences, 29, 5, 422-432 doi:14236/ijcns292547 Published Online August 29 (http://wwwscirporg/journal/ijcns/) Load Control for Overloaded MPLS/DiffServ Networks during

More information

Research Article Performance Evaluation of Human Resource Outsourcing in Food Processing Enterprises

Research Article Performance Evaluation of Human Resource Outsourcing in Food Processing Enterprises Advance Journal of Food Science and Technology 9(2): 964-969, 205 ISSN: 2042-4868; e-issn: 2042-4876 205 Maxwell Scientific Publication Corp. Subitted: August 0, 205 Accepted: Septeber 3, 205 Published:

More information

Markovian inventory policy with application to the paper industry

Markovian inventory policy with application to the paper industry Coputers and Cheical Engineering 26 (2002) 1399 1413 www.elsevier.co/locate/copcheeng Markovian inventory policy with application to the paper industry K. Karen Yin a, *, Hu Liu a,1, Neil E. Johnson b,2

More information

TOPIC T3: DIMENSIONAL ANALYSIS AUTUMN 2013

TOPIC T3: DIMENSIONAL ANALYSIS AUTUMN 2013 TOPIC T3: DIMENSIONAL ANALYSIS AUTUMN 013 Objectives (1 Be able to deterine the diensions of hysical quantities in ters of fundaental diensions. ( Understand the Princile of Diensional Hoogeneity and its

More information

Method of supply chain optimization in E-commerce

Method of supply chain optimization in E-commerce MPRA Munich Personal RePEc Archive Method of supply chain optiization in E-coerce Petr Suchánek and Robert Bucki Silesian University - School of Business Adinistration, The College of Inforatics and Manageent

More information

A Hybrid Grey-Game-MCDM Method for ERP Selecting Based on BSC. M. H. Kamfiroozi, 2 A. BonyadiNaeini

A Hybrid Grey-Game-MCDM Method for ERP Selecting Based on BSC. M. H. Kamfiroozi, 2 A. BonyadiNaeini Int. J. Manag. Bus. Res., 3 (1), 13-20, Winter 2013 IAU A Hybrid Grey-Gae-MCDM Method for ERP Selecting Based on BSC 1 M. H. Kafiroozi, 2 A. BonyadiNaeini 1,2 Departent of Industrial Engineering, Iran

More information

Fuzzy Sets in HR Management

Fuzzy Sets in HR Management Acta Polytechnica Hungarica Vol. 8, No. 3, 2011 Fuzzy Sets in HR Manageent Blanka Zeková AXIOM SW, s.r.o., 760 01 Zlín, Czech Republic blanka.zekova@sezna.cz Jana Talašová Faculty of Science, Palacký Univerzity,

More information

Fuzzy Evaluation on Network Security Based on the New Algorithm of Membership Degree Transformation M(1,2,3)

Fuzzy Evaluation on Network Security Based on the New Algorithm of Membership Degree Transformation M(1,2,3) 324 JOURNAL OF NETWORKS, VOL. 4, NO. 5, JULY 29 Fuzzy Evaluation on Networ Security Based on the New Algorith of Mebership Degree Transforation M(,2,3) Hua Jiang School of Econoics and Manageent, Hebei

More information

Option B: Credit Card Processing

Option B: Credit Card Processing Attachent B Option B: Credit Card Processing Request for Proposal Nuber 4404 Z1 Bidders are required coplete all fors provided in this attachent if bidding on Option B: Credit Card Processing. Note: If

More information

Driving Behavior Analysis Based on Vehicle OBD Information and AdaBoost Algorithms

Driving Behavior Analysis Based on Vehicle OBD Information and AdaBoost Algorithms , March 18-20, 2015, Hong Kong Driving Behavior Analysis Based on Vehicle OBD Inforation and AdaBoost Algoriths Shi-Huang Chen, Jeng-Shyang Pan, and Kaixuan Lu Abstract This paper proposes a novel driving

More information

Approximately-Perfect Hashing: Improving Network Throughput through Efficient Off-chip Routing Table Lookup

Approximately-Perfect Hashing: Improving Network Throughput through Efficient Off-chip Routing Table Lookup Approxiately-Perfect ing: Iproving Network Throughput through Efficient Off-chip Routing Table Lookup Zhuo Huang, Jih-Kwon Peir, Shigang Chen Departent of Coputer & Inforation Science & Engineering, University

More information

Design of A Knowledge Based Trouble Call System with Colored Petri Net Models

Design of A Knowledge Based Trouble Call System with Colored Petri Net Models 2005 IEEE/PES Transmission and Distribution Conference & Exhibition: Asia and Pacific Dalian, China Design of A Knowledge Based Trouble Call System with Colored Petri Net Models Hui-Jen Chuang, Chia-Hung

More information

Research on Risk Assessment of PFI Projects Based on Grid-fuzzy Borda Number

Research on Risk Assessment of PFI Projects Based on Grid-fuzzy Borda Number Researc on Risk Assessent of PFI Projects Based on Grid-fuzzy Borda Nuber LI Hailing 1, SHI Bensan 2 1. Scool of Arcitecture and Civil Engineering, Xiua University, Cina, 610039 2. Scool of Econoics and

More information

Near Light Correction for Image Relighting and 3D Shape Recovery

Near Light Correction for Image Relighting and 3D Shape Recovery Near Light Correction for Iage Relighting and 3D Shae Recovery Xiang Huang, Marc Walton, Greg Bearan and Oliver Cossairt Northwestern University, Evanston, IL, USA ANE Iage, Pasadena, CA, USA xianghuang@gailco

More information

Resource Allocation in Wireless Networks with Multiple Relays

Resource Allocation in Wireless Networks with Multiple Relays Resource Allocation in Wireless Networks with Multiple Relays Kağan Bakanoğlu, Stefano Toasin, Elza Erkip Departent of Electrical and Coputer Engineering, Polytechnic Institute of NYU, Brooklyn, NY, 0

More information

Lesson 13: Voltage in a Uniform Field

Lesson 13: Voltage in a Uniform Field Lesson 13: Voltage in a Unifor Field Most of the tie if we are doing experients with electric fields, we use parallel plates to ensure that the field is unifor (the sae everywhere). This carries over to

More information

The Mathematics of Pumping Water

The Mathematics of Pumping Water The Matheatics of Puping Water AECOM Design Build Civil, Mechanical Engineering INTRODUCTION Please observe the conversion of units in calculations throughout this exeplar. In any puping syste, the role

More information

ON SELF-ROUTING IN CLOS CONNECTION NETWORKS. BARRY G. DOUGLASS Electrical Engineering Department Texas A&M University College Station, TX 77843-3128

ON SELF-ROUTING IN CLOS CONNECTION NETWORKS. BARRY G. DOUGLASS Electrical Engineering Department Texas A&M University College Station, TX 77843-3128 ON SELF-ROUTING IN CLOS CONNECTION NETWORKS BARRY G. DOUGLASS Electrical Engineering Departent Texas A&M University College Station, TX 778-8 A. YAVUZ ORUÇ Electrical Engineering Departent and Institute

More information

The Benefit of SMT in the Multi-Core Era: Flexibility towards Degrees of Thread-Level Parallelism

The Benefit of SMT in the Multi-Core Era: Flexibility towards Degrees of Thread-Level Parallelism The enefit of SMT in the Multi-Core Era: Flexibility towards Degrees of Thread-Level Parallelis Stijn Eyeran Lieven Eeckhout Ghent University, elgiu Stijn.Eyeran@elis.UGent.be, Lieven.Eeckhout@elis.UGent.be

More information

Local Area Network Management

Local Area Network Management Technology Guidelines for School Coputer-based Technologies Local Area Network Manageent Local Area Network Manageent Introduction This docuent discusses the tasks associated with anageent of Local Area

More information

An Improved Decision-making Model of Human Resource Outsourcing Based on Internet Collaboration

An Improved Decision-making Model of Human Resource Outsourcing Based on Internet Collaboration International Journal of Hybrid Inforation Technology, pp. 339-350 http://dx.doi.org/10.14257/hit.2016.9.4.28 An Iproved Decision-aking Model of Huan Resource Outsourcing Based on Internet Collaboration

More information

Energy Proportionality for Disk Storage Using Replication

Energy Proportionality for Disk Storage Using Replication Energy Proportionality for Disk Storage Using Replication Jinoh Ki and Doron Rote Lawrence Berkeley National Laboratory University of California, Berkeley, CA 94720 {jinohki,d rote}@lbl.gov Abstract Energy

More information

An Energy Aware Cloud Load Balancing Technique using Dynamic Placement of Virtualized Resources

An Energy Aware Cloud Load Balancing Technique using Dynamic Placement of Virtualized Resources pp 81 86 Krishi Sanskriti Publications http://www.krishisanskriti.org/acsit.html An Energy Aware Cloud Load Balancing Technique using Dynamic Placement of Virtualized Resources Sumita Bose 1, Jitender

More information

Reliability Constrained Packet-sizing for Linear Multi-hop Wireless Networks

Reliability Constrained Packet-sizing for Linear Multi-hop Wireless Networks Reliability Constrained acket-sizing for inear Multi-hop Wireless Networks Ning Wen, and Randall A. Berry Departent of Electrical Engineering and Coputer Science Northwestern University, Evanston, Illinois

More information

Impact of Processing Costs on Service Chain Placement in Network Functions Virtualization

Impact of Processing Costs on Service Chain Placement in Network Functions Virtualization Ipact of Processing Costs on Service Chain Placeent in Network Functions Virtualization Marco Savi, Massio Tornatore, Giacoo Verticale Dipartiento di Elettronica, Inforazione e Bioingegneria, Politecnico

More information

2. FINDING A SOLUTION

2. FINDING A SOLUTION The 7 th Balan Conference on Operational Research BACOR 5 Constanta, May 5, Roania OPTIMAL TIME AND SPACE COMPLEXITY ALGORITHM FOR CONSTRUCTION OF ALL BINARY TREES FROM PRE-ORDER AND POST-ORDER TRAVERSALS

More information

Presentation Safety Legislation and Standards

Presentation Safety Legislation and Standards levels in different discrete levels corresponding for each one to a probability of dangerous failure per hour: > > The table below gives the relationship between the perforance level (PL) and the Safety

More information

AN ALGORITHM FOR REDUCING THE DIMENSION AND SIZE OF A SAMPLE FOR DATA EXPLORATION PROCEDURES

AN ALGORITHM FOR REDUCING THE DIMENSION AND SIZE OF A SAMPLE FOR DATA EXPLORATION PROCEDURES Int. J. Appl. Math. Coput. Sci., 2014, Vol. 24, No. 1, 133 149 DOI: 10.2478/acs-2014-0011 AN ALGORITHM FOR REDUCING THE DIMENSION AND SIZE OF A SAMPLE FOR DATA EXPLORATION PROCEDURES PIOTR KULCZYCKI,,

More information

Design of Model Reference Self Tuning Mechanism for PID like Fuzzy Controller

Design of Model Reference Self Tuning Mechanism for PID like Fuzzy Controller Research Article International Journal of Current Engineering and Technology EISSN 77 46, PISSN 347 56 4 INPRESSCO, All Rights Reserved Available at http://inpressco.co/category/ijcet Design of Model Reference

More information

Load Balancing Mechanism in Agent-based Grid

Load Balancing Mechanism in Agent-based Grid Communications on Advanced Comutational Science with Alications 2016 No. 1 (2016) 57-62 Available online at www.isacs.com/cacsa Volume 2016, Issue 1, Year 2016 Article ID cacsa-00042, 6 Pages doi:10.5899/2016/cacsa-00042

More information

SUPPORTING YOUR HIPAA COMPLIANCE EFFORTS

SUPPORTING YOUR HIPAA COMPLIANCE EFFORTS WHITE PAPER SUPPORTING YOUR HIPAA COMPLIANCE EFFORTS Quanti Solutions. Advancing HIM through Innovation HEALTHCARE SUPPORTING YOUR HIPAA COMPLIANCE EFFORTS Quanti Solutions. Advancing HIM through Innovation

More information

Managing Complex Network Operation with Predictive Analytics

Managing Complex Network Operation with Predictive Analytics Managing Coplex Network Operation with Predictive Analytics Zhenyu Huang, Pak Chung Wong, Patrick Mackey, Yousu Chen, Jian Ma, Kevin Schneider, and Frank L. Greitzer Pacific Northwest National Laboratory

More information

ENERGY EFFICIENT VIRTUAL MACHINE ASSIGNMENT BASED ON ENERGY CONSUMPTION AND RESOURCE UTILIZATION IN CLOUD NETWORK

ENERGY EFFICIENT VIRTUAL MACHINE ASSIGNMENT BASED ON ENERGY CONSUMPTION AND RESOURCE UTILIZATION IN CLOUD NETWORK International Journal of Computer Engineering & Technology (IJCET) Volume 7, Issue 1, Jan-Feb 2016, pp. 45-53, Article ID: IJCET_07_01_006 Available online at http://www.iaeme.com/ijcet/issues.asp?jtype=ijcet&vtype=7&itype=1

More information

Adaptive Modulation and Coding for Unmanned Aerial Vehicle (UAV) Radio Channel

Adaptive Modulation and Coding for Unmanned Aerial Vehicle (UAV) Radio Channel Recent Advances in Counications Adaptive odulation and Coding for Unanned Aerial Vehicle (UAV) Radio Channel Airhossein Fereidountabar,Gian Carlo Cardarilli, Rocco Fazzolari,Luca Di Nunzio Abstract In

More information

Efficient Qos Based Resource Scheduling Using PAPRIKA Method for Cloud Computing

Efficient Qos Based Resource Scheduling Using PAPRIKA Method for Cloud Computing Efficient Qos Based Resource Scheduling Using PAPRIKA Method for Cloud Computing Hilda Lawrance* Post Graduate Scholar Department of Information Technology, Karunya University Coimbatore, Tamilnadu, India

More information

Algorithmica 2001 Springer-Verlag New York Inc.

Algorithmica 2001 Springer-Verlag New York Inc. Algorithica 2001) 30: 101 139 DOI: 101007/s00453-001-0003-0 Algorithica 2001 Springer-Verlag New York Inc Optial Search and One-Way Trading Online Algoriths R El-Yaniv, 1 A Fiat, 2 R M Karp, 3 and G Turpin

More information

Performance Evaluation of Machine Learning Techniques using Software Cost Drivers

Performance Evaluation of Machine Learning Techniques using Software Cost Drivers Perforance Evaluation of Machine Learning Techniques using Software Cost Drivers Manas Gaur Departent of Coputer Engineering, Delhi Technological University Delhi, India ABSTRACT There is a treendous rise

More information

ASIC Design Project Management Supported by Multi Agent Simulation

ASIC Design Project Management Supported by Multi Agent Simulation ASIC Design Project Manageent Supported by Multi Agent Siulation Jana Blaschke, Christian Sebeke, Wolfgang Rosenstiel Abstract The coplexity of Application Specific Integrated Circuits (ASICs) is continuously

More information

Media Adaptation Framework in Biofeedback System for Stroke Patient Rehabilitation

Media Adaptation Framework in Biofeedback System for Stroke Patient Rehabilitation Media Adaptation Fraework in Biofeedback Syste for Stroke Patient Rehabilitation Yinpeng Chen, Weiwei Xu, Hari Sundara, Thanassis Rikakis, Sheng-Min Liu Arts, Media and Engineering Progra Arizona State

More information

An improved TF-IDF approach for text classification *

An improved TF-IDF approach for text classification * Zhang et al. / J Zheiang Univ SCI 2005 6A(1:49-55 49 Journal of Zheiang University SCIECE ISS 1009-3095 http://www.zu.edu.cn/zus E-ail: zus@zu.edu.cn An iproved TF-IDF approach for text classification

More information

Measuring Bottleneck Bandwidth of Targeted Path Segments

Measuring Bottleneck Bandwidth of Targeted Path Segments Measuring Bottleneck Bandwidth of Targeted Path Segents Khaled Harfoush Deartent of Couter Science North Carolina State University Raleigh, NC 27695 harfoush@cs.ncsu.edu Azer Bestavros Couter Science Deartent

More information

Optimal Resource-Constraint Project Scheduling with Overlapping Modes

Optimal Resource-Constraint Project Scheduling with Overlapping Modes Optial Resource-Constraint Proect Scheduling with Overlapping Modes François Berthaut Lucas Grèze Robert Pellerin Nathalie Perrier Adnène Hai February 20 CIRRELT-20-09 Bureaux de Montréal : Bureaux de

More information

Searching strategy for multi-target discovery in wireless networks

Searching strategy for multi-target discovery in wireless networks Searching strategy for ulti-target discovery in wireless networks Zhao Cheng, Wendi B. Heinzelan Departent of Electrical and Coputer Engineering University of Rochester Rochester, NY 467 (585) 75-{878,

More information

INTEGRATED ENVIRONMENT FOR STORING AND HANDLING INFORMATION IN TASKS OF INDUCTIVE MODELLING FOR BUSINESS INTELLIGENCE SYSTEMS

INTEGRATED ENVIRONMENT FOR STORING AND HANDLING INFORMATION IN TASKS OF INDUCTIVE MODELLING FOR BUSINESS INTELLIGENCE SYSTEMS Artificial Intelligence Methods and Techniques for Business and Engineering Applications 210 INTEGRATED ENVIRONMENT FOR STORING AND HANDLING INFORMATION IN TASKS OF INDUCTIVE MODELLING FOR BUSINESS INTELLIGENCE

More information

Capacity of Multiple-Antenna Systems With Both Receiver and Transmitter Channel State Information

Capacity of Multiple-Antenna Systems With Both Receiver and Transmitter Channel State Information IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 49, NO., OCTOBER 23 2697 Capacity of Multiple-Antenna Systes With Both Receiver and Transitter Channel State Inforation Sudharan K. Jayaweera, Student Meber,

More information

Factored Models for Probabilistic Modal Logic

Factored Models for Probabilistic Modal Logic Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence (2008 Factored Models for Probabilistic Modal Logic Afsaneh Shirazi and Eyal Air Coputer Science Departent, University of Illinois

More information

Study on Cloud Computing Resource Scheduling Strategy Based on the Ant Colony Optimization Algorithm

Study on Cloud Computing Resource Scheduling Strategy Based on the Ant Colony Optimization Algorithm www.ijcsi.org 54 Study on Cloud Computing Resource Scheduling Strategy Based on the Ant Colony Optimization Algorithm Linan Zhu 1, Qingshui Li 2, and Lingna He 3 1 College of Mechanical Engineering, Zhejiang

More information

BeoSound 9000. Reference book

BeoSound 9000. Reference book BeoSound 9000 Reference book CAUTION: To reduce the risk of electric shock, do not reove cover (or back). No User-serviceable arts inside. Refer servicing to qualified service ersonnel. WARNING: To revent

More information

Quality evaluation of the model-based forecasts of implied volatility index

Quality evaluation of the model-based forecasts of implied volatility index Quality evaluation of the odel-based forecasts of iplied volatility index Katarzyna Łęczycka 1 Abstract Influence of volatility on financial arket forecasts is very high. It appears as a specific factor

More information

Exploring Resource Provisioning Cost Models in Cloud Computing

Exploring Resource Provisioning Cost Models in Cloud Computing Exploring Resource Provisioning Cost Models in Cloud Computing P.Aradhya #1, K.Shivaranjani *2 #1 M.Tech, CSE, SR Engineering College, Warangal, Andhra Pradesh, India # Assistant Professor, Department

More information

A Fast Algorithm for Online Placement and Reorganization of Replicated Data

A Fast Algorithm for Online Placement and Reorganization of Replicated Data A Fast Algorith for Online Placeent and Reorganization of Replicated Data R. J. Honicky Storage Systes Research Center University of California, Santa Cruz Ethan L. Miller Storage Systes Research Center

More information

International Journal of Computer Science Trends and Technology (IJCST) Volume 3 Issue 3, May-June 2015

International Journal of Computer Science Trends and Technology (IJCST) Volume 3 Issue 3, May-June 2015 RESEARCH ARTICLE OPEN ACCESS Ensuring Reliability and High Availability in Cloud by Employing a Fault Tolerance Enabled Load Balancing Algorithm G.Gayathri [1], N.Prabakaran [2] Department of Computer

More information

This paper studies a rental firm that offers reusable products to price- and quality-of-service sensitive

This paper studies a rental firm that offers reusable products to price- and quality-of-service sensitive MANUFACTURING & SERVICE OPERATIONS MANAGEMENT Vol., No. 3, Suer 28, pp. 429 447 issn 523-464 eissn 526-5498 8 3 429 infors doi.287/so.7.8 28 INFORMS INFORMS holds copyright to this article and distributed

More information