Seungjoon Lee

Efficient geographic routing in multihop wireless networks

We propose a new link metric called normalized advance (NADV) for geographic routing in multihop wireless networks. NADV selects neighbors with the optimal trade-off between proximity and link cost. Coupled with the local next hop decision in geographic routing, NADV enables an adaptive and efficient cost-aware routing strategy. Depending on the objective or message priority, applications can use the NADV framework to minimize various types of link cost.We present efficient methods for link cost estimation and perform detailed simulations in diverse scenarios. Our results show that NADV outperforms current schemes in many aspects: for example, in high noise environments with frequent packet losses, the use of NADV leads to 81% higher delivery ratio. When compared to centralized routing under certain settings, geographic routing using NADV finds paths whose cost is close to the optimum.

Network function virtualization: Challenges and opportunities for innovations

Network function virtualization was recently proposed to improve the flexibility of network service provisioning and reduce the time to market of new services. By leveraging virtualization technologies and commercial off-the-shelf programmable hardware, such as general-purpose servers, storage, and switches, NFV decouples the software implementation of network functions from the underlying hardware. As an emerging technology, NFV brings several challenges to network operators, such as the guarantee of network performance for virtual appliances, their dynamic instantiation and migration, and their efficient placement. In this article, we provide a brief overview of NFV, explain its requirements and architectural framework, present several use cases, and discuss the challenges and future directions in this burgeoning research area.

Cooperative peer groups in NICE

A distributed scheme for trust inference in peer-to-peer networks is presented. Our work is in context of the NICE system, which is a platform for implementing cooperative applications over the Internet. We describe a technique for efficiently storing user reputation information in a completely decentralized manner, and show how this information can be used to efficiently identify noncooperative users in NICE. We present a simulation based study of our algorithms, in which we show our scheme scales to thousands of users using modest amounts of storage, processing, and bandwidth at any individual node. Lastly, we show that our scheme is robust and can form cooperative groups in systems where the vast majority of users are malicious.

Resilient multicast using overlays

We introduce Probabilistic Resilient Multicast (PRM): a multicast data recovery scheme that improves data delivery ratios while maintaining low end-to-end latencies. PRM has both a proactive and a reactive components; in this paper we describe how PRM can be used to improve the performance of application-layer multicast protocols especially when there are high packet losses and host failures. Through detailed analysis in this paper, we show that this loss recovery technique has efficient scaling properties-the overheads at each overlay node asymptotically decrease to zero with increasing group sizes.As a detailed case study, we show how PRM can be applied to the NICE application-layer multicast protocol. We present detailed simulations of the PRM-enhanced NICE protocol for 10000 node Internet-like topologies. Simulations show that PRM achieves a high delivery ratio (>97%) with a low latency bound (600 ms) for environments with high end-to-end network losses (1%-5%) and high topology change rates (5 changes per second) while incurring very low overheads (<5%).

Optimal content placement for a large-scale VoD system

IPTV service providers offering Video-on-Demand currently use servers at each metropolitan office to store all the videos in their library. With the rapid increase in library sizes, it will soon become infeasible to replicate the entire library at each office. We present an approach for intelligent content placement that scales to large library sizes (e.g., 100 Ks of videos). We formulate the problem as a mixed integer program (MIP) that takes into account constraints such as disk space, link bandwidth, and content popularity. To overcome the challenges of scale, we employ a Lagrangian relaxation-based decomposition technique combined with integer rounding. Our technique finds a near-optimal solution (e.g., within 1%-2%) with orders of magnitude speedup relative to solving even the linear programming (LP) relaxation via standard software. We also present simple strategies to address practical issues such as popularity estimation, content updates, short-term popularity fluctuation, and frequency of placement updates. Using traces from an operational system, we show that our approach significantly outperforms simpler placement strategies. For instance, our MIP-based solution can serve all requests using only half the link bandwidth used by least recently used (LRU) or least frequently used (LFU) cache replacement policies. We also investigate the tradeoff between disk space and network bandwidth.

Raman study of electric-field-induced first-order metal-insulator transition in VO2-based devices

An abrupt first-order metal-insulator transition (MIT) without structural phase transition is first observed by current-voltage measurements and micro-Raman scattering experiments, when a DC electric field is applied to a Mott insulator VO_2 based two-terminal device. An abrupt current jump is measured at a critical electric field. The Raman-shift frequency and the bandwidth of the most predominant Raman-active A_g mode, excited by the electric field, do not change through the abrupt MIT, while, they, excited by temperature, pronouncedly soften and damp (structural MIT), respectively. This structural MIT is found to occur secondarily.An abrupt first-order metal-insulator transition (MIT) as a current jump has been observed by applying a dc electric field to Mott insulator VO2-based two-terminal devices. The size of the jumps was measured to be asymmetrical depending on the direction of the applied voltage due to heating effects. The structure of VO2 is investigated by micro-Raman scattering experiments. An analysis of the Raman-active Ag modes at 195 and 222cm−1, explained by pairing and tilting of V cations, and 622cm−1, shows that the modes below a low compliance (restricted) current do not change when the MIT occurs, whereas a structural phase transition above the low compliance current is found to occur secondarily, due to heating effects in the device induced by the MIT. The MIT has applications in the development of high-speed and high-gain switching devices.

Neighbor supporting ad hoc multicast routing protocol

An ad hoc network is a multi-hop wireless network formed by a collection of mobile nodes without the intervention of fixed infrastructure. Limited bandwidth and a high degree of mobility require that routing protocols for ad hoc networks be robust, simple, and energy-conserving. This paper proposes a new ad hoc multicast routing protocol called neighbor-supporting multicast protocol (NSMP). NSMP adopts a mesh structure to enhance resilience against mobility. NSMP utilizes node locality to reduce the overhead of route failure recovery and mesh maintenance. NSMP also attempts to improve route efficiency and reduce data transmissions. Our simulation results show that NSMP delivers packets efficiently while substantially reducing control overhead in various environments.

Robust routing in wireless ad hoc networks

A wireless ad hoc network is a collection of mobile nodes with no fixed infrastructure. The absence of a central authorization facility in dynamic and distributed environments requires collaboration among nodes. When a source searches for a route to a destination, an intermediate node can reply with its cached entry. To strengthen correctness of such a routing discovery process, we propose a method in which the intermediate node requests its next hop to send a confirmation message to the source. After receiving both a route reply and confirmation message, the source determines the validity of a path according to its policy. As a result, this strategy discourages malicious nodes from intercepting packets. Simulation results show a remarkable improvement in throughput (30% higher delivery ratio and 10% less data transmission overhead) with a moderate increase of control messages.

Modeling channel popularity dynamics in a large IPTV system

Understanding the channel popularity or content popularity is an important step in the workload characterization for modern information distribution systems (e.g., World Wide Web, peer-to-peer file-sharing systems, video-on-demand systems). In this paper, we focus on analyzing the channel popularity in the context of Internet Protocol Television (IPTV). In particular, we aim at capturing two important aspects of channel popularity - the distribution and temporal dynamics of the channel popularity. We conduct in-depth analysis on channel popularity on a large collection of user channel access data from a nation-wide commercial IPTV network. Based on the findings in our analysis, we choose a stochastic model that finds good matches in all attributes of interest with respect to the channel popularity. Furthermore, we propose a method to identify subsets of user population with inherently different channel interest. By tracking the change of population mixtures among different user classes, we extend our model to a multi-class population model, which enables us to capture the moderate diurnal popularity patterns exhibited in some channels. We also validate our channel popularity model using real user channel access data from commercial IPTV network.

Cost-effective mass fabrication of multilevel diffractive optical elements by use of a single optical exposure with a gray-scale mask on high-energy beam-sensitive glass

We present a method for reproducing diffractive optical elements in quantity. The method is compatible with VLSI microfabrication techniques and involves generating a gray-scale mask. The gray-scale mask is employed in an optical aligner to expose an analog photoresist on any environmentally durable substrate, e.g., glass, quartz, semiconductor, or metal, one exposure for each diffractive optical element. After copies of the mask on the photoresist are developed, many substrates can be processed in parallel in a chemically assisted ion-beam etcher to transfer the microstructures on the analog resists simultaneously onto the surfaces of the substrates.