检索结果-内蒙古大学图书馆

replication Strategy with Comprehensive Data Center Selection Method in Cloud Environments

Computers, Materials & Continua 2023年第1期74卷 415-433页

作者： M.A.Fazlina Rohaya Latip Hamidah Ibrahim Azizol Abdullah Faculty of Computer Science and Information Technology Universiti Putra MalaysiaSerdang43400SelangorMalaysia

As the amount of data continues to grow rapidly,the variety of data produced by applications is becoming more affluent than *** computing is the best technology evolving today to provide multi-services for the mass and variety of *** cloud computing features are capable of processing,managing,and storing all sorts of *** data is stored in many high-end nodes,either in the same data centers or across many data centers in cloud,performance issues are still *** cloud replication strategy is one of best solutions to address risk of performance degradation in the cloud *** real challenge here is developing the right data replication strategy with minimal data movement that guarantees efficient network usage,low fault tolerance,and minimal replication *** key problem discussed in this research is inefficient network usage discovered during selecting a suitable data center to store replica copies induced by inadequate data center selection ***,to mitigate the issue,we proposed replication Strategy with a comprehensive Data Center Selection Method(RS-DCSM),which can determine the appropriate data center to place replicas by considering three key factors:Popularity,space availability,and *** proposed RS-DCSM was simulated using CloudSim and the results proved that data movement between data centers is significantly reduced by 14%reduction in overall replication frequency and 20%decrement in network usage,which outperformed the current replication strategy,known as Dynamic Popularity aware replication Strategy(DPRS)algorithm.

关键词： Cloud computing data replication replica placement data center merits replication algorithm

来源：评论

学校读者我要写书评

暂无评论

Managing Fragmented Database replication for Mygrants Using Binary Vote Assignment on Cloud Quorum

Managing Fragmented Database Replication for Mygrants Using ...

引用

2nd International Conference on Mechanical Design and Power Engineering (ICMDPE 2013)

作者： Fauzi, Ainul Azila Che Noraziah, A. Mohd, Wan Maseri Binti Wan Amer, A. Herawan, Tutut Univ Malaysia Pahang Fac Comp Syst & Software Engn Kuantan 26300 Pahang Malaysia Univ Malaya Fac Comp Sci & Informat Technol Dept Informat Sci Kuala Lumpur 50603 Malaysia

ISBN: (纸本)9783038350019

replication in distributed database is the process of copying and maintaining database objects in multiple databases that make up a distributed database system. In this paper, we will manage fragmented database replication and transaction management for Malaysian Greater Research Network (MyGRANTS) using a new proposed algorithm called Binary Vote Assignment on Cloud Quorum (BVACQ). This technique will combine replication and fragmentation. Fragmentation in distributed database is very useful in terms of usage, efficiency, parallelism and also for security. This strategy will partition the database into disjoint fragments. The result shows that managing replication and transaction through proposed BVACQ able to preserve data consistency. It also increases the degrees of parallelism. This is because by using fragmentation, replication and transaction can be divided into several subqueries that operate on the fragments.

关键词： Data replication Cloud Computing replication algorithm fragmentation BVACQ quorum MyGRANTS

来源：评论

学校读者我要写书评

暂无评论

Mobile Data replication algorithms Based on Agent

Mobile Data Replication Algorithms Based on Agent

引用

International Conference on Automation, Communication, Architectonics and Materials

作者： Zeng, Wenying Zhao, Yuelong S China Univ Technol Sch Comp Sci & Engn Guangzhou Guangdong Peoples R China

ISBN: (纸本)9783037851036

In mobile transaction process, there exists frequently data transferring and replication. By the bandwidth limitation, discontinuous characteristics, there are a lot of questions in mobile data loss, replication failure, etc. Aimed at the questions, the paper proposes several mobile data transfer and replication algorithms based on agent. Every proposed algorithm is analyzed and simulation is performed to compare their delay. Result shows that through collecting small data transactions by agent, data are batch processed to servers, which may reduce the total cost of replication and promote replication success ratio and reduce the delay of replications. Adaptive algorithm is also considered.

关键词： mobile data replication algorithm transfer agent adaptive

来源：评论

学校读者我要写书评

暂无评论

Managing Educational Resource - Student Information Systems Using BVAGQ Fragmented Database replication Model

引用

Procedia - Social and Behavioral Sciences 2011年 28卷 127-132页

作者： A. Noraziah Ainul Azila Che Fauzi Mustafa Mat Deris Md Yazid Mohd Saman Noriyani Mohd Zain Nawsher Khan Faculty of Computer Systems and Software Engineering Universiti Malaysia Pahang Malaysia Faculty of Computer Science and Information Technology Universiti Tun Hussein Onn Malaysia Malaysia Faculty of Science & Technology Universiti Malaysia Terengganu Malaysia

Significant and urgent solutions are required in order to manage educational resource efficient and effective. Data replication is one of the key components to manage the huge of resources in data grid architecture as it enhances data access and reliability. replication provides user with fast, local access to shared data, and increased availability of applications because alternate data access options exist. In this paper, we present on how to manage fragmented database replication and transaction for educational resources-Student Information System (SIS) by using Binary Vote Assignment on Grid Quorum (BVAGQ) fragmented database replication model. Furthermore, fragmentation in distributed database is very useful in terms of usage, reliability and efficiency. In particular, BVAGQ able to partition the database into disjoint fragments. The result shows that managing replication and transaction through proposed BVAGQ able to preserve data availability and consistency. It also increases the degrees of parallelism. This is because by using fragmentation, replication and transaction can be divided into several subqueries that operate on the fragments.

关键词： replication algorithm fragmentation BVAGQ Student Information System

来源：评论

学校读者我要写书评

暂无评论

Storing and replication in Topic-Based Publish/Subscribe Networks

Storing and Replication in Topic-Based Publish/Subscribe Net...

引用

IEEE Global Telecommunications Conference (GLOBECOM 2010)

作者： Sourlas, Vasilis Flegkas, Paris Paschos, Georgios S. Katsaros, Dimitrios Tassiulas, Leandros Univ Thessaly Dept Comp & Commun Engn Volos Greece

ISBN: (纸本)9781424456383

In current publish/subscribe networks messages are not stored and only active subscribers receive published messages. However, in a dynamic scenario a user may be interested in content published before the subscription time. In this paper, we introduce a mechanism that enables storing in such networks, while maintaining the main principle of loose-coupled and asynchronous communication. Furthermore, we propose a new storage placement and replication algorithm which differentiates classes of content and minimize the clients response latency. The performance of our proposed placement and replication algorithm and the proposed storing mechanism is evaluated via simulations and insights are given for future work.

关键词： asynchronous communication loose coupled communication message passing middleware replication algorithm storage placement algorithm topic based publish network topic based subscribe network

来源：评论

学校读者我要写书评

暂无评论

A model to predict the optimal performance of the Hierarchical Data Grid

引用

FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE 2010年第1期26卷 1-11页

作者： Zhang, Junwei Lee, Bu-Sung Tang, Xueyan Yeo, Chai-Kiat Nanyang Technol Univ Sch Comp Engn Singapore Singapore

The Data Grid, as a specialization and extension of the Grid, has been adopted as the solution to solve data-intensive problems, such as high energy physics, life science and etc. Large data files are replicated across the Data Grid to improve the system performance. One form of the Data Grid studied is the Hierarchical Data Grid used in LHC experiments. There has been a lot of research work on replication algorithms for the Hierarchical Data Grid. It is important and useful to analyze the optimal performance, as it can be used as a benchmark to compare the performances of different replication algorithms and helps us to understand how good the replication algorithms are in approaching the optimal performance. In this paper, we construct a model to predict the optimal performance of the Hierarchical Data Grid. The performance metrics used for the model are average response time and average bandwidth cost. We propose the optimal replication algorithm and present a detailed analysis of its performance. The Multi-Tier Data Grid is used as a specific example of the Hierarchical Data Grid to verify our model. The performance of the proposed optimal replication algorithm is studied together with three well-known replication algorithms. The simulation results show that the optimal replication algorithm has the best performance and its performance is pretty close to the result obtained using our probabilistic model. (C) 2009 Elsevier B.V. All rights reserved.

关键词： Hierarchical Data Grid Theoretical model replication algorithm Performance analysis

来源：评论

学校读者我要写书评

暂无评论

Optimal replication algorithm for scalable streaming media in content delivery networks

引用

IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS 2004年第12期E87D卷 2723-2732页

作者： Su, Z Katto, J Yasuda, Y Waseda Univ Sch Sci & Engn Tokyo 1690072 Japan

CDN (Content Delivery Networks) improves end-user performance by replicating web contents on a group of geographically distributed servers. However, repeatedly keeping the entire replica of the original objects into many content servers consumes too much server resource. This problem becomes more serious for the large-sized objects such as streaming media, e.g. high quality video. In this paper, we therefore propose an efficient replication method for layered video streams in CDN, which can reduce user response delays and storage costs simultaneously. Based on an analytical formulation of the cooperative replication of layers and segments of each video stream, we derive a replication algorithm which solves next three problems quantitatively. (1) How many servers should be selected to replicate a given video stream? (2) For a single video stream, how many layers and segments should be stored in a given server? (3) After selecting a group of servers for each video stream, how do we allocate the replication priority (i.e. order) to each server? Simulation results verify that the proposed algorithm efficiently resolves the above problems and provides much better performance than conventional methods.

关键词： content deliver networks replication algorithm scalable video streaming web cache performance network traffic

来源：评论

学校读者我要写书评

暂无评论

Orthogonal replication algorithm on cluster storage system 5

Orthogonal replication algorithm on cluster storage system

引用

5th International Conference on algorithms and Architectures for Parallel Processing

作者： Hu, JF Zhang, YH Zheng, WM Tsing Hua Univ Dept Comp Sci & Technol Beijing 100084 Peoples R China

ISBN: (纸本)0769515126

This paper presents a replication algorithm, which can be embedded in storage APIs provided by cluster storage systems and can improve the availability of storage. Compared with previous methods, this orthogonal algorithm is independent of data types and upper-level applications. It implements three data-consistency criteria for developers to select for their applications. Availability is object based and can be dynamically adjusted. Moreover low latency of commands is obtained by reducing the communication among replicas as much as possible. We implemented this method partially in TODS, which is a p distributed object persistent system running on COCs.

关键词： distributed object management distributed memory systems storage management replication algorithm cluster storage data-consistency criteria orthogonal replication APIs distributed object persistent system

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：