TY - GEN AU - Latif U. Khan AU - Mohsen Guizani AU - Ibrar Yaqoob AU - Ala Al-Fuqaha AU - Aiman Erbad AU - Zhu Han TI - Network Virtualization Empowered Metaverse: A Hierarchical Matching Approach PY - 2025/// CY - [Place of publication not identified] PB - Institute of Electrical and Electronics Engineers KW - metaverse KW - network virtualization KW - hierarchical matching KW - wireless resource allocation KW - computing resource allocation KW - edge-cloud deployment KW - B. Sc. Information Technology KW - UMUN open access collection KW - Journal articles N1 - Publication type: Journal article; Linked open-access copy: published version; Open access; no subscription required for the linked open-access version N2 - The metaverse has generated significant interest for enabling wireless systems due to its self-sustainability and proactive analytic capabilities. It enables the deployment of meta spaces featuring avatars and digital twins for various real-world applications. However, it has become challenging to efficiently deploy meta spaces on edge/cloud environments while managing communication and computing resources effectively. In this paper, we propose a novel network virtualization framework within a shared system to make the deployment of meta spaces for various metaverse applications cost-efficient. The framework abstracts, isolates, and facilitates the sharing of wireless and computing resources, thereby enhancing flexibility and efficiency for metaverse-driven applications. It involves three key players: network operators (selling resources), metaverse operators (managing transactions), and end-users (purchasing resources). An optimization problem is formulated to optimize the wireless resource allocation, computing resource allocation, association of end-devices with meta spaces deployed at the network operators' base stations, communication resource cost, and computing resource cost. Our problem has a mixed integer non-linear programming (MINLP) problem nature and is difficult to solve using conventional convex optimization. Therefore, we use a decomposition approach and then employ convex optimization and hierarchical matching. Numerical results confirm the validity of the proposed approach UR - https://doi.org/10.1109/tnse.2025.3588451 ER -