Abstract
Data server replication is a promising technique for improving system performance in a large distributed network. Recently, transparent data replication has been gaining increasing attention due to its low management overheads incurred. However, research on replica placement strategies for transparent data replication thus far focused on read operations only. In this paper, we consider examination for read/write applications of two data replica placement problems (i.e., without and with constraint on the number of replicas respectively) for a single object on the deployed transparent replication proxies. The performance objective is to minimize the total data transfer cost for a target server under a given traffic pattern. Optimal solutions for these two problems are proposed, with complexities of O(N) and O(N+N/sub o/P/sub o/M/sup 2/) respectively. Numerical results show that the proposed solutions are very efficient.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
