Data Replication Ranking for Social Network Storage
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Social network applications face challenges in optimizing data storage allocation and replication across distributed data centers, leading to increased access delays and storage costs due to the complexity of user interactions and data access patterns.
Innovation Solution
A ranking-based method is employed to optimize data storage allocation and replication by determining the optimal data center for storing user data based on access ratios and friendship matrices, ensuring that primary and replica copies are stored in high-ranking data centers that minimize access latency for users.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If data is stored in distributed data centers to improve accessibility and reliability, then system reliability and availability are improved, but access delay increases due to data being stored farther from users
Solution Approach 1:
The patent applies local quality by storing data copies in data centers with different characteristics - primary copies in cost-effective locations and replica copies in user-proximity locations. This allows different parts of the data storage system to serve different functions: reliability through distribution and fast access through local replication.
Solution Approach 2:
The patent segments data storage into primary copies and replica copies, each stored in different data centers with different ranking priorities. Primary copies are stored in lower-ranked (more cost-effective) data centers while replica copies are stored in higher-ranked (user-proximity) data centers, allowing the system to balance cost and access delay.
2Speed
If data is replicated across multiple data centers to reduce access delay, then access speed is improved, but storage costs increase due to redundant data copies
Solution Approach 1:
The patent implements partial replication by creating only one replica copy for each primary copy, rather than full replication across all data centers. The replica is placed in a higher-ranked data center based on user proximity, providing sufficient access speed improvement while minimizing storage cost increase through selective rather than universal replication.
3Loss of time
If user data is stored in data centers with high user concentration to minimize access delay, then access delay is reduced, but the system becomes less adaptable to varying user interaction patterns and data access ratios
Solution Approach 1:
The patent implements dynamic data center ranking that adapts to varying user interaction patterns by calculating rankings based on user-specific factors including friendship matrices and data access ratios. The system dynamically determines which data centers are highest-ranked for each user based on their specific social network connections and access patterns, allowing the system to adapt to different user behaviors rather than using a static storage strategy.
4Device complexity
If a simple storage allocation method is used to reduce system complexity, then device complexity is reduced, but the ability to optimize storage allocation based on user access patterns is limited
Solution Approach 1:
The patent implements self-service through automated data center ranking and selection processes. The system automatically calculates user-specific rankings based on friendship matrices and access ratios, then autonomously selects optimal data centers for primary and replica copies without manual intervention. This automation reduces operational complexity while maintaining high optimization efficiency through algorithmic decision-making.
Data Source
AI summary
Systems and methods are provided for optimizing data storage allocation and replication of user data in computing systems. For example, a method includes determining a ranking of each data center in the computing system for a given user of the computing system, and selecting a first data center to store a primary copy of user data, and a second data center to store a replica copy of the user data, based at least in part on the determined rankings of the data centers for the given user. The data centers are ranked using a ranking function which includes an access ratio that is determined as ratio of (i) a number of times that each of a total number of users in the given data center have accessed shared data of the given user to (ii) a number of data uploads that the given user has made to the computing system.