Please use this identifier to cite or link to this item:
https://idr.l3.nitk.ac.in/jspui/handle/123456789/7976
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Sridhar, A. | |
dc.contributor.author | Karamchandani, N. | |
dc.contributor.author | Prabhakaran, V.M. | |
dc.date.accessioned | 2020-03-30T10:03:14Z | - |
dc.date.available | 2020-03-30T10:03:14Z | - |
dc.date.issued | 2016 | |
dc.identifier.citation | 2016 22nd National Conference on Communication, NCC 2016, 2016, Vol., , pp.- | en_US |
dc.identifier.uri | http://idr.nitk.ac.in/jspui/handle/123456789/7976 | - |
dc.description.abstract | 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. | en_US |
dc.title | Coded caching in hybrid networks | en_US |
dc.type | Book chapter | en_US |
Appears in Collections: | 2. Conference Papers |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.