Bo Jiang

TL;DR: Opportunistic Flooding is introduced, a novel design tailored for low-duty-cycle networks with unreliable wireless links and predetermined working schedules and achieves significantly shorter flooding delay while consuming only 20-60% of the transmission energy.

TL;DR: In this paper, the authors investigate the problem of optimal request routing and content caching in a heterogeneous network supporting in-network content caching with the goal of minimizing average content access delay.

TL;DR: Opportunistic Flooding is introduced, a novel design tailored for low-duty-cycle networks with unreliable wireless links and predetermined working schedules and achieves significantly shorter flooding delay while consuming only 20-60% of the transmission energy.

TL;DR: This work investigates the problem of optimal request routing and content caching in a heterogeneous network supporting in-network content caching with the goal of minimizing average content access delay, and proves that under the congestion-insensitive model the problem can be solved optimally in polynomial time.

TL;DR: This work investigates the problem of developing optimal joint routing and caching policies in a network supporting in-network caching with the goal of minimizing expected content-access delay and identifies the structural property of the user-cache graph that makes the problem NP-complete.