报告题目：Optimal Edge User Allocation in Edge Computing with Variable Sized Vector Bin Packing
Qiang HE received his first Ph. D. degree from Swinburne University of Technology (SUT), Australia, in 2009 and his second Ph. D. degree from Huazhong University of Science and Technology (HUST), China, in 2010. He is a currently a senior lecturer at Swinburne University of Technology. His major research interests include edge computing, software engineering, service-oriented computing and cloud computing. He has published 80+ papers at top venues, e.g., TSE, TSC, TBD, JPDC, ICSE, WWW, ICDE, IJCAI, ICWS, ICSOC and CLOUD. He is recipient of the Best Student Paper Award at SCC2018 and ICWS2017 and the Best Paper Award at ICSOC2018.
In mobile edge computing, edge servers are geographically distributed around base stations placed near end-users to provide highly accessible and efficient computing capacities and services. In the mobile edge computing environment, a service provider can deploy its service on hired edge servers to reduce end-to-end service delays experienced by its end-users allocated to those edge servers. An optimal deployment must maximize the number of allocated end-users and minimize the number of hired edge servers while ensuring the required quality of service for end-users. In this seminar, we will discuss how to model the edge user allocation (EUA) problem as a bin packing problem, and introduce a novel, optimal approach to solving the EUA problem based on the Lexicographic Goal Programming technique. This paper was awarded the Best Paper Award at the International Conference on Service-Oriented Computing in 2018.
邀请人：马于涛 副教授、王健 讲师