Fog Cache Optimization (CPCS-498)

Project Overview

This project introduces a closed-loop orchestration framework to solve the dynamic Cache Placement Problem in a fog computing environment. It uses a parallel genetic algorithm to continuously adapt its caching strategy in response to real-time changes in content popularity.

Project Aims

  • Design and develop a dynamic, closed-loop orchestration framework.
  • Implement a parallel genetic algorithm for optimization.
  • Simulate a heterogeneous fog computing environment.
  • Continuously adapt to real-time changes in content popularity.
  • Goal 1: Maximize system-wide cache hit ratio.
  • Goal 2: Minimize average data retrieval latency.

Problem Statement

Traditional cloud computing struggles with latency for real-time IoT applications. Fog computing solves this by moving resources to the network edge, but these "fog nodes" have limited capacity.

The challenge is deciding which data items to cache at which specific fog nodes to optimize performance. This "Cache Placement Problem" is NP-hard.

Furthermore, content popularity changes over time ("concept drift"), requiring a dynamic, online optimization approach, not a static one.