SLA Aware Cost based Service Ranking in Cloud Computing
|
|
|
- Margaret Rice
- 10 years ago
- Views:
Transcription
1 SLA Aware Cost based Service Ranking in Cloud Computing Princy Bathla 1, Sahil Vashist 2 1 M.Tech Student, Department of Computer Science, CEC, Landran.Punjab(India) 2 Assisatant Professor, Department of Computer Science, CEC, Landran.Punjab(India) ABSTRACT Cloud Computing is very powerful tool for different service providers to implement their services. Various companies are working to possible exploration to find the best cloud to implement their services. Not only finding the best cloud but detection and analyzing of best service is also a high trend. Therefore this works examines ranking of the services with keeping cost as important parameters. We explore the latency of the user s requests and finally schedule the requests with best possible combinations. Therefore in this work we evaluate the cost of the service as parameter to find the best available service among equals taking into other parameters like processing time, latency, suitability, reliability. Keywords: Cloud Computing, QoS, SLA, Ranking,Services 1. INTRODUCTION The field attracting most of organizations is Cloud Computing (CC) and has created a buzz in the world by expanding its services in no time. Companies like Google, Microsoft are the main providers of services nowadays. Every organization is trying to expand itself and get benefits of emerging Cloud computing [1]. Different service models of Cloud Computing offers different services. Infrastructure as a Service provides services like storage, Ram etc. Platform as a service provides a platform such as operating systems to user for deployment[8]. Software as a service model provides user with software on a single machine instead of installing on every user machine [2]. Nowadays, many service providers are there and it is difficult to choose the best available one. Due to lack of standardization of computing services it makes it more difficult to choose, as different service providers uses different formats, protocols, technologies [7]. These factors make it difficult to migrate from one service to another. There are various examples of services in cloud computing which provide the efficient way to the best possible service to the users. The different ways to evaluate a cloud provider can be based on performance, price, services, security. 1.1 SLA Service level agreement refers to a contract that is between a customer and a provider. This is a legal contract, which contains type of service to be delivered, time, price, performance, warranties, termination and penalty to be paid if there is a violation in the SLA [3]. Every service level agreement flows through a queue of steps called SLA life cycle. Life cycle of service level agreement has following stages: Contract Definition In the initial phase of SLA,provider of cloud service defines a list of services to be offered and equivalent SLAs using traditional templates. The offerings of provider are presented in a catalog and individuals can customize SLAs by customization of the base templates. Publication and Discovery Different service providers adopt the method of publication media to advertise their services so that the customer can find the provider and locate in order to avail the services via catalog searching. Customers can shortlist few services according to basis of the provider fulfilling their requirement [16]. Negotiation When customer has found out the provider who provides services to host applications which are required by customer and the terms and conditions written in the service level agreement are commonly agreed upon before signing the document of agreement. The services which are the standard application of provider generally has automated phase.there is a need to consider application s conduct while considering performance and scalability before signing the SLA. In the last step of negotiation phase, the Service Level Agreement is mutually signed by provider and the customer. This phase uses the WS-negotiation specification[16]. Operationalization Service level agreement operation consists of monitoring, accounting and enforcement. Parameter values are measured and metrics are calculated according to what is defined in service level agreement is done in Service level agreement monitoring phase and deviations are determined. Concerned parties are informed when deviations are identified. Accounting of service level agreement is concerned with archiving the service level agreement for compliance. In Volume 3, Issue 7, July 2014 Page 257
2 accounting, actual performance as compared to that was guaranteed in Service Level agreement for application is reported. If there is any SLA violation then information regarding penalities to be paid should be mentioned except breaches in frequency and duration. Appropriate actions should be taken when SLA violation is detected at run time monitoring. Policies that are different can be expressed using a subset of Common Information Model (CIM) [4][16]. De-commissioning All activities are terminated which perform under a particular Service level agreement while relationship ends which is hosted in between service provider and consumer. Terms and conditions for termination of contract are specified in SLA and conditions under which relation will be terminated by provider and consumer be ended legally is specified [16]. 1.2 Ranking Ranking can be defined as categorizing and assigning weight to some choices. Ranking is a new concept in Cloud Computing field which attracts the attention of users. Ranking of services in cloud computing is a different concept from other fields as in this field is due to existing infrastructure. The infrastructure is connected through Internet to different components that are having a different connection speeds [6]. This leads to the different level of QoS received by users for same service. Therefore a framework is required to rank services such that different users can get service according to the QoS. Ranking needs to done in order to select the best possible service which is effective and efficient. Quality of service parameters are used by companies in order to rank the different services, and customer can select the service by comparing the rank of the different services. Also, it is needed to consider following items for ranking of selected services [6]. 1) Which attributes should be selected for ranking? 2) How the value of each attributes is determined? 3) Which algorithm should be applied for ranking? 4) How to get the received result? How to present them to the user? The different approaches used for ranking of cloud services are described below: Service Mapper Approach Service Mapper uses the technique Singular Value Decomposition, which is used for ranking of cloud services in a statistical way. This approach uses a mapping technique to map services through a service mapper which is known as a Cloud service provider mapper for ranking services. The layers of mapper are divided into three as shown in the Figure 1.1. The layer at the lowest level is known as information gathering layer whose main responsibility is to collect information from a service provider and attributes represented by different providers. This layer gets requirement from the user and finds out the services which are capable of satisfying them. Through information collected by this layer, services are passed to the layer above it and the layer is known as applied SVD. Figure 1.1 Architecture of Service Mapper Approach[11] The second layer is responsible for making a matrix, Provider Quality. In the matrix rows are filled with the provider s information. The columns are filled with the qualitative attributes of providers. This layer applies Singular Value Decomposition technique on the matrix. After this, three singular values are extracted from the matrix and this is sent to the third layer. This layer receives singular values and qualitative values of user requirements. After this it is capable of selecting the best service among the services selected by first layer. After this, the application of user is mapped to the selected service. Advantage of Service Mapper approach is the appliance of Singular Value Decomposition. This technique helps in bringing together the service providers according to the user requirements. It makes really easy to select the optimal service. Though its has some limitation too. In the last phase, only one service is selected according to Volume 3, Issue 7, July 2014 Page 258
3 the requirements of the user. On the other hand, the ranking of all services is a better option. This provides the user with knowledge about priority of the services and selects a service more knowingly. But this technique doesn t take into consideration all qualitative attributes of a service and comparison of services is based on few attributes only. SVD technique is time consuming for large matrixes and therefore is sometimes infeasible. Therefore it may not give correct results. Also this technique can be used only when the cloud service providers are few and measures for comparison are limited.[11] SRS Approach The service ranking system is used in SRS approach. Two states of cloud service ranking are taken into consideration in this approach that is the static state and the dynamic state. Cloud providers are ranked in a static state without considering the needs of the users. The services are searched and ranked according to the requirements of the user in the dynamic state. For service comparison and ranking seven key attributes are used. These attributes are used for comparison. The main attributes are availability, throughput, cost, response time, security, reliability and user feedback. The phases of dynamic ranking of cloud services are as follows: The very first phase involves presenting the key attributes to the user. Then the user is made to specify the attributes. The next phase involves the selection of services that give the information about user requirements and for measuring the qualitative values of attributes by service monitoring. The third phase involves the user is made to enter the attributes in weight format. The weight of attributes entered should be equal to one. The last phase services are ranked and are represented with the help of formulas according to the weights entered by the user. The formula is used to multiply the weights with the value of each attribute. After this the numbers which are calculated are sorted and are presented in the form of ranking result. The other state that is the static state includes only the second and the fourth phases which are performed. The second phase in this involves the qualitative value of all services and are measured without taking into consideration the requirements of the user. But, it is good to have a component for searching all available services and maintaining the information based on the approach s assumption, before performing the ranking process. The main advantage of this approach is that the attributes which are important are used in the form of weights. The ranking of static and dynamic states is possible through this approach. The ranking of all services is obtained with the execution of this technique. The limitation of this algorithm is that this approach is not suitable for finding the rank of dynamic state as the comparison is performed on the basis of seven attributes. Also, forcing the user to enter the weights is a major drawback of this approach as weight should not increase the total of 1, in case this condition is not fulfilled, then the user will not be able to obtain the correct results [11] SLA Matching Approach The SLA matching approach tends to define the process of identifying the service provided by matching against the parameters written in the Service Level Agreement. There are four steps involved in this approach: The first one is to define the cloud model RDF file which is known as Model C which contains resources of cloud, properties, resource quantity, etc. and a requirement model called ModelR that contains application s required resources and its quantity. The next step is to convert the models into the graphs. These RDF models are converted to graphs with the help of Jena APIs. The next step is to find Pairwise Connectivity Graph (PCG) and Induced Propagation Graph is calculated using this PCG equation.the last step is to find the initial mapping between two models using RDF Schema. For initial mapping nodes of two models are compared as if they are of a subclass, super class or equivalence in the RDF Schema file [11] Aggregation Approach In the aggregation approach benchmarks are used. User feedback is applied for ranking of services. The aggregation approach gets information of two types from the user and benchmark and aggregates them for the purpose of comparing and ranking the services. Objective assessment is the information received from the benchmark and subjective assessment is the other information. The architecture used for ranking of services is as depicted in the Figure 1.2. Figure 1.2: Architecture of Aggregation Approach[11] The lower part of the architecture is known as cloud selection service. Some services are selected which gives information about the requirements of user without taking into account the qualitative values. Then this information is sent to the other two sections that is the benchmark testing service and user feedback management service. Analysis and test services Volume 3, Issue 7, July 2014 Page 259
4 are performed in the benchmark testing service section. After that qualitative values are obtained via benchmarks. User requirements are received in the User feedback management service and it also try for producing a series of fuzzy numbers for qualitative measures by applying fuzzy method. User feedback and requirements are given in the language of the user. This information is transformed into scientific and comparable data only with the help of fuzzy method. The information on these sections is sent to the assessment aggregation section which selects services required by user by receiving performed assessments. Usage of benchmarks and feedback from users is the strong point of this approach and straightforward approach for performing ranking. The weakness of aggregation approach is that comparison and ranking of services is done with the limited qualitative measures [11] CloudRank Approach CloudRank approach ranking of services is based on prediction of qualitative values. This approach suggests that the qualitative value of services should be measured before service comparison. In traditional methods which are based on components, calling the components was applied for measuring the values. But the process of calling is not possible in the cloud environment as it involves time and cost complexity. Internet s unpredictable speed will not allow getting correct results by calling. The calling in cloud computing and each client-server environment can be performed in two different places, that is, one at Service provider side and another on the client side. Good values for qualitative measures are usually received at the service provider side. The values are very much near to the values which the provider claimed to offer. Fewer values are achieved in the case of calling on the user side as the speed of internet connection is hard to predict and also the physical distance between the user and provider is large. The qualitative values from different users will be different. So the better way to get the real picture is the calling of service at the client site. Based on this the calling of services in the cloud environment which is impossible and need to be performed in different way. This approach exploited from personalized services in calling service model. The CloudRank approach applies qualitative value of service prediction in client-side. Whenever user demands for ranking of services the system selects the similar users for which ranking was done in past. The system with the help of past experience applies the ranking process for new user. Figure 1.3 depicts the architecture of the CloudRank framework. The active user is the one who is requesting for ranking of service from the system. The CloudRank architecture has three main components. The database contains information about users and the ranking done in the past by the users. This information about the user is known as train data and the user as train user. Different components of the system perform different tasks. The similarity computation component is responsible for calculation of similarity between all the active users according to the comparison done with the train user. The other component is responsible for separating and classifying similar users based on the calculated similarity value. The third component performs the ranking by applying two algorithms on similar users and presents the result to the user. The strong point of CloudRank approach is that it considers different received qualitative values for the user. Furthermore, all services are ranked only in a single execution. The negative side of this approach is that it depends upon the train data. In case the data present in the database is wrong then the ranking will be done according to the wrong data and also it does not consider all the qualitative values for the comparison process[11]. FIGURE 1.3: ARCHITECTURE OF CLOUDRANK[11] 2. RELATED WORK Buyya et al.(2009)[7] proposed a detailed information about the different brokers. Different infrastructure available is provided as a list to the brokers and the amount of processing power required. Also the consumers require faster response time which are at far places and when requests are distributed to multiple Clouds at different places at same time helps in saving time. Volume 3, Issue 7, July 2014 Page 260
5 Computing atmosphere is required for interconnecting and provisioning clouds dynamically through number of domains within and outside enterprises. Garg et.al (2012) [9] proposed framework in which different cloud providers are compared which can satisfy Service level agreement. Proposed framework SMICloud helps customer in selecting the best provider for services according to the number of dimensions like suitability, security, interoperability, sustainability, reliability. Proposed system solves many problems in existence that is how SMI attributes are measured, how services are ranked according to the attributes. It also proposed AHP system for ranking providers according to Quality of service requirements. Ostermann et al.(2010) [10] proposed performance metrics which uses benchmarks. In proposed work,based on type of instance,efficiency is defined and used for a real virtual cluster as ratio between benchmark performance and real environment performance formed with only one instance of same type in terms of percentage. Li et al.(2010) [11] proposed CloudCmp that helps in comparing performance and cost of services provided by Cloud service providers. Proposed system measures networking services, persistent storage and elastic computing along with the metrics that linear reflects impact on customer application s performance. Popular cloud providers are compared in the paper that stated the difference in the performance of and costs. Proposed system helps customer in choosing the provider that best fits their requirement. Bawa et al. (2011)[12] proposed formulas for ranking jobs and according to the rank of job obtained, job with higher rank is send to the scheduler for further processing. The resource which has higher rank is given the high priority over the jobs which has low rank. The scheduler used for scheduling resources according to rank uses a straight forward technique of match making algorithm. The usual scheduler is not concerned about the service history but only is concerned about usage score. The criteria that is followed is that the resource with higher usage score is chosen again and again over the other with low usage score. This leads to attitude of ignorance towards success rate, affordability, bandwidth as it does not consider past service history. This results in low quality resources and user disappointment. In order to rank resources factors like past history of service, bandwidth, feedback, affordability needs to be given due considerations. In the proposed work if any resource fails to fulfill the rank criteria, it falls quickly and reaches the point of lower trust and will not be chosen by users thereafter. Simarro et al. (2012)[13] proposes a cloud architecture suitable for different cloud environments. Proposed architecture acts a management software for cloud for scheduling of services according to different criteria like optimization of performance or cost, or can be based on user constraints like cost, performance etc or can be environmental conditions like dynamic or static. This proposed work provided architecture to help users in distributing services among the clouds transparently that are present. Cloud scheduler of the presented architecture helps in decision making based on user demands available dynamically, dynamic cost schemes. The proposed work demonstrates the profits while deploying services on a different environment under different conditions. Xiong et al.(2009)[14] proposed criteria for evaluating the performance of service in cloud computing. In particular, in order to deliver Quality of service that are guaranteed, relation is established between maximum number of customers, minimum resources required by service and the highest point of service. In the paper, relation between level of QoS services guaranteed and service resources is given, also number of customers and relation between services required is stated, moreover it states service resources and number of customers who can be efficiently provided the service. A queuing network model is proposed for evaluating the computer service s performance and developed an estimation technique for computing response time distribution of Laplace transform in cloud computing. The output provides help in designing new computing paradigms. The following Section 3 explains the system model of our proposed framework followed by Experimental Setup in Section 4 and we finally concludes and present future work in Section METHODOLOGY We implement our proposed algorithm on a NetBeans IDE 8.0 with a CloudSim as a simulator to simulate the results. We proposed an algorithm that with cost function as prime parameter which is compared with non-cost based algorithm and the overall efficiency of the cloud services is find out. We tried to evaluate the number of requests which are failed to get processed under a desired cost. Costing in cloud computing are essential parameter in scheduling requests and the some of the existing rank based technique ignoring this fact. In this algorithm we are trying to make groups of the requests according to the rank of each of the service and cost the service offering as shown in Figure 1. Volume 3, Issue 7, July 2014 Page 261
6 3.1 Flow chart of proposed work. Figure 2 depicts the flowchart of the proposed work. Figure 1: Schematic Framework Figure 2. Flowchart of Proposed Work 3.2 Parameters Parameters that are used are Latency, Suitability, Reliability, Cost that are defined as follows: Latency Latency can be defined as the total time taken by the request to reach the virtual machine and to respond back to the user. LATENCY=Time taken from user request to reach cloud virtual machine+ time taken from cloud virtual machine back to user. Volume 3, Issue 7, July 2014 Page 262
7 3.2.2 Reliability It depicts how a service operates without failure during a given time and condition. Therefore it is defined based on the mean time to failure promised by the cloud provider and previous failures experienced by the users. It is measured by: Reliability=probability of violation* Where numfailure is the number of users who encountered a failure in time interval less than promised by the Cloud provider, n is the number of users, and is the promised mean time to failure.[9] Reliability of storage can be defined in terms of durability, that is the chance of failure of a storage device Suitability It is defined upto which the requirements of user are fulfilled by cloud provider. In case there are a number of providers who can fulfill both essential requirements and non essential requirements, then any provider can be selected as all are suitable. In another case if there is no provider who can fulfill both essential and non essential requirements, then a provider who fulfills essential requirements is selected. Therefore in the second case, suitability is the extend to which services match up with user requirements.[9] If only essential requirements are fulfilled = 1 if all requirements are fulfilled. = 0 otherwise Cost Cost is the main parameter which is used by customers to compare the different service providers. As different providers offer virtual machines at different cost. So the cost can be evaluated as Cost = (Total number of Virtual Machines Cost per Virtual Machine) + (Power usage per Virtual Machine Total number of Virtual Machine). 3.3 Proposed Algorithm 4.. EXPERIMENTAL SETUP AND RESULTS To implement our proposed algorithm we use cloudsim as simulator. In this case we have assumed 5 services and each service are hosted in a virtual machine. Therefore there are 5 different virtual machines having different configuration as shown in Table 1: Hence these configurations represent the service capabilities to response users requests (cloudlets). We generate three types of Cloudlets (requests) which sends to broker for execution as shown in Table 2. Volume 3, Issue 7, July 2014 Page 263
8 4.1 SLA violations by each service In this case we randomly sends requests to each of the service and each service behavior is noticed as shown in Figure 3. Here we can observe that each service is behaving differently if we see the SLA violations. Hence from the Figure 3 we can conclude that the number of MIPS and CPU cores is directly related to the SLA violations of the system. Figure 4,5,6,7,8 shows the individual service response time of the services located in a different datacenter. Therefore in these figure we can evaluate the service behavior located in different geographical location have significant impact on the behavior of the service. Therefore in this experiment we have separately identified the behavior of the service on the basis of SLA violations and latency. Figure 3 shows SLA violations and that depicts that Service 4 has maximum number of violations and for Service 5 is least. Service 5 is capable of fulfilling the service requests with the least amount of violations. Figure 3: SLA violations by each service 250 LATENCY for Service 1 in ms LATENCY 50 0 LC1 LC2 LC3 LC4 LC5 Figure 4: Latency of Service 1 from different Locations Figure 4.shows the latency of service 1 at five different locations that is LC1, LC2, LC3, LC4, LC5. The latency for Service 1 at LC1 is least and for the LC5 it is maximum that is around 230ms Volume 3, Issue 7, July 2014 Page 264
9 Latency for Service 2 in ms LC1 LC2 LC3 LC4 LC5 Late Figure 5: Latency of Service 2 from different Locations Figure 5 shows the latency of service 2 at five different locations that is LC1, LC2, LC3, LC4, LC5. The latency for Service 2 at LC1 is around 230 ms and for the LC2 it is maximum that is around 240ms. Least latency is for LC3 that is 120ms, with a slight increase for LC Latency for Service 3 in ms LATENCY 50 0 LC1 LC2 LC3 LC4 LC5 Figure 6: Latency of Service 3 from different Locations Figure 6 shows shows the latency of service 3 at five different locations that is LC1, LC2, LC3, LC4, LC5. The latency for Service 1 at LC1 is least which a slight increase for LC2 and then again falls for LC3 at 132ms, after that rise of approximately 13 ms and for the LC5 it is maximum that is around 210ms. Figure 7: Latency of Service 4 from different Locations Figure 7 shows the latency of service 4 at five different locations that is LC1, LC2, LC3, LC4, LC5. The latency for Service 4 at LC1 is least that is around 123ms and for the LC3 and LC5 it is around 143ms. Volume 3, Issue 7, July 2014 Page 265
10 250 Latency for Service 5 in ms Latency 50 0 LC1 LC2 LC3 LC4 LC5 Figure 8: Latency of Service 5 from different Locations Figure 8 shows the latency of service 5 at five different locations that is LC1, LC2, LC3, LC4, LC5. The latency for Service 5 at LC1 is least and for the LC3 it is maximum that is 230ms. Till LC3, latency increases, but after LC3 it decreases. The Table 4.5 depicts the location and Latency of different services in ms in a tabular form. Table 4.5: Latency of Service vs Location 4.2 Number of Requests failed by Ranking of Service without cost vs ranking of service with cost. In this experiment we took the existing techniques with the addition of the cost factor and find out how cost based ranking is effective when we see the overall functioning of the services. In the Figure 9 we can observe that the failure of the requests is high with base algorithm (non-cost based). This is due to the fact that base algorithm has only the limited capability to find the best ranked service, but this will lead to overloading of that particular service as all the service requests would go towards that service only irrespective of the cost. If that service is offering higher cost than all the service requests with low cost necessity have to pay higher cost hence lead to requests drop. Therefore ranking of the service with cost as deciding parameters have very low requests drops. Volume 3, Issue 7, July 2014 Page 266
11 Figure 9: Number of Requests failed by Ranking of Service without cost vs ranking of service with cost. 5. CONCLUSION In this paper we evolved the different factors like latency and cost of the service. It is evident for the services provider to develop a system which evaluates the service and provides the detailed information of the consequences when a lot of varieties of services are presents. The feedback system would be the future step for this work. This feedback will be provided by the users of the service as a parameter for further allocation of that service to the users. REFERENCES [1] Vashist. Sahil, Singh. Rajwinder Energy Cost and QoS based management of Data Centers Resources in Cloud Computing International Journal of Computer Science & Engineering Technology (IJCSET) ISSN : Vol. 4 No. 06 Jun 2013 [2] Gupta. Ankur, Kapoor. Lohit, Wattal. Manisha C2C (Cloud-to-Cloud): An Ecosystem of Cloud Service Providers for Dynamic Resource Provisioning DOI / _49 Print ISBN Online ISBN [3]. Web Services Agreement Specification (WS Agreement), Public_Comment_Docs/Documents/Oct2006/WSAgreementSpecificationDraftFinal_sp_tn_jpver_v2.pdf, accessed on April 16, [4] Common Information Model (CIM) Standards, DMTF standard version , March 2010, accessed on April 16, [5] Celesti. Antonio, Tusa. Francesco, Villari. Massimo and Puliafito. Antonio Improving Virtual Machine Migration in Federated Cloud Environments 2010 Second International Conference on Evolving Internet 2010 IEEE DOI /INTERNET [6] Zhu. Zhiliang, Bi. Jing, Yuan. Haitao, Chen.Ying SLA Based Dynamic Virtualized Resources Provisioning for Shared Cloud Data Centers 2011 IEEE 4th International Conference on Cloud Computing [7] Buyya.Rajkumar, Yeo. Chee Shin, Venugopal. Srikumar, Broberg. James, and Brandic.Ivona Cloud Computing and Emerging IT Platforms: Vision, Hype, and Reality for Delivering Computing as the 5th Utility 2008 elsevier. Doi: /j.future [8] Bathla. Princy, Vashist.Sahil, Singh.Rajwinder, Singh. Gagandeep A Sophisticated Review of the Job Scheduling methods on Cloud Network International Journal of Latest Scientific Research and Technology (IJLSRT) Volume1 Issue 1 (April 2014) ISSN : [9] Garg.Saurabh Kumar, Versteeg.Steve, Buyya. Rajkumar A framework for ranking of cloud computing services doi: /j.future [10] Ostermann.Simon, Iosup. Alexandru, Yigitbasi. Nezih, Prodan. Radu, Fahringer.Thomas and Eperna.Dick A Performance Analysis of EC2 Cloud Computing Services for Scientific Computing Cloudcomp 2009, LNICST 34, pp , Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering 2010 [11] Li.Ang, Yang.Xiaowei, Kandula. Srikanth, Zhang. Ming CloudCmp: Comparing Public Cloud Providers IMC 10, November 1 3, 2010, Melbourne, Australia ACM /10/11 [12] Bawa.Rajesh Kumar, Sharma. Gaurav Ranking Based Resource Selection in Grid Environment TECHNIA International Journal of Computing Science and Communication Technologies, VOL. 4, NO. 1, July (ISSN ) [13] Simarro. J.L. Lucas, Vozmediano. Rafael Moreno, Montero.R.S,Llorente.I.M Scheduling strategies for optimal service deployment across multiple clouds doi: /j.future [14] Xiong.Kaiqi and Perros.Harry Service Performance and Analysis in Cloud Computing INSPEC Accession Number: E-ISBN : (IEEE) Print ISBN: (conference date 6-10 July 2009) DOI: /SERVICES-I Volume 3, Issue 7, July 2014 Page 267
12 [15] Kapoor.Lohit,Bawa.Seema,Gupta. Ankur Hierarchical Chord-Based Resource Discovery in Intercloud Environment ISBN: doi> /ucc [16] Buyya.Rajkumar,Broberg.James,Goscinski.Andrzej CLOUD COMPUTING Principles and Paradigm ISBN (hardback) [17] 6 Chauhan.Tejas, Chaudhary.Sanjay, Kumar.Vikas, Bhise.Minal Service Level Agreement parameter matching in Cloud Computing /11/ 2011 IEEE 2011 World Congress on Information and Communication Technologies. [18] Bathla. Princy, Vashist.Sahil A Sophisticated Study of QoS Ranking Frameworks in Cloud Computing International Journal of Advanced Research in Computer Science and Software Engineering Volume 4, Issue 7, July 2014 ISSN: X AUTHOR Princy Bathla received the B.Tech(CSE) from Doaba Institute Of Engineering and Technology,Kharar,Punjab,India in 2012 and is pursuing M.Tech (CSE) from Chandigarh College of Engineering, Landran,Punjab.India.Area of interest are Cloud computing,big data, Hadoop Volume 3, Issue 7, July 2014 Page 268
SMICloud: A Framework for Comparing and Ranking Cloud Services
2011 Fourth IEEE International Conference on Utility and Cloud Computing SMICloud: A Framework for Comparing and Ranking Cloud Services Saurabh Kumar Garg, Steve Versteeg and Rajkumar Buyya Cloud Computing
Cloud deployment model and cost analysis in Multicloud
IOSR Journal of Electronics and Communication Engineering (IOSR-JECE) ISSN: 2278-2834, ISBN: 2278-8735. Volume 4, Issue 3 (Nov-Dec. 2012), PP 25-31 Cloud deployment model and cost analysis in Multicloud
A Cloud Service Measure Index Framework to Evaluate Efficient Candidate with Ranked Technology
A Cloud Service Measure Index Framework to Evaluate Efficient Candidate with Ranked Technology Shruthi Shirur 1, Annappa Swamy D. R. 2 1 M. Tech, CSE Department, Mangalore Institute of Technology & Engineering
Performance Gathering and Implementing Portability on Cloud Storage Data
International Journal of Information & Computation Technology. ISSN 0974-2239 Volume 4, Number 17 (2014), pp. 1815-1823 International Research Publications House http://www. irphouse.com Performance Gathering
Keywords: Cloudsim, MIPS, Gridlet, Virtual machine, Data center, Simulation, SaaS, PaaS, IaaS, VM. Introduction
Vol. 3 Issue 1, January-2014, pp: (1-5), Impact Factor: 1.252, Available online at: www.erpublications.com Performance evaluation of cloud application with constant data center configuration and variable
DESIGN OF AGENT BASED SYSTEM FOR MONITORING AND CONTROLLING SLA IN CLOUD ENVIRONMENT
International Journal of Advanced Technology in Engineering and Science www.ijates.com DESIGN OF AGENT BASED SYSTEM FOR MONITORING AND CONTROLLING SLA IN CLOUD ENVIRONMENT Sarwan Singh 1, Manish Arora
An Effective Approach To Find a Best Cloud Service Provider Using Ranked Voting Method
An Effective Approach To Find a Best Cloud Service Provider Using Ranked Voting Method Vidyashree C.N M.Tech, Dept of CSE PESCE, Mandya [email protected] V Chetan Kumar Asst.Prof, Dept of CSE PESCE,
K.Niha, Dr. W.Aisha Banu, Ruby Anette
International Journal of Scientific & Engineering Research, Volume 6, Issue 4, April-2015 41 A Cloud Service Providers Ranking System Using Ontology K.Niha, Dr. W.Aisha Banu, Ruby Anette Abstract Cloud
RANKING THE CLOUD SERVICES BASED ON QOS PARAMETERS
RANKING THE CLOUD SERVICES BASED ON QOS PARAMETERS M. Geetha 1, K. K. Kanagamathanmohan 2, Dr. C. Kumar Charlie Paul 3 Department of Computer Science, Anna University Chennai. A.S.L Paul s College of Engineering
Future Generation Computer Systems
Future Generation Computer Systems 29 (2013) 1012 1023 Contents lists available at SciVerse ScienceDirect Future Generation Computer Systems journal homepage: www.elsevier.com/locate/fgcs A framework for
PERFORMANCE ANALYSIS OF PaaS CLOUD COMPUTING SYSTEM
PERFORMANCE ANALYSIS OF PaaS CLOUD COMPUTING SYSTEM Akmal Basha 1 Krishna Sagar 2 1 PG Student,Department of Computer Science and Engineering, Madanapalle Institute of Technology & Science, India. 2 Associate
Profit Based Data Center Service Broker Policy for Cloud Resource Provisioning
I J E E E C International Journal of Electrical, Electronics ISSN No. (Online): 2277-2626 and Computer Engineering 5(1): 54-60(2016) Profit Based Data Center Service Broker Policy for Cloud Resource Provisioning
Heterogeneous Workload Consolidation for Efficient Management of Data Centers in Cloud Computing
Heterogeneous Workload Consolidation for Efficient Management of Data Centers in Cloud Computing Deep Mann ME (Software Engineering) Computer Science and Engineering Department Thapar University Patiala-147004
A Comparative Study of Load Balancing Algorithms in Cloud Computing
A Comparative Study of Load Balancing Algorithms in Cloud Computing Reena Panwar M.Tech CSE Scholar Department of CSE, Galgotias College of Engineering and Technology, Greater Noida, India Bhawna Mallick,
Performance Evaluation of Round Robin Algorithm in Cloud Environment
Performance Evaluation of Round Robin Algorithm in Cloud Environment Asha M L 1 Neethu Myshri R 2 Sowmyashree C.S 3 1,3 AP, Dept. of CSE, SVCE, Bangalore. 2 M.E(dept. of CSE) Student, UVCE, Bangalore.
A Proposed Framework for Ranking and Reservation of Cloud Services Based on Quality of Service
II,III A Proposed Framework for Ranking and Reservation of Cloud Services Based on Quality of Service I Samir.m.zaid, II Hazem.m.elbakry, III Islam.m.abdelhady I Dept. of Geology, Faculty of Sciences,
SERVICE BROKER ROUTING POLICES IN CLOUD ENVIRONMENT: A SURVEY
SERVICE BROKER ROUTING POLICES IN CLOUD ENVIRONMENT: A SURVEY Rekha P M 1 and M Dakshayini 2 1 Department of Information Science & Engineering, VTU, JSS academy of technical Education, Bangalore, Karnataka
SLA BASED SERVICE BROKERING IN INTERCLOUD ENVIRONMENTS
SLA BASED SERVICE BROKERING IN INTERCLOUD ENVIRONMENTS Foued Jrad, Jie Tao and Achim Streit Steinbuch Centre for Computing, Karlsruhe Institute of Technology, Karlsruhe, Germany {foued.jrad, jie.tao, achim.streit}@kit.edu
Cloud Computing Simulation Using CloudSim
Cloud Computing Simulation Using CloudSim Ranjan Kumar #1, G.Sahoo *2 # Assistant Professor, Computer Science & Engineering, Ranchi University, India Professor & Head, Information Technology, Birla Institute
RANKING OF CLOUD SERVICE PROVIDERS IN CLOUD
RANKING OF CLOUD SERVICE PROVIDERS IN CLOUD C.S. RAJARAJESWARI, M. ARAMUDHAN Research Scholar, Bharathiyar University,Coimbatore, Tamil Nadu, India. Assoc. Professor, Department of IT, PKIET, Karaikal,
Sla Aware Load Balancing Algorithm Using Join-Idle Queue for Virtual Machines in Cloud Computing
Sla Aware Load Balancing Using Join-Idle Queue for Virtual Machines in Cloud Computing Mehak Choudhary M.Tech Student [CSE], Dept. of CSE, SKIET, Kurukshetra University, Haryana, India ABSTRACT: Cloud
VOL. 4, NO. 2, March 2014 ISSN 2222-9833 ARPN Journal of Systems and Software 2009-2014 AJSS Journal. All rights reserved
Ranking Approaches for Cloud Computing Services Based on Quality of Service: A Review 1 Leyli Mohammadkhanli, 2 Arezoo Jahani * 1 Associate professor, Electrical and Computer Engineering Department, University
A Survey on Cloud Computing
A Survey on Cloud Computing Poulami dalapati* Department of Computer Science Birla Institute of Technology, Mesra Ranchi, India [email protected] G. Sahoo Department of Information Technology Birla
Round Robin with Server Affinity: A VM Load Balancing Algorithm for Cloud Based Infrastructure
J Inf Process Syst, Vol.9, No.3, September 2013 pissn 1976-913X eissn 2092-805X http://dx.doi.org/10.3745/jips.2013.9.3.379 Round Robin with Server Affinity: A VM Load Balancing Algorithm for Cloud Based
Webpage: www.ijaret.org Volume 3, Issue XI, Nov. 2015 ISSN 2320-6802
An Effective VM scheduling using Hybrid Throttled algorithm for handling resource starvation in Heterogeneous Cloud Environment Er. Navdeep Kaur 1 Er. Pooja Nagpal 2 Dr.Vinay Guatum 3 1 M.Tech Student,
Towards Comparative Evaluation of Cloud Services
Towards Comparative Evaluation of Cloud Services Farrukh Nadeem Department of Information Systems, Faculty of Computing and Information Technology, King Abdulaziz University, Jeddah, Saudi Arabia. Abstract:
Efficient Algorithm for Predicting QOS in Cloud Services Sangeeta R. Alagi, Srinu Dharavath
Efficient Algorithm for Predicting QOS in Cloud Services Sangeeta R. Alagi, Srinu Dharavath Abstract Now a days, Cloud computing is becoming more popular research topic. Building high-quality cloud applications
Dynamically optimized cost based task scheduling in Cloud Computing
Dynamically optimized cost based task scheduling in Cloud Computing Yogita Chawla 1, Mansi Bhonsle 2 1,2 Pune university, G.H Raisoni College of Engg & Mgmt, Gate No.: 1200 Wagholi, Pune 412207 Abstract:
Federation of Cloud Computing Infrastructure
IJSTE International Journal of Science Technology & Engineering Vol. 1, Issue 1, July 2014 ISSN(online): 2349 784X Federation of Cloud Computing Infrastructure Riddhi Solani Kavita Singh Rathore B. Tech.
Analysis of Cloud Solutions for Asset Management
ICT Innovations 2010 Web Proceedings ISSN 1857-7288 345 Analysis of Cloud Solutions for Asset Management Goran Kolevski, Marjan Gusev Institute of Informatics, Faculty of Natural Sciences and Mathematics,
CDBMS Physical Layer issue: Load Balancing
CDBMS Physical Layer issue: Load Balancing Shweta Mongia CSE, School of Engineering G D Goenka University, Sohna [email protected] Shipra Kataria CSE, School of Engineering G D Goenka University,
CloudSim: A Toolkit for Modeling and Simulation of Cloud Computing Environments and Evaluation of Resource Provisioning Algorithms
CloudSim: A Toolkit for Modeling and Simulation of Cloud Computing Environments and Evaluation of Resource Provisioning Algorithms Rodrigo N. Calheiros, Rajiv Ranjan, Anton Beloglazov, César A. F. De Rose,
Resource Provisioning in Clouds via Non-Functional Requirements
Resource Provisioning in Clouds via Non-Functional Requirements By Diana Carolina Barreto Arias Under the supervision of Professor Rajkumar Buyya and Dr. Rodrigo N. Calheiros A minor project thesis submitted
DESIGN OF A PLATFORM OF VIRTUAL SERVICE CONTAINERS FOR SERVICE ORIENTED CLOUD COMPUTING. Carlos de Alfonso Andrés García Vicente Hernández
DESIGN OF A PLATFORM OF VIRTUAL SERVICE CONTAINERS FOR SERVICE ORIENTED CLOUD COMPUTING Carlos de Alfonso Andrés García Vicente Hernández 2 INDEX Introduction Our approach Platform design Storage Security
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
Simulation-based Evaluation of an Intercloud Service Broker
Simulation-based Evaluation of an Intercloud Service Broker Foued Jrad, Jie Tao and Achim Streit Steinbuch Centre for Computing, SCC Karlsruhe Institute of Technology, KIT Karlsruhe, Germany {foued.jrad,
Fair Scheduling Algorithm with Dynamic Load Balancing Using In Grid Computing
Research Inventy: International Journal Of Engineering And Science Vol.2, Issue 10 (April 2013), Pp 53-57 Issn(e): 2278-4721, Issn(p):2319-6483, Www.Researchinventy.Com Fair Scheduling Algorithm with Dynamic
Environments, Services and Network Management for Green Clouds
Environments, Services and Network Management for Green Clouds Carlos Becker Westphall Networks and Management Laboratory Federal University of Santa Catarina MARCH 3RD, REUNION ISLAND IARIA GLOBENET 2012
IMPROVEMENT OF RESPONSE TIME OF LOAD BALANCING ALGORITHM IN CLOUD ENVIROMENT
IMPROVEMENT OF RESPONSE TIME OF LOAD BALANCING ALGORITHM IN CLOUD ENVIROMENT Muhammad Muhammad Bala 1, Miss Preety Kaushik 2, Mr Vivec Demri 3 1, 2, 3 Department of Engineering and Computer Science, Sharda
Multilevel Communication Aware Approach for Load Balancing
Multilevel Communication Aware Approach for Load Balancing 1 Dipti Patel, 2 Ashil Patel Department of Information Technology, L.D. College of Engineering, Gujarat Technological University, Ahmedabad 1
Fig. 1 WfMC Workflow reference Model
International Journal of Information & Computation Technology. ISSN 0974-2239 Volume 4, Number 10 (2014), pp. 997-1002 International Research Publications House http://www. irphouse.com Survey Paper on
Response Time Minimization of Different Load Balancing Algorithms in Cloud Computing Environment
Response Time Minimization of Different Load Balancing Algorithms in Cloud Computing Environment ABSTRACT Soumya Ranjan Jena Asst. Professor M.I.E.T Dept of CSE Bhubaneswar In the vast complex world the
A Load Balancing Model Based on Cloud Partitioning for the Public Cloud
International Journal of Information & Computation Technology. ISSN 0974-2239 Volume 4, Number 16 (2014), pp. 1605-1610 International Research Publications House http://www. irphouse.com A Load Balancing
ABSTRACT. KEYWORDS: Cloud Computing, Load Balancing, Scheduling Algorithms, FCFS, Group-Based Scheduling Algorithm
A REVIEW OF THE LOAD BALANCING TECHNIQUES AT CLOUD SERVER Kiran Bala, Sahil Vashist, Rajwinder Singh, Gagandeep Singh Department of Computer Science & Engineering, Chandigarh Engineering College, Landran(Pb),
Cloud Broker for Reputation-Enhanced and QoS based IaaS Service Selection
Proc. of Int. Conf. on Advances in Communication, Network, and Computing, CNC Cloud Broker for Reputation-Enhanced and QoS based IaaS Service Selection Ruby Annette.J 1, Dr. Aisha Banu.W 2 and Dr.Sriram
International Journal of Computer Science Trends and Technology (IJCST) Volume 2 Issue 4, July-Aug 2014
RESEARCH ARTICLE An Efficient Service Broker Policy for Cloud Computing Environment Kunal Kishor 1, Vivek Thapar 2 Research Scholar 1, Assistant Professor 2 Department of Computer Science and Engineering,
FEDERATED CLOUD: A DEVELOPMENT IN CLOUD COMPUTING AND A SOLUTION TO EDUCATIONAL NEEDS
International Journal of Computer Engineering and Applications, Volume VIII, Issue II, November 14 FEDERATED CLOUD: A DEVELOPMENT IN CLOUD COMPUTING AND A SOLUTION TO EDUCATIONAL NEEDS Saju Mathew 1, Dr.
Figure 1. The cloud scales: Amazon EC2 growth [2].
- Chung-Cheng Li and Kuochen Wang Department of Computer Science National Chiao Tung University Hsinchu, Taiwan 300 [email protected], [email protected] Abstract One of the most important issues
An Efficient Hybrid P2P MMOG Cloud Architecture for Dynamic Load Management. Ginhung Wang, Kuochen Wang
1 An Efficient Hybrid MMOG Cloud Architecture for Dynamic Load Management Ginhung Wang, Kuochen Wang Abstract- In recent years, massively multiplayer online games (MMOGs) become more and more popular.
Optimal Service Pricing for a Cloud Cache
Optimal Service Pricing for a Cloud Cache K.SRAVANTHI Department of Computer Science & Engineering (M.Tech.) Sindura College of Engineering and Technology Ramagundam,Telangana G.LAKSHMI Asst. Professor,
Estimating Trust Value for Cloud Service Providers using Fuzzy Logic
Estimating Trust Value for Cloud Service Providers using Fuzzy Logic Supriya M, Venkataramana L.J, K Sangeeta Department of Computer Science and Engineering, Amrita School of Engineering Kasavanahalli,
Resource Allocation Avoiding SLA Violations in Cloud Framework for SaaS
Resource Allocation Avoiding SLA Violations in Cloud Framework for SaaS Shantanu Sasane Abhilash Bari Kaustubh Memane Aniket Pathak Prof. A. A.Deshmukh University of Pune University of Pune University
Comparison of PBRR Scheduling Algorithm with Round Robin and Heuristic Priority Scheduling Algorithm in Virtual Cloud Environment
www.ijcsi.org 99 Comparison of PBRR Scheduling Algorithm with Round Robin and Heuristic Priority Scheduling Algorithm in Cloud Environment Er. Navreet Singh 1 1 Asst. Professor, Computer Science Department
Grid Computing Vs. Cloud Computing
International Journal of Information and Computation Technology. ISSN 0974-2239 Volume 3, Number 6 (2013), pp. 577-582 International Research Publications House http://www. irphouse.com /ijict.htm Grid
Role of Cloud Computing in Big Data Analytics Using MapReduce Component of Hadoop
Role of Cloud Computing in Big Data Analytics Using MapReduce Component of Hadoop Kanchan A. Khedikar Department of Computer Science & Engineering Walchand Institute of Technoloy, Solapur, Maharashtra,
International Journal of Computer Science Trends and Technology (IJCST) Volume 2 Issue 4, July-Aug 2014
RESEARCH ARTICLE An Efficient Priority Based Load Balancing Algorithm for Cloud Environment Harmandeep Singh Brar 1, Vivek Thapar 2 Research Scholar 1, Assistant Professor 2, Department of Computer Science
Utilizing Round Robin Concept for Load Balancing Algorithm at Virtual Machine Level in Cloud Environment
Utilizing Round Robin Concept for Load Balancing Algorithm at Virtual Machine Level in Cloud Environment Stuti Dave B H Gardi College of Engineering & Technology Rajkot Gujarat - India Prashant Maheta
Infrastructure as a Service (IaaS)
Infrastructure as a Service (IaaS) (ENCS 691K Chapter 4) Roch Glitho, PhD Associate Professor and Canada Research Chair My URL - http://users.encs.concordia.ca/~glitho/ References 1. R. Moreno et al.,
Payment minimization and Error-tolerant Resource Allocation for Cloud System Using equally spread current execution load
Payment minimization and Error-tolerant Resource Allocation for Cloud System Using equally spread current execution load Pooja.B. Jewargi Prof. Jyoti.Patil Department of computer science and engineering,
ISSN (Print): 2328-3491, ISSN (Online): 2328-3580, ISSN (CD-ROM): 2328-3629
American International Journal of Research in Science, Technology, Engineering & Mathematics Available online at http://www.iasir.net ISSN (Print): 2328-3491, ISSN (Online): 2328-3580, ISSN (CD-ROM): 2328-3629
An enhanced QoS Architecture based Framework for Ranking of Cloud Services
An enhanced QoS Architecture based Framework for Ranking of Cloud Services Mr.K.Saravanan #1, M.Lakshmi Kantham #2 1 Assistant Professor, 2 PG Scholar Department of Computer Science and Engineering Anna
International Journal of Engineering Research & Management Technology
International Journal of Engineering Research & Management Technology March- 2015 Volume 2, Issue-2 Survey paper on cloud computing with load balancing policy Anant Gaur, Kush Garg Department of CSE SRM
Permanent Link: http://espace.library.curtin.edu.au/r?func=dbin-jump-full&local_base=gen01-era02&object_id=154091
Citation: Alhamad, Mohammed and Dillon, Tharam S. and Wu, Chen and Chang, Elizabeth. 2010. Response time for cloud computing providers, in Kotsis, G. and Taniar, D. and Pardede, E. and Saleh, I. and Khalil,
Cloud Federations in Contrail
Cloud Federations in Contrail Emanuele Carlini 1,3, Massimo Coppola 1, Patrizio Dazzi 1, Laura Ricci 1,2, GiacomoRighetti 1,2 " 1 - CNR - ISTI, Pisa, Italy" 2 - University of Pisa, C.S. Dept" 3 - IMT Lucca,
Analysis of Service Broker Policies in Cloud Analyst Framework
Journal of The International Association of Advanced Technology and Science Analysis of Service Broker Policies in Cloud Analyst Framework Ashish Sankla G.B Pant Govt. Engineering College, Computer Science
A Dynamic Resource Management with Energy Saving Mechanism for Supporting Cloud Computing
A Dynamic Resource Management with Energy Saving Mechanism for Supporting Cloud Computing Liang-Teh Lee, Kang-Yuan Liu, Hui-Yang Huang and Chia-Ying Tseng Department of Computer Science and Engineering,
Performance Analysis of VM Scheduling Algorithm of CloudSim in Cloud Computing
IJECT Vo l. 6, Is s u e 1, Sp l-1 Ja n - Ma r c h 2015 ISSN : 2230-7109 (Online) ISSN : 2230-9543 (Print) Performance Analysis Scheduling Algorithm CloudSim in Cloud Computing 1 Md. Ashifuddin Mondal,
EFFICIENT VM LOAD BALANCING ALGORITHM FOR A CLOUD COMPUTING ENVIRONMENT
EFFICIENT VM LOAD BALANCING ALGORITHM FOR A CLOUD COMPUTING ENVIRONMENT Jasmin James, 38 Sector-A, Ambedkar Colony, Govindpura, Bhopal M.P Email:[email protected] Dr. Bhupendra Verma, Professor
Energetic Resource Allocation Framework Using Virtualization in Cloud
Energetic Resource Allocation Framework Using Virtualization in Ms.K.Guna *1, Ms.P.Saranya M.E *2 1 (II M.E(CSE)) Student Department of Computer Science and Engineering, 2 Assistant Professor Department
Efficient DNS based Load Balancing for Bursty Web Application Traffic
ISSN Volume 1, No.1, September October 2012 International Journal of Science the and Internet. Applied However, Information this trend leads Technology to sudden burst of Available Online at http://warse.org/pdfs/ijmcis01112012.pdf
CLOUD COMPUTING. DAV University, Jalandhar, Punjab, India. DAV University, Jalandhar, Punjab, India
CLOUD COMPUTING 1 Er. Simar Preet Singh, 2 Er. Anshu Joshi 1 Assistant Professor, Computer Science & Engineering, DAV University, Jalandhar, Punjab, India 2 Research Scholar, Computer Science & Engineering,
How To Understand Cloud Computing
Overview of Cloud Computing (ENCS 691K Chapter 1) Roch Glitho, PhD Associate Professor and Canada Research Chair My URL - http://users.encs.concordia.ca/~glitho/ Overview of Cloud Computing Towards a definition
Efficient Service Broker Policy For Large-Scale Cloud Environments
www.ijcsi.org 85 Efficient Service Broker Policy For Large-Scale Cloud Environments Mohammed Radi Computer Science Department, Faculty of Applied Science Alaqsa University, Gaza Palestine Abstract Algorithms,
Dynamic Round Robin for Load Balancing in a Cloud Computing
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 2, Issue. 6, June 2013, pg.274
Creation and Allocation of Virtual Machines for Execution of Cloudlets in Cloud Environment
Creation and Allocation of Virtual Machines for Execution of Cloudlets in Cloud Environment Bachelor of Technology In Computer Science & Engineering By Durbar Show 110CS0153 Department of Computer Science
SLA-based Admission Control for a Software-as-a-Service Provider in Cloud Computing Environments
SLA-based Admission Control for a Software-as-a-Service Provider in Cloud Computing Environments Linlin Wu, Saurabh Kumar Garg, and Rajkumar Buyya Cloud Computing and Distributed Systems (CLOUDS) Laboratory
Full Length Research Article
Available online at http://www.journalijdr.com International Journal of DEVELOPMENT RESEARCH ISSN: 2230-9926 International Journal of Development Research Vol. 4, Issue, 5, pp. 1035-1040, May, 2014 Full
Optimized Resource Allocation in Cloud Environment Based on a Broker Cloud Service Provider
International Journal of Scientific and Research Publications, Volume 3, Issue 5, May 2013 1 Optimized Resource Allocation in Cloud Environment Based on a Broker Cloud Service Provider Jyothi.R.L *, Anilkumar.A
Dynamic Resource Allocation in Software Defined and Virtual Networks: A Comparative Analysis
Dynamic Resource Allocation in Software Defined and Virtual Networks: A Comparative Analysis Felipe Augusto Nunes de Oliveira - GRR20112021 João Victor Tozatti Risso - GRR20120726 Abstract. The increasing
Auto-Scaling Model for Cloud Computing System
Auto-Scaling Model for Cloud Computing System Che-Lun Hung 1*, Yu-Chen Hu 2 and Kuan-Ching Li 3 1 Dept. of Computer Science & Communication Engineering, Providence University 2 Dept. of Computer Science
A Comparative Performance Analysis of Load Balancing Algorithms in Distributed System using Qualitative Parameters
A Comparative Performance Analysis of Load Balancing Algorithms in Distributed System using Qualitative Parameters Abhijit A. Rajguru, S.S. Apte Abstract - A distributed system can be viewed as a collection
AN IMPLEMENTATION OF E- LEARNING SYSTEM IN PRIVATE CLOUD
AN IMPLEMENTATION OF E- LEARNING SYSTEM IN PRIVATE CLOUD M. Lawanya Shri 1, Dr. S. Subha 2 1 Assistant Professor,School of Information Technology and Engineering, Vellore Institute of Technology, Vellore-632014
Load Balancing of Web Server System Using Service Queue Length
Load Balancing of Web Server System Using Service Queue Length Brajendra Kumar 1, Dr. Vineet Richhariya 2 1 M.tech Scholar (CSE) LNCT, Bhopal 2 HOD (CSE), LNCT, Bhopal Abstract- In this paper, we describe
Application Deployment Models with Load Balancing Mechanisms using Service Level Agreement Scheduling in Cloud Computing
Global Journal of Computer Science and Technology Cloud and Distributed Volume 13 Issue 1 Version 1.0 Year 2013 Type: Double Blind Peer Reviewed International Research Journal Publisher: Global Journals
A Novel Approach for Efficient Load Balancing in Cloud Computing Environment by Using Partitioning
A Novel Approach for Efficient Load Balancing in Cloud Computing Environment by Using Partitioning 1 P. Vijay Kumar, 2 R. Suresh 1 M.Tech 2 nd Year, Department of CSE, CREC Tirupati, AP, India 2 Professor
International Journal of Advance Research in Computer Science and Management Studies
Volume 3, Issue 6, June 2015 ISSN: 2321 7782 (Online) International Journal of Advance Research in Computer Science and Management Studies Research Article / Survey Paper / Case Study Available online
Logical Data Models for Cloud Computing Architectures
Logical Data Models for Cloud Computing Architectures Augustine (Gus) Samba, Kent State University Describing generic logical data models for two existing cloud computing architectures, the author helps
Mobile Cloud Computing: Critical Analysis of Application Deployment in Virtual Machines
2012 International Conference on Information and Computer Networks (ICICN 2012) IPCSIT vol. 27 (2012) (2012) IACSIT Press, Singapore Mobile Cloud Computing: Critical Analysis of Application Deployment
Network Infrastructure Services CS848 Project
Quality of Service Guarantees for Cloud Services CS848 Project presentation by Alexey Karyakin David R. Cheriton School of Computer Science University of Waterloo March 2010 Outline 1. Performance of cloud
A Survey Study on Monitoring Service for Grid
A Survey Study on Monitoring Service for Grid Erkang You [email protected] ABSTRACT Grid is a distributed system that integrates heterogeneous systems into a single transparent computer, aiming to provide
