• KSII Transactions on Internet and Information Systems
    Monthly Online Journal (eISSN: 1976-7277)

A Heuristic Algorithm for Optimal Facility Placement in Mobile Edge Networks

Vol. 11, No.7, July 31, 2017
10.3837/tiis.2017.07.002, Download Paper (Free):

Abstract

Installing caching and computing facilities in mobile edge networks is a promising solution to cope with the challenging capacity and delay requirements imposed on future mobile communication systems. The problem of optimal facility placement in mobile edge networks has not been fully studied in the literature. This is a non-trivial problem because the mobile edge network has a unidirectional topology, making existing solutions inapplicable. This paper considers the problem of optimal placement of a fixed number of facilities in a mobile edge network with an arbitrary tree topology and an arbitrary demand distribution. A low-complexity sequential algorithm is proposed and proved to be convergent and optimal in some cases. The complexity of the algorithm is shown to be ()2OHγ, where H is the height of the tree and γ is the number of facilities. Simulation results confirm that the proposed algorithm is effective in producing near-optimal solutions.


Statistics

Show / Hide Statistics

Statistics (Cumulative Counts from December 1st, 2015)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article

[IEEE Style]
Jiping Jiao, Lingyu Chen, Xuemin Hong and Jianghong Shi, "A Heuristic Algorithm for Optimal Facility Placement in Mobile Edge Networks," KSII Transactions on Internet and Information Systems, vol. 11, no. 7, pp. 3329-3350, 2017. DOI: 10.3837/tiis.2017.07.002

[ACM Style]
Jiao, J., Chen, L., Hong, X., and Shi, J. 2017. A Heuristic Algorithm for Optimal Facility Placement in Mobile Edge Networks. KSII Transactions on Internet and Information Systems, 11, 7, (2017), 3329-3350. DOI: 10.3837/tiis.2017.07.002