ABSTRACT
This chapter discusses the cooperative microservices provisioning among end devices and introduce a local optimal caching algorithm that targets the limited resource and privacy issues to encourage end devices to provide caching services. Based on the mobile caching game, a local optimal caching algorithm is developed for achieving the best caching strategy for mixed cooperative and selfish-neighbours. The social selfishness-based utility involves two major aspects, the access admission mechanism and the social group utility mechanism. The main idea of our algorithm for the caching model is to choose devices one by one and maximise the social selfishness-based utility for each of them accordingly until the system reaches the Nash Equilibrium. A Local Optimal Caching Algorithm with Social Selfishness is introduced to prove the existence of Nash equilibrium and solve the game. Data-centric applications such as mobile caching is considered to be a promising solution to cope with the explosive data.
