Coded caching for combination networks with cache-aided relays

Ahmed A. Zewail, Aylin Yener

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    18 Citations (Scopus)

    Abstract

    We study a two-hop cache-aided network, where a layer of relay nodes connects a server and a set of end users, i.e., a combination network. We consider the case where both the relay nodes and the end users have caching capabilities. We provide upper and lower bounds which are applicable to any combination network, noting that previous work had focused on models where the relays do not have caches as well as schemes that were suitable for a special class of combination networks. Utilizing maximum distance separable (MDS) codes, we jointly optimize the placement and the delivery phases, demonstrating the impact of cache memories in alleviating the delivery load over the two hop communications. Moreover, we show how cooperation between the relay nodes and the end users can effectively replace the server during the delivery phase whenever the total memory at each end user and its connected relay nodes is sufficient to store the database.

    Original languageEnglish (US)
    Title of host publication2017 IEEE International Symposium on Information Theory, ISIT 2017
    PublisherInstitute of Electrical and Electronics Engineers Inc.
    Pages2433-2437
    Number of pages5
    ISBN (Electronic)9781509040964
    DOIs
    StatePublished - Aug 9 2017
    Event2017 IEEE International Symposium on Information Theory, ISIT 2017 - Aachen, Germany
    Duration: Jun 25 2017Jun 30 2017

    Other

    Other2017 IEEE International Symposium on Information Theory, ISIT 2017
    CountryGermany
    CityAachen
    Period6/25/176/30/17

    Fingerprint

    Caching
    Cache
    Relay
    Servers
    Cache memory
    Vertex of a graph
    Data storage equipment
    Server
    Communication
    Placement
    Upper and Lower Bounds
    Optimise
    Sufficient

    All Science Journal Classification (ASJC) codes

    • Theoretical Computer Science
    • Information Systems
    • Modeling and Simulation
    • Applied Mathematics

    Cite this

    Zewail, A. A., & Yener, A. (2017). Coded caching for combination networks with cache-aided relays. In 2017 IEEE International Symposium on Information Theory, ISIT 2017 (pp. 2433-2437). [8006966] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2017.8006966
    Zewail, Ahmed A. ; Yener, Aylin. / Coded caching for combination networks with cache-aided relays. 2017 IEEE International Symposium on Information Theory, ISIT 2017. Institute of Electrical and Electronics Engineers Inc., 2017. pp. 2433-2437
    @inproceedings{8ddbfb4ef5ce4d12bebea35c5b5c31c2,
    title = "Coded caching for combination networks with cache-aided relays",
    abstract = "We study a two-hop cache-aided network, where a layer of relay nodes connects a server and a set of end users, i.e., a combination network. We consider the case where both the relay nodes and the end users have caching capabilities. We provide upper and lower bounds which are applicable to any combination network, noting that previous work had focused on models where the relays do not have caches as well as schemes that were suitable for a special class of combination networks. Utilizing maximum distance separable (MDS) codes, we jointly optimize the placement and the delivery phases, demonstrating the impact of cache memories in alleviating the delivery load over the two hop communications. Moreover, we show how cooperation between the relay nodes and the end users can effectively replace the server during the delivery phase whenever the total memory at each end user and its connected relay nodes is sufficient to store the database.",
    author = "Zewail, {Ahmed A.} and Aylin Yener",
    year = "2017",
    month = "8",
    day = "9",
    doi = "10.1109/ISIT.2017.8006966",
    language = "English (US)",
    pages = "2433--2437",
    booktitle = "2017 IEEE International Symposium on Information Theory, ISIT 2017",
    publisher = "Institute of Electrical and Electronics Engineers Inc.",
    address = "United States",

    }

    Zewail, AA & Yener, A 2017, Coded caching for combination networks with cache-aided relays. in 2017 IEEE International Symposium on Information Theory, ISIT 2017., 8006966, Institute of Electrical and Electronics Engineers Inc., pp. 2433-2437, 2017 IEEE International Symposium on Information Theory, ISIT 2017, Aachen, Germany, 6/25/17. https://doi.org/10.1109/ISIT.2017.8006966

    Coded caching for combination networks with cache-aided relays. / Zewail, Ahmed A.; Yener, Aylin.

    2017 IEEE International Symposium on Information Theory, ISIT 2017. Institute of Electrical and Electronics Engineers Inc., 2017. p. 2433-2437 8006966.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    TY - GEN

    T1 - Coded caching for combination networks with cache-aided relays

    AU - Zewail, Ahmed A.

    AU - Yener, Aylin

    PY - 2017/8/9

    Y1 - 2017/8/9

    N2 - We study a two-hop cache-aided network, where a layer of relay nodes connects a server and a set of end users, i.e., a combination network. We consider the case where both the relay nodes and the end users have caching capabilities. We provide upper and lower bounds which are applicable to any combination network, noting that previous work had focused on models where the relays do not have caches as well as schemes that were suitable for a special class of combination networks. Utilizing maximum distance separable (MDS) codes, we jointly optimize the placement and the delivery phases, demonstrating the impact of cache memories in alleviating the delivery load over the two hop communications. Moreover, we show how cooperation between the relay nodes and the end users can effectively replace the server during the delivery phase whenever the total memory at each end user and its connected relay nodes is sufficient to store the database.

    AB - We study a two-hop cache-aided network, where a layer of relay nodes connects a server and a set of end users, i.e., a combination network. We consider the case where both the relay nodes and the end users have caching capabilities. We provide upper and lower bounds which are applicable to any combination network, noting that previous work had focused on models where the relays do not have caches as well as schemes that were suitable for a special class of combination networks. Utilizing maximum distance separable (MDS) codes, we jointly optimize the placement and the delivery phases, demonstrating the impact of cache memories in alleviating the delivery load over the two hop communications. Moreover, we show how cooperation between the relay nodes and the end users can effectively replace the server during the delivery phase whenever the total memory at each end user and its connected relay nodes is sufficient to store the database.

    UR - http://www.scopus.com/inward/record.url?scp=85034023783&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=85034023783&partnerID=8YFLogxK

    U2 - 10.1109/ISIT.2017.8006966

    DO - 10.1109/ISIT.2017.8006966

    M3 - Conference contribution

    AN - SCOPUS:85034023783

    SP - 2433

    EP - 2437

    BT - 2017 IEEE International Symposium on Information Theory, ISIT 2017

    PB - Institute of Electrical and Electronics Engineers Inc.

    ER -

    Zewail AA, Yener A. Coded caching for combination networks with cache-aided relays. In 2017 IEEE International Symposium on Information Theory, ISIT 2017. Institute of Electrical and Electronics Engineers Inc. 2017. p. 2433-2437. 8006966 https://doi.org/10.1109/ISIT.2017.8006966