DocumentCode :
623669
Title :
On the steady-state of cache networks
Author :
Rosensweig, Elisha J. ; Menasche, Daniel S. ; Kurose, Jim
Author_Institution :
Dept. of Comput. Sci., Univ. of Massachusetts, Amherst, MA, USA
fYear :
2013
fDate :
14-19 April 2013
Firstpage :
863
Lastpage :
871
Abstract :
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-sufficient 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.
Keywords :
cache storage; content management; network topology; peer-to-peer computing; admission control; cache network steady state; cache replacement policy; content centric networking; ergodic component; host-to-content communication protocol; interconnected caching system; network topology; sufficient condition; Admission control; Delays; Markov processes; Network topology; Routing; Steady-state; Topology;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
INFOCOM, 2013 Proceedings IEEE
Conference_Location :
Turin
ISSN :
0743-166X
Print_ISBN :
978-1-4673-5944-3
Type :
conf
DOI :
10.1109/INFCOM.2013.6566874
Filename :
6566874
Link To Document :
بازگشت