HIGHLIGHTS
- who: CJ from the (UNIVERSITY) have published the research work: IEEE Paper Template in A4 (V1), in the Journal: (JOURNAL)
- what: This study shows that the problem of service placement in a microservice application considering affinities constrained by computational resources can be mapped to an instance of the Binary Knapsack Problem. The authors propose a container and merging mechanism based on a heuristic solution to the Binary Knapsack Problem. This study has done a comparison between several container networks in a single host and multiple hosts separately. B. Container Placement Problem Based on the aforementioned . . .
If you want to have access to all the content you need to log in!
Thanks :)
If you don't have an account, you can create one here.