Sciweavers

1432 search results - page 214 / 287
» Hardness of robust network design
Sort
View
FSTTCS
2009
Springer
16 years 22 days ago
Approximating Fault-Tolerant Group-Steiner Problems
In this paper, we initiate the study of designing approximation algorithms for FaultTolerant Group-Steiner (FTGS) problems. The motivation is to protect the well-studied group-Ste...
Rohit Khandekar, Guy Kortsarz, Zeev Nutov
IPPS
2007
IEEE
16 years 14 days ago
Packet Loss Burstiness: Measurements and Implications for Distributed Applications
Many modern massively distributed systems deploy thousands of nodes to cooperate on a computation task. Network congestions occur in these systems. Most applications rely on conge...
David X. Wei, Pei Cao, Steven H. Low
IPPS
2006
IEEE
16 years 5 days ago
A distributed paging RAM grid system for wide-area memory sharing
Memory-intensive applications often suffer from the poor performance of disk swapping when memory is inadequate. Remote memory sharing schemes, which provide a remote memory that ...
Rui Chu, Nong Xiao, Yongzhen Zhuang, Yunhao Liu, X...
IPPS
2006
IEEE
16 years 5 days ago
A segment-based DSM supporting large shared object space
This paper introduces a software DSM that can extend its shared object space exceeding 4GB in a 32bit commodity cluster environment. This is achieved through the dynamic memory ma...
Benny Wang-Leung Cheung, Cho-Li Wang
FIRBPERF
2005
IEEE
259views Algorithms» more  FIRBPERF 2005»
15 years 11 months ago
Performance Issues in Video Streaming Environments
The main motivation for applying capacity planning techniques to the design of Internet-based video services is that very often these systems incur significant delays that decrea...
Giuliano Casale, Paolo Cremonesi, Giuseppe Serazzi...