Browsing by Author "Prabhakaran, V.M."

Now showing 1 - 4 of 4

Coded caching in hybrid networks
(2016) Sridhar, A.; Karamchandani, N.; Prabhakaran, V.M.
Caching networks have been extensively studied from an information-theoretic perspective for various network topologies. In particular device-to-device (D2D) topologies have been considered and it has been shown that rates similar to a centralized server setup can be achieved. Hierarchical networks with an intermediate layer of cache called mirrors between the server and the users have been looked at previously and approximately optimal schemes have been developed. In this paper we consider a more general hybrid network, where the mirrors in hierarchical network are connected to form a D2D network in between the server and the end users. We study the trade-off between the sum-rate in the D2D network and the server transmission rate, to understand the extent to which the D2D network can act as a substitute for the server. To this end, we propose an achievable scheme to operate the network for any values of mirror and user cache memory, and prove that is optimal up to a constant additive and multiplicative gap. � 2016 IEEE.
Coded caching in hybrid networks
(Institute of Electrical and Electronics Engineers Inc., 2016) Sridhar, A.; Karamchandani, N.; Prabhakaran, V.M.
Caching networks have been extensively studied from an information-theoretic perspective for various network topologies. In particular device-to-device (D2D) topologies have been considered and it has been shown that rates similar to a centralized server setup can be achieved. Hierarchical networks with an intermediate layer of cache called mirrors between the server and the users have been looked at previously and approximately optimal schemes have been developed. In this paper we consider a more general hybrid network, where the mirrors in hierarchical network are connected to form a D2D network in between the server and the end users. We study the trade-off between the sum-rate in the D2D network and the server transmission rate, to understand the extent to which the D2D network can act as a substitute for the server. To this end, we propose an achievable scheme to operate the network for any values of mirror and user cache memory, and prove that is optimal up to a constant additive and multiplicative gap. Â© 2016 IEEE.
Critical database size for effective caching
(2015) Ajaykrishnan, N.; Prem, N.S.; Prabhakaran, V.M.; Vaze, R.
Replicating or caching popular content in memories distributed across the network is a technique to reduce peak network loads. Conventionally, the performance gain of caching was thought to result from making part of the requested data available closer to end users. Recently, it has been shown that by using a carefully designed technique to store the contents in the cache and coding across data streams a much more significant gain can be achieved in reducing the network load. Inner and outer bounds on the network load v/s cache memory tradeoff were obtained in [1]. We give an improved outer bound on the network load v/s cache memory tradeoff. We also address the question of to what extent caching is effective in reducing the server load when the number of files becomes large as compared to the number of users. We show that the effectiveness of caching become small when the number of files becomes comparable to the square of the number of users. � 2015 IEEE.
Critical database size for effective caching
(Institute of Electrical and Electronics Engineers Inc., 2015) Ajaykrishnan, N.; Prem, N.S.; Prabhakaran, V.M.; Vaze, R.
Replicating or caching popular content in memories distributed across the network is a technique to reduce peak network loads. Conventionally, the performance gain of caching was thought to result from making part of the requested data available closer to end users. Recently, it has been shown that by using a carefully designed technique to store the contents in the cache and coding across data streams a much more significant gain can be achieved in reducing the network load. Inner and outer bounds on the network load v/s cache memory tradeoff were obtained in [1]. We give an improved outer bound on the network load v/s cache memory tradeoff. We also address the question of to what extent caching is effective in reducing the server load when the number of files becomes large as compared to the number of users. We show that the effectiveness of caching become small when the number of files becomes comparable to the square of the number of users. Â© 2015 IEEE.