Junliang Chen
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Junliang Chen has a total of 21 co-authors. Here are the top co-authors by number of shared publications:
- Bo Cheng
School of Computer Science, Beijing University of Posts and Telecommunications, Beijing 100876, China
7 shared publications - Bingfei Ren
State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, China
2 shared publications - Chuanchang Liu
School of Computer Science, Beijing University of Posts and Telecommunications, Beijing 100876, China
2 shared publications - Shuai Zhao
Beijing University of Posts and Telecommunications
2 shared publications - Tongguang Zhang
State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, China
2 shared publications - Wendi Feng
College of Computer Science, Beijing Information Science and Technology University, Beijing, China
2 shared publications
Latest Publications
- 1 March 2021
- Published by Elsevier in Journal of Network and Computer Applications
- Vol. 178, 102969
Secure and cost-effective controller deployment in multi-domain SDN with Baguette
- 1 March 2021
- Published by Elsevier in Journal of Network and Computer Applications
- Vol. 178, 102969
Secure and cost-effective controller deployment in multi-domain SDN with Baguette
- 1 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 574-581
GMAS: A Geo-Aware MAS-Based Workflow Allocation Approach on Hybrid-Edge-Cloud Environment
Cloud computing is expanding to distributed edge computing(or known as fog computing). Connecting edge and cloud open great potential for real-time and mobility support workflow applications. However, scheduling workflow on a hybrid edge-cloud environment is an NP-hard problem. This paper proposes the Geo-Aware Multi-Agents-System-Based Workflow Allocation Approach(GMAS). Leveraging a novel geo-aware negotiation mechanism, GMAS addresses resource location caused transmission delays, which are the primary sources of workflow bottlenecks. In Multi-Agents-System(MAS), this paper proposes a geo-aware cost model and a dynamic workflow re-structuring strategy that decrease the impact of resource locations on workflow cost. Finally, this paper evaluates GMAS on Cloudsim, and the result shows that GMAS decreases the workflow makespan and traffic overheads.
- 1 October 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 574-581
GMAS: A Geo-Aware MAS-Based Workflow Allocation Approach on Hybrid-Edge-Cloud Environment
Cloud computing is expanding to distributed edge computing(or known as fog computing). Connecting edge and cloud open great potential for real-time and mobility support workflow applications. However, scheduling workflow on a hybrid edge-cloud environment is an NP-hard problem. This paper proposes the Geo-Aware Multi-Agents-System-Based Workflow Allocation Approach(GMAS). Leveraging a novel geo-aware negotiation mechanism, GMAS addresses resource location caused transmission delays, which are the primary sources of workflow bottlenecks. In Multi-Agents-System(MAS), this paper proposes a geo-aware cost model and a dynamic workflow re-structuring strategy that decrease the impact of resource locations on workflow cost. Finally, this paper evaluates GMAS on Cloudsim, and the result shows that GMAS decreases the workflow makespan and traffic overheads.
- Open Access
- 1 January 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 8314-8323
Q-Graphplan: QoS-Aware Automatic Service Composition With the Extended Planning Graph
With the progress of web technologies, web services with abundant functionalities, such as video transmission, location, navigation, etc., are becoming more and more pervasive. Automatic web service composition aims to automatically combine selected elementary web services from a finite service set by matching the input and output parameters given an initial state and a goal state. Considering the end-to-end Quality-of-Service(QoS) of each web service, the service composition problem becomes an optimization problem to find the optimal solution. This paper maps this problem to an automatic planning problem and proposes Q-Graphplan based on the classical graphplan, an efficient planner for solving classical planning problems. First, we construct a planning graph based on the dependency relationships of the web services and extract essential heuristics according to the reachability analysis. Second, we convert this planning graph to a directed path generation graph. Finally, we extract the optimal solution from the path generation graph using a backward A* algorithm with the heuristics of the planning graph. Furthermore, our approach avoids redundancies when constructing the planning graph and improves the searching effectiveness in extracting solution. We conduct experiments on the WSC-2009 dataset to compare performance against present approaches, and the results show the efficiency and effectiveness of our proposed approach.
- 1 January 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 8314-8323
Open AccessQ-Graphplan: QoS-Aware Automatic Service Composition With the Extended Planning Graph
With the progress of web technologies, web services with abundant functionalities, such as video transmission, location, navigation, etc., are becoming more and more pervasive. Automatic web service composition aims to automatically combine selected elementary web services from a finite service set by matching the input and output parameters given an initial state and a goal state. Considering the end-to-end Quality-of-Service(QoS) of each web service, the service composition problem becomes an optimization problem to find the optimal solution. This paper maps this problem to an automatic planning problem and proposes Q-Graphplan based on the classical graphplan, an efficient planner for solving classical planning problems. First, we construct a planning graph based on the dependency relationships of the web services and extract essential heuristics according to the reachability analysis. Second, we convert this planning graph to a directed path generation graph. Finally, we extract the optimal solution from the path generation graph using a backward A* algorithm with the heuristics of the planning graph. Furthermore, our approach avoids redundancies when constructing the planning graph and improves the searching effectiveness in extracting solution. We conduct experiments on the WSC-2009 dataset to compare performance against present approaches, and the results show the efficiency and effectiveness of our proposed approach.
- Open Access
- 26 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 1767-1776
Enabling Ordinary Users Mobile Development With Web Components
The rapid progress of the mobile internet has been promoting the popularity of mobile devices, and mobile application development is getting more pervasive. However, the state of the art development environments has a high learning barrier for users' lack of programming experience. In this paper, instead of traditional programming environments, we take consideration of ordinary users' requirements and propose a WYSIWYG cross-platform web-component-based mobile application creation environment for ordinary users. This environment has a visual editor with a drag-and-drop web component. A web component library model is proposed to standardize customized libraries. A cross-platform application model based on web components is implemented to build applications rapidly. It helps ordinary users generate installing packages within simple operations for multiple platforms. A native plugin model is proposed to assist web components to invoke native functionalities. The experiment result shows that ordinary users could quickly start to create mobile applications in our environment.
- 26 December 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 8, 1767-1776
Open AccessEnabling Ordinary Users Mobile Development With Web Components
The rapid progress of the mobile internet has been promoting the popularity of mobile devices, and mobile application development is getting more pervasive. However, the state of the art development environments has a high learning barrier for users' lack of programming experience. In this paper, instead of traditional programming environments, we take consideration of ordinary users' requirements and propose a WYSIWYG cross-platform web-component-based mobile application creation environment for ordinary users. This environment has a visual editor with a drag-and-drop web component. A web component library model is proposed to standardize customized libraries. A cross-platform application model based on web components is implemented to build applications rapidly. It helps ordinary users generate installing packages within simple operations for multiple platforms. A native plugin model is proposed to assist web components to invoke native functionalities. The experiment result shows that ordinary users could quickly start to create mobile applications in our environment.
- 1 August 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 24, 617-624
Availability-Aware Multi-Objective Virtual Cluster Allocation Optimization in Energy-Efficient Datacenters
With a great number of cloud applications being deployed in virtual clusters (VCs) and running in datacenters, the energy consumption of datacenters is experiencing rapidly cumulative growth. Thus, it is a critical issue that how to allocate virtual machines (VMs) of the VC in physical machines (PMs) for energy savings as much as possible. Considering each PM/switch has a certain failure rate, VMs may not be executed when they meet with any PM/switch fault. So, a compact allocation scheme may benefit in low energy consumption but increase the risk of violating the availability of the VC. In this paper, we consider four optimization objectives about the VC and the datacenter, i.e., availability, energy consumption, average resource utilization, and resource load balance. Then we propose a multi-objective optimization model and raise an evolution algorithm to trade-off among these four optimization objectives. Finally, experimental results show the effectiveness and efficiency of our algorithm.
- 1 August 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 24, 617-624
Availability-Aware Multi-Objective Virtual Cluster Allocation Optimization in Energy-Efficient Datacenters
With a great number of cloud applications being deployed in virtual clusters (VCs) and running in datacenters, the energy consumption of datacenters is experiencing rapidly cumulative growth. Thus, it is a critical issue that how to allocate virtual machines (VMs) of the VC in physical machines (PMs) for energy savings as much as possible. Considering each PM/switch has a certain failure rate, VMs may not be executed when they meet with any PM/switch fault. So, a compact allocation scheme may benefit in low energy consumption but increase the risk of violating the availability of the VC. In this paper, we consider four optimization objectives about the VC and the datacenter, i.e., availability, energy consumption, average resource utilization, and resource load balance. Then we propose a multi-objective optimization model and raise an evolution algorithm to trade-off among these four optimization objectives. Finally, experimental results show the effectiveness and efficiency of our algorithm.
- 1 June 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Data Loss Prevention and Storage Utilization Improvement of the Hidden Volume on Mobile Devices
Sensitive data protection is vital for mobile users. An effective way is to store sensitive data in the hidden volume of mobile devices with Plausibly Deniable Encryption (PDE) systems. Typically, PDE creates a hidden volume inside the outer volume. However, existing PDE systems could lose data, due to overriding the hidden volume, and significantly waste physical storage, because of the fixedly reserved area for the hidden volume. In this paper, we present MobiGyges to solve the above problems. MobiGyges leverages the Thin Pool to coordinate the storage allocation for both the outer volume and the hidden volume which avoids data override and prevents data loss. Moreover, it improves the storage efficiency by virtualizing the total physical storage into small storage blocks and utilizing the blocks for the outer volume and the hidden volume, which eliminates the reserved area. We implement MobiGyges prototype on Google Nexus 6P with LineageOS 13 operating system. Experimental results show that MobiGyges avoids data loss and improves storage utilization up to 31% compared with existing works.
- 1 June 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Data Loss Prevention and Storage Utilization Improvement of the Hidden Volume on Mobile Devices
Sensitive data protection is vital for mobile users. An effective way is to store sensitive data in the hidden volume of mobile devices with Plausibly Deniable Encryption (PDE) systems. Typically, PDE creates a hidden volume inside the outer volume. However, existing PDE systems could lose data, due to overriding the hidden volume, and significantly waste physical storage, because of the fixedly reserved area for the hidden volume. In this paper, we present MobiGyges to solve the above problems. MobiGyges leverages the Thin Pool to coordinate the storage allocation for both the outer volume and the hidden volume which avoids data override and prevents data loss. Moreover, it improves the storage efficiency by virtualizing the total physical storage into small storage blocks and utilizing the blocks for the outer volume and the hidden volume, which eliminates the reserved area. We implement MobiGyges prototype on Google Nexus 6P with LineageOS 13 operating system. Experimental results show that MobiGyges avoids data loss and improves storage utilization up to 31% compared with existing works.
- 4 April 2018
- Published by Taylor & Francis in International Journal of Computers and Applications
- Vol. 41 (6) , 407-417
Research, implementation, and improvement of MPTCP on mobile smart devices
As more and more mobile smart devices (MSDs) are equipped with multiple wireless network interfaces (e.g. WiFi, cellular, etc.), MultiPath TCP (MPTCP) can enable MSDs to send data over several interfaces or paths and can achieve better throughput and robust data transfers. MPTCP thus attracts an increasing interest from both academia and industry. This paper systematically studies MPTCP and clearly describes the relationship between each portions of MPTCP. Up to now, MPTCP has not been widely used in the mobile Internet, one of the reasons is that it is a challenge to research, implement and test MPTCP on the actual MSDs. To overcome the shortcoming of the existing researches on MPTCP being mainly limited to network simulators, a novel approach to port MPTCP to MSDs is proposed, which includes three main steps: first, run real mobile operating system (MOS) on VirtualBox; second, port MPTCP to MOS on VirtualBox and test; third, directly copy modified files in the second step to real MOS on MSD and test. By using this method, MPTCP V0.90 is successfully ported to a real smartphone running Android-7.1.1 for the first time. The validity of the method is proved by experiments. In addition, this paper improves the subpath establishment algorithm of MPTCP and applies the improved MPTCP to Mobile Ad Hoc Network (MANET) constructed by MSDs, the test result shows that our algorithm has better performance than the original MPTCP in achieving higher data throughput.
- 4 April 2018
- Published by Taylor & Francis in International Journal of Computers and Applications
- Vol. 41 (6) , 407-417
Research, implementation, and improvement of MPTCP on mobile smart devices
As more and more mobile smart devices (MSDs) are equipped with multiple wireless network interfaces (e.g. WiFi, cellular, etc.), MultiPath TCP (MPTCP) can enable MSDs to send data over several interfaces or paths and can achieve better throughput and robust data transfers. MPTCP thus attracts an increasing interest from both academia and industry. This paper systematically studies MPTCP and clearly describes the relationship between each portions of MPTCP. Up to now, MPTCP has not been widely used in the mobile Internet, one of the reasons is that it is a challenge to research, implement and test MPTCP on the actual MSDs. To overcome the shortcoming of the existing researches on MPTCP being mainly limited to network simulators, a novel approach to port MPTCP to MSDs is proposed, which includes three main steps: first, run real mobile operating system (MOS) on VirtualBox; second, port MPTCP to MOS on VirtualBox and test; third, directly copy modified files in the second step to real MOS on MSD and test. By using this method, MPTCP V0.90 is successfully ported to a real smartphone running Android-7.1.1 for the first time. The validity of the method is proved by experiments. In addition, this paper improves the subpath establishment algorithm of MPTCP and applies the improved MPTCP to Mobile Ad Hoc Network (MANET) constructed by MSDs, the test result shows that our algorithm has better performance than the original MPTCP in achieving higher data throughput.
- 1 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-2
Performance enhancement of multipath TCP in mobile Ad Hoc networks
In some special circumstances, e.g. tsunamis, floods, battlefields, earthquakes, etc., communication infrastructures are damaged or non-existent, as well as unmanned aerial vehicle (UAV) cluster. For the communication between people or UAVs, UAVs or mobile smart devices (MSDs) can be used to construct Mobile Ad Hoc Networks (MANETs), and Multipath TCP (MPTCP) can be used to simultaneously transmit in one TCP connection via multiple interfaces of MSDs. However the original MPTCP subpaths creating algorithm can establish multiple subpaths between two adjacent nodes, thus cannot achieve true concurrent data transmission. To solve this issue, we research and improve both the algorithm of adding routing table entries and the algorithm of establishing subpaths to offer more efficient use of multiple subpaths and better network traffic load balancing. The main works are as follows: (1) improve multi-hop routing protocol; (2) run MPTCP on UAVs or MSDs; (3) improve MPTCP subpaths establishment algorithm. The results show that our algorithms have better performance than the original MPTCP in achieving higher data throughput.
- 1 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-2
Performance enhancement of multipath TCP in mobile Ad Hoc networks
In some special circumstances, e.g. tsunamis, floods, battlefields, earthquakes, etc., communication infrastructures are damaged or non-existent, as well as unmanned aerial vehicle (UAV) cluster. For the communication between people or UAVs, UAVs or mobile smart devices (MSDs) can be used to construct Mobile Ad Hoc Networks (MANETs), and Multipath TCP (MPTCP) can be used to simultaneously transmit in one TCP connection via multiple interfaces of MSDs. However the original MPTCP subpaths creating algorithm can establish multiple subpaths between two adjacent nodes, thus cannot achieve true concurrent data transmission. To solve this issue, we research and improve both the algorithm of adding routing table entries and the algorithm of establishing subpaths to offer more efficient use of multiple subpaths and better network traffic load balancing. The main works are as follows: (1) improve multi-hop routing protocol; (2) run MPTCP on UAVs or MSDs; (3) improve MPTCP subpaths establishment algorithm. The results show that our algorithms have better performance than the original MPTCP in achieving higher data throughput.
- 1 September 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10903038,p. 1-5
SPMLD: Sub-Packet Based Multipath Load Distribution for Real-Time Multimedia Traffic
Load distribution is vital to the performance of multipath transport. The task becomes more challenging in real-time multimedia applications (RTMA), which impose stringent delay requirements. Two key issues to be addressed are: 1) how to minimize end-to-end delay, and 2) how to alleviate packet reordering that incurs additional recovery time at the receiver. In this paper, we propose SPMLD, a new model that splits traffic at the granularity of sub-packet. The Sub-Packet based Multipath Load Distribution (SPMLD) model aims to minimize total packet delay by effectively aggregating multiple parallel paths as a single virtual path. First, we formulate the packet splitting over multiple paths as a constrained optimization problem and derive its solution based on progressive approximation method. Second, in the solution, we analyze queuing delay by introducing D/M/1 model and obtain the expression of dynamic packet splitting ratio for each path. The performances of SPMLD are evaluated through extensive simulations in QualNet using real-time H.264 video streaming. Experimental results demonstrate that: SPMLD outperforms previous flow and packet based load distribution models in total packet delay, end-to-end delay and seldom induces packet reordering. Besides, SPMLD's extra overhead is tiny compared to the input video streaming.
- 1 September 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 10903038,p. 1-5
SPMLD: Sub-Packet Based Multipath Load Distribution for Real-Time Multimedia Traffic
Load distribution is vital to the performance of multipath transport. The task becomes more challenging in real-time multimedia applications (RTMA), which impose stringent delay requirements. Two key issues to be addressed are: 1) how to minimize end-to-end delay, and 2) how to alleviate packet reordering that incurs additional recovery time at the receiver. In this paper, we propose SPMLD, a new model that splits traffic at the granularity of sub-packet. The Sub-Packet based Multipath Load Distribution (SPMLD) model aims to minimize total packet delay by effectively aggregating multiple parallel paths as a single virtual path. First, we formulate the packet splitting over multiple paths as a constrained optimization problem and derive its solution based on progressive approximation method. Second, in the solution, we analyze queuing delay by introducing D/M/1 model and obtain the expression of dynamic packet splitting ratio for each path. The performances of SPMLD are evaluated through extensive simulations in QualNet using real-time H.264 video streaming. Experimental results demonstrate that: SPMLD outperforms previous flow and packet based load distribution models in total packet delay, end-to-end delay and seldom induces packet reordering. Besides, SPMLD's extra overhead is tiny compared to the input video streaming.
- Open Access
- 1 January 2007
- Published by Springer Nature
- p. 178-189
Integrating Semantic Business Policy into Web Service Composition
- 1 January 2007
- Published by Springer Nature
- p. 178-189
Open AccessIntegrating Semantic Business Policy into Web Service Composition