Browsing by Author "Pusane, Ali Emre"

Filter results by typing the first few letters
Now showing 1 - 2 of 2
  • Thumbnail Image
    Conference Object
    Citation - WoS: 1
    Citation - Scopus: 1
    Average Bandwidth-Cost Vs. Storage Trade-Off for Bs-Assisted Distributed Storage Networks
    (IEEE, 2021) Tengiz, Ayse Ceyda; Haytaoğlu, Elif; Pusane, Ali Emre; Arslan, Şuayb Şefik; Pourmandi, Massoud
    In this study, we consider a hierarchically structured base station (BS)-assisted cellular system equipped with a backend distributed data storage in which nodes randomly arrive and depart the cell. We numerically motivate and characterize the fundamental trade-off between the average repair bandwidth cost versus storage space where BS communication cost (higher than that of local) and link capacity constraints exist while the number of failed nodes can vary dynamically. We establish the capacity region that is most relevant to 5G and beyond networks, which are layered by design. We hope that this study shall motivate novel regeneration code constructions that will be able to achieve the presented limits.
  • Thumbnail Image
    Article
    Minimum Repair Bandwidth Ldpc Codes for Distributed Storage Systems
    (IEEE, 2023) Pourmandi, Massoud; Pusane, Ali Emre; Arslan , Şuayb Şefik; Haytaoğlu, Elif
    In distributed storage systems (DSS), an optimal code design must meet the requirements of efficient local data regeneration in addition to reliable data retention. Recently, lowdensity parity-check (LDPC) codes have been proposed as a promising candidate that can secure high data rates as well as low repair bandwidth while maintaining low complexity in data reconstruction. The main objective of this study is to optimize the repair bandwidth characteristics of LDPC code families for a DSS application while meeting the data reliability requirements. First, a data access scenario in which nodes contact other available nodes randomly to download data is examined. Later, a minimum-bandwidth protocol is considered in which nodes make their selections based on the degree numbers of check nodes. Through formulating optimization problems for both protocols, a fundamental trade-off between the decoding threshold and the repair bandwidth is established for a given code rate. Finally, conclusions are confirmed by numerical results showing that irregular constructions have a large potential for establishing optimized LDPC code families for DSS applications.