Design and analysis of content caching networks

Speaker : Jim Kurose
University of Massachusetts, Ahmerst
Date: 15/02/2012
Time: 2:00 pm - 3:00 pm
Location: LINCS Meeting Room 40


Today’s Internet architecture, nearly 40 years old now, is grounded in a model of host-to-host communication. More recently, a number of researchers have begun to focus on Content Networking – a model in which host-to-content (rather than host-to-host) interaction is the norm. Here, content distribution and retrieval, rather than host-to-host packet delivery, is the core function supported in each and every network node. A central component of proposals for such content delivery is the routing of content to requestors through a large-scale interconnected network of caches. In this talk we focus on this cache network.

We begin with a quick overview of Content Networking. We then describe Breadcrumbs – a simple content caching, location, and routing system that uses a small amount of information regarding cache history/routing in a simple, best-effort approach towards caching. In the second part of this talk we consider the broad challenge of analyzing networks of interconnected caches. We describe an iterative fixed-point algorithm for approximating cache network performance, evaluate the accuracy of the approximation, and identify the sources of approximation error. We also consider the steady state behavior of cache networks. We demonstrate that certain cache networks are non-ergodic in that their steady-state characterization depends on the initial state of the system. We describe sufficient conditions (based on topology, admission control, and cache replacement policy) for ergodicity and ergodicity equivalence classes among policies. Last, we describe current work on developing a network calculus for cache network flows.

Joint work with Elisha Rosensweig, Daniel Menasche, Don Towsley.