The Babel File System

Naquid, Moisés Quezada; Jiménez, Ricardo; Compeán, José Luis González

doi:10.1109/bigdata.congress.2014.42

Cited by 4 publications

(2 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…It should be noted that a given entry supports the same number of losses as any lower entry in the same column. However, this results in high redundancy [36]. Figure 11 shows that each dispersal is sent through different channels, and in case of information interruption, the information with three dispersals can be recovered.…”

Section: Additional Redundancymentioning

confidence: 99%

System Design for Opportunistic Spectrum Access Using Statistical Decision-Making and Coded-MAC

Rodríguez-Colina

Jiménez

Palacios-Luengas

et al. 2020

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

Different mechanisms have been proposed to solve opportunistic spectrum access (OSA). In order to address spectrum management efficiently, these mechanisms can be divided into four main functionalities, spectrum sensing, decision-making, sharing, and mobility. These functionalities depend on the interpretation and adaptation of different parameters, for example, sensing and data interpretation for adaptive modulation, power adjustments, and changes regarding the range of frequency operation. For the decision-making function, a novel approach is proposed in which coding information is added to the establishment of the communication process thus assisting the medium access control (MAC). The presence of cognitive radio devices in the network coverage range can be controlled or coordinated by using specific redundancy codes. Hence, Reed Solomon (RS) code is used in this paper as part of the handshaking process to provide error correction. In addition, a redundancy strategy based on Rabin’s information dispersal algorithm (IDA) is presented to provide fault tolerance to the communication between cognitive radio devices. In this case, the information is divided into fragments dynamically, and each fragment is coded by an RS code and reassigned to a subset of recipients using alternate paths. This work shows how to optimize spectrum access based on IDA and RS codes to diversify channel occupation without losing significant information with several frequency hops presented in cognitive radio communications. The validations were executed in a discrete event simulator developed in Python. The proposed system for OSA was found to perform better than other approaches using pilot sequences. Our proposal, therefore, provides fault tolerance, to diversify channel occupation, and helps identify the presence of primary and secondary users when a common control channel (CCC) is implemented by the optimization of the spectrum use.

show abstract

Section: Additional Redundancymentioning

confidence: 99%

System Design for Opportunistic Spectrum Access Using Statistical Decision-Making and Coded-MAC

Rodríguez-Colina

Jiménez

Palacios-Luengas

et al. 2020

Wireless Communications and Mobile Computing

View full text Add to dashboard Cite

show abstract

“…Muchos proyectos de almacenamiento de alto desempeño como EMC [4], Babel [5] o almacenamiento en la nube [6] han utilizado el Algoritmo de Dispersión de Información (IDA) por las posibilidades que ofrece este algoritmo para configurar una estrategia de almacenamiento tolerante a fallas, con diferentes grados de redundancia en la información y un uso eficiente del almacenamiento.…”

Section: Definición Del Problemaunclassified

Evaluación de rendimiento del algoritmo de dispersión de información sobre los campos finitos GF(2⁸) y GF(2¹⁶)

Méndez

View full text Add to dashboard Cite

El algoritmo de dispersión de información (IDA) es una transformación lineal sobre un campo finito, que convierte un archivo de |F | bytes en n archivos de |F | m bytes, denominados dispersos, tales que es posible reconstruir el original, a partir de cualesquiera m dispersos.En este trabajo se evalúa el funcionamiento de un par de implementaciones de IDA que operan sobre GF (2 8 ) y GF (2 16 ), respectivamente. Ambas soportan un conjunto de parámetros 2 < m ≤ 28 y 3 < n ≤ 30.Esta evaluación determina el desempeño de cada implementación como una función del campo finito sobre el que opera, sus parámetros (m, n), así como las condiciones de trabajo sobre las cuales se despliega, esto es, el sistema operativo, el hardware de base y la gestión de la memoria.Además se evalúa el impacto de IDA con cada campo finito tomando en cuenta el sistema operativo, el hardware de procesamiento y la implementación en memoria, para apreciar un panorama general sobre el comportamiento de la velocidad de procesamiento de acuerdo a las características que necesite el usuario.Los resultados muestran que a pesar del sistema operativo, el hardware utilizado o la implementación en memoria, siempre hay un aumento de velocidad utilizando el campo GF (2 16 ) en comparación con el campo GF (2 8 ).También encontramos que el tamaño de los elementos de trabajo no es más que una forma de controlar las operaciones de entrada y salida, que resultan tener el impacto más sensible en el rendimiento de IDA.

show abstract

A performance study of the Babel file system

Marcelín-Jiménez

Ramirez-Ortiz

Munoz-Texzocotetla

2016

2016 IEEE 13th International Conference on Networking, Sensing, and Control (ICNSC)

View full text Add to dashboard Cite

collaborates with the research team at the DAIC in INFOTEC.Abstract-The performance of a distributed file system is defined by its hardware components, as well as its operational parameters. Even a slight change on a working condition may induce the major impact, for instance, on service response times. In this paper, we propose a set of experiments on the Babel file system using a client that sends requests for either file storage or retrieval, with two file sizes (512 MB and 1 GB). The aim is to achieve the best working conditions. To measure the performance of the Babel system we took the throughput and the response time when any of two operations (storage or retrieval) was running. The analysis of results showed that, for a given set of operational parameters, there is an optimal file size that gets the best out of the system's performance.keywords-redundancy, storage, Babel file system, availability.

show abstract

The Babel File System

Cited by 4 publications

References 27 publications

System Design for Opportunistic Spectrum Access Using Statistical Decision-Making and Coded-MAC

System Design for Opportunistic Spectrum Access Using Statistical Decision-Making and Coded-MAC

Evaluación de rendimiento del algoritmo de dispersión de información sobre los campos finitos GF(2⁸) y GF(2¹⁶)

A performance study of the Babel file system

Contact Info

Product

Resources

About