Before revision:  To attain this goal , we formulate an optimization problem to capture the C3 costs, which turns out to be a non-convex Mixed Integer Non-Linear Programming }  (MINLP) Problem.
After revision:  To attain this goal , we formulate an optimization problem to capture the C3 costs, which turns out to be a non-convex Mixed Integer Non-Linear Programming Our goal is to identify the optimal data compression rate and data placement over the network to minimize the overall energy consumption in the network.} (MINLP) Problem.