000 04093naa a22005657i 4500
001 UMUN-OA-20261005-IT-062
003 local
005 20261005174836.0
006 m o d
007 cr||||||||||||
008 261005s2025 xx o u000 0 eng d
024 7 _a10.1109/tnse.2025.3588451
_2doi
035 _a(local)OpenAlex:W4412170835
040 _alocal
_beng
_clocal
041 0 _aeng
100 0 _aLatif U. Khan
_eauthor.
245 1 0 _aNetwork Virtualization Empowered Metaverse: A Hierarchical Matching Approach /
_cLatif U. Khan; Mohsen Guizani; Ibrar Yaqoob [and others].
264 1 _a[Place of publication not identified] :
_bInstitute of Electrical and Electronics Engineers,
_c2025.
300 _a1 online resource (1 article).
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
500 _aPublication type: Journal article.
500 _aLinked open-access copy: published version.
506 0 _aOpen access; no subscription required for the linked open-access version.
_fUnrestricted online access
_2star
520 3 _aThe 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.
540 _aCreative Commons Attribution (licence family recorded by the source; version not supplied in metadata).
_uhttps://openalex.org/W4412170835
546 _aIn English.
588 0 _aDescription generated from OpenAlex bibliographic metadata retrieved on 5 October 2026; full text linked from the source.
590 _aCourse allocation: B. Sc. Information Technology.
650 4 _ametaverse
650 4 _anetwork virtualization
650 4 _ahierarchical matching
650 4 _awireless resource allocation
650 4 _acomputing resource allocation
650 4 _aedge-cloud deployment
653 _aB. Sc. Information Technology
653 _aUMUN open access collection
653 _anetwork virtualization
655 4 _aJournal articles.
700 0 _aMohsen Guizani
_eauthor.
700 0 _aIbrar Yaqoob
_eauthor.
700 0 _aAla Al-Fuqaha
_eauthor.
700 0 _aAiman Erbad
_eauthor.
700 0 _aZhu Han
_eauthor.
773 0 _tIEEE Transactions on Network Science and Engineering
_gVol. 13, (2025), pages/article 5403-5416
_x2327-4697
856 4 0 _uhttps://doi.org/10.1109/tnse.2025.3588451
_yRead open-access publication
_zOpen access. Access and licence reported by the source; this host could not be independently checked by automation.
_70
884 _aCourse selection and automated MARC21 enrichment from OpenAlex metadata.
_g20261005
_khttps://openalex.org/W4412170835
_qlocal
942 _n0
999 _c749
_d749