access icon free Instance expansion algorithm for micro-service with prediction

© The Institution of Engineering and Technology
Received 04/11/2017, Published 01/02/2018

Instance expansion of micro-service consumes time for constructing new instances, it cannot satisfy the requirement of low latency service, such as scientific calculation workflows. In order to reduce the time for expanding instances, an instance expansion algorithm for micro-service with prediction is proposed in this letter, which sets correntropy as cost function and uses maximum correntropy criteria to filter the burst service requirements to improve the accuracy of prediction, and use stochastic gradient descent algorithm to train the data set to predict the required micro-service instances in the next time. The performance of the proposed algorithm is analysed in a real experiment telecom office with the compared ones using A/B test, and the experimental results show that the proposed algorithm has 70% less time of instance expansion than the compared ones, and the accuracy of the proposed algorithm is 20% more than the compared one which uses least mean square as the cost function.

Inspec keywords: maximum entropy methods; gradient methods; Web services; service-oriented architecture

Other keywords: instance expansion algorithm; instance expansion time; A/B test; maximum correntropy criteria; cost function; least mean square; low latency service; stochastic gradient descent algorithm; microservice

Subjects: Interpolation and function approximation (numerical analysis); Internet software; Software engineering techniques

References

    1. 1)
      • 2. Kan, C.: ‘Docloud: an elastic cloud platform for web applications based on docker’. Int. Conf. on Advanced Communication Technology, Botswana, 2016, vol. 7, pp. 478–483.
    2. 2)
      • 1. Alshuqayran, N., Ali, N., Evans, R.: ‘A systematic mapping study in microservice architecture’. Int. Conf. on Service-Oriented Computing and Applications, Banff, Canada, 2016, vol. 10, pp. 44–51.
    3. 3)
      • 4. Hua, Q., Wentao, M., Jihong, Z., et al: ‘Kernel least mean kurtosis based online chaotic time series prediction’, Chin. Phys. Lett., 2013, 30, (11), pp. 468–477.
    4. 4)
      • 3. Nguyen, P., Nahrstedt, K.: ‘MONAD: self-adaptive micro-service infrastructure for heterogeneous scientific workflows’. Int. Conf. on Autonomic Computing, Tucson, USA, 2017, vol. 9, pp. 187–196.
    5. 5)
      • 5. Zhu, X., Gong, X., Tsang, D.: ‘The optimal macro control strategies of service providers and micro service selection of users: quantification model based on synergetics’, Wirel. Netw., 2017, 23, (1), pp. 1–14.
http://iet.metastore.ingenta.com/content/journals/10.1049/el.2017.4117
Loading

Related content

content/journals/10.1049/el.2017.4117
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading