Design of efficient and elastic storage in the cloud

Ph.DDOCTOR OF PHILOSOPH

Mix-ORAM: Using Delegated Shuffles

Oblivious RAM (ORAM) is a key technology for providing private storage and querying on untrusted machines but is commonly seen as impractical due to the high and recurring overhead of the re-randomization, called the eviction, the client incurs. We propose in this work to securely delegate the eviction to semi-trusted third parties to enable any client to accede the ORAM technology and present four different designs inspired by mix-net technologies with reasonable periodic costs

Big Data Processing with Peer-To-Peer Architectures

Ph.DDOCTOR OF PHILOSOPH

Wireless Communication in Data Centers: A Survey

Data centers (DCs) is becoming increasingly an integral part of the computing infrastructures of most enterprises. Therefore, the concept of DC networks (DCNs) is receiving an increased attention in the network research community. Most DCNs deployed today can be classified as wired DCNs as copper and optical fiber cables are used for intra- and inter-rack connections in the network. Despite recent advances, wired DCNs face two inevitable problems; cabling complexity and hotspots. To address these problems, recent research works suggest the incorporation of wireless communication technology into DCNs. Wireless links can be used to either augment conventional wired DCNs, or to realize a pure wireless DCN. As the design spectrum of DCs broadens, so does the need for a clear classification to differentiate various design options. In this paper, we analyze the free space optical (FSO) communication and the 60 GHz radio frequency (RF), the two key candidate technologies for implementing wireless links in DCNs. We present a generic classification scheme that can be used to classify current and future DCNs based on the communication technology used in the network. The proposed classification is then used to review and summarize major research in this area. We also discuss open questions and future research directions in the area of wireless DCs

Grammalepsy

This book is available as open access through the Bloomsbury Open Access programme and is available on www.bloomsburycollections.com. Collecting and recontextualizing writings from the last twenty years of John Cayley's research-based practice of electronic literature, Grammalepsy introduces a theory of aesthetic linguistic practice developed specifically for the making and critical appreciation of language art in digital media. As he examines the cultural shift away from traditional print literature and the changes in our culture of reading, Cayley coins the term “grammalepsy” to inform those processes by which we make, understand, and appreciate language. Framing his previous writings within the overall context of this theory, Cayley eschews the tendency of literary critics and writers to reduce aesthetic linguistic making-even when it has multimedia affordances-to “writing.” Instead, Cayley argues that electronic literature and digital language art allow aesthetic language makers to embrace a compositional practice inextricably involved with digital media, which cannot be reduced to print-dependent textuality

An Optimal Single-Path Routing Algorithm in the Datacenter Network DPillar

DPillar has recently been proposed as a server-centric datacenter network and is combinatorially related to (but distinct from) the well-known wrapped butterfly network. We explain the relationship between DPillar and the wrapped butterfly network before proving that the underlying graph of DPillar is a Cayley graph; hence, the datacenter network DPillar is node-symmetric. We use this symmetry property to establish a single-path routing algorithm for DPillar that computes a shortest path and has time complexity O(k), where k parameterizes the dimension of DPillar (we refer to the number of ports in its switches as n). Our analysis also enables us to calculate the diameter of DPillar exactly. Moreover, our algorithm is trivial to implement, being essentially a conditional clause of numeric tests, and improves significantly upon a routing algorithm earlier employed for DPillar. Furthermore, we provide empirical data in order to demonstrate this improvement. In particular, we empirically show that our routing algorithm improves the average length of paths found, the aggregate bottleneck throughput, and the communication latency. A secondary, yet important, effect of our work is that it emphasises that datacenter networks are amenable to a closer combinatorial scrutiny that can significantly improve their computational efficiency and performance