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-02-01) Arslan, Şuayb ŞefikIt 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: 5Citation - Scopus: 7Founsure 1.0: an Erasure Code Library With Efficient Repair and Update Features(Elsevier, 2021-01-01) Arslan, Şuayb ŞefikFounsure is an open-source software library that implements a multi-dimensional graph-based erasure coding entirely based on fast exclusive OR (XOR) logic. Its implementation utilizes compiler optimizations and multi-threading to generate the right assembly code for the given multi-core CPU architecture with vector processing capabilities. Founsure possesses important features that shall find various applications in modern data storage, communication, and networked computer systems, in which the data needs protection against device, hardware, and node failures. As data size reached unprecedented levels, these systems have become hungry for network bandwidth, computational resources, and average consumed power. To address that, the proposed library provides a three-dimensional design space that trades off the computational complexity, coding overhead, and data/node repair bandwidth to meet different requirements of modern distributed data storage and processing systems. Founsure library enables efficient encoding, decoding, repairs/rebuilds, and updates while all the required data storage and computations are distributed across the network nodes.Article Citation - WoS: 28Citation - Scopus: 32Service-Aware Multi-Resource Allocation in Software-Defined Next Generation Cellular Networks(IEEE-Inst Electrical Electronics Engineers Inc, 2018) Arslan, Şuayb Şefik; Zeydan, Engin; Narmanloğlu, Ömer; Narmanlioglu, OmerNetwork slicing is one of the major solutions needed to meet the requirements of next generation cellular networks, under one common network infrastructure, in supporting multiple vertical services provided by mobile network operators. Network slicing makes one shared physical network infrastructure appear as multiple logically isolated virtual networks dedicated to different service types where each Network Slice (NS) benefits from on-demand allocated resources. Typically, the available resources distributed among NSs are correlated and one needs to allocate them judiciously in order to guarantee the service, MNO, and overall system qualities. In this paper, we consider a joint resource allocation strategy that weights the significance of the resources per a given NS by leveraging the correlation structure of different quality-of-service (QoS) requirements of the services. After defining the joint resource allocation problem including the correlation structure, we propose three novel scheduling mechanisms that allocate available network resources to the generated NSs based on different type of services with different QoS requirements. Performance of the proposed schedulers are then investigated through Monte-Carlo simulations and compared with each other as well as against a traditional max-min fairness algorithm benchmark. The results reveal that our schedulers, which have different complexities, outperform the benchmark traditional method in terms of service-based and overall satisfaction ratios, while achieving different fairness index levels.