Loading...
| Friend's email | |
| Your name | |
| Your email | |
| enter code | |
This page was sent successfuly
- Type of Document: M.Sc. Thesis
- Language: Farsi
- Document No: 48784 (19)
- University: Sharif University of Technology
- Department: Computer Engineering
- Advisor(s): Movaghar Rahimabadi, Ali
- Abstract:
- Today's, organizations tend to use cloud services to increase efficiency and reduce IT costs. At the other hand, the growth in diversity of cloud services in aspects of virtual machines cost, technical specifications and locations intricate the process of suitable cloud service selection. In addition to satisfying user requests' requirements, the chosen service must reduce the IT costs. Because of this service diversity and efficiency increase, software modules can be placed in different data centers. And considering this distributivity adds to selection complexity. However, only small amounts of researches have considered communications costs and only have considered qualitative values. As a result, this research has attempted to reduce the cloud-related costs in addition to satisfying requests requirements by considering modules communications, network costs and peer-assisted clouds. A suitable solution has been proposed for this problem by using the set theorem, B+Tree and greedy algorithms. Evaluation results of this research in compared to existing solutions represent that the proposed solution has been succeeded to reduce 17 to 30 percent of cloud-related costs. Also because of B+ tree implementation and speed optimization, the proposed algorithm can reach to compared works best values at least 7 times faster
- Keywords:
- Cloud Service Selection ; Network Cost ; Service Location ; Manage Organization Request ; Peer-Assisted Cloud
Digital Object List
-
محتواي کتاب
- view
Bookmark