Sciweavers

183 search results - page 4 / 37
» Continuous Replica Placement schemes in distributed systems
Sort
View
IPPS
2007
IEEE
14 years 1 days ago
Implementing Replica Placements: Feasibility and Cost Minimization
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 ...
Thanasis Loukopoulos, Nikos Tziritas, Petros Lamps...
IPPS
2009
IEEE
14 years 12 days ago
Robust CDN replica placement techniques
—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...
TPDS
2010
107views more  TPDS 2010»
13 years 4 months ago
Optimal Resource Placement in Structured Peer-to-Peer Networks
—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...
JSS
2000
76views more  JSS 2000»
13 years 5 months ago
Data placement schemes in replicated mirrored disk systems
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...
Athena Vakali, Yannis Manolopoulos
IPPS
2005
IEEE
13 years 11 months ago
On the Optimal Placement of Secure Data Objects over Internet
Secret sharing algorithms have been used for intrusion tolerance, which ensure the confidentiality, integrity and availability of critical information. However, dynamically changi...
Manghui Tu, Peng Li, Qingkai Ma, I-Ling Yen, Farok...