Bilgisayar Mühendisliği Bölümü Koleksiyonu
Permanent URI for this collectionhttps://hdl.handle.net/20.500.11779/1940
Browse
3 results
Search Results
Article Citation - WoS: 3Citation - Scopus: 3Exact Construction of Bs-Assisted Mscr Codes With Link Constraints(IEEE Communications Letters, 2022) Arslan, Şuayb Şefik; Arslan, Şefik Şuayb; 02.02. Department of Computer Engineering; 02. Faculty of Engineering; 01. MEF UniversityIt is clear that 5G network resources would be consumed by heavy data traffic owing to increased mobility, slicing, and layered/distributed storage system architecture. The problem is elevated when multiple node failures are repaired to address service quality requirements. Typical approaches include individual or cooperative data regeneration to efficiently utilize the available bandwidth. It is observed that storage systems of 5G and beyond technologies shall have a multi–layer architecture in which base stations (BS) would be present. Moreover, communication with each layer would be subject to various communication costs and link constraints. Under limited BS assistance and cooperation, the trade-off between storage per node and communication bandwidth has been established. In this trade–off, two operating points, namely minimum storage, and bandwidth regeneration are particularly important. In this study, we first identify the optimal number of BS use at the minimum storage regeneration point. An explicit code construction is provided subsequently for the exact minimum storage regeneration whereby each layer may help the repair process subject to a communication link constraint.Article Citation - WoS: 4Citation - Scopus: 6Data Repair-Efficient Fault Tolerance for Cellular Networks Using Ldpc Codes(IEEE, 2022) Haytaoglu, Elif; Arslan, Şefik Şuayb; Arslan, Şuayb Şefik; 02.02. Department of Computer Engineering; 02. Faculty of Engineering; 01. MEF UniversityThe base station-mobile device communication traffic has dramatically increased recently due to mobile data, which in turn heavily overloaded the underlying infrastructure. To decrease Base Station (BS) interaction, intra-cell communication between local devices, known as Device-to-Device, is utilized for distributed data caching. Nevertheless, due to the continuous departure of existing nodes and the arrival of newcomers, the missing cached data may lead to permanent data loss. In this study, we propose and analyze a class of LDPC codes for distributed data caching in cellular networks. Contrary to traditional distributed storage, a novel repair algorithm for LDPC codes is proposed which is designed to exploit the minimal direct BS communication. To assess the versatility of LDPC codes and establish performance comparisons to classic coding techniques, novel theoretical and experimental evaluations are derived. Essentially, the theoretical/numerical results for repair bandwidth cost in presence of BS are presented in a distributed caching setting. Accordingly, when the gap between the cost of downloading a symbol from BS and from other local network nodes is not dramatically high, we demonstrate that LDPC codes can be considered as a viable fault-tolerance alternative in cellular systems with caching capabilities for both low and high code rates.Conference Object Citation - WoS: 2Citation - Scopus: 1Average Bandwidth-Cost Vs. Storage Trade-Off for Bs-Assisted Distributed Storage Networks(IEEE, 2021) Tengiz, Ayse Ceyda; Arslan, Şefik Şuayb; Pusane, Ali Emre; Arslan, Şuayb Şefik; Pourmandi, Massoud; 02.02. Department of Computer Engineering; 02. Faculty of Engineering; 01. MEF UniversityIn 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.