Loading...

An efficient and social-aware distributed in-network caching scheme in named data networks using matching theory

Ehsanpour, M ; Sharif University of Technology | 2019

525 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.comnet.2019.05.009
  3. Publisher: Elsevier B.V , 2019
  4. Abstract:
  5. One of the main characteristics of Named Data Networks (NDN) which makes it a promising architecture for the future of the Internet is its universal in-network caching. Due to the limited caching capacity of the network and the infinite amount of data objects, the cache management scheme becomes a challenging task in NDN. While existing cache management schemes utilize network's caching capacity inefficiently by redundantly keeping popular objects across the network and concentrate on improving bandwidth utilization, we focus on a novel criterion to elevate the cache utilization efficiency. In this paper, a distributed solution that associates the objects to the cache-enabled nodes and maximizes the total network's social welfare is proposed which models the problem of network's social welfare maximization as a many-to-one matching game. Further, it is proved that the proposed solution has a number of desired properties. The resulting matching is stable and the outcome of the proposed algorithm is in Competitive Equilibrium, the social-welfare of the proposed algorithm converges to the social-welfare of the centralized optimal approach as the price step number is sufficiently small, the proposed algorithm converges after a finite number of iterations with relatively low overhead and the cost of retrieving the required objects is the minimum for the Internet Service Providers (ISP). Finally, simulation results show the convergence of our proposed scheme to the centralized optimal solution and its outperformance against the default applied caching scheme in NDN in terms of both network's social welfare and hit ratio. © 2019 Elsevier B.V
  6. Keywords:
  7. Cache management scheme ; Distributed algorithm ; Matching theory ; Internet service providers ; Parallel algorithms ; Band-width utilization ; Cache management schemes ; Competitive equilibrium ; Distributed solutions ; Internet service providers (ISP) ; Named data networks ; Social welfare maximization ; Information management
  8. Source: Computer Networks ; Volume 158 , 2019 , Pages 175-183 ; 13891286 (ISSN)
  9. URL: https://www.sciencedirect.com/science/article/abs/pii/S1389128618305863