Younes Ben Mazziane - Communication systems
Date: - Location: Eurecom
Abstract: This talk aims to provide an overview of my PhD thesis contributions, specifically analyzing three randomized algorithms for online frequency estimation and caching. We derive mathematical formulas for each algorithm, allowing efficient performance evaluation without simulations. The first algorithm, Count-Min Sketch with Conservative Updates, is widely used for real-time frequency estimation in data streams with limited memory. Building on the popular Follow-the-Perturbed-Leader algorithm for online learning, the second algorithm tackles caching with incomplete information about past requests. Finally, the third is a variation of the classic Least-Recently Used policy, tailored for similarity caching, where similar items can fulfill requests. Short bio: Younes Ben Mazziane completed his Ph.D. in Computer Science at Université Côte d’Azur, France, in May 2024, following his Master’s degree from the same university in 2020. His research interests include performance evaluation of networked systems.
