In recent years, the joint configuration of communication,computing and popular content resources in wireless networks has been gaining an increasing amount of attention to efficiently handle the gigantic data traffic. To effectively manage resources, the network virtualization is deemed as a promising technique in which mobile virtual network operators(MVNOs) create virtual slices to serve the requests issued by their subscribed users via obtaining contents and computing abilities from content providers and fog nodes. In this paper, the above MVNO optimization is formulated as an assignment game employing the supplier-firm-buyer game model, which gives the optimal solution of matchings among the contents, computation nodes, MVNOs and users. Moreover, the existence of the non empty core of such game is proved, indicating that the proposed framework is stable. In order to obtain the simple practical solution, a distributed sub optimal algorithm of reduced version of three-sided matching with size and cyclic preference (R-TMSC) is adopted. Furthermore, a greedy strategy is proposed to improve the convergence speed as well as performance of the R-TMSC scheme. Simulation results show that compared to the random allocation, a 12.97% increase in average revenue can be reached by solving the supplier-firm-buyer problem, and that the greedy R-TMSC algorithm is able to reach the similar point of the optimal value with a faster speed.
To View the Abstract Contents
Now it is Your Time to Shine.
Great careers Start Here.
We Guide you to Every Step
Success! You're Awesome
Thank you for filling out your information!
We’ve sent you an email with your Final Year Project PPT file download link at the email address you provided. Please enjoy, and let us know if there’s anything else we can help you with.
To know more details Call 900 31 31 555
The WISEN Team