Instance expansion algorithm for micro‐service with prediction. Issue 6 (1st March 2018)

• Record Type: Journal Article
• Authors: Zhu, Min; Qu, Hua; Zhao, Jihong
• Is Part Of: Electronics letters. Volume 54:Issue 6(2018)
• Page Start: 356
• Page End: 357
• Publication Date: 2018-03-01
• Subjects: Web services -- service‐oriented architecture -- maximum entropy methods -- gradient methods; instance expansion algorithm -- microservice -- low latency service -- instance expansion time -- cost function -- maximum correntropy criteria -- stochastic gradient descent algorithm -- A/B test -- least mean square; Electronics -- Periodicals; 621.381
• DOI: 10.1049/el.2017.4117
• Languages: English
• ISSNs: 0013-5194

Abstract

Abstract : 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.