scholarly journals Replica Placement in Cloud Storage based on Minimal Blocking Probability

2015 ◽  
Author(s):  
Meng Xue ◽  
Shen jian jing ◽  
guo xiao feng
Keyword(s):  
Cloud Storage ◽  
Blocking Probability ◽  
Replica Placement ◽  
Minimal Blocking

scholarly journals Implementation of Adaptive Algorithm to Optimize the Placement of Wavelength Converters

2020 ◽  
Vol 9 (4) ◽  
pp. 2139-2142
Keyword(s):  
Performance Improvement ◽  
Adaptive Algorithm ◽  
Blocking Probability ◽  
Optical Network ◽  
Cost Effective ◽  
Previous Method ◽  
Wavelength Converters ◽  
Wavelength Converter ◽  
Effective Use ◽  
Minimal Blocking

Wavelength Converters in WDM Optical Network, is one the essential component in today’s advanced research, but at the same time they are very expensive and it should be used in limited number to make effective use of Wavelength Converters. The two main criteria to be achieved is to reduce the overall blocking probability at an affordable cost and the other performance measures are within reasonable limits. To equip the node with the Wavelength converter for any network is crucial. There should be a minimal blocking probability at those particular nodes chosen to place the Wavelength Converter. A large margin decrease in the blocking probability will be easy for the placement of Wavelength Converter. Compared with the previous method of allocation, the results of the proposed adaptive algorithm can significantly reduce the blocking probability at higher range. The implementation of Adaptive algorithm shows that it is more cost effective to optimize the blocking performance. The blocking performance improvement hence led to the comparison of performance and efficiency other conventional methods with the proposed Adaptive algorithm is done.

Replica placement study in large-scale cloud storage system

2013 ◽  
Vol 32 (3) ◽  
pp. 620-624 ◽  
Author(s):  
Ji-guang DONG ◽  
Wei-wei CHEN ◽  
Lang-jun TIAN ◽  
Hai-jia WU
Keyword(s):  
Cloud Storage ◽  
Large Scale ◽  
Storage System ◽  
Replica Placement

scholarly journals Optimized Data Replication for Small Files in Cloud Storage Systems

2016 ◽  
Vol 2016 ◽  
pp. 1-8 ◽  
Author(s):  
Xiong Fu ◽  
Wenjie Liu ◽  
Yeliang Cang ◽  
Xiaojie Gong ◽  
Song Deng
Keyword(s):  
Cloud Storage ◽  
Storage Systems ◽  
Data Replication ◽  
Cloud Services ◽  
Cloud System ◽  
Replica Placement ◽  
File Storage ◽  
Block Based ◽  
Placement Algorithm ◽  
Small File

Cloud storage has become an important part of a cloud system nowadays. Most current cloud storage systems perform well for large files but they cannot manage small file storage appropriately. With the development of cloud services, more and more small files are emerging. Therefore, we propose an optimized data replication approach for small files in cloud storage systems. A small file merging algorithm and a block replica placement algorithm are involved in this approach. Small files are classified into four types according to their access frequencies. A number of small files will be merged into the same block based on which type they belong to. And the replica placement algorithm helps to improve the access efficiencies of small files in a cloud system. Related experiment results demonstrate that our proposed approach can effectively shorten the time spent reading and writing small files, and it performs better than the other two already known data replication algorithms: HAR and SequenceFile.

A Data Replica Placement Scheme for Cloud Storage under Healthcare IoT Environment

2014 ◽  
Vol 556-562 ◽  
pp. 5511-5517 ◽  
Author(s):  
Bang Zhang ◽  
Xing Wei Wang ◽  
Min Huang
Keyword(s):  
Load Balance ◽  
Cloud Storage ◽  
Access Time ◽  
Replica Placement ◽  
Health Care Environment ◽  
Care Environment ◽  
Multiple Data ◽  
Access Cost ◽  
User Access ◽  
Simulation Results

In this paper, a multiple data replica placement scheme for cloud storage under health-care environment is proposed. It is based on p-center model with minimizing user access cost as its optimization objective. It uses GA (Genetic Algorithm) to find the optimal data replica placement solution. Simulation results have shown that it can not only improve user access time and promote load balance but also enhance system scalability and reliability.

On Number of Planes of Rearrangeably Nonblocking Optical Banyan Networks with Link Failures

2008 ◽  
Vol 1 (1) ◽  
pp. 43-54
Author(s):  
Basra Sultana ◽  
Mamun-ur-Rashid Khandker
Keyword(s):  
Optical Switching ◽  
Blocking Probability ◽  
Link Failure ◽  
Link Failures ◽  
Small Depth ◽  
Internal Link ◽  
Banyan Network ◽  
Minimum Number ◽  
Switch Design ◽  
Banyan Networks

Vertically stacked optical banyan (VSOB) networks are attractive for serving as optical switching systems due to the desirable properties (such as the small depth and self-routing capability) of banyan network structures. Although banyan-type networks result in severe blocking and crosstalk, both these problems can be minimized by using sufficient number of banyan planes in the VSOB network structure. The number of banyan planes is minimum for rearrangeably nonblocking and maximum for strictly nonblocking structure. Both results are available for VSOB networks when there exist no internal link-failures. Since the issue of link-failure is unavoidable, we intend to find the minimum number of planes required to make a VSOB network nonblocking when some links are broken or failed in the structure. This paper presents the approximate number of planes required to make a VSOB networks rearrangeably nonblocking allowing link-failures. We also show an interesting behavior of the  blocking  probability of a faulty VSOB networks that the blocking probability may not  always  increase monotonously with  the  increase  of  link-failures; blocking probability  decreases  for  certain range of  link-failures, and then increases again. We believe that such fluctuating behavior of blocking probability with the increase of link failure probability deserves special attention in switch design.  Keywords: Banyan networks; Blocking probability; Switching networks; Vertical stacking; Link-failures. © 2009 JSR Publications. ISSN: 2070-0237(Print); 2070-0245 (Online). All rights reserved. DOI: 10.3329/jsr.v1i1.1070

Sign in / Sign up

Export Citation Format

Share Document