In cloud computing,the number of replicas and deployment strategy have extensive impacts on user's requirement and storage efficiency.Therefore,in this paper,a new definition of file access popularity according to...In cloud computing,the number of replicas and deployment strategy have extensive impacts on user's requirement and storage efficiency.Therefore,in this paper,a new definition of file access popularity according to users' preferences,and its prediction algorithm are provided to predict file access trend with historical data.Files are sorted by priority depending on their popularity.A mathematical model between file access popularity and the number of replicas is built so that the reliability is increased efficiently.Most importantly,we present an optimal strategy of dynamic replicas deployment based on the file access popularity strategy with the overall concern of nodes' performance and load condition.By this strategy,files with high priority will be deployed on nodes with better performance therefore higher quality of service is guaranteed.The strategy is realized in the Hadoop platform.Performance is compared with that of default strategy in Hadoop and CDRM strategy.The result shows that the proposed strategy can not only maintain the system load balance,but also supply better service performance,which is consistent with the theoretical analysis.展开更多
In this paper, the problems of redundant traffic and redundant replicas tor efficient object replication in P2P overlay are studies. Firstly, a hierarchical and topology-aware P2P overlay is developed with κ-Medoids ...In this paper, the problems of redundant traffic and redundant replicas tor efficient object replication in P2P overlay are studies. Firstly, a hierarchical and topology-aware P2P overlay is developed with κ-Medoids partition algorithm to achieve the minimal physical distance of all super peer pairs. Secondly, a new idea of placing at most one replica in a cluster of physically adjacent nodes is introduced to achieve scattered distribution of replicas. Lastly, an efficient replicas-query algorithm based on multiple hash functions is proposed. Theoretical analysis and simulation experiment on several performance metrics are given, and it is verified that the method in this paper can efficiently disseminate replicas across the network, increase query-hit ratio, and decrease redundant messages and storage spaces required.展开更多
基金Supported by the National Natural Science Foundation of China(No.61170209,61272508,61202432,61370132,61370092)
文摘In cloud computing,the number of replicas and deployment strategy have extensive impacts on user's requirement and storage efficiency.Therefore,in this paper,a new definition of file access popularity according to users' preferences,and its prediction algorithm are provided to predict file access trend with historical data.Files are sorted by priority depending on their popularity.A mathematical model between file access popularity and the number of replicas is built so that the reliability is increased efficiently.Most importantly,we present an optimal strategy of dynamic replicas deployment based on the file access popularity strategy with the overall concern of nodes' performance and load condition.By this strategy,files with high priority will be deployed on nodes with better performance therefore higher quality of service is guaranteed.The strategy is realized in the Hadoop platform.Performance is compared with that of default strategy in Hadoop and CDRM strategy.The result shows that the proposed strategy can not only maintain the system load balance,but also supply better service performance,which is consistent with the theoretical analysis.
基金Supported by the National Natural Science Foundation of China （ No. 60903195 ） and the Key Technological Problems Tackling Project of Wuhan （ No. 200750499172）.
文摘In this paper, the problems of redundant traffic and redundant replicas tor efficient object replication in P2P overlay are studies. Firstly, a hierarchical and topology-aware P2P overlay is developed with κ-Medoids partition algorithm to achieve the minimal physical distance of all super peer pairs. Secondly, a new idea of placing at most one replica in a cluster of physically adjacent nodes is introduced to achieve scattered distribution of replicas. Lastly, an efficient replicas-query algorithm based on multiple hash functions is proposed. Theoretical analysis and simulation experiment on several performance metrics are given, and it is verified that the method in this paper can efficiently disseminate replicas across the network, increase query-hit ratio, and decrease redundant messages and storage spaces required.
