Latency Optimization for Resource Allocation in Cloud Computing System

2017 3th International Conference on Web Research (ICWR)

2017

Self Cite

Process modeling is a suitable tool for improving the business processes. Successful process modeling strongly depends on correct requirements engineering. In this paper, we proposed a combination approach for requirements elicitation for developing business models. To do this, BORE (Business-Oriented Requirements Engineering) method is utilized as the base of our work and it is enriched by the important features of the BDD (Business-driven development) method, in order to make the proposed approach appropriate for modeling the more complex processes. As the main result, our method eventuates in exact requirements elicitation that adapts the customers' needs. Also, it let us avoid any rework in the modeling of process. In this paper, we conduct a case study for the paper submission and publication system of a journal. The results of this study not only give a good experience of real world application of proposed approach on a web-based system, also it approves the proficiency of this approach for modeling the complex systems with many sub-processes and complicated relationships.

Section: Case Studymentioning

confidence: 99%

Exact requirements engineering for developing business process models

2017 3th International Conference on Web Research (ICWR)

2017

Self Cite

“…In this way, each applicant is bound to a virtual machine and supposes that it is a complete resource. Resource provider is the entity that manages these virtual machines (Nosrati et al , 2015).…”

Section: Introductionmentioning

confidence: 99%

Community-based replica management in distributed systems

Fazlali

2018

IJWIS

Self Cite

Purpose One of the techniques for improving the performance of distributed systems is data replication, wherein new replicas are created to provide more accessibility, fault tolerance and lower access cost of the data. In this paper, the authors propose a community-based solution for the management of data replication, based on the graph model of communication latency between computing and storage nodes. Communities are the clusters of nodes that the communication latency between the nodes are minimum values. The purpose of this study if to, by using this method, minimize the latency and access cost of the data. Design/methodology/approach This paper used the Louvain algorithm for finding the best communities. In the proposed algorithm, by requesting a file according to the nodes of each community, the cost of accessing the file located out of the applicant’s community was calculated and the results were accumulated. On exceeding the accumulated costs from a specified threshold, a new replica of the file was created in the applicant’s community. Besides, the number of replicas of each file should be limited to prevent the system from creating useless and redundant data. Findings To evaluate the method, four metrics were introduced and measured, including communication latency, response time, data access cost and data redundancy. The results indicated acceptable improvement in all of them. Originality/value So far, this is the first research that aims at managing the replicas via community detection algorithms. It opens many opportunities for further studies in this area.

“…In our previous research, we proposed an optimization on a common resource allocation method based on the latencies of communications to improve the performance of the system by minimizing the communication latencies (Nosrati et al, 2015). Because of it, we added a table to resource agent (entity that allocates resources to the applicants) to hold the history of previous allocations.…”

Section: Introductionmentioning

confidence: 99%

Energy efficient and latency optimized media resource allocation

Karimi

2016

IJWIS

Self Cite

Purpose This paper aims to provide a method for media resource allocation in Cloud systems for supporting green computing policies, as well as attempting to improve the overall performance of system by optimizing the communication latencies. Design/methodology/approach A common method for resource allocation is using resource agent that takes the budgets/prices of applicants/resources and creates a probability matrix of allocation according to the policies of system. Two general policies for optimization are latency optimization and green computing. Presented heuristic for latencies is so that the average latencies of communication between applicant and resource are measured, and they will affect the next decision. For gaining green computing, it is attempted to consolidate the allocated resources on smaller number of physical machines. So calculation formula of the price of each resource is modified to decrease the probability of allocating the resources on the machine with least allocated resources. Findings Results of proposed method indicates its success in both green computing and improving the performance. Experiments show decreasing 21.4 per cent of response time simultaneously with increasing tasks in the tested range. The maximum and minimum of saved energy is acceptable and reported as 79.2 and 16.8 per cent. Research limitations/implications Like other centralized solutions, the proposed method suffers from the limitations of centralized resource agent, like bottle neck. But the implementation of distributed resource agent is postponed to future work. Originality/value Proposed method presents heuristics for improving the performance and gaining green computing. The key feature is formulating all the details and considering pitch variables for controlling the policies of system.