On the Steady State of Cache Networks

May 29, 2013
CS Open Area (CSB 477)
Hosted by: Columbia CS/EE Networking Seminar
Speaker: Daniel Sadoc Menasché , Assistant Professor (UFRJ, Brazil)


Over the past few years Content-Centric Networking, a networking model in which host-to-content communication protocols are introduced, has been gaining much attention. A central component of such an architecture is a large-scale interconnected caching system. To date, the way these Cache Networks operate and perform is still poorly understood. In this work, we demonstrate that certain cache networks are non-ergodic in that their steady-state characterization depends on the initial state of the system. We then establish several important properties of cache networks, in the form of three independently suf´Čücient conditions for a cache network to comprise a single ergodic component. Each property targets a different aspect of the system - topology, admission control and cache replacement policies. Perhaps most importantly we demonstrate that cache replacement can be grouped into equivalence classes, such that the ergodicity (or lack-thereof) of one policy implies the same property holds for all policies in the class. This is joint work with Elisha J. Rosensweig and Jim Kurose.

Speaker Biography

Daniel Sadoc Menasché is an Assistant Professor at the Federal University of Rio de Janeiro, Brazil. His research interests are in the mathematical modeling, performance evaluation, optimization and design of distributed systems. In particular, he recently studied mechanisms for content distribution, smart power grids, wireless scheduling and network science. For more information about his research, please visit his web page.

500 W. 120th St., Mudd 1310, New York, NY 10027    212-854-3105               
©2014 Columbia University