Deakin University
Browse

File(s) under permanent embargo

Optimal edge user allocation in edge computing with variable sized vector bin packing

conference contribution
posted on 2018-01-01, 00:00 authored by P Lai, Q He, Mohamed AbdelrazekMohamed Abdelrazek, Feifei ChenFeifei Chen, J Hosking, John Grundy, Y Yang
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 paper, we 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. We have conducted three series of experiments to evaluate the proposed approach against two representative baseline approaches. Experimental results show that our approach significantly outperforms the other two approaches.

History

Event

Service-Oriented Computing. Conference (16th : 2018 : Hangzhou, China)

Volume

11236

Series

Service-Oriented Computing Conference

Pagination

230 - 245

Publisher

Springer

Location

Hangzhou, China

Place of publication

Cham, Switzerland

Start date

2018-11-12

End date

2018-11-15

ISSN

0302-9743

eISSN

1611-3349

ISBN-13

9783030035952

Language

eng

Publication classification

E1 Full written paper - refereed

Copyright notice

2018, Springer Nature Switzerland AG

Editor/Contributor(s)

C Pahl, M Vukovic, J Yin, Q Yu

Title of proceedings

ICSOC 2018 : Proceedings of the 16th International Conference on Service Oriented Computing