Shuo Wang

Dr. Shuo Wang

orcid

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
26 February 2019 in Electronics
Verified
Journal Article
Open access
PDF file
SKSaleem Karmoshi
Saleem Karmoshi
SWShuo Wang
Shuo Wang
NAnaji alhusaini
naji alhusaini
JLJing Li
Jing Li
MZMing Zhu
Ming Zhu
Ammar HawbaniAmmar Hawbani
Ammar Hawbani
Allocating bandwidth guarantees to applications in the cloud has become increasingly demanding and essential as applications compete to share cloud network resources. However, cloud-computing providers offer no network bandwidth guarantees in a cloud environment, predictably preventing tenants from running their applications. Existing schemes offer tenants practical cluster abstraction solutions emulating underlying physical network resources, proving impractical; however, providing virtual network abstractions has remained an essential step in the right direction. In this paper, we consider the requirements for enabling the application-aware network with bandwidth guarantees in a Virtual Data Center (VDC). We design GANA-VDC, a network virtualization framework supporting VDC application-aware networking with bandwidth guarantees in a cloud datacenter. GANA-VDC achieves scalability using an interceptor to translate OpenFlow features to prompt fine-grained Quality of Service (QoS). Facilitating the expression of diverse network resource demands, we also propose a new Virtual Network (VN) to Physical Network (PN) mapping approach, Graph Abstraction Network Architecture (GANA), which we innovatively introduce in this paper, allowing tenants to provide applications with cloud networking environment, thereby increasing the preservation performance. Our results show GANA-VDC can provide bandwidth guarantee and achieve low time complexity, yielding higher network utility.
1

6 November 2020 in Applied Sciences
Verified
Journal Article
Open access
PDF file
SWShuo Wang
Shuo Wang
ZZZhiqiang Zhou
Zhiqiang Zhou
Hongjie ZhangHongjie Zhang
Hongjie Zhang
JLJing Li
Jing Li
In the cloud datacenter, for the multi-tenant model, network resources should be fairly allocated among VDCs (virtual datacenters). Conventionally, the allocation of cloud network resources is on a best-effort basis, so the specific information of network resource allocation is unclear. Previous research has either aimed to provide minimum bandwidth guarantee, or focused on realizing work conservation according to the VM-to-VM (virtual machine to virtual machine) flow policy or per-source policy, or both policies. However, they failed to consider allocating redundant bandwidth among VDCs in a fair way. This paper presents a bandwidth that guarantees enforcement framework NXT-Freedom, and this framework allocates the network resources on the basis of per-VDC fairness, which can achieve work conservation. In order to guarantee per-VDC fair allocation, a hierarchical max–min fairness algorithm is put forward in this paper. In order to ensure that the framework can be applied to non-congestion-free network core and achieve scalability, NXT-Freedom decouples the computation of per-VDC allocation from the execution of allocation, but it brings some CPU overheads resulting from bandwidth enforcement. We observe that there is no need to enforce the non-blocking virtual network. Leveraging this observation, we distinguish the virtual network type of VDC to eliminate part of the CPU overheads. The evaluation results of a prototype prove that NXT-Freedom can achieve the isolation of per-VDC performance, which also shows fast adaption to flow variation in cloud datacenter.

30 April 2026 in Ingegneria Sismica
Verified
Journal Article
Open access
PDF file
XWXiaoyuan Wei
Xiaoyuan Wei
SWShuo Wang
Shuo Wang
Music recommendation supported by AI algorithms has been widely used in college students' mental health interventions. In this study, we constructed a three-dimensional entity network of “college students-music resources-socialized labels” by mining and analyzing the features related to the social labels of college students on music social networking platforms to correlate college students' interests in music resources. Multidimensional Correspondence Analysis (MCA) is used to reduce the noise of heterogeneous tag data, and the Boolean matrix of music and tags is established to improve the correlation between tags and resources. Combining the music interest degree scores of college students with the music interest similarity calculation results of neighboring college students, sorting the music to be recommended, recommending music for college students that matches their psychological state, and designing controlled experiments of music intervention for mental health. Through the systematic music recommendation to intervene in the mental health of college students, the four assessment dimension scores of students in the experimental group after the experiment had an improvement of 27.560±3.425 to 37.040±2.613 points.