Pengzhan Wang

Pengzhan Wang

Auto-generated profile, based on publicly available information

Pengzhan Wang

School of Computer Science and Technology, University of Science and Technology of China, Hefei, China

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
12 February 2019 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
SWShaowei Wang
Shaowei Wang
LHLiusheng Huang
Liusheng Huang
YNYiwen Nie
Yiwen Nie
XZXinyuan Zhang
Xinyuan Zhang
PWPengzhan Wang
Pengzhan Wang
WYWei Yang
Wei Yang

8 January 2018 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
PWPengzhan Wang
Pengzhan Wang
HXHongli Xu
Hongli Xu
LHLiusheng Huang
Liusheng Huang
CQChen Qian
Chen Qian
SWShaowei Wang
Shaowei Wang
YSYanjing Sun
Yanjing Sun
Software defined networking (SDN) is becoming increasingly prevalent for its programmability that enables centralized network configuration and management. With the growth of SDNs, a cluster of controllers cooperatively manages more and more switches/flows in a network to avoid the single-controller congestion/failure and improve the control-plane robustness. Under the architecture with multiple controllers, it is expected to minimize the maximum response time on these controllers to provide better QoS for users. To achieve this target, two previous methods are mainly used, the static scheme and the dynamic scheme. However, these methods may lead to an increase of the control-plane communication overhead/delay. In this paper, we propose to minimize the maximum response time on controllers through flow redirecting, which is implemented by installing wildcard rules on switches. We formulate the minimum controller response time problem, which takes the flow-table size and link capacity constraints into account, as an integer linear program, and prove its NP-Hardness. Two algorithms with bounded approximation factors are designed to solve this problem. We implement the proposed methods on our SDN testbed. The testing results and extensive simulation results show that our proposed algorithm can reduce the maximum controller response time by about 50%-80% compared with the static/dynamic methods under the same controller cost, or reduce the number of controllers by 30% compared with the dynamic method while preserving almost the same controller response time.

2 August 2018 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
GZGongming Zhao
Gongming Zhao
HXHongli Xu
Hongli Xu
SCShigang Chen
Shigang Chen
LHLiusheng Huang
Liusheng Huang
PWPengzhan Wang
Pengzhan Wang
Software-defined networking (SDN) separates the control plane from the data plane to ease network management and provide flexibility in packet routing. The control plane interacts with the data plane through an interface that configures the forwarding tables, usually including a flow table and a group table, at each switch. Due to high cost and power consumption of ternary content addressable memory, commodity switches can only support flow/group tables of limited size, which presents serious challenge for SDN to scale to large networks. One promising approach to address the scalability problem is to deploy aggregate default paths specified by wildcard forwarding rules. However, the multi-dimensional interaction among numerous system parameters and performance/scalability considerations makes the problem of setting up the flow/group tables at all switches for optimal overall layout of default paths very challenging. This paper studies the joint optimization of flow/group tables in the complex setting of large-scale SDNs. We formulate this problem as an integer linear program, and prove its NP-hardness. An efficient algorithm with bounded approximation factors is proposed to solve the problem. The properties of our algorithm are formally analyzed. We implement the proposed algorithm on an SDN test bed for experimental studies and use simulations for large-scale investigation. The experimental results and simulation results show that, under the same number of flow entries, our method can achieve better network performance than the equal cost multipath while reducing the use of group entries by about 74%. Besides, our method can reduce the link load ratio and the number of flow entries by approximately 13% and 60% compared with DevoFlow with 10% additional group entries.

5 October 2017 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
PWPengzhan Wang
Pengzhan Wang
HXHongli Xu
Hongli Xu
LHLiusheng Huang
Liusheng Huang
JHJie He
Jie He
ZMZeyu Meng
Zeyu Meng
Software defined networking (SDN) separates the data plane and control plane on independent devices. Since the data plane, consisting of switches, is responsible for packets forwarding, previous work often considers the different constraints (e.g., data link capacity and flow-table size) only in the data plane to provide better QoS for users. However, due to limited CPU processing power and low speed of flow-table updating on each switch, the control channels/links between switches and the controller often have very limited capacity, which will cause QoS performance (e.g., response time and throughput) degradation when the switch should handle a high traffic load. The goal of our paper is to achieve better QoS by jointly considering the control link constraint and other different constraints of the data plane in SDNs. We formally define the control link load balancing and low delay route deployment problems, and prove the NP-Hardness. We present two algorithms with bounded approximation factors for each problem and implement the proposed methods on our SDN testbed. Extensive simulation results and experimental results show that our algorithms can reduce control link load by about 50% and response time by about 60%, and increase the network throughput by 65% compared with previous methods.

1 December 2015
Verified
Conference Paper
Closed access
SWShaowei Wang
Shaowei Wang
LHLiusheng Huang
Liusheng Huang
PWPengzhan Wang
Pengzhan Wang
YSYao Shen
Yao Shen
HXHongli Xu
Hongli Xu
WYWei Yang
Wei Yang
The popularity of mobile devices has far expanded the application scenarios of spatial crowdsensing, due to its ability to provide fine-grained multi dimensional sensor readings associated with location information. Privacy is one of the fundamental issues in crowdsensing, as these location-based sensor readings may reveal identities or activities of participants. In this paper, we adopts the state-of-art location privacy definition geo-indistinguishability, provide an efficient and effective privacy preserving histogram aggregation mechanism BFMM (Bit Flipping Matrix Mechanism) for fine-grained multi dimensional location-based data. Theoretical analyses and experimental results demonstrate the efficiency and effectiveness of our approach for fine-grained multidimensional location-based data. Specifically, the aggregation accuracy of our approach averagely outperforms existing methods by a factor of number of buckets in the histogram.

24 September 2018 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
PWPengzhan Wang
Pengzhan Wang
HXHongli Xu
Hongli Xu
LHLiusheng Huang
Liusheng Huang
JHJie He
Jie He
ZMZeyu Meng
Zeyu Meng
In [1] , reference [16] should be replaced as follows: [16] P. Chao, Y. Tan, and L. T. Yang, “New algorithms for the minimum-cost single-source unsplittable flow problem,” in Proc. 21st Int. Conf. Adv. Inf. Netw. Appl. Workshops (AINAW) , Niagara Falls, ON, Canada, May 2007.