André Brinkmann

Learn More
Data deduplication systems discover and remove redundancies between data blocks. The search for redundant data blocks is often based on hashing the content of a block and comparing the resulting hash value with already stored entries inside an index. The limited random IO performance of hard disks limits the overall throughput of such systems, if the index(More)
In this paper we consider the problem of delivering dynamically changing input streams in dynamically changing networks where both the topology and the input streams can change in an unpredictable way. In particular, we present two simple distributed balancing algorithms (one for packet injections and one for flow injections) and show that for the case of a(More)
ABSTRACT In the last ouple of years a dramati growth of enterprise data storage apa ity an be observed. As a result, new strategies have been sought that allow servers and storage being entralized to better manage the explosion of data and the overall ost of ownership. Nowadays, a ommon approa h is to ombine storage devi es into a dedi ated network that is(More)
In this paper we study the problem of designing compact, adaptive strategies for the distribution of objects among a heterogeneous set of servers. Ideally, such a strategy should allow the computation of the position of an object with a low time and space complexity, and it should be able to adapt with a near-minimum amount of replacements of objects to(More)
In this paper we study the problem of designing compact, adaptive strategies for the distribution of objects among a heterogeneous set of servers. Ideally, such a strategy should allow the computation of the position of an object with a low time and space complexity, and it should be able to adapt with a near-minimum amount of replacements of objects to(More)
In this paper we consider the problem of routing packets in dynamically changing networks, concentrating<lb>on two different modes: anycasting and multicasting. In anycasting, a packet has a set of destinations but<lb>only has to reach any one of them, whereas in multicasting, a packet has a set of destinations and has to<lb>reach all of them. Both(More)
The success of server virtualization has let to the deployment of a huge number of virtual machines in today's data centers, making a manual virtualization management very laborintensive. The development of appropriate management solutions is hindered by the various management interfaces of different hypervisors. Therefore, a uniform management can be(More)
Deduplication is a storage saving technique that is highly successful in enterprise backup environments. On a file system, a single data block might be stored multiple times across different files, for example, multiple versions of a file might exist that are mostly identical. With deduplication, this data replication is localized and redundancy is removed(More)
Data deduplication is an important component of enterprise storage environments. The throughput and capacity limitations of single node solutions have led to the development of clustered deduplication systems. Most implemented clustered inline solutions are trading deduplication ratio versus performance and are willing to miss opportunities to detect(More)