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

A 5G mobile network has evolved from a cell centric radio access network to a user centric one. A user-centric no-cell (UCNC) framework has been proposed, which enables physical layer coordination over a large number of transmission and reception points for each mobile user to always experience cell-center-like communications. This paper presents some key technologies in the UCNC framework. The focus is on proof of concept of UL grant-free transmissions in the UCNC architecture. Massive connectivity supporting a huge number of devices is one of the three important scenarios in 5G networks. The challenges to support massive connectivity lie in the cost of signaling overhead and transmission latency. An uplink grant-free transmission based on sparse code multiple access (SCMA) design is proposed. The proposed scheme can provide different levels of overloading to efficiently meet the massive connectivity requirements. Grant-free transmission conducted in RRC connected state can reduce signaling overhead, while in energy conserved operation (ECO) state, it can significantly reduce the user plane transmission latency. Extensive laboratory testing has been conducted in a collaborative project of Huawei and Telefonica to verify the performance matrices. Taking LTE as a baseline for comparison purposes, it is shown that the signaling overhead by using uplink grant-free transmission can be reduced by around 80% and the user plane transmission latency in ECO state can be reduced by around 93%. Moreover, massive connectivity is efficiently supported with the SCMA scheme that yields around 230% gain over OFDMA in terms of supported active users.

PoC of SCMA-Based Uplink Grant-Free Transmission in UCNC for 5G

To contribute to the apparent polar wander path (APWP) of the South China Block and Eurasia in general, we collected paleomagnetic samples from Mesozoic red beds around the city of Ya' an (30°N, 103°E) in the western tip of the Sichuan Basin. In this paper we present the results from 373 oriented cores taken from one section representing 3 km of sedimentary rocks. The section is dated with continental ostracods and with a magnetostratigraphic correlation between a densely sampled 272-m sequence and the polarity time scale, giving an upper Jurassic to Upper Cretaceous or Lower Tertiary age. The remanent direction is remarkably stable throughout the section (D=2.0°, I=34.2°, k=63.1,α95=3.6°, N=26/28 sites). While this fact might suggest that the section has been remagnetized, paleomagnetic and rock magnetic tests indicate that the remanence is primary. The pole position (78.6°N, 273.4°E, dp=2.4°, dm=4.1°) corresponds to a rather low paleolatitude (λ=18.8°±2.4°) but is consistent with other Cretaceous poles from China. If one accepts the Eurasian APWP of Irving and Irving (1982), this result would imply that more than 1000 km of shortening took place between South China and Eurasia, following the acquisition of the remanence. However, there is no geological evidence for this large shortening. We propose that the remanence was acquired within the time corresponding to the tip of the hairpin turn (∼150–50 Ma) in the revised APWP of Besse and Courtillot (this issue). The local geology suggests that the syncline from which the samples were taken has been rotated by 15°±5° counterclockwise, which is reflected in a similar discrepancy between the measured paleodeclination and that predicted by the Besse and Courtillot (this issue) Eurasian APWP. After correcting for this rotation, the pole position is 70.9°N, 225.2°E (dp=2.4°, dm=6.5°). We conclude that Eurasia was fully assembled by the end of the Jurassic and that the Mesozoic Eurasian hairpin turn is a real feature.

A Cretaceous pole from south China, and the Mesozoic hairpin turn of the Eurasian apparent polar wander path

Overlay network monitoring enables distributed Internet applications to detect and recover from path outages and periods of degraded performance within seconds. For an overlay network with n end hosts, existing systems either require O(n2) measurements, and thus lack scalability, or can only estimate the latency but not congestion or failures. Unlike other network tomography systems, we characterize end-to-end losses (this extends to any additive metrics, including latency) rather than individual link losses. We find a minimal basis set of k linearly independent paths that can fully describe all the O(n,2) paths. We selectively monitor and measure the loss rates of these paths, then apply them to estimate the loss rates of all other paths. By extensively studying synthetic and real topologies, we find that for reasonably large n (e.g., 100), k is only in the range of O(n log n). This is explained by the moderately hierarchical nature of Internet routine.Our scheme only assumes the knowledge of underlying IP topology, and any link can become lossy or return to normal. In addition, our technique is tolerant to topology measurement inaccuracies, and is adaptive to topology changes.

/pdf/tomography-based-overlay-network-monitoring-219sipzev6.pdf

Tomography-based overlay network monitoring

Routing in wireless communication systems such as ad hoc networks remains a challenging problem given the limited wireless bandwidth, users' mobility, and potentially large scale. Recently, a thrust of research has addressed these problems-the on- demand routing, geographical routing, and virtual coordinates. In this paper, we focus on geographical routing that has been shown to achieve good scalability without flooding; however, this usually requires the availability of location information and can suffer from poor routing performance and severe dead end problems, especially in sparse networks. Specifically, we propose a new Hop ID routing scheme, which is a virtual coordinate-based routing protocol and does not require any location information. This achieves excellent routing performance comparable with that obtained by the shortest path routing schemes. In addition, we design efficient algorithms for setting up the system and adapt to the node mobility quickly and can effectively route out of dead ends. Extensive analysis and simulation show that the Hop ID-based routing achieves efficient routing for mobile ad hoc networks with various density, irregular topologies, and obstacles.

/pdf/hop-id-a-virtual-coordinate-based-routing-for-sparse-mobile-4vzkk0funv.pdf

Hop ID: A Virtual Coordinate based Routing for Sparse Mobile Ad Hoc Networks

This paper presents a voxel-based biomechanical model for muscle deformation using finite element method (FEM) and volume graphics. Hierarchical voxel meshes are reconstructed from filtered segmented muscle images followed by FEM simulation and volume rendering. Physiological muscle force is considered and linear elastic muscle models for both static and dynamic cases are simulated by FEM. Voxel-based wireframe, polygon surface rendering, and volume rendering techniques are applied to show real-time muscle deformation processes as well as realistic animations.

/pdf/real-time-biomechanically-based-muscle-volume-deformation-3b8aj6w7rx.pdf

Yan Chen

Papers

PoC of SCMA-Based Uplink Grant-Free Transmission in UCNC for 5G

A Cretaceous pole from south China, and the Mesozoic hairpin turn of the Eurasian apparent polar wander path

Tomography-based overlay network monitoring

Hop ID: A Virtual Coordinate based Routing for Sparse Mobile Ad Hoc Networks

Real-time Biomechanically-based Muscle Volume Deformation using FEM