The transportation system has evolved into a complex cyber-physical system with the introduction of wireless communication and the emergence of connected travelers and connected automated vehicles. Such applications create an urgent need to develop high-fidelity transportation modeling tools that capture the mutual interaction of the communication and transportation systems. This paper addresses this need by developing a high-fidelity, large-scale dynamic and integrated traffic and direct cellullar vehicle-to-vehicle and vehicle-to-infrastructure (collectively known as V2X) modeling tool. The unique contributions of this work are (1) we developed a scalable implementation of the analytical communication model that captures packet movement at the millisecond level; (2) we coupled the communication and traffic simulation models in real-time to develop a fully integrated dynamic connected vehicle modeling tool; and (3) we developed scalable approaches that adjust the frequency of model coupling depending on the number of concurrent vehicles in the network. The proposed scalable modeling framework is demonstrated by running on the Los Angeles downtown network considering the morning peak hour traffic demand (145,000 vehicles), running faster than real-time on a regular personal computer (1.5 h to run 1.86 h of simulation time). Spatiotemporal estimates of packet delivery ratios for downtown Los Angeles are presented. This novel modeling framework provides a breakthrough in the development of urgently needed tools for large-scale testing of direct (C-V2X) enabled applications.

The open radio access network (O-RAN) architecture is consolidating the concept of software-defined cellular networks beyond 5G networks, mainly through the introduction of the near-real-time radio access network (RAN) intelligent controller (Near-RT RIC) and the xApps. The deployment of the Near-RT RICs and the assignment of RAN nodes to the deployed RICs play a crucial role in optimizing the performance of O-RANs. In this paper, we develop a robust optimization framework for joint RIC deployment and assignment, considering the uncertainty in user locations. Specifically, our contributions are as follows. First, we develop CP, a robust static joint RIC placement and RAN node-RIC assignment scheme. The objective of CP is to minimize the number of RICs needed to control all RAN nodes while ensuring that the response time to each RAN node will not exceed δ milliseconds with a probability greater than β. Second, we develop CPPA, a robust joint RIC placement and adaptive RAN node-RIC assignment scheme. In contrast to CP, CPPA enjoys a recourse capability, where the RAN node-RIC assignment adapts to the variations in the user locations. We use chance-constrained stochastic optimization combined with several linearization techniques to develop a mixed-integer linear (MIL) formulation for CP. Two-stage stochastic optimization with recourse, combined with several linearization techniques, is used to develop an MIL formulation for CPPA. The optimal performance of CP and CPPA has been examined under various system parameter values. Furthermore, sample average approximation has been employed to design efficient approximate algorithms for solving CP and CPPA. Our results demonstrate the robustness of the proposed stochastic resource allocation schemes for O-RANs compared to existing deterministic allocation schemes. They also show the merits of adapting the allocation of resources to the network uncertainties compared to statically allocating them.