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

Network Denial of Service (DoS) attacks are increasing in frequency, severity and sophistication, making it desirable to measure the resilience of systems to DoS attacks. In this paper, we propose a simulation-based methodology and apply it to attacks on object location services such as DNS. Our results allow us to contrast the DoS resilience of three distinct architectures for object location.

/pdf/quantifying-network-denial-of-service-a-location-service-2z9qoefgo1.pdf

Quantifying Network Denial of Service: A Location Service Case Study

To meet the global challenge of reducing greenhouse gas emissions and the explosion demand of wireless data traffic, green architecture design is becoming a critical issue for mobile network operators. Heterogeneous deployments of different cell types have been used to fulfill the challenges mentioned above. In this respect, a critical concern for operators is how to deploy small cells in a green manner such that the global network is cost-effective as well as energy-efficient. In this paper, we characterize the energy efficiency (EE) and deployment efficiency (DE) for heterogenous wireless networks, taking into account realistic network power consumption model and dynamic network configuration. We give first order closed form analysis to address this issue and show that a proper density of small cells is required to obtain the maximum achievable EE/DE. Our study also provides useful insights for the modeling and deployment of future green wireless networks.

Energy efficiency and deployment efficiency tradeoff for heterogeneous wireless networks

Modes of magma emplacement may provide key information on geodynamic-tectonic settings of magmatism, when the threshold of magma volume and duration of emplacement process is crossed, brittle/ductile crustal deformation behavior, and volumes and rates of magma transfer in the crust. The majority of upper-crustal granitic intrusions are incrementally emplaced as laccoliths or sills, while midcrustal or deeper-level granitic intrusions appear to be predominantly emplaced as sills or lopoliths, but relatively few examples have been studied. We present a case study on the Jurassic Qitianling pluton from South China, which was constructed in the upper part of the middle crust (at a depth of ~10-15 km). To characterize its emplacement mechanism and evolution, we have combined field and microscopic observations, Anisotropy of Magnetic Susceptibility measurements and Bouguer gravity anomaly modeling. The main findings are (1) the generally undeformed granite-country rock contacts with a narrow thermal aureole, (2) irregularly wavy and gradational contacts between the main granite facies, (3) dominant subhorizontal magnetic fabrics in the granites with a scattered magnetic foliation, (4) rare occurrence of dykes, and (5) a subcircular surface and lopolith-like pluton geometry. Accordingly, we suggest that the Qitianling pluton forms an ~25-km wide and ~5-km thick lopolith that was incrementally emplaced during a period of tectonic quiescence, most likely by under-accretion of multiple magma sheets deflected from magma pulses that ascended through pipe-like channels. The mineralogical and compositional variation of the pluton may be the result of in situ fractionation, fractionation at deeper crustal level, or variation in source-derived melt compositions.

/pdf/incremental-emplacement-of-the-late-jurassic-midcrustal-nd2vz08u69.pdf

Incremental Emplacement of the Late Jurassic Midcrustal, Lopolith-Like Qitianling Pluton, South China, Revealed by AMS and Bouguer Gravity Data

In this paper, both configuration of active radio frequency (RF) chains and resource allocation are investigated for improving energy efficiency of downlink multiple-input-multiple-output (MIMO) orthogonal frequency division multiple access (OFDMA) systems. We first formulate an optimization problem to minimize the total power consumed at the base station with the maximum transmit power constraint and ergodic capacity constraints from multiple users. Then a two-step suboptimal algorithm is proposed. Specifically, the continuous variable optimization problem is first solved, and then a discretization algorithm is presented to obtain the number of active RF chains and the number of subcarriers allocated to each user. Simulation results demonstrate that the proposed algorithm can provide significant power-saving gain over the all-on RF chain scheme and the adaptive subcarrier allocation helps to save more power.

Energy-Efficient MIMO-OFDMA Systems Based on Switching off RF Chains

The exponential growth of data demands scalable and adaptable infrastructures for indexing and searching a huge amount of data sources with high accuracy and efficiency. Existing centralized search engines are not scalable and suffer from single-point-offailures. The recent work on P2P index construction partitions the document vectors either randomly or statically, making it difficult to tradeoff between search efficiency and accuracy. In this position paper, we propose a peer-to-peer (P2P) IR framework (termed as P2PIR) that leverages a novel two-phase distributed semantic indexing on top of distributed hash tables (DHT). The distributed semantic clustering of P2PIR leads to good semantic locality on index placement so that the indices of similar documents are placed together or near to each other. The semantic locality enables smoother tradeoff between search accuracy and efficiency, as well as incremental adaptation to document and semantics changes. In addition, P2PIR allows for sophisticated retrieval techniques, e.g., query refinement, feedback and personalized search for better usability. A prototype of P2PIR is currently under development, which can be applied for general web retrieval and domain-specific applications such as a distributed electric medical records system.

Yan Chen

Papers

Quantifying Network Denial of Service: A Location Service Case Study

Energy efficiency and deployment efficiency tradeoff for heterogeneous wireless networks

Incremental Emplacement of the Late Jurassic Midcrustal, Lopolith-Like Qitianling Pluton, South China, Revealed by AMS and Bouguer Gravity Data

Energy-Efficient MIMO-OFDMA Systems Based on Switching off RF Chains

A Scalable Semantic Indexing Framework for Peer-to-Peer Information Retrieval