Distributed parallelization of greedy Mobile Network Optimization algorithms

Ye, Y., Cadenas, J.O. and Megson, G.M. (2013) Distributed parallelization of greedy Mobile Network Optimization algorithms. In: 21st International Conference on Software, Telecommunications and Computer Networks (SoftCOM), Primosten, 18-20 Sept. 2013. IEEE, pp. 1-5.

Full text not available from this repository.
Official URL: https://dx.doi.org/10.1109/SoftCOM.2013.6671867


The Mobile Network Optimization (MNO) technologies have advanced at a tremendous pace in recent years. And the Dynamic Network Optimization (DNO) concept emerged years ago, aimed to continuously optimize the network in response to variations in network traffic and conditions. Yet, DNO development is still at its infancy, mainly hindered by a significant bottleneck of the lengthy optimization runtime. This paper identifies parallelism in greedy MNO algorithms and presents an advanced distributed parallel solution. The solution is designed, implemented and applied to real-life projects whose results yield a significant, highly scalable and nearly linear speedup up to 6.9 and 14.5 on distributed 8-core and 16-core systems respectively. Meanwhile, optimization outputs exhibit self-consistency and high precision compared to their sequential counterpart. This is a milestone in realizing the DNO. Further, the techniques may be applied to similar greedy optimization algorithm based applications.

Item Type: Book Section
SWORD Depositor: repository@westminster.ac.uk
Depositing User: repository@westminster.ac.uk
Date Deposited: 09 Aug 2016 16:02
Last Modified: 09 Aug 2016 16:02
URI: http://westminsterresearch.wmin.ac.uk/id/eprint/17475

Actions (login required)

Edit Item (Repository staff only) Edit Item (Repository staff only)