Abstract
Reducing service cost has been a popular topic in recent studies on cloud storage systems. One of the basic techniques is to power down parts of service nodes. However, it will reduce the availability of data objects, which is the overriding concern of users. So we mathematically formulate the problem to close maximum service nodes under the constraint of a given high availability. According to our analysis, this problem is NP complete. In practical systems, few data objects get most accesses while large number of objects get few. So we propose a parallelized greedy algorithm to power down service nodes based on the skew ness of data popularity.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
