Given two replication schemes old X and new X , the Replica Transfer Scheduling Problem (RTSP) aims at reaching new X , starting from old X , with minimal implementation cost. In ...
—Creating replicas of frequently accessed data objects across a read-intensive Content Delivery Network (CDN) can result in reduced user response time. Because CDNs often operate...
Samee Ullah Khan, Anthony A. Maciejewski, Howard J...
—Utilizing the skewed popularity distribution in P2P systems, common in Gnutella and KazaA like P2P applications, we propose an optimal resource (replica or link) placement strat...
Weixiong Rao, Lei Chen 0002, Ada Wai-Chee Fu, Guor...
In the present paper, we study the most frequent data placement schemes, i.e., the organ-pipe and camel arrangements, in a mirrored disk system which supports cylinder replication...
Secret sharing algorithms have been used for intrusion tolerance, which ensure the confidentiality, integrity and availability of critical information. However, dynamically changi...