Haitao Wu

Haitao Wu

Auto-generated profile, based on publicly available information

Haitao Wu

Department of mathematics, Nanjing University, China, and also with the CERI-LIA at the University of Avignon

Research Focus & Metrics

Academic Career Length

25Years (2002-Present)

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

Representative Publications

View All Publications
28 April 2017 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
HWHaitao Wu
Haitao Wu
FZFen Zhou
Fen Zhou
Zuqing ZhuZuqing Zhu
Zuqing Zhu
YCYaojun Chen
Yaojun Chen
In elastic optical networks, two lightpaths sharing common fiber links might have to be isolated in the spectrum domain with a proper guard-band to prevent crosstalk and/or reduce physical-layer security threats. Meanwhile, the actual requirements on guard-band sizes can vary for different lightpath pairs, because of various reasons. Therefore, in this paper, we consider the situation in which the actual guardband requirements for different lightpath pairs are different, and formulate the distance spectrum assignment (DSA) problem to investigate how to assign the spectrum resources efficiently in such a situation. We first define the DSA problem formally and prove its NP-hardness and inapproximability. Then, we analyze and provide the upper and lower bounds for the optimal solution of DSA, and prove that they are tight. In order to solve the DSA problem time-efficiently, we develop a two-phase algorithm. In its first phase, we obtain an initial solution and then the second phase improves the quality of the initial solution with random optimization. We prove that the proposed two-phase algorithm can get the optimal solution in bipartite DSA conflict graphs and can ensure an approximate ratio of O(log(|V|)) in complete DSA conflict graphs, where |V| is the number of vertices in the conflict graph, i.e., the number of lightpaths to be considered. Numerical results demonstrate our proposed algorithm can find near-optimal solutions for DSA in various conflict graphs.

1 April 2018
Verified
Conference Paper
Open access
ZLZhuotao Liu
Zhuotao Liu
KCKai Chen
Kai Chen
HWHaitao Wu
Haitao Wu
SHShuihai Hu
Shuihai Hu
YHYih-Chun Hut
Yih-Chun Hut
GZGong Zhang
Gong Zhang
Today's cloud networks are shared among many tenants. Bandwidth guarantees and work conservation are two key properties to ensure predictable performance for tenant applications and high network utilization for providers. Despite significant efforts, very little prior work can really achieve both properties simultaneously even some of them claimed so. In this paper, we present QShare, a comprehensive in-network solution to achieve bandwidth guarantees and work conservation simultaneously. QShare leverages weighted fair queuing on commodity switches to slice network bandwidth for tenants, and solves the challenge of queue scarcity through balanced tenant placement and dynamic tenant-queue binding. We have implemented a QShare prototype and evaluated it extensively via both testbed experiments and simulations. Our results show that QShare ensures bandwidth guarantees while driving network utilization to over 91% even under unpredictable traffic demands.

16 June 2020 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
HWHaitao Wu
Haitao Wu
FZFen Zhou
Fen Zhou
YCYaojun Chen
Yaojun Chen
RZRan Zhang
Ran Zhang
Network virtualization provides a promising solution to overcome the ossification of current networks, allowing multiple Virtual Network Requests (VNRs) to be embedded on a common infrastructure. The major challenge in network virtualization is the Virtual Network Embedding (VNE) problem, which is to embed VNRs onto a shared substrate network and known to be NP-hard. The topological heterogeneity of VNRs is one important factor hampering the performance of the VNE. However, in many specialized applications and infrastructures, VNRs are of some common structural features e.g., paths and cycles. To achieve better outcomes, it is thus critical to design dedicated algorithms for these applications and infrastructures by taking into accounting topological characteristics. Besides, paths and cycles are two of the most fundamental topologies that all network structures consist of. Exploiting the characteristics of path and cycle embeddings is vital to tackle the general VNE problem. In this paper, we investigate the path and cycle embedding problems. For path embedding, we prove its NP-hardness and inapproximability. Then, by utilizing Multiple Knapsack Problem (MKP) and Multi-Dimensional Knapsack Problem (MDKP), we propose an efficient and effective MKP-MDKP-based algorithm. For cycle embedding, we propose a Weighted Directed Auxiliary Graph (WDAG) to develop a polynomial-time algorithm to determine the least-resource-consuming embedding. Numerical results show our customized algorithms can boost the acceptance ratio and revenue compared to generic embedding algorithms in the literature.

16 March 2017
Verified
Conference Paper
Closed access
HWHaitao Wu
Haitao Wu
YLyunhe li
yunhe li
JJJian Jiao
Jian Jiao
BCBin Cao
Bin Cao
Qinyu ZhangQinyu Zhang
Qinyu Zhang
To describe the transmission performance of LTP protocol more intuitively and accurately, it is an original work to model the transfer procedure of a single LTP session, and analyze the expected file delivery time of a data block theoretically. In order to improve the data transmission efficiency in extreme long and error-prone deep space links, an asynchronous accelerated retransmission strategy triggered by the receiver during the course of the red-part original transmission is proposed for recovering the missing data segments sooner. The asynchronous accelerated retransmission process in deep space environment is modeled, and the theoretical expression of the expected file delivery time based on the proposed strategy is derived. The performance of strategy is analyzed by numerical simulations under the Mars to Earth scenario. The strategy is verified to accelerate the retransmission process, effectively shorten the file delivery time and improve the efficiency of file transmission.