Sciweavers

360 search results - page 64 / 72
» Distributed Network Querying with Bounded Approximate Cachin...
Sort
View
TKDE
2010
184views more  TKDE 2010»
14 years 7 months ago
The Dynamic Bloom Filters
—A Bloom filter is an effective, space-efficient data structure for concisely representing a set, and supporting approximate membership queries. Traditionally, the Bloom filter a...
Deke Guo, Jie Wu, Honghui Chen, Ye Yuan, Xueshan L...
SIGCOMM
2006
ACM
15 years 3 months ago
Planet scale software updates
Fast and effective distribution of software updates (a.k.a. patches) to millions of Internet users has evolved into a critical task over the last years. In this paper, we characte...
Christos Gkantsidis, Thomas Karagiannis, Milan Voj...
ICPP
2002
IEEE
15 years 2 months ago
Optimal Video Replication and Placement on a Cluster of Video-on-Demand Servers
A cost-effective approach to building up scalable Videoon-Demand (VoD) servers is to couple a number of VoD servers together in a cluster. In this article, we study a crucial vide...
Xiaobo Zhou, Cheng-Zhong Xu
SPAA
2004
ACM
15 years 2 months ago
The effect of faults on network expansion
We study the problem of how resilient networks are to node faults. Specifically, we investigate the question of how many faults a network can sustain and still contain a large (i...
Amitabha Bagchi, Ankur Bhargava, Amitabh Chaudhary...
SPAA
2004
ACM
15 years 2 months ago
On achieving optimized capacity utilization in application overlay networks with multiple competing sessions
In this paper, we examine the problem of large-volume data dissemination via overlay networks. A natural way to maximize the throughput of an overlay multicast session is to split...
Yi Cui, Baochun Li, Klara Nahrstedt