On Popular Services Pushing and Distributed Caching in Converged Overlay Networks

This paper proposes a novel popular services pushing and caching scheme by using converged overlay networks (CON). The most popular services are pushed by terrestrial broadcasting networks. And they are cached in n router-nodes with limited cache sizes. Each router-node only interconnects with its neighbor nodes. Users are served through the router's WiFi link. If the services requested are cached in the routers, the user can be immediately responded; otherwise, the requests can be responded through the link from cellular stations to the router. In the proposed scheme, the cache size of the router, the maximum number of requests each router can serve, and the whole-time delay are limited. Node-selecting and dynamic programming algorithm is adopted to maximize the equivalent throughput. Analytical and numerical results demonstrate that the proposed scheme is very effective.