Nicaise Choungmo Fofack

Nicaise Choungmo Fofack

Auto-generated profile, based on publicly available information

Nicaise Choungmo Fofack

INRIA, Sophia Antipolis, France

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
13 April 2012 in Pervasive and Mobile Computing
Verified
Journal Article
Closed access
SASara Alouf
Sara Alouf
VMVincenzo Mancuso
Vincenzo Mancuso
NFNicaise Choungmo Fofack
Nicaise Choungmo Fofack

1 January 2014
Verified
Conference Paper
Closed access
NFNicaise Choungmo Fofack
Nicaise Choungmo Fofack
SASara Alouf
Sara Alouf
International audienceCaching is undoubtedly one of the most popular solution that easily scales up with a world-wide deployment of resources. Records in Domain Name System (DNS) caches are kept for a pre-set duration (time-to-live or TTL) to avoid becoming outdated. Modern caches are those that set locally the TTL regardless of what authoritative servers say. In this paper, we introduce analytic models to study the modern DNS cache behavior based on renewal arguments. For tree cache networks, we derive the cache performance metrics, characterize at each cache the miss process and the aggregate request process. We address the problem of the optimal caching duration and find that constant TTL is the best only if if inter-request times have a concave CDF. We validate our theoretical findings using real DNS traces (single cache case) and via event-driven simulations (network case). Our models are very robust as the relative error between empirical and analytic values stays within 1% in the former case and less than 5% in the latter case

1 January 2012
Verified
Conference Paper
Closed access
CEChoungmo Fofack Nicaise Eric
Choungmo Fofack Nicaise Eric
NPNain Philippe
Nain Philippe
NGNeglia Giovanni
Neglia Giovanni
TDTowsley Don
Towsley Don