Mike Jia
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Mike Jia has a total of 8 co-authors. Here are the top co-authors by number of shared publications:
- Weifa Liang
Department of Computer Science, City University of Hong Kong, Hong Kong, P. R. China
2 shared publications - Zichuan Xu
Dalian University of Technology
2 shared publications - Jiannong Cao
The Hong Kong Polytechnic University
1 shared publication Meitian Huang
1 shared publication- Meitian Huang
Research School of Computer Science, Australian National University, Canberra, ACT, Australia
1 shared publication Weifa Liang
Research School of Computer Science, The Australian National University, Canberra, ACT, Australia
1 shared publication
Latest Publications
- 2 January 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 8 (2) , 623-634
QoS-Aware Cloudlet Load Balancing in Wireless Metropolitan Area Networks
With advances in wireless communication technology, more and more people depend heavily on portable mobile devices for businesses, entertainments and social interactions. This poses a great challenge of building a seamless application experience across different computing platforms. A key issue is the resource limitations of mobile devices due to their portable size, however this can be overcome by remotely executing computation-intensive tasks on clusters of near by computers called cloudlets. As increasing numbers of people access the Internet via mobile devices, it is reasonable to envision in the near future that cloudlet services will be available for the public through easily accessible public wireless metropolitan area networks. In this paper we investigate how to balance the workload among multiple cloudlets in such a network to optimize mobile application performance. We introduce a novel system model to capture the response time delays of offloaded tasks and formulate an optimization problem with the aim to minimize the maximum response time among offloaded tasks. We then propose two algorithms for the problem. We finally evaluate the performance of the proposed algorithms in realistic simulation environments. The experimental results demonstrate the significant potential of the proposed algorithms in reducing response time, maximizing user experience.
- 2 January 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 8 (2) , 623-634
QoS-Aware Cloudlet Load Balancing in Wireless Metropolitan Area Networks
With advances in wireless communication technology, more and more people depend heavily on portable mobile devices for businesses, entertainments and social interactions. This poses a great challenge of building a seamless application experience across different computing platforms. A key issue is the resource limitations of mobile devices due to their portable size, however this can be overcome by remotely executing computation-intensive tasks on clusters of near by computers called cloudlets. As increasing numbers of people access the Internet via mobile devices, it is reasonable to envision in the near future that cloudlet services will be available for the public through easily accessible public wireless metropolitan area networks. In this paper we investigate how to balance the workload among multiple cloudlets in such a network to optimize mobile application performance. We introduce a novel system model to capture the response time delays of offloaded tasks and formulate an optimization problem with the aim to minimize the maximum response time among offloaded tasks. We then propose two algorithms for the problem. We finally evaluate the performance of the proposed algorithms in realistic simulation environments. The experimental results demonstrate the significant potential of the proposed algorithms in reducing response time, maximizing user experience.
- 1 December 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Throughput Maximization of NFV-Enabled Unicasting in Software-Defined Networks
Data transfers in contemporary networks depend upon network functions for ensuring data security and system performance. These policies are represented by a service chain that consists of different network functions such as firewalls, Intrusion Detection Systems (IDSs), transcoders, etc. Network Function Virtualization (NFV) has emerged as a promising technology to meet the stringent requirement imposed on the service chain. In this paper, we study NFV-enabled unicasting in SDNs with and without end-to-end delay constraints. We aim to maximize the network throughput for a sequence of NFV-enabled unicast requests without the knowledge of future arrivals. We first formulate the problems as novel optimization problems in terms of both computing and bandwidth resource consumptions, and provide a generic optimization framework. We then develop an online algorithm with guaranteed performance without the delay requirement and a heuristic with the delay requirement. We finally evaluate the performance of the proposed algorithms through experimental simulations. The results of the experimental simulations show that the proposed algorithms are promising.
- 1 December 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Throughput Maximization of NFV-Enabled Unicasting in Software-Defined Networks
Data transfers in contemporary networks depend upon network functions for ensuring data security and system performance. These policies are represented by a service chain that consists of different network functions such as firewalls, Intrusion Detection Systems (IDSs), transcoders, etc. Network Function Virtualization (NFV) has emerged as a promising technology to meet the stringent requirement imposed on the service chain. In this paper, we study NFV-enabled unicasting in SDNs with and without end-to-end delay constraints. We aim to maximize the network throughput for a sequence of NFV-enabled unicast requests without the knowledge of future arrivals. We first formulate the problems as novel optimization problems in terms of both computing and bandwidth resource consumptions, and provide a generic optimization framework. We then develop an online algorithm with guaranteed performance without the delay requirement and a heuristic with the delay requirement. We finally evaluate the performance of the proposed algorithms through experimental simulations. The results of the experimental simulations show that the proposed algorithms are promising.
- Top Cited Papers
- 25 June 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 5 (4) , 725-737
Optimal Cloudlet Placement and User to Cloudlet Allocation in Wireless Metropolitan Area Networks
Mobile applications are becoming increasingly computation-intensive, while the computing capability of portable mobile devices is limited. A powerful way to reduce the completion time of an application in a mobile device is to offload its tasks to nearby cloudlets, which consist of clusters of computers. Although there is a significant body of research in mobile cloudlet offloading technology, there has been very little attention paid to how cloudlets should be placed in a given network to optimize mobile application performance. In this paper we study cloudlet placement and mobile user allocation to the cloudlets in a wireless metropolitan area network (WMAN). We devise an algorithm for the problem, which enables the placement of the cloudlets at user dense regions of the WMAN, and assigns mobile users to the placed cloudlets while balancing their workload. We also conduct experiments through simulation. The simulation results indicate that the performance of the proposed algorithm is very promising.
- 25 June 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cloud Computing
- Vol. 5 (4) , 725-737
Top Cited PapersOptimal Cloudlet Placement and User to Cloudlet Allocation in Wireless Metropolitan Area Networks
Mobile applications are becoming increasingly computation-intensive, while the computing capability of portable mobile devices is limited. A powerful way to reduce the completion time of an application in a mobile device is to offload its tasks to nearby cloudlets, which consist of clusters of computers. Although there is a significant body of research in mobile cloudlet offloading technology, there has been very little attention paid to how cloudlets should be placed in a given network to optimize mobile application performance. In this paper we study cloudlet placement and mobile user allocation to the cloudlets in a wireless metropolitan area network (WMAN). We devise an algorithm for the problem, which enables the placement of the cloudlets at user dense regions of the WMAN, and assigns mobile users to the placed cloudlets while balancing their workload. We also conduct experiments through simulation. The simulation results indicate that the performance of the proposed algorithm is very promising.