A fundamental problem that confronts peer-to-peer applications is to efficiently locate the node that stores a particular data item. This paper presents Chord, a distributed lookup protocol that addresses this problem. Chord provides support for just one operation: given a key, it maps the key onto a node. Data location can be easily implemented on top of Chord by associating a key with each data item, and storing the key/data item pair at the node to which the key maps. Chord adapts efficiently as nodes join and leave the system, and can answer queries even if the system is continuously changing. Results from theoretical analysis, simulations, and experiments show that Chord is scalable, with communication cost and the state maintained by each node scaling logarithmically with the number of Chord nodes.

Chord: A scalable peer-to-peer lookup service for internet applications

This paper presents the design and evaluation of Pastry, a scalable, distributed object location and routing substrate for wide-area peer-to-peer ap- plications. Pastry performs application-level routing and object location in a po- tentially very large overlay network of nodes connected via the Internet. It can be used to support a variety of peer-to-peer applications, including global data storage, data sharing, group communication and naming. Each node in the Pastry network has a unique identifier (nodeId). When presented with a message and a key, a Pastry node efficiently routes the message to the node with a nodeId that is numerically closest to the key, among all currently live Pastry nodes. Each Pastry node keeps track of its immediate neighbors in the nodeId space, and notifies applications of new node arrivals, node failures and recoveries. Pastry takes into account network locality; it seeks to minimize the distance messages travel, according to a to scalar proximity metric like the number of IP routing hops. Pastry is completely decentralized, scalable, and self-organizing; it automatically adapts to the arrival, departure and failure of nodes. Experimental results obtained with a prototype implementation on an emulated network of up to 100,000 nodes confirm Pastry's scalability and efficiency, its ability to self-organize and adapt to node failures, and its good network locality properties.

/pdf/pastry-scalable-decentralized-object-location-and-routing-1u2equbbbp.pdf

Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems

Hash tables - which map "keys" onto "values" - are an essential building block in modern software systems. We believe a similar functionality would be equally valuable to large distributed systems. In this paper, we introduce the concept of a Content-Addressable Network (CAN) as a distributed infrastructure that provides hash table-like functionality on Internet-like scales. The CAN is scalable, fault-tolerant and completely self-organizing, and we demonstrate its scalability, robustness and low-latency properties through simulation.

https://www.cs.sjtu.edu.cn/~gchen/course/acn/Reading/CAN.pdf

A scalable content-addressable network

A review of the geologic history of the Himalayan-Tibetan orogen suggests that at least 1400 km of north-south shortening has been absorbed by the orogen since the onset of the Indo-Asian collision at about 70 Ma. Significant crustal shortening, which leads to eventual construction of the Cenozoic Tibetan plateau, began more or less synchronously in the Eocene (50–40 Ma) in the Tethyan Himalaya in the south, and in the Kunlun Shan and the Qilian Shan some 1000–1400 km in the north. The Paleozoic and Mesozoic tectonic histories in the Himalayan-Tibetan orogen exerted a strong control over the Cenozoic strain history and strain distribution. The presence of widespread Triassic flysch complex in the Songpan-Ganzi-Hoh Xil and the Qiangtang terranes can be spatially correlated with Cenozoic volcanism and thrusting in central Tibet. The marked difference in seismic properties of the crust and the upper mantle between southern and central Tibet is a manifestation of both Mesozoic and Cenozoic tectonics. The form...

Geologic Evolution of the Himalayan-Tibetan Orogen

Reliability at massive scale is one of the biggest challenges we face at Amazon.com, one of the largest e-commerce operations in the world; even the slightest outage has significant financial consequences and impacts customer trust. The Amazon.com platform, which provides services for many web sites worldwide, is implemented on top of an infrastructure of tens of thousands of servers and network components located in many datacenters around the world. At this scale, small and large components fail continuously and the way persistent state is managed in the face of these failures drives the reliability and scalability of the software systems.This paper presents the design and implementation of Dynamo, a highly available key-value storage system that some of Amazon's core services use to provide an "always-on" experience. To achieve this level of availability, Dynamo sacrifices consistency under certain failure scenarios. It makes extensive use of object versioning and application-assisted conflict resolution in a manner that provides a novel interface for developers to use.

/pdf/dynamo-amazon-s-highly-available-key-value-store-2ozfk43ou4.pdf

Dynamo: amazon's highly available key-value store

Third-party JavaScript offers much more diversity to Web and its applications but also introduces new threats. Those scripts cannot be completely trusted and executed with the privileges given to host web sites. Due to incomplete virtualization and lack of tracking all the data flows, all the existing works in this area can secure only a subset of third-party JavaScript. At the same time, because of the existence of not so well documented browser quirks, attacks may be encoded in non standard HTML/JavaScript so that they can bypass existing approaches as these approaches will parse third-party JavaScript twice, at both server and client side.In this paper, we propose Virtual Browser, a completely virtualized environment within existing browsers for executing untrusted third-party code. We secure complete JavaScript, including all the hard-to-secure functions of JavaScript programs, such as with and eval. Since this approach parses scripts only once, there is no possibility of attacks being executed through browser quirks. We first completely isolate Virtual Browser from the native browser components and then introduce communication by adding data flows carefully examined for security.

/pdf/virtual-browser-a-web-level-sandbox-to-secure-third-party-2iwucv7s2g.pdf

Virtual browser: a web-level sandbox to secure third-party JavaScript without sacrificing functionality

Mobile users are increasingly becoming targets of malware infections and scams. In order to curb such attacks it is important to know how these attacks originate. We take a previously unexplored step in this direction. Numerous in-app advertisements work at this interface: when the user taps on the advertisement, she is led to a web page which may further redirect until the user reaches the final destination. Even though the original applications may not be malicious, the Web destinations that the user visits could play an important role in propagating attacks. We develop a systematic static analysis methodology to find ad libraries embed in applications and dynamic analysis methodology consisting of three components related to triggering web links, detecting malware and scam campaigns, and determining the provenance of such campaigns reaching the user. Our static analysis system identified 242 different ad libraries and dynamic analysis system was deployed for a two-month period and analyzed over 600,000 applications while triggering a total of about 1.5 million links in applications to the Web. We gain a general understanding of attacks through the app-web interface and make several interesting findings including a rogue antivirus scam, free iPad scams, and advertisements propagating SMS trojans.

Understanding In-App Ads and Detecting Hidden Attacks through the Mobile App-Web Interface

Future urban waterlogging simulation based on LULC forecast model: a case study in Haining City, China

All-inorganic halide perovskites, as a dominant member of the perovskite family, have been proven to be excellent semiconductors due to the great successes for solar cells, light-emitting diodes, photodetectors, and nanocrystal photocatalysts. Despite the remarkable advances in those fields, there are few research studies focusing on gas and humidity-sensing performances, especially for pure CsPbBr3 and heterogeneous CsPbBr3@MoS2 composites. Here, we first report a valuable CsPbBr3 sensor prepared by electrospinning, and the excellent gas sensing performances are investigated. The CsPbBr3 sensor can quickly and effectively detect ethanolamine at room temperature. The response time is only 16 s, and the response to 100 ppm ethanolamine is as high as 29.87, besides the excellent repeatability and good stability. The theoretical detection limit is estimated to be 21 ppb. Furthermore, considering the irreplaceable role of heterostructures in regulating the electronic structure and supporting rich reaction boundaries, we also actively explored the EA sensitivity of inorganic CsPbBr3-based heterogeneous composites CsPbBr3@MoS2. At the same time, the roles of the critical capping agents OA and OAm are systematically investigated. This work demonstrates the great potential of all-inorganic halide perovskites in promising volatile organic compound detection.

CsPbBr3-Based Nanostructures for Room-Temperature Sensing of Volatile Organic Compounds.

Full-duplex (FD) communications benefit from recent breakthroughs in analog and digital signal processing and demonstrate nearly doubled spectrum efficiency for point-to-point links with beyond 100 dB self-interference cancellation capability. However, FD cellular networks with base stations (BSs) in FD mode and user terminals (UEs) in half-duplex mode also introduce intra-cell inter-UE interference and other kinds of interference, which might even eat up the potential gain. In this paper, we propose to take advantage of power control and inter-UE interference cancellation (IC) techniques to cope with the bothersome intra-cell inter-UE interference. We verify that the power control solution for single-cell FD network with a given user pair exhibits an interesting binary feature, that is, either both the BS and the uplink UE transmit at the maximum power or one of them completely mutes to achieve the optimal sum rate. Moreover, the binary feature holds even when inter-UE IC is applied, thus showing appealing computational efficiency. We also demonstrate significant performance improvement by applying binary power control with inter-UE IC to both singlecell and multi-cell FD networks.

Yan Chen

Papers

Virtual browser: a web-level sandbox to secure third-party JavaScript without sacrificing functionality

Understanding In-App Ads and Detecting Hidden Attacks through the Mobile App-Web Interface

Future urban waterlogging simulation based on LULC forecast model: a case study in Haining City, China

CsPbBr3-Based Nanostructures for Room-Temperature Sensing of Volatile Organic Compounds.

Binary power control for full-duplex networks