Skip to Main content Skip to Navigation
Conference papers

CCN Interest Forwarding Strategy as Multi-Armed Bandit Model with Delays

Konstantin Avrachenkov 1 Peter Jacko 2 
1 MAESTRO - Models for the performance analysis and the control of networks
CRISAM - Inria Sophia Antipolis - Méditerranée
2 Networks
BCAM - Basque Center for Applied Mathematics
Abstract : We consider Content Centric Network (CCN) interest forwarding problem as a Multi-Armed Bandit (MAB) problem with delays. We investigate the transient behaviour of the $\eps$-greedy, tuned $\eps$-greedy and Upper Confidence Bound (UCB) interest forwarding policies. Surprisingly, for all the three policies very short initial exploratory phase is needed. We demonstrate that the tuned $\eps$-greedy algorithm is nearly as good as the UCB algorithm, commonly reported as the best currently available algorithm. We prove the uniform logarithmic bound for the tuned $\eps$-greedy algorithm in the presence of delays. In addition to its immediate application to CCN interest forwarding, the new theoretical results for MAB problem with delays represent significant theoretical advances in machine learning discipline.
Document type :
Conference papers
Complete list of metadata
Contributor : Konstantin Avrachenkov Connect in order to contact the contributor
Submitted on : Wednesday, December 12, 2012 - 10:58:22 AM
Last modification on : Thursday, January 20, 2022 - 5:27:38 PM


  • HAL Id : hal-00764011, version 1



Konstantin Avrachenkov, Peter Jacko. CCN Interest Forwarding Strategy as Multi-Armed Bandit Model with Delays. NetGCoop'12: The 6th International Conference on Network Games, Control and Optimization, Nov 2012, Avignon, France. ⟨hal-00764011⟩



Record views