Wuyunzhaola Borjigin

Wuyunzhaola Borjigin

Auto-generated profile, based on publicly available information

Wuyunzhaola Borjigin

Inner Mongolia University of Finance and Economics

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
21 November 2018 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Open access
WBWuyunzhaola Borjigin
Wuyunzhaola Borjigin
KOKaoru Ota
Kaoru Ota
MDMianxiong Dong
Mianxiong Dong

17 February 2025 in International Review of Financial Analysis
Verified
Journal Article
Closed access
WBWuyunzhaola Borjigin
Wuyunzhaola Borjigin
SHSarula He
Sarula He
HXHuixian Xu
Huixian Xu

9 June 2020 in IEEE Transactions on Cloud Computing
Verified
Journal Article
Closed access
XTXiaoyi Tao
Xiaoyi Tao
KOKaoru Ota
Kaoru Ota
MDMianxiong Dong
Mianxiong Dong
WBWuyunzhaola Borjigin
Wuyunzhaola Borjigin
HQHeng Qi
Heng Qi
KLKeqiu Li
Keqiu Li
The Inter-datacenter transfer is a fundamental service for global cloud applications. Geo-distributed data centers become an essential resource for their application performance which may be destroyed by network congestion. Recent years, most inter-datacenter transfer methods focus on allocating transfers by bandwidth allocation to achieve low cost or high utilization. However, the congestion condition is rarely considered in these works. In this paper, we introduce a congestion-aware traffic allocation method named CONA (CONgestion-Aware), whose target is to maximize the profit of allocation transfer among multiple data centers. On this purpose, a maximizing optimization model is proposed, and an efficient link grading strategy is presented. A matrix transformation method is also introduced to simplify the optimization problem. Furthermore, the link congestion condition is considered by the controller, as well as the prediction on link congestion. To verify our proposed method, simulation model is established and comprehensive experiments are conducted. The experimental results show that our method brings higher profit than fair share traffic allocation method.

18 March 2022 in IEEE Transactions on Computational Social Systems
Verified
Journal Article
Closed access
WBWuyunzhaola Borjigin
Wuyunzhaola Borjigin
KOKaoru Ota
Kaoru Ota
MDMianxiong Dong
Mianxiong Dong
As a new and effective technology, network function virtualization (NFV) manages network nodes to improve service performance for the next-generation network. Despite its promised effectiveness, efficiently deploying the functions to different consumers is the major difficulty presented in NFV. In this article, the multiple-Walrasian auction graphic model combined with virtual network functions of different bundled tree nodes based on Vickrey-Clarke-Grove (VCG) payment is proposed to maximize the social effectiveness of NFV. It is the first work to define the virtualized service as a tree valuation in the NFV market. To solve this problem, novel algorithms, including the valuation structure algorithm and auction strategy, are implemented along with the NFV to schedule network resources. With all theories considered, we conducted a comprehensive simulation to verify the tree valuation mechanism. The results confirmed that the tree valuation mechanism outperforms the backpack auction model and reserve auction model with respect to social welfare.

1 September 2017
Verified
Conference Paper
Closed access
WBWuyunzhaola Borjigin
Wuyunzhaola Borjigin
KOKaoru Ota
Kaoru Ota
MDMianxiong Dong
Mianxiong Dong
Coflow is a collection of parallel flows, while a job consists of a set of coflows. A job is completed if all of the flows completes in the coflows. Therefore, the completion time of a job is affected by the latest flows in the coflows. To guarantee the job completion time and service performance, the job deadline and the dependency of coflows needs to be considered in the scheduling process. However, most existing methods ignore the dependency of coflows which is important to guarantee the job completion. In this paper, we take the dependency of coflows into consideration. To guarantee job completion for performance, we formulate a deadline and dependency-based model called MTF scheduler model. The purpose of MTF model is to minimize the overall completion time with the constraints of deadline and network capacity. Accordingly, we propose our method to schedule dependent coflows. Especially, we consider the dependent coflows as an entirety and propose a valuable coflow scheduling first MTF algorithm. We conduct extensive simulations to evaluate MTF method which outperforms the conventional short job first method as well as guarantees the job deadline.