arXiv subjects

Ang Chen

Publications and source records attributed to Ang Chen.

48 records · Page 3Linked to original sources

arXiv2021

Shufflecast: An Optical, Data-rate Agnostic and Low-Power Multicast Architecture for Next-Generation Compute Clusters

An optical circuit-switched network core has the potential to overcome the inherent challenges of a conventional electrical packet-switched core of today's compute clusters. As optical circuit switches (OCS) directly handle the photon beams without any optical-electrical-optical (O/E/O) conversion and packet processing, OCS-based network cores have the following desirable properties: a) agnostic to data-rate, b) negligible/zero power consumption, c) no need of transceivers, d) negligible forwarding latency, and e) no need for frequent upgrade. Unfortunately, OCS can only provide point-to-point (unicast) circuits. They do not have built-in support for one-to-many (multicast) communication, yet multicast is fundamental to a plethora of data-intensive applications running on compute clusters nowadays. In this paper, we propose Shufflecast, a novel optical network architecture for next-generation compute clusters that can support high-performance multicast satisfying all the properties of an OCS-based network core. Shufflecast leverages small fanout, inexpensive, passive optical splitters to connect the Top-of-rack (ToR) switch ports, ensuring data-rate agnostic, low-power, physical-layer multicast. We thoroughly analyze Shufflecast's highly scalable data plane, light-weight control plane, and graceful failure handling. Further, we implement a complete prototype of Shufflecast in our testbed and extensively evaluate the network. Shufflecast is more power-efficient than the state-of-the-art multicast mechanisms. Also, Shufflecast is more cost-efficient than a conventional packet-switched network. By adding Shufflecast alongside an OCS-based unicast network, an all-optical network core with the aforementioned desirable properties supporting both unicast and multicast can be realized.

cs.NI↗

arXiv2021

High Velocity Kernel File Systems with Bento

High development velocity is critical for modern systems. This is especially true for Linux file systems which are seeing increased pressure from new storage devices and new demands on storage systems. However, high velocity Linux kernel development is challenging due to the ease of introducing bugs, the difficulty of testing and debugging, and the lack of support for redeployment without service disruption. Existing approaches to high-velocity development of file systems for Linux have major downsides, such as the high performance penalty for FUSE file systems, slowing the deployment cycle for new file system functionality. We propose Bento, a framework for high velocity development of Linux kernel file systems. It enables file systems written in safe Rust to be installed in the Linux kernel, with errors largely sandboxed to the file system. Bento file systems can be replaced with no disruption to running applications, allowing daily or weekly upgrades in a cloud server setting. Bento also supports userspace debugging. We implement a simple file system using Bento and show that it performs similarly to VFS-native ext4 on a variety of benchmarks and outperforms a FUSE version by 7x on 'git clone'. We also show that we can dynamically add file provenance tracking to a running kernel file system with only 15ms of service interruption.

cs.OS↗

arXiv2020

The Design and Implementation of a Verified File System with End-to-End Data Integrity

Despite significant research and engineering efforts, many of today's important computer systems suffer from bugs. To increase the reliability of software systems, recent work has applied formal verification to certify the correctness of such systems, with recent successes including certified file systems and certified cryptographic protocols, albeit using quite different proof tactics and toolchains. Unifying these concepts, we present the first certified file system that uses cryptographic primitives to protect itself against tampering. Our certified file system defends against adversaries that might wish to tamper with the raw disk. Such an "untrusted storage" threat model captures the behavior of storage devices that might silently return erroneous bits as well as adversaries who might have limited access to a disk, perhaps while in transit. In this paper, we present IFSCQ, a certified cryptographic file system with strong integrity guarantees. IFSCQ combines and extends work on cryptographic file systems and formally certified file systems to prove that our design is correct. It is the first certified file system that is secure against strong adversaries that can maliciously corrupt on-disk data and metadata, including attempting to roll back the disk to earlier versions of valid data. IFSCQ achieves this by constructing a Merkle hash tree of the whole disk, and by proving that tampered disk blocks will always be detected if they ever occur. We demonstrate that IFSCQ runs with reasonable overhead while detecting several kinds of attacks.

cs.CR↗

arXiv2019

Generating optical vortex beams by momentum-space polarization vortices centered at bound states in the continuum

An optical vortex (OV) is a beam with spiral wave front and screw phase dislocation. This kind of beams is attracting rising interest in various fields. Here we theoretically proposed and experimentally realized a novel but easy approach to generate optical vortices. We leverage the inherent topological vortex structures of polarization around bound states in the continuum (BIC) in the momentum space of two dimensional periodic structures, e.g. photonic crystal slabs, to induce Pancharatnam-Berry phases to the beams. This new class of OV generators operates in the momentum space, meaning that there is no real-space center of structure. Thus, not only the fabrication but also the practical alignment would be greatly simplified. Any even order of OV, which is actually a quasi-non-diffractive high-order quasi-Bessel beam, at any desired working wavelength could be achieved in principle. The proposed approach expands the application of bound states in the continuum and topological photonics.

physics.optics↗

arXiv2019

Programmable In-Network Security for Context-aware BYOD Policies

Bring Your Own Device (BYOD) has become the new norm in enterprise networks, but BYOD security remains a top concern. Context-aware security, which enforces access control based on dynamic runtime context, holds much promise. Recent work has developed SDN solutions to collect device context for network-wide access control in a central controller. However, the central controller poses a bottleneck that can become an attack target, and processing context changes at remote software has low agility. We present a new paradigm, programmable in-network security (Poise), which is enabled by the emergence of programmable switches. At the heart of Poise is a novel switch primitive, which can be programmed to support a wide range of context-aware policies in hardware. Users of Poise specify concise policies, and Poise compiles them into different instantiations of the security primitive in P4. Compared to centralized SDN defenses, Poise is resilient to control plane saturation attacks, and it dramatically increases defense agility.

cs.NI↗

arXiv2019

Nanophotonic Media for Artificial Neural Inference

We show optical waves passing through a nanophotonic medium can perform artificial neural computing. Complex information, is encoded in the wave front of an input light. The medium transforms the wave front to realize sophisticated computing tasks such as image recognition. At the output, the optical energy is concentrated to well-defined locations, which for example can be interpreted as the identity of the object in the image. These computing media can be as small as tens of wavelengths and offer ultra-high computing density. They exploit sub-wavelength scatterers to realize complex input output mapping beyond the capabilities of traditional nanophotonic devices.

physics.optics↗

arXiv2019

Contra: A Programmable System for Performance-aware Routing

We present Contra, a system for performance-aware routing that can adapt to traffic changes at hardware speeds. While existing work has developed point solutions for performance-aware routing on a fixed topology (e.g., a Fattree) with a fixed routing policy (e.g., use least utilized paths), Contra can be configured to operate seamlessly over any network topology and a wide variety of sophisticated routing policies. Users of Contra write network-wide policies that rank network paths given their current performance. A compiler then analyzes such policies in conjunction with the network topology and decomposes them into switch-local P4 programs, which collectively implement a new, specialized distance-vector protocol. This protocol generates compact probes that traverse the network, gathering path metrics to optimize for the user policy dynamically. Switches respond to changing network conditions at hardware speeds by routing flowlets along the best policy-compliant paths. Our experiments show that Contra scales to large networks, and that in terms of flow completion times, it is competitive with hand-crafted systems that have been customized for specific topologies and policies.

cs.NI↗

arXiv2018

An Historical Analysis of the SEAndroid Policy Evolution

Android adopted SELinux's mandatory access control (MAC) mechanisms in 2013. Since then, billions of Android devices have benefited from mandatory access control security policies. These policies are expressed in a variety of rules, maintained by Google and extended by Android OEMs. Over the years, the rules have grown to be quite complex, making it challenging to properly understand or configure these policies. In this paper, we perform a measurement study on the SEAndroid repository to understand the evolution of these policies. We propose a new metric to measure the complexity of the policy by expanding policy rules, with their abstraction features such as macros and groups, into primitive "boxes", which we then use to show that the complexity of the SEAndroid policies has been growing exponentially over time. By analyzing the Git commits, snapshot by snapshot, we are also able to analyze the "age" of policy rules, the trend of changes, and the contributor composition. We also look at hallmark events in Android's history, such as the "Stagefright" vulnerability in Android's media facilities, pointing out how these events led to changes in the MAC policies. The growing complexity of Android's mandatory policies suggests that we will eventually hit the limits of our ability to understand these policies, requiring new tools and techniques.

cs.CR↗

arXiv2018

Observation of optical states below light cone with compound lattices

For optical systems, states inside the light cone could be detected by far-field measurement, while those below the light cone are not detectable by far-field measurement. A new method for far-field detection has been developed for observing states below the light cone with compound lattices. The basic mechanism involved is that periodic weak scattering leads to band folding, making the states out of the light cone to occur inside. By using polarization-resolved momentum-space imaging spectroscopy the band structures and iso-frequency contours of plasmonic lattices with different dimensions and symmetries are experimentally mapped out, in good agreement with the simulation.

physics.optics↗

arXiv2017

Observing half and integer polarization vortices at band degeneracies

Far-field polarization vortices were recently found on singlet bands in the momentum-space of two-dimensional photonic lattices, also known as the dark states and bound states in continuum. Here, we theoretically proposed and experimentally verified the existence of the polarization vortices at the degenerate points of photonic dispersions, whose vortex cores can be radiative bright states. Half-charged vortices were generated from the Dirac points of π Berry phase and integer-charged vortices were generated from a quadratic degeneracy. Using a home-made polarization-resolved momentum-space imaging spectroscopy, we observed the complete evolution of the splitting from one quadratic point to a pair of Dirac cones by tracking the winding of the polarization vectors and the full spectrum of iso-frequency contours.

physics.optics↗

arXiv2017

Observation of optical vortices in momentum space

Vortex, the winding of a vector field in two dimensions, has its core the field singularity and its topological charge defined by the quantized winding angle of the vector field. Vortices are one of the most fundamental topological excitations in nature, widely known in hair whorls as the winding of hair strings, in fluid dynamics as the winding of velocities, in angular-momentum beams as the winding of phase angle and in superconductors and superfluids as the winding of order parameters. Nevertheless, vortices have hardly been observed other than those in the real space. Although band degeneracies, such as Dirac cones, can be viewed as momentum-space vortices in their mathematical structures, there lacks a well-defined physical observable whose winding number is an arbitrary signed integer. Here, we experimentally observed momentum-space vortices as the winding of far-field polarization vectors in the Brillouin zone (BZ) of periodic plasmonic structures. Using a home-made polarization-resolved momentum-space imaging spectroscopy, we completely map out the dispersion, lifetime and polarization of all radiative states at the visible wavelengths. The momentum space vortices were experimentally identified by their winding patterns in the polarization-resolved iso-frequency contours and their diverging radiative quality factors. Such polarization vortices can exist robustly on any periodic systems of vectorial fields, while they are not captured by the existing topological band theory developed for scaler fields. This work opens up a promising avenue for exploring topological photonics in the momentum space, studying bound states in continuum (BICs), as well as for rendering and steering vector beams and designing high-Q plasmonic resonances.

physics.optics↗

arXiv2013

STor: Social Network based Anonymous Communication in Tor

Anonymity networks hide user identities with the help of relayed anonymity routers. However, the state-of-the-art anonymity networks do not provide an effective trust model. As a result, users cannot circumvent malicious or vulnerable routers, thus making them susceptible to malicious router based attacks (e.g., correlation attacks). In this paper, we propose a novel social network based trust model to help anonymity networks circumvent malicious routers and obtain secure anonymity. In particular, we design an input independent fuzzy model to determine trust relationships between friends based on qualitative and quantitative social attributes, both of which can be readily obtained from existing social networks. Moreover, we design an algorithm for propagating trust over an anonymity network. We integrate these two elements in STor, a novel social network based Tor. We have implemented STor by modifying the Tor's source code and conducted experiments on PlanetLab to evaluate the effectiveness of STor. Both simulation and PlanetLab experiment results have demonstrated that STor can achieve secure anonymity by establishing trust-based circuits in a distributed way. Although the design of STor is based on Tor network, the social network based trust model can be adopted by other anonymity networks.

cs.CR↗