A Hybrid Heuristic Approach to Provider Selection and Task Allocation Problem in Telecommunications with Varying QoS Levels
- DOI
- 10.2991/ijcis.2017.10.1.58How to use a DOI?
- Keywords
- Hybrid GA; telecommunications; provider selection; resource allocation; quality of service (QoS)
- Abstract
In this research, we study a cost minimization problem for a firm that acquires capacity from providers to accomplish daily operations on telecommunication networks. We model the related optimization problem considering quality of service and capacity requirements and offer a solution approach based on genetic algorithm (GA). Our model reckons the tradeoff between the network capacity acquisition cost and opportunity cost arise when data transmission quality for real-time tasks manifested at undesired levels. To better represent the related features and complexities, we model both capacity and loss probability requirements explicitly, and then, formulate delay and jitter requirements as level matching constraints. Using an experimental framework, we analyze how optimal behavior of the firm is affected by different price schemes, transmission quality and task distributions. We also compare three GA based heuristic solution approaches and comment on the suitability of them on resource selection and task allocation problems.
- Copyright
- © 2017, the Authors. Published by Atlantis Press.
- Open Access
- This is an open access article under the CC BY-NC license (http://creativecommons.org/licences/by-nc/4.0/).
Download article (PDF)
View full text (HTML)
Cite this article
TY - JOUR AU - Nihat Kasap AU - Berna Tektaş Sivrikaya AU - Hasan Hüseyin Turan AU - Dursun Delen PY - 2017 DA - 2017/04/10 TI - A Hybrid Heuristic Approach to Provider Selection and Task Allocation Problem in Telecommunications with Varying QoS Levels JO - International Journal of Computational Intelligence Systems SP - 866 EP - 881 VL - 10 IS - 1 SN - 1875-6883 UR - https://doi.org/10.2991/ijcis.2017.10.1.58 DO - 10.2991/ijcis.2017.10.1.58 ID - Kasap2017 ER -