We introduce convex formulations of continuous-time dynamic network traffic assignment (DTA) problems and prove their feasibility with respect to realistic cell-based dynamic network loading models controlled by variable speed-limit and ramp metering. Then, we present results on the stability and robustness of the optimal solutions of such DTAs. Finally, we discuss models for cascading failures and measures of resilience in traffic flow networks.