Interactive WiFi Connectivity For Moving Vehicles (2009)
Aruna Balasubramanian, Ratul Mahajan, Arun Venkataramani, Brian Neil, Levine John Zahorjan
Abstract – We ask if the ubiquity of WiFi can be leveraged to provide cheap connectivity from moving vehicles for common applications such as Web browsing and VoIP. Driven by this question, we...
Interactive WiFi Connectivity For Moving Vehicles (2009)
Aruna Balasubramanian, Ratul Mahajan, Arun Venkataramani, Brian Neil, Levine John Zahorjan
We ask if the ubiquity of WiFi can be leveraged to provide cheap connectivity from moving vehicles for common applications such as Web browsing and VoIP. Driven by this question, we conduct a study...
Consensus routing: The internet as a distributed system (2009)
John P. John, Ethan Katz-bassett, Arvind Krishnamurthy, Thomas Anderson, Arun Venkataramani
Internet routing protocols (BGP, OSPF, RIP) have traditionally favored responsiveness over consistency. A router applies a received update immediately to its forwarding table before propagating the...
Consensus routing: The internet as a distributed system (2009)
John P. John, Ethan Katz-bassett, Arvind Krishnamurthy, Thomas Anderson, Arun Venkataramani
Internet routing protocols (BGP, OSPF, RIP) have traditionally favored responsiveness over consistency. A router applies a received update immediately to its forwarding table before propagating the...
Interactive WiFi Connectivity For Moving Vehicles (2009)
Aruna Balasubramanian, Ratul Mahajan, Arun Venkataramani, Brian Neil, Levine John Zahorjan
We ask if the ubiquity of WiFi can be leveraged to provide cheap connectivity from moving vehicles for common applications such as Web browsing and VoIP. Driven by this question, we conduct a study...
ABSTRACT DTN Routing as a Resource Allocation Problem (2009)
Aruna Balasubramanian, Brian Neil Levine, Arun Venkataramani
Routing protocols for disruption-tolerant networks (DTNs) use a variety of mechanisms, including discovering the meeting probabilities among nodes, packet replication, and network coding. The primary...
Abstract Black-box and Gray-box Strategies for Virtual Machine Migration (2009)
Timothy Wood, Prashant Shenoy, Arun Venkataramani, Mazin Yousif
Virtualization can provide significant benefits in data centers by enabling virtual machine migration to eliminate hotspots. We present Sandpiper, a system that automates the task of monitoring and...
Abstract iPlane: An Information Plane for Distributed Services (2008)
Harsha V. Madhyastha, Tomas Isdal, Michael Piatek, Colin Dixon, Thomas Anderson, Arvind Krishnamurthy, ...
In this paper, we present the design, implementation, and evaluation of iPlane, a scalable service providing accurate predictions of Internet path performance for emerging overlay services. Unlike...
ABSTRACT DTN Routing as a Resource Allocation Problem (2008)
Aruna Balasubramanian, Brian Neil Levine, Arun Venkataramani
Routing protocols for disruption-tolerant networks (DTNs) use a variety of mechanisms, including discovering the meeting probabilities among nodes, packet replication, and network coding. The primary...
Ming Li, Tingxin Yan, Deepak Ganesan, Eric Lyons, Prashant Shenoy, Arun Venkataramani, ...
In this paper, we focus on a network of rich sensors that are geographically distributed and argue that the design of such networks poses very different challenges from traditional “mote-class ”...
ABSTRACT A Structural Approach to Latency Prediction (2008)
Harsha V. Madhyastha, Thomas Anderson, Arvind Krishnamurthy, Neil Spring, Arun Venkataramani
Several models have been recently proposed for predicting the latency of end to end Internet paths. These models treat the Internet as a black-box, ignoring its internal structure. While these models...
Abstract iPlane: An Information Plane for Distributed Services (2008)
Harsha V. Madhyastha, Tomas Isdal, Michael Piatek, Colin Dixon, Thomas Anderson, Arvind Krishnamurthy, ...
In this paper, we present the design, implementation, and evaluation of iPlane, a scalable service providing accurate predictions of Internet path performance for emerging overlay services. Unlike...
Abstract TCP Nice: A Mechanism for Background Transfers (2008)
Arun Venkataramani, Ravi Kokku, Mike Dahlin
Many distributed applications can make use of large background transfers £ transfers of data that humans are not waiting for £ to improve availability, reliability, latency or consistency. However,...
ABSTRACT A Structural Approach to Latency Prediction (2008)
Harsha V. Madhyastha, Thomas Anderson, Arvind Krishnamurthy, Neil Spring, Arun Venkataramani
Several models have been recently proposed for predicting the latency of end to end Internet paths. These models treat the Internet as a black-box, ignoring its internal structure. While these models...
Online Hierarchical Cooperative Caching ∗ Theory of Computing Systems (2008)
Xiaozhou Li, C. Greg Plaxton, Mitul Tiwari, Arun Venkataramani
Abstract. We address a hierarchical generalization of the well-known disk paging problem. In the hierarchical cooperative caching problem, a set of n machines residing in an ultrametric space...
Abstract iPlane: An Information Plane for Distributed Services (2008)
Harsha V. Madhyastha, Tomas Isdal, Michael Piatek, Colin Dixon, Thomas Anderson, Arvind Krishnamurthy, ...
In this paper, we present the design, implementation, and evaluation of iPlane, a scalable service providing accurate predictions of Internet path performance for emerging overlay services. Unlike...
ABSTRACT DTN Routing as a Resource Allocation Problem (2008)
Aruna Balasubramanian, Brian Neil Levine, Arun Venkataramani
Many DTN routing protocols use a variety of mechanisms, including discovering the meeting probabilities among nodes, packet replication, and network coding. The primary focus of these mechanisms is...
Online hierarchical cooperative caching (2008)
Xiaozhou Li, C. Greg, Plaxton Mitul Tiwari, Arun Venkataramani
We address a hierarchical generalization of the well-known disk paging problem. In the hierarchical cooperative caching problem, a set ofÒmachines residing in an ultrametric space cooperate with one...
ABSTRACT Web Search From a Bus (2008)
Aruna Balasubramanian, Yun Zhou, W. Bruce, Croft Brian, Neil Levine, Arun Venkataramani
Opportunistic connections to the Internet from open wireless access points is now commonly possible in urban areas. Vehicular networks can opportunistically connect to the Internet for several...
Abstract iPlane: An Information Plane for Distributed Services (2008)
Harsha V. Madhyastha, Tomas Isdal, Michael Piatek, Colin Dixon, Thomas Anderson, Arvind Krishnamurthy, ...
In this paper, we present the design, implementation, and evaluation of iPlane, a scalable service providing accurate predictions of Internet path performance for emerging overlay services. Unlike...
ABSTRACT A Structural Approach to Latency Prediction (2008)
Harsha V. Madhyastha, Thomas Anderson, Arvind Krishnamurthy, Neil Spring, Arun Venkataramani
Several models have been recently proposed for predicting the latency of end to end Internet paths. These models treat the Internet as a black-box, ignoring its internal structure. While these models...
Abstract Black-box and Gray-box Strategies for Virtual Machine Migration (2008)
Timothy Wood, Prashant Shenoy, Arun Venkataramani, Mazin Yousif
Virtualization can provide significant benefits in data centers by enabling virtual machine migration to eliminate hotspots. We present Sandpiper, a system that automates the task of monitoring and...
ABSTRACT DTN Routing as a Resource Allocation Problem (2008)
Aruna Balasubramanian, Brian Neil Levine, Arun Venkataramani
Routing protocols for disruption-tolerant networks (DTNs) use a variety of mechanisms, including discovering the meeting probabilities among nodes, packet replication, and network coding. The primary...
Online hierarchical cooperative caching (2008)
Mitul Tiwari, Arun Venkataramani
Abstract We address a hierarchical generalization of the well-known disk paging problem. In thehierarchical cooperative caching problem, a set of n machines residing in an ultrametric spacecooperate...
Xiaozhou Li, C. Greg Plaxton, Mitul Tiwari, Arun Venkataramani
We address a hierarchical generalization of the well-known disk paging problem. In the hierarchical cooperative caching problem, a set of n machines residing in an ultrametric space cooperate with...
ABSTRACT Web Search From a Bus (2008)
Aruna Balasubramanian, Yun Zhou, Bruce Croft, Brian Neil Levine, Arun Venkataramani
Opportunistic connections to the Internet from open wireless access points is now commonly possible in municipal areas. Vehicular networks can opportunistically connect to the internet for several...
Abstract TCP Nice: A Mechanism for Background Transfers (2008)
Arun Venkataramani, Ravi Kokku, Mike Dahlin
Many distributed applications can make use of large background transfers £ transfers of data that humans are not waiting for £ to improve availability, reliability, latency or consistency. However,...
Online Hierarchical Cooperative Caching (2008)
Xiaozhou Li Greg, C. Greg Plaxton, Mitul Tiwari, Arun Venkataramani
We address a hierarchical generalization of the well-known disk paging problem. In the hierarchical cooperative caching problem, a set of n machines residing in an ultrametric space cooperate with...
Online hierarchical cooperative caching (2007)
Xiaozhou Li, C. Greg Plaxton, Mitul Tiwari, Arun Venkataramani
We address a hierarchical generalization of the well-known disk paging problem. In the hierarchical cooperative caching problem, a set of n machines residing in an ultrametric space cooperate with...
TCP Nice: Self-tuning Network Support for Background Applications (2007)
Arun Venkataramani, Ravi Kokku, Mike Dahlin
Many distributed applications can make use of large background transfers transfers of data that humans are not waiting for to improve availability, reliability, latency or consistency. However, given...
Model Checking A Parameterized Directory-based Cache Protocol (2007)
Allen E. Emerson, Arun Venkataramani
We present the mechanical verification of a parametrized distributed directory-based cacshe protocol, that had been defying naive attempts at mechanical verification for quite some time. The...
Model Checking A Parameterized Directory-based Cache Protocol (2007)
Allen E. Emerson, Steve German, John Havlicek, Arun Venkataramani
We present the mechanical verification of a parametrized distributed directory-based cacshe protocol, that had been defying naive attempts at mechanical verification for quite some time. The...
Do Incentives Build Robustness in BitTorrent (2007)
Michael Piatek, Tomas Isdal, Thomas Anderson, Arvind Krishnamurthy, Arun Venkataramani
A fundamental problem with many peer-to-peer systems is the tendency for users to “free ride”—to consume resources without contributing to the system. The popular file distribution tool...
A multipath background network architecture (2007)
Ravi Kokku, Aniruddha Bohra, Samrat Ganguly, Arun Venkataramani
Abstract — Background transfers, or transfers that humans do not actively wait on, dominate the Internet today. In today’s best-effort Internet, background transfers can interfere with foreground...
iPlane: Measurements and Query Interface (2007)
Harsha V. Madhyastha, Thomas Anderson, Arvind Krishnamurthy, Arun Venkataramani
In this document, we describe the application interface to iPlane, an information plane that continuously performs measurements to generate and maintain an annotated map of the Internet with a rich...
A multipath background network architecture (2007)
Ravi Kokku, Aniruddha Bohra, Samrat Ganguly, Arun Venkataramani
Abstract — Background transfers, or transfers that humans do not actively wait on, dominate the Internet today. In today’s best-effort Internet, background transfers can interfere with foreground...
Do Incentives Build Robustness in BitTorrent (2007)
Michael Piatek, Tomas Isdal, Thomas Anderson, Arvind Krishnamurthy, Arun Venkataramani
A fundamental problem with many peer-to-peer systems is the tendency for users to “free ride”—to consume resources without contributing to the system. The popular file distribution tool...
Do Incentives Build Robustness in BitTorrent (2007)
Michael Piatek, Tomas Isdal, Thomas Anderson, Arvind Krishnamurthy, Arun Venkataramani
A fundamental problem with many peer-to-peer systems is the tendency for users to “free ride”—to consume resources without contributing to the system. The popular file distribution tool...
Availability in bittorrent systems (2007)
Giovanni Neglia, Honggang Zhang, Don Towsley, Arun Venkataramani, John Danaher
Abstract — In this paper, we investigate the problem of highly available, massive-scale file distribution in the Internet. To this end, we conduct a large-scale measurement study of BitTorrent, a...
Availability in bittorrent systems (2007)
Giovanni Neglia, Honggang Zhang, Don Towsley, Arun Venkataramani
Abstract — In this paper, we investigate the problem of highly available, massive-scale file distribution in the Internet. To this end, we conduct a large-scale measurement study of BitTorrent, a...
Oasis: An Overlay-aware Network Stack (2006)
Harsha V. Madhyastha, Arun Venkataramani, Arvind Krishnamurthy, Thomas Anderson
Overlays have enabled several new and popular distributed applications such as Akamai, Kazaa, and Bittorrent. However, the lack of an overlay-aware network stack has hindered the widespread use of...
Nalini Belaramani, Mike Dahlin, Lei Gao, Amol Nayate, Arun Venkataramani, Praveen Yalag, ...
We present PRACTI, a new approach for large-scale replication. PRACTI systems can replicate or cache any subset of data on any node (Partial Replication), provide a broad range of consistency...
Nalini Belaramani, Mike Dahlin, Lei Gao, Amol Nayate, Arun Venkataramani, Praveen Yalag, ...
We present PRACTI, a new approach for large-scale replication. PRACTI systems can replicate or cache any subset of data on any node (Partial Replication), provide a broad range of consistency...
Nalini Belaramani, Mike Dahlin, Lei Gao, Amol Nayate, Arun Venkataramani, Praveen Yalag, ...
We present PRACTI, a new approach for large-scale replication. PRACTI systems can replicate or cache any subset of data on any node (Partial Replication), provide a broad range of consistency...
Oasis: An Overlay-aware Network Stack (2006)
Harsha V. Madhyastha, Arun Venkataramani, Arvind Krishnamurthy, Thomas Anderson
Overlays have enabled several new and popular distributed applications such as Akamai, Kazaa, and Bittorrent. However, the lack of an overlay-aware network stack has hindered the widespread use of...
PRACTI Replication (Extended version) (2005)
Mike Dahlin, Lei Gao, Amol Nayate, Arun Venkataramani, Praveen Yalag, An Zheng
See
PRACTI Replication for Large-Scale Systems (2004)
Mike Dahlin, Lei Gao, Amol Nayate, Arun Venkataramani, Praveen Yalagandula, Jiandan Zheng, ...
Many replication mechanisms for large scale distributed systems exist, but they require a designer to compromise a system's replication policy (e.g., by requiring full replication of all data to...
Online Hierarchical Cooperative Caching (2004)
Xiaozhou Li Microsoft, Xiaozhou Li, C. Greg Plaxton, Mitul Tiwari, Arun Venkataramani
We address a hierarchical generalization of the well-known disk paging problem. In the hierarchical cooperative caching problem, a set of n machines residing in an ultrametric space cooperate with...
PRACTI replication for large-scale systems (2004)
Mike Dahlin, Lei Gao, Amol Nayate, Arun Venkataramani, Praveen Yalag, An Zheng
Many replication mechanisms for large scale distributed systems exist, but they require a designer to compromise a system’s replication policy (e.g., by requiring full replication of all data to...
NPS: A non-interfering deployable web prefetching system (2003)
Ravi Kokku, Praveen Yalagandula, Arun Venkataramani, Mike Dahlin
We present NPS, a novel non-intrusive web prefetching system that (1) utilizes only spare resources to avoid interference between prefetch and demand requests at the server as well as in the network,...
NPS: A non-interfering deployable web prefetching system (2003)
Ravi Kokku, Praveen Yalagandula, Arun Venkataramani, Mike Dahlin
We present Prefetch-Nice, a novel non-intrusive web prefetching system that (1) systematically avoids interference between prefetch and demand requests at the server as well as in the network by...
NPS: A non-interfering deployable web prefetching system (2003)
Ravi Kokku, Praveen Yalagandula, Arun Venkataramani, Mike Dahlin
We present Prefetch-Nice, a novel non-intrusive web prefetching system that (1) systematically avoids interference between prefetch and demand requests at the server as well as in the network by...
NPS: A non-interfering deployable web prefetching system (2003)
Ravi Kokku, Praveen Yalagandula, Arun Venkataramani, Mike Dahlin
We present Prefetch-Nice, a novel non-intrusive web prefetching system that (1) systematically avoids interference between prefetch and demand requests at the server as well as in the network by...
Separating agreement from execution for byzantine fault tolerant services (2003)
Jian Yin, Arun Venkataramani, Lorenzo Alvisi, Mike Dahlin
We describe a new architecture for Byzantine fault tolerant state machine replication that separates agreement that orders requests from execution that processes requests. This separation yields two...
Separating Agreement from Execution for (2003)
Zantine Fault Tolerant, Jian Yin, Arun Venkataramani, Lorenzo Alvisi, Mike Dahlin
We describe a new architecture for Byzantine fault tolerant state machine replication that separates agreement that orders requests from execution that processes requests. This separation yields two...
Separating Agreement from Execution for Byzantine Fault Tolerant Services (2003)
Jian Yin, Jean-Philippe Martin, Arun Venkataramani, Lorenzo Alvisi, Mike Dahlin
We describe a new architecture for Byzantine fault tolerant state machine replication that separates agreement that orders requests from execution that processes requests. This separation yields two...
NPS: A non-interfering deployable web prefetching system (2003)
Ravi Kokku, Praveen Yalagandula, Arun Venkataramani, Mike Dahlin
NPS: A non-interfering deployable web prefetching system (2003)
Ravi Kokku, Praveen Yalagandula, Arun Venkataramani, Mike Dahlin
We present NPS, a novel non-intrusive web prefetching system that (1) utilizes only spare resources to avoid interference between prefetch and demand requests at the server as well as in the network,...
NPS: A non-interfering deployable web prefetching system (2003)
Ravi Kokku, Praveen Yalagandula, Arun Venkataramani, Mike Dahlin
We present Prefetch-Nice, a novel non-intrusive web prefetching system that (1) systematically avoids interference between prefetch and demand requests at the server as well as in the network by...
NPS: A Non-interfering Deployable Web Prefetching System (2003)
Ravi Kokku Praveen, Praveen Yalagandula, Arun Venkataramani, Mike Dahlin
We present NPS, a novel non-intrusive web prefetching system that (1) utilizes only spare resources to avoid interference between prefetch and demand requests at the server as well as in the network...
Separating Agreement from Execution for Byzantine Fault Tolerant Services (2003)
Jian Yin, Jean-Philippe Martin, Arun Venkataramani, Lorenzo Alvisi, Mike Dahlin
We describe a new architecture for Byzantine fault tolerant state machine replication that separates agreement--- ordering requests---from execution---processing requests. This separation yields two...
Operating system support for massive replication (2002)
Arun Venkataramani, Ravi Kokku, Mike Dahlin
The increasing number of devices used by each user to access data and services and the increasing importance of the data and services available electronically both favor
Byzantine fault-tolerant confidentiality (2002)
Jian Yin, Arun Venkataramani, Lorenzo Alvisi, Mike Dahlin
As the world becomes increasingly interconnected, more and more important services such as business transactions are deployed as access anywhere services-- services that are accessible
TCP-Nice: A mechanism for background transfers (2002)
Arun Venkataramani, Ravi Kokku, Mike Dahlin
Many distributed applications can make use of large background transfers transfers of data that humans are not waiting for to improve availability, reliability, latency or consistency. However, given...
TCP-Nice: A mechanism for background transfers (2002)
Arun Venkataramani, Ravi Kokku, Mike Dahlin
Many distributed applications can make use of large background transfers transfers of data that humans are not waiting for to improve availability, reliability, latency or consistency. However, given...
Byzantine fault-tolerant confidentiality (2002)
Jian Yin, Arun Venkataramani, Lorenzo Alvisi, Mike Dahlin
As the world becomes increasingly interconnected, more and more important services such as business transactions are deployed as access-anywhere services-- services that are accessible by remote...
Byzantine Fault-Tolerant Confidentiality (2002)
Jian Yin, Arun Venkataramani, Jean-Phillipe Martin, Lorenzo Alvisi, Mike Dahlin
This paper discuss how to use redundancy to simultaneously improve availability, integrity, and confidentiality. We propose an architecture for such a system - Confidential BFT (CBFT). In CBFT,...
Byzantine Fault-Tolerant Confidentiality (2002)
Jian Yin Arun, Jian Yin, Arun Venkataramani, Lorenzo Alvisi, Mike Dahlin
This paper discusses how to use redundancy to simultaneously improve availability, integrity, and confidentiality. We call this problem Confidential BFT (CBFT) and propose the privacy firewall...
TCP-Nice: A mechanism for background transfers (2002)
Arun Venkataramani, Ravi Kokku, Mike Dahlin
Abstract Many distributed applications can make use of largebackground transfers
Byzantine fault-tolerant confidentiality (2002)
Jian Yin, Arun Venkataramani, Jean-phillipe Martin, Lorenzo Alvisi, Mike Dahlin
As the world becomes increasingly interconnected, more and more important services such as business transactions are deployed as access anywhere services – services that are accessible by remote...
Byzantine fault-tolerant confidentiality (2002)
Jian Yin, Arun Venkataramani, Lorenzo Alvisi, Mike Dahlin
As the world becomes increasingly interconnected, more and more important services such as business transactions are deployed as access-anywhere services – services that are accessible by remote...
Byzantine fault-tolerant confidentiality (2002)
Jian Yin, Arun Venkataramani, Lorenzo Alvisi, Mike Dahlin
As the world becomes increasingly interconnected, more and more important services such as business transactions are deployed as access-anywhere services – services that are accessible by remote...
Operating system support for massive replication (2002)
Arun Venkataramani, Ravi Kokku, Mike Dahlin
The increasing number of devices used by each userto access data and services and the increasing importance of the data and services available electronically both fa-vor "access-anywhere...
Byzantine fault-tolerant confidentiality (2002)
Jian Yin, Arun Venkataramani, Lorenzo Alvisi, Mike Dahlin
As the world becomes increasingly interconnected, more and more important services such as business transactions are deployed as access anywhere services – services that are accessible by remote...
TCP-Nice: A mechanism for background transfers (2002)
Arun Venkataramani, Ravi Kokku, Mike Dahlin
Rights to individual papers remain with the author or the author's employer. Permission is granted for noncommercial reproduction of the work for educational or research purposes. This copyright...
Potential costs and benefits of long-term prefetching for content-distribution (2001)
Arun Venkataramani, Praveen Yalagandula, Ravindranath Kokku, Sadia Sharif, Mike Dahlin
This paper examines the costs and potential benefits of long-term prefetching for content distribution. In contrast with traditional short-term prefetching, in which caches use recent access history...
Potential costs and benefits of long-term prefetching for content-distribution (2001)
Arun Venkataramani, Praveen Yalagandula, Ravindranath Kokku, Sadia Sharif, Mike Dahlin
This paper examines the costs and potential benefits of long-term prefetching for content distribution. In traditional short-term prefetching, caches use recent access history to predict and prefetch...
Potential costs and benefits of long-term prefetching for content-distribution (2001)
Arun Venkataramani, Praveen Yalagandula, Ravindranath Kokku, Sadia Sharif, Mike Dahlin
This paper examines the costs and potential benefits of long-term prefetching for content distribution. In traditional short-term prefetching, caches use recent access history to predict and prefetch...
Potential costs and benefits of long-term prefetching for content-distribution (2001)
Arun Venkataramani, Praveen Yalagandula, Ravindranath Kokku, Sadia Sharif, Mike Dahlin
This paper examines the costs and potential benefits of long-term prefetching for content distribution. In contrast with traditional short-term prefetching, in which caches use recent access history...
Bandwidth constrained placement in a WAN (2001)
Arun Venkataramani, Phoebe Weidmann, Mike Dahlin
In this paper, we examine the bandwidth-constrained placement problem, focusing on trade-os appropriate for wide area network (WAN) environments. The goal is to place copies of objects at a...
Potential costs and benefits of long-term prefetching for content-distribution (2001)
Arun Venkataramani, Praveen Yalagandula, Ravindranath Kokku, Sadia Sharif, Mike Dahlin
This paper examines the costs and potential benefits of long-term prefetching for content distribution. In contrast with traditional short-term prefetching, in which caches use recent access history...
Potential costs and benefits of long-term prefetching for content-distribution (2001)
Arun Venkataramani, Praveen Yalagandula, Ravindranath Kokku, Sadia Sharif, Mike Dahlin
This paper examines the costs and potential benefits of long-term prefetching for content distribution. In contrast with traditional short-term prefetching, in which caches use recent access history...
Bandwidth constrained placement in a WAN (2001)
Arun Venkataramani, Phoebe Weidmann, Mike Dahlin
In this paper, we examine the bandwidth-constrained placement problem, focusing on trade-os appropriate for wide area network (WAN) environments. The goal is to place copies of objects at a...
Potential costs and benefits of long-term prefetching for content-distribution (2001)
Arun Venkataramani, Praveen Yalagandula, Ravindranath Kokku, Sadia Sharif, Mike Dahlin
This paper examines the costs and potential benefits of long-term prefetching for content distribution. In traditional short-term prefetching, caches use recent access history to predict and prefetch...
Potential costs and benefits of long-term prefetching for content-distribution (2001)
Arun Venkataramani, Praveen Yalagandula, Ravi Kokku, Sadia Sharif, Mike Dahlin
This paper examines the costs and potential benefits of long-term prefetching for content distribution. In contrast with traditional short-term prefetching, in which caches use recent access history...
Bandwidth constrained placement in a WAN (2001)
Arun Venkataramani, Phoebe Weidmann, Mike Dahlin
ABSTRACT In this paper, we examine the bandwidth-constrained placement problem, focusing on trade-offs appropriate for wide area network (WAN) environments. The goal is to place copies of objects at...
The Potential Costs and Benefits of Long-term Prefetching for Content Distribution (2001)
Arun Venkataramani, Praveen Yalagandula, Ravi Kokku, Sadia Sharif, Mike Dahlin
This paper examines the costs and potential benefits of long-term prefetching for content distribution. In contrast with traditional short-term prefetching, in which caches use recent access history...