Daniel Lowe Wheeler, Dropbox Inc.

In this section, we present the architecture and implementation of a distributed hash table DDS. Figure 2 illustrates our hash table's architecture, which consists of the following components: Client: ...

Traditionally, uniprocessors have not been able to saturate the network with the introduction of each new Ethernet bandwidth generation, but exponential gains in uniprocessor performance have always ...

Figure 2: Simplified model of wildfire worm propagation. Figure 2 illustrates the propagation dynamics of wildfire worms. Three access points A, B and C provide wireless coverage to end users, e.g.

To compare connection parallelism in the same framework as message parallelism, FreeBSD 7 was modified to support two variants of connection-based parallelism (ConnP) that differ in how they serialize ...

A storage server for continuous media is usually based on disk arrays like RAID. However, this kind of architecture does not provide any flexibility and scalability which are essential for storage ...

Network performance is increasingly important in all types of modern computer systems. Furthermore, architectural trends are pushing future microprocessors away from uniprocessor designs and toward ...

The high cost of IT operations has led to an intense focus on the automation of processes for IT service delivery. We take the heretical position that automation does not necessarily reduce the cost ...

Figure: High-level view of a DDS: a DDS is a self-managing, cluster-based data repository. All service instances (S) in the cluster see the same consistent image of the DDS; as a result, any WAN ...

We have developed a set of defenses based on the detection of abnormal combinations of network events. For example, to detect the injection of a DNS reply, we use bookkeeping of request-reply pairs to ...