In particular, [@AHirwe16] seeks to balance the load on links and servers, while [@TKuo16] studies how to optimize routing to minimize network utilization. The above approaches formulate mixed-integer linear programming (MILP) problems and propose heuristic strategies to solve them. [@ABaumgartner15], [@FJemaa16] and [@BAddis15] formulate ILP problems, respectively aiming at minimizing the cost of used links and network nodes, minimizing resource utilization subject to QoS requirements, and minimizing bitrate variations through the VNF graph.

Not many works however exist that combine real-world traces and multi-access edge computing. Among the most recent ones, [@noi-pof] studies the price (in terms of additional infrastructure) of deploying caches within the cellular core network. Compared to our work, [@noi-pof] only focuses on caching and vehicular traffic, and it only considers the dataset for the city of Los Angeles.

Our earlier work [@noi-workshop] sets in the same scenario as this paper: the traces introduced in [Sec. \[sec:traces\]]{} were used to study the trade-offs between network latency and server utilization in MEC network design. The results presented in [@noi-workshop] use the quantity of data downloaded by users as a proxy metric for computational capabilities required at the servers, and their limited applicability represents one of the main motivations 