Performance Analysis of Key-Value Stores with Consistent Replica Selection Approach

2020 ◽  
pp. 377-387
Author(s):  
Thazin Nwe ◽  
Tin Tin Yee ◽  
Ei Chaw Htoon
Keyword(s):  
Performance Analysis ◽  
Replica Selection ◽  
Selection Approach

scholarly journals Performance Analysis of Web Service Replica Selection in an Extranet

2007 ◽  
Author(s):  
Partheeban Chandrasekaran ◽  
Shikharesh Majumdar ◽  
Chung-Horng Lung ◽  
Laura Serghi
Keyword(s):  
Performance Analysis ◽  
Web Service ◽  
Replica Selection

scholarly journals An Enhanced Replica Selection Approach Based on Distance Constraint in ICN

Electronics ◽  
2021 ◽  
Vol 10 (4) ◽  
pp. 490
Author(s):  
Yaqin Song ◽  
Hong Ni ◽  
Xiaoyong Zhu
Keyword(s):  
The State ◽  
Low Latency ◽  
Distance Constraint ◽  
5G Networks ◽  
State Table ◽  
Network Distance ◽  
Fifth Generation ◽  
Resolution System ◽  
Replica Selection ◽  
Selection Approach

Fifth generation (5G) networks have a high requirement for low latency of data delivery. Information-centric networking (ICN) adopts the paradigm of separation of the identifier and locator. It is efficient in content distribution by supporting in-network caching and has the potential to satisfy the low latency requirement in 5G. Replica selection is a key problem to retrieving content in ICN. Prior research usually utilizes the nearest replica. However, using the nearest replica cannot guarantee the smallest content download delay. To exploit in-network caching better, we propose an enhanced replica selection approach, called ERS. ERS first uses a distance-constrained-based name resolution system to discover the nearby replicas. Then, the most appropriate replica is chosen according to a local state table that maintains the state of replica nodes within a limited domain. In addition to network distance and replica node load, ERS innovatively introduces the path congestion degree between requester and replica nodes to assist replica selection. With extensive simulations, the proposed approach shows better performance than the state-of-the-art methods in terms of average content download delay. Finally, the overhead of the proposed method is analyzed.

A Novel Response Time-Driven Replica Selection Approach for Cloud Computing

2014 ◽  
Vol 519-520 ◽  
pp. 146-150
Author(s):  
Zhong Xue Yang ◽  
Xiao Lin Qin ◽  
Wen Rui Li ◽  
Ying Jie Yang
Keyword(s):  
Cloud Computing ◽  
Response Time ◽  
High Performance ◽  
Data Availability ◽  
Access Latency ◽  
Mean Response Time ◽  
Network Bandwidth ◽  
Replica Selection ◽  
Selection Approach ◽  
Categorical Distribution

Data replication techniques are used in cloud computing to reduce access latency, network bandwidth and enhance data availability, system reliability. Replica selection involves selecting the best replica location to access the data for job execution in cloud computing. In order to select the best replica, a novel response time-driven replica selection approach based on Dirichlet probability distribution (DPRS) is proposed in this paper. Dirichlet PDF is the conjugate prior of categorical distribution to predict the posteriori value. The response time is calculated based on the network parameters such as network bandwidth, file size and access latency. The best replica can be predicted in corresponding with the historical log file by using Dirichlet PDF. Simulation results show that DPRS method conducts high performance in lower mean response time, while compared with No replica, LRU and LFU strategies.

Sign in / Sign up

Export Citation Format

Share Document