A Shortest-Response-Time Assured Microservices Selection Framework
2017 15TH IEEE INTERNATIONAL SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING WITH APPLICATIONS AND 2017 16TH IEEE INTERNATIONAL CONFERENCE ON UBIQUITOUS COMPUTING AND COMMUNICATIONS (ISPA/IUCC 2017)(2017)
Abstract
Service response time is considered as one of the most important quality parameters of a web service. This paper focuses on the microservices selection problem that how to select a service invocation path with the shortest response time. We propose a novel distributed microservices selection framework (DMSF) which is distributed and can be easily integrated into common microservices architectures. A distributed microservices selection algorithm (DMSA) is developed within the framework, which incorporates the aspects of both source routing algorithm and distributed routing algorithm. DMSF attempts to reduce the time complexity of service selection and communication overhead while ensuring the shortest response time. The experiment results show that DMSF outperforms the existing frameworks in terms of time complexity, communication overhead and response time.
MoreTranslated text
Key words
Microservices, service selection, shortest response time
AI Read Science
Must-Reading Tree
Example
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined