Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Alec Wolman is active.

Publication


Featured researches published by Alec Wolman.


international conference on mobile systems, applications, and services | 2010

MAUI: making smartphones last longer with code offload

Eduardo Cuervo; Aruna Balasubramanian; Dae-Ki Cho; Alec Wolman; Stefan Saroiu; Ranveer Chandra; Paramvir Bahl

This paper presents MAUI, a system that enables fine-grained energy-aware offload of mobile code to the infrastructure. Previous approaches to these problems either relied heavily on programmer support to partition an application, or they were coarse-grained requiring full process (or full VM) migration. MAUI uses the benefits of a managed code environment to offer the best of both worlds: it supports fine-grained code offload to maximize energy savings with minimal burden on the programmer. MAUI decides at run-time which methods should be remotely executed, driven by an optimization engine that achieves the best energy savings possible under the mobile devices current connectivity constrains. In our evaluation, we show that MAUI enables: 1) a resource-intensive face recognition application that consumes an order of magnitude less energy, 2) a latency-sensitive arcade game application that doubles its refresh rate, and 3) a voice-based language translation application that bypasses the limitations of the smartphone environment by executing unsupported components remotely.


symposium on operating systems principles | 1999

On the scale and performance of cooperative Web proxy caching

Alec Wolman; Geoffrey M. Voelker; Nitin Sharma; Neal Cardwell; Anna R. Karlin; Henry M. Levy

While algorithms for cooperative proxy caching have been widely studied, little is understood about cooperative-caching performance in the large-scale World Wide Web environment. This paper uses both trace-based analysis and analytic modelling to show the potential advantages and drawbacks of inter-proxy cooperation. With our traces, we evaluate quantitatively the performance-improvement potential of cooperation between 200 small-organization proxies within a university environment, and between two large-organization proxies handling 23,000 and 60,000 clients, respectively. With our model, we extend beyond these populations to project cooperative caching behavior in regions with millions of clients. Overall, we demonstrate that cooperative caching has performance benefits only within limited population bounds. We also use our model to examine the implications of future trends in Web-access behavior and traffic.


broadband communications, networks and systems | 2004

A multi-radio unification protocol for IEEE 802.11 wireless networks

Atul Adya; Paramvir Bahl; Jitendra Padhye; Alec Wolman; Lidong Zhou

We present a link layer protocol called the multi-radio unification protocol or MUP. On a single node, MUP coordinates the operation of multiple wireless network cards tuned to non-overlapping frequency channels. The goal of MUP is to optimize local spectrum usage via intelligent channel selection in a multihop wireless network. MUP works with standard-compliant IEEE 802.11 hardware, does not require changes to applications or higher-level protocols, and can be deployed incrementally. The primary usage scenario for MUP is a multihop community wireless mesh network, where cost of the radios and battery consumption are not limiting factors. We describe the design and implementation of MUP, and analyze its performance using both simulations and measurements based on our implementation. Our results show that under dynamic traffic patterns with realistic topologies, MUP significantly improves both TCP throughput and user perceived latency for realistic workloads.


acm special interest group on data communication | 2004

Reconsidering wireless systems with multiple radios

Paramvir Bahl; Atul Adya; Jitendra Padhye; Alec Wolman

The tremendous popularity of wireless systems in recent years has led to the commoditization of RF transceivers (radios) whose prices have fallen dramatically. The lower cost allows us to consider using two or more radios in the same device. Given this, we argue that wireless systems that use multiple radios in a collaborative manner dramatically improve system performance and functionality over the traditional single radio wireless systems that are popular today. In this context, we revisit some standard problems in wireless networking, including energy management, capacity enhancement, mobility management, channel failure recovery, and last-hop packet scheduling. We show that a systems approach can alleviate many of the performance and robustness issues prevalent in current wireless LAN systems. We explore the implications of the multi-radio approach on software and hardware design, as well as on algorithmic and protocol research issues. We identify three key design guidelines for constructing multi-radio systems and present results from two systems that we have built. Our experience supports our position that a multi-radio platform offers significant ben-efits for wireless systems.


international conference on computer communications | 2003

An evaluation of scalable application-level multicast built using peer-to-peer overlays

Miguel Castro; Michael B. Jones; Anne-Marie Kermarrec; Antony I. T. Rowstron; Marvin M. Theimer; Helen J. Wang; Alec Wolman

Structured peer-to-peer overlay networks such as CAN, Chord, Pastry, and Tapestry can be used to implement Internet-scale application-level multicast. There are two general approaches to accomplishing this: tree building and flooding. This paper evaluates these two approaches using two different types of structured overlay: 1) overlays which use a form of generalized hypercube routing, e.g., Chord, Pastry and Tapestry, and 2) overlays which use a numerical distance metric to route through a Cartesian hyperspace, e.g., CAN. Pastry and CAN are chosen as the representatives of each type of overlay. To the best of our knowledge, this paper reports the first head-to-head comparison of CAN-style versus Pastry-style overlay networks, using multicast communication workloads running on an identical simulation infrastructure. The two approaches to multicast are independent of overlay network choice, and we provide a comparison of flooding versus tree-based multicast on both overlays. Results show that the tree-based approach consistently outperforms the flooding approach. Finally, for tree-based multicast, we show that Pastry provides better performance than CAN.


international conference on mobile systems, applications, and services | 2007

Wireless wakeups revisited: energy management for voip over wi-fi smartphones

Yuvraj Agarwal; Ranveer Chandra; Alec Wolman; Paramvir Bahl; Kevin Chin; Rajesh K. Gupta

IP based telephony is rapidly gaining acceptance over traditional means of voice communication. Wireless LANs are also becoming ubiquitous due to their inherent ease of deployment and decreasing costs. In enterpriseWi-Fi environments, VoIP is a compelling application for devices such as smart phones with multiple wireless interfaces. However, the high energy consumption of Wi-Fi interfaces, especially when a device is idle,presents a significant barrier to the widespread adoption of VoIP over Wi-Fi.To address this issue, we present Cell2Notify, a practical and deployable energy management architecture that leverages the cellular radio on a smart phone to implement wakeup for the high-energy consumption Wi-Fi radio. We present detailed measurements of energy consumption on smart phone devices, and we show that Cell2Notify, can extend the battery lifetime of VoIPover Wi-Fi enabled smart phones by a factor of 1.7 to 6.4.


international conference on mobile systems, applications, and services | 2006

Enhancing the security of corporate Wi-Fi networks using DAIR

Paramvir Bahl; Ranveer Chandra; Jitendra Padhye; Lenin Ravindranath; Manpreet Singh; Alec Wolman; Brian Zill

We present a framework for monitoring enterprise wireless networks using desktop infrastructure. The framework is called DAIR, which is short for Dense Array of Inexpensive Radios. We demonstrate that the DAIR framework is useful for detecting rogue wireless devices (e.g., access points) attached to corporate networks, as well as for detecting Denial of Service attacks on Wi-Fi networks.Prior proposals in this area include monitoring the network via a combination of access points (APs), mobile clients, and dedicated sensor nodes. We show that a dense deployment of sensors is necessary to effectively monitor Wi-Fi networks for certain types of threats, and one can not accomplish this using access points alone. An ordinary, single-radio AP can not monitor multiple channels effectively, without adversely impacting the associated clients. Moreover, we show that a typical deployment of access points is not sufficiently dense to detect the presence of rogue wireless devices. Due to power constraints, mobile devices can provide only limited assistance in monitoring wireless networks. Deploying a dense array of dedicated sensor nodes is an expensive proposition.Our solution is based on two simple observations. First, in most enterprise environments, one finds plenty of desktop machines with good wired connectivity, and spare CPU and disk resources. Second, inexpensive USB-based wireless adapters are commonly available. By attaching these adapters to desktop machines, and dedicating the adapters to the task of monitoring the wireless network, we create a low cost management infrastructure.


international conference on pervasive computing | 2010

Virtual compass: relative positioning to sense mobile social interactions

Nilanjan Banerjee; Sharad Agarwal; Paramvir Bahl; Ranveer Chandra; Alec Wolman; Mark D. Corner

There are endless possibilities for the next generation of mobile social applications that automatically determine your social context. A key element of such applications is ubiquitous and precise sensing of the people you interact with. Existing techniques that rely on deployed infrastructure to determine proximity are limited in availability and accuracy. Virtual Compass is a peer-based relative positioning system that relies solely on the hardware and operating system support available on commodity mobile handhelds. It uses multiple radios to detect nearby mobile devices and places them in a two-dimensional plane. It uses adaptive scanning and out-of-band coordination to explore trade-offs between energy consumption and the latency in detecting movement. We have implemented Virtual Compass on mobile phones and laptops, and we evaluate it using a sample application that senses social interactions between Facebook friends.


architectural support for programming languages and operating systems | 2014

Using ARM trustzone to build a trusted language runtime for mobile applications

Nuno Santos; Himanshu Raj; Stefan Saroiu; Alec Wolman

This paper presents the design, implementation, and evaluation of the Trusted Language Runtime (TLR), a system that protects the confidentiality and integrity of .NET mobile applications from OS security breaches. TLR enables separating an applications security-sensitive logic from the rest of the application, and isolates it from the OS and other apps. TLR provides runtime support for the secure component based on a .NET implementation for embedded devices. TLR reduces the TCB of an open source .NET implementation by a factor of


workshop on online social networks | 2008

Lockr: social access control for web 2.0

Amin Tootoonchian; Kiran K. Gollu; Stefan Saroiu; Yashar Ganjali; Alec Wolman

78

Collaboration


Dive into the Alec Wolman's collaboration.

Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Henry M. Levy

University of California

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge