Sciweavers

1110 search results - page 15 / 222
» New Approximation Results for Resource Replication Problems
Sort
View
P2P
2005
IEEE
112views Communications» more  P2P 2005»
15 years 5 months ago
Randomized Protocols for Duplicate Elimination in Peer-to-Peer Storage Systems
Distributed peer-to-peer systems rely on voluntary participation of peers to effectively manage a storage pool. In such systems, data is generally replicated for performance and a...
Ronaldo A. Ferreira, Murali Krishna Ramanathan, An...
INFOCOM
2009
IEEE
15 years 6 months ago
Forward Correction and Fountain codes in Delay Tolerant Networks
Abstract—Delay tolerant Ad-hoc Networks leverage the mobility of relay nodes to compensate for lack of permanent connectivity and thus enable communication between nodes that are...
Eitan Altman, Francesco De Pellegrini
CCGRID
2007
IEEE
15 years 5 months ago
Study of Different Replica Placement and Maintenance Strategies in Data Grid
Data replication is an excellent technique to move and cache data close to users. By replication, data access performance can be improved dramatically. One of the challenges in da...
Rashedur M. Rahman, Ken Barker, Reda Alhajj
FGCS
2008
135views more  FGCS 2008»
14 years 11 months ago
An on-line replication strategy to increase availability in Data Grids
Data is typically replicated in a Data Grid to improve the job response time and data availability. Strategies for data replication in a Data Grid have previously been proposed, b...
Ming Lei, Susan V. Vrbsky, Xiaoyan Hong
WADS
2005
Springer
187views Algorithms» more  WADS 2005»
15 years 5 months ago
Improved Approximation Algorithms for Metric Maximum ATSP and Maximum 3-Cycle Cover Problems
We consider an APX-hard variant (∆-Max-ATSP) and an APX-hard relaxation (Max-3-DCC) of the classical traveling salesman problem. We present a 31 40-approximation algorithm for â...
Markus Bläser, L. Shankar Ram, Maxim Sviriden...