Distributed File Synchronization via Coordinated Renaming
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Distributed computer systems face challenges in ensuring consistent delivery of web pages and files across multiple servers due to low reliability and scalability issues with existing techniques, such as reliance on a single repository or the complexity of two-phase commit procedures.
Innovation Solution
A system and method that schedules the renaming of data across multiple file systems to ensure simultaneous availability of new web pages and files, using a data delivery program to estimate and synchronize renaming times based on wait and transit times within each server, allowing all clients to receive the same content at approximately the same time.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Stability of the object's composition
If a single shared repository is used for web pages and files, then all web servers can access the same content, but reliability decreases due to dependency on a single repository and scalability is limited due to bandwidth and response time constraints
Solution Approach 1:
The patent divides the single shared repository into multiple distributed repositories, with each web server having its own storage. This segmentation eliminates the single point of failure while maintaining content consistency through coordinated renaming operations across all servers.
Solution Approach 2:
The patent creates copies of the same content in multiple distributed repositories. Each web server stores identical web pages and files locally, allowing independent operation while maintaining consistency through synchronized renaming of content versions across all copies.
2Reliability
If each web server has its own storage for web pages and files, then reliability improves through redundancy, but complexity increases due to the need for synchronization and consistency management across multiple storages
Solution Approach 1:
The patent performs preliminary actions by pre-calculating and scheduling rename operations across all servers before actual content delivery. The system determines optimal rename times in advance based on server load and network conditions, then executes coordinated renaming to ensure consistency without complex real-time synchronization.
Solution Approach 2:
The patent introduces a content distributor as an intermediary component that manages the renaming coordination between multiple web servers. This intermediary schedules and coordinates rename operations across all servers, abstracting the complexity of synchronization from individual servers and enabling reliable consistency management.
3Stability of the object's composition
If content is updated in distributed storages simultaneously, then consistency is achieved, but time loss increases due to coordination delays and synchronization overhead
Solution Approach 1:
The patent calculates and schedules rename operations in advance based on estimated time periods for each server. By determining optimal rename times beforehand and accounting for potential delays, the system minimizes actual synchronization time while ensuring all servers complete renaming simultaneously.
Solution Approach 2:
The patent dynamically adjusts rename scheduling based on real-time server conditions and estimated processing times. The content distributor monitors server status and adapts rename timing to account for varying load conditions, optimizing synchronization efficiency while maintaining data consistency across all distributed storages.
Data Source
AI summary
System, method and program for making same data available from different file systems to clients. The data is transferred to each of the file systems. Respective time periods required to rename the data in the file systems from a first name to a second name are estimated. The data with the first name is not available to the clients. The data with the second name is available to the clients. Renaming of the data in the file systems from the first name to the second name is scheduled. The scheduling is based at least in part on the estimated respective time periods to rename the data in the file systems. Preferably, the scheduling is timed to result in completion of the renaming of the data in all of the file systems at approximately a same time. Preferably, one of the time periods to rename the data in the file systems is based at least in part on a time period to transfer the data to a server associated with the file system and a wait time within the server to schedule the renaming.