Bernat Gaston
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Bernat Gaston has a total of 48 co-authors. Here are the top co-authors by number of shared publications:
- Antonio Lioy
Politecnico di Torino Dip. di Automatica e Informatica Torino Italy
2 shared publications G. Gardikis
Space Hellas, Athens (Greece)
2 shared publicationsJaume Pujol
Universitat Autónoma de Barcelona
2 shared publications- Jaume Pujol
Centre for Sensors, Instruments and Systems Development, Universitat Politecnica de Catalunya, Spain
2 shared publications L. Jacquin
Hewlett Packard Labs, Bristol (United Kingdom)
2 shared publications- Mercè Villanueva
Department of Information and Communications Engineering, Universitat Autònoma de Barcelona, Cerdanyola del Vallès, Spain
2 shared publications
Latest Publications
- 23 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Electronics
- Vol. 69 (10) , 10354-10362
A Metric for Assessing, Comparing, and Predicting the Performance of Autonomous RFID-Based Inventory Robots for Retail
Radio frequency identification (RFID) technology is being widely adopted by retailers due to its accuracy, versatility, and reduction of operational costs. Most commonly, RFID in retail is used for taking frequent and accurate inventories of items in the stores. Usually, RFID inventories use handheld RFID devices, which makes the task tedious, costly, and prone to human errors. More reliable, fully automatic alternatives exist, such as smart shelves, overhead RFID antennas, and RFID-equipped robots. Among them, robots seem to be the preferred choice by retailers with large stores. However, retailers need an objective way to compare the different options for inventory solutions and to calculate the return on investment of each of them before they make an investment decision. In this article, we present a metric for assessing, comparing, and predicting the performance of autonomous RFID-based robots in retail stores. The metric is based on a theoretical model of both the store and the robot, and predicts the performance of a given robot when inventorying a specific store. The metric also allows to compare the performance of different RFID robots in different stores. The metric has been developed using experimental data and has been validated in a real store.
- 23 November 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Electronics
- Vol. 69 (10) , 10354-10362
A Metric for Assessing, Comparing, and Predicting the Performance of Autonomous RFID-Based Inventory Robots for Retail
Radio frequency identification (RFID) technology is being widely adopted by retailers due to its accuracy, versatility, and reduction of operational costs. Most commonly, RFID in retail is used for taking frequent and accurate inventories of items in the stores. Usually, RFID inventories use handheld RFID devices, which makes the task tedious, costly, and prone to human errors. More reliable, fully automatic alternatives exist, such as smart shelves, overhead RFID antennas, and RFID-equipped robots. Among them, robots seem to be the preferred choice by retailers with large stores. However, retailers need an objective way to compare the different options for inventory solutions and to calculate the return on investment of each of them before they make an investment decision. In this article, we present a metric for assessing, comparing, and predicting the performance of autonomous RFID-based robots in retail stores. The metric is based on a theoretical model of both the store and the robot, and predicts the performance of a given robot when inventorying a specific store. The metric also allows to compare the performance of different RFID robots in different stores. The metric has been developed using experimental data and has been validated in a real store.
- 17 May 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 18 (2) , 767-775
A Simple Solution to Locate Groups of Items in Large Retail Stores Using an RFID Robot
This article presents a simple solution to estimate the location of products in a retail store, using an autonomous ground robot with a radio frequency identification payload. The model used and explained in this article is designed to be as simple and versatile as possible, while achieving accurate location estimations when compared with other proposed models in the state of the art. In addition, the solution developed meets the business requirements of the retail industry, such as locating at stock keeping unit level, as opposed to item level, or expressing the location in terms of store fixtures (e.g., shelf and rack) as opposed to $(x,y)$ coordinates. The research results are obtained from experiments of the model in different environments, achieving accurate location estimations in a controlled laboratory environment. Moreover, for the first time, the model has been tested in a large retail store, where the results obtained met the requirements of the store owners.
- 17 May 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 18 (2) , 767-775
A Simple Solution to Locate Groups of Items in Large Retail Stores Using an RFID Robot
This article presents a simple solution to estimate the location of products in a retail store, using an autonomous ground robot with a radio frequency identification payload. The model used and explained in this article is designed to be as simple and versatile as possible, while achieving accurate location estimations when compared with other proposed models in the state of the art. In addition, the solution developed meets the business requirements of the retail industry, such as locating at stock keeping unit level, as opposed to item level, or expressing the location in terms of store fixtures (e.g., shelf and rack) as opposed to $(x,y)$ coordinates. The research results are obtained from experiments of the model in different environments, achieving accurate location estimations in a controlled laboratory environment. Moreover, for the first time, the model has been tested in a large retail store, where the results obtained met the requirements of the store owners.
- Open Access
- 1 January 2019
- Published by INSTICC
- p. 38-48
Ensembled Outlier Detection using Multi-Variable Correlation in WSN through Unsupervised Learning Techniques
- 1 January 2019
- Published by INSTICC
- p. 38-48
Open AccessEnsembled Outlier Detection using Multi-Variable Correlation in WSN through Unsupervised Learning Techniques
- Open Access
- 1 November 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-2
NFV-based network protection: The SHIELD approach
This demo showcases some of the capabilities foreseen for the security infrastructure designed by the H2020 SHIELD project. SHIELD exploits NFV for adaptive monitoring of an IT infrastructure and for feeding the data to an analytics engine to detect attacks in real time. An intelligent reaction system is then activated to reconfigure the SDN/NFV infrastructure so that the attacks are thwarted. The SDN/NFV infrastructure itself is protected from attacks thanks to trusted computing techniques, that permit to quickly identify misbehaving nodes. The proposed demo will present detection and reaction to a DDoS attack (by on-the-fly deployment of new virtual network security functions and/or change of network paths), as well as detection of software attacks against virtual network functions (executed in Docker containers) and unauthorized modification of the SDN switching tables and NFV configurations.
- 1 November 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-2
Open AccessNFV-based network protection: The SHIELD approach
This demo showcases some of the capabilities foreseen for the security infrastructure designed by the H2020 SHIELD project. SHIELD exploits NFV for adaptive monitoring of an IT infrastructure and for feeding the data to an analytics engine to detect attacks in real time. An intelligent reaction system is then activated to reconfigure the SDN/NFV infrastructure so that the attacks are thwarted. The SDN/NFV infrastructure itself is protected from attacks thanks to trusted computing techniques, that permit to quickly identify misbehaving nodes. The proposed demo will present detection and reaction to a DDoS attack (by on-the-fly deployment of new virtual network security functions and/or change of network paths), as well as detection of software attacks against virtual network functions (executed in Docker containers) and unauthorized modification of the SDN switching tables and NFV configurations.
- Open Access
- 1 July 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
SHIELD: A novel NFV-based cybersecurity framework
SHIELD is an EU-funded project, targeting at the design and development of a novel cybersecurity framework, which offers security-as-a-Service in an evolved telco environment. The SHIELD framework leverages NFV (Network Functions Virtualization) and SDN (Software-Defined Networking) for virtualization and dynamic placement of virtualised security appliances in the network (virtual Network Security Functions - vNSFs), Big Data analytics for real-time incident detection and mitigation, as well as attestation techniques for securing both the infrastructure and the services. This papers discusses key use cases and requirements for the SHIELD framework and presents a high-level architectural approach.
- 1 July 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-6
Open AccessSHIELD: A novel NFV-based cybersecurity framework
SHIELD is an EU-funded project, targeting at the design and development of a novel cybersecurity framework, which offers security-as-a-Service in an evolved telco environment. The SHIELD framework leverages NFV (Network Functions Virtualization) and SDN (Software-Defined Networking) for virtualization and dynamic placement of virtualised security appliances in the network (virtual Network Security Functions - vNSFs), Big Data analytics for real-time incident detection and mitigation, as well as attestation techniques for securing both the infrastructure and the services. This papers discusses key use cases and requirements for the SHIELD framework and presents a high-level architectural approach.
- 1 December 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2017-2022
Experimental evaluation of a Recursive InterNetwork Architecture prototype
The Recursive InterNetwork Architecture (RINA) is a recently proposed network architecture based on first principles, which promises to solve a number of issues present in the current Internet such as the lack of inherent security. In this paper, we present the experimental evaluation of the first performance-oriented implementation of RINA, the IRATI stack. Our open source stack is designed for GNU/Linux Operating Systems, with key components developed in kernel space for optimal performance. After briefly introducing the architecture, we present the main features of the stack, give some details about the implementation and discuss some trade-offs that had to be taken into account. We present use case scenarios for the evaluation, which were implemented in a test environment, and present the performance, achieving a goodput close to line rate on a GbE link, even when multiple Distributed Inter Process Communication Facilities (DIFs) are stacked.
- 1 December 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2017-2022
Experimental evaluation of a Recursive InterNetwork Architecture prototype
The Recursive InterNetwork Architecture (RINA) is a recently proposed network architecture based on first principles, which promises to solve a number of issues present in the current Internet such as the lack of inherent security. In this paper, we present the experimental evaluation of the first performance-oriented implementation of RINA, the IRATI stack. Our open source stack is designed for GNU/Linux Operating Systems, with key components developed in kernel space for optimal performance. After briefly introducing the architecture, we present the main features of the stack, give some details about the implementation and discuss some trade-offs that had to be taken into account. We present use case scenarios for the evaluation, which were implemented in a test environment, and present the performance, achieving a goodput close to line rate on a GbE link, even when multiple Distributed Inter Process Communication Facilities (DIFs) are stacked.
- 1 July 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 1237-1241
Non-homogeneous two-rack model for distributed storage systems
In the traditional two-rack distributed storage system (DSS) model, due to the assumption that the storage capacity of each node is the same, the minimum bandwidth regenerating (MBR) point becomes infeasible. In this paper, we design a new non-homogeneous two-rack model by proposing a generalization of the threshold function used to compute the tradeoff curve. We prove that by having the nodes in the rack with higher regenerating bandwidth stores more information, all the points on the tradeoff curve, including the MBR point, become feasible. Finally, we show how the non-homogeneous two-rack model outperforms the traditional model in the tradeoff curve between the storage per node and the repair bandwidth.
- 1 July 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21578095,p. 1237-1241
Non-homogeneous two-rack model for distributed storage systems
In the traditional two-rack distributed storage system (DSS) model, due to the assumption that the storage capacity of each node is the same, the minimum bandwidth regenerating (MBR) point becomes infeasible. In this paper, we design a new non-homogeneous two-rack model by proposing a generalization of the threshold function used to compute the tradeoff curve. We prove that by having the nodes in the rack with higher regenerating bandwidth stores more information, all the points on the tradeoff curve, including the MBR point, become feasible. Finally, we show how the non-homogeneous two-rack model outperforms the traditional model in the tradeoff curve between the storage per node and the repair bandwidth.
- Open Access
Quasi-cyclic Flexible Regenerating Codes
In a distributed storage environment, where the data is placed in nodes connected through a network, it is likely that one of these nodes fails. It is known that the use of erasure coding improves the fault tolerance and minimizes the redundancy added in distributed storage environments. The use of regenerating codes not only make the most of the erasure coding improvements, but also minimizes the amount of data needed to regenerate a failed node. In this paper, a new family of regenerating codes based on quasi-cyclic codes is presented. Quasi-cyclic flexible minimum storage regenerating (QCFMSR) codes are constructed and their existence is proved. Quasi-cyclic flexible regenerating codes with minimum bandwidth constructed from a base QCFMSR code are also provided. These codes not only achieve optimal MBR parameters in terms of stored data and repair bandwidth, but also for an specific choice of the parameters involved, they can be decreased under the optimal MBR point. Quasi-cyclic flexible regenerating codes are very interesting because of their simplicity and low complexity. They allow exact repair-by-transfer in the minimum bandwidth case and an exact pseudo repair-by-transfer in the MSR case, where operations are needed only when a new node enters into the system replacing a lost one.
Open AccessQuasi-cyclic Flexible Regenerating Codes
In a distributed storage environment, where the data is placed in nodes connected through a network, it is likely that one of these nodes fails. It is known that the use of erasure coding improves the fault tolerance and minimizes the redundancy added in distributed storage environments. The use of regenerating codes not only make the most of the erasure coding improvements, but also minimizes the amount of data needed to regenerate a failed node. In this paper, a new family of regenerating codes based on quasi-cyclic codes is presented. Quasi-cyclic flexible minimum storage regenerating (QCFMSR) codes are constructed and their existence is proved. Quasi-cyclic flexible regenerating codes with minimum bandwidth constructed from a base QCFMSR code are also provided. These codes not only achieve optimal MBR parameters in terms of stored data and repair bandwidth, but also for an specific choice of the parameters involved, they can be decreased under the optimal MBR point. Quasi-cyclic flexible regenerating codes are very interesting because of their simplicity and low complexity. They allow exact repair-by-transfer in the minimum bandwidth case and an exact pseudo repair-by-transfer in the MSR case, where operations are needed only when a new node enters into the system replacing a lost one.
- 1 March 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 33-42
Quasi-cyclic Minimum Storage Regenerating Codes for Distributed Data Compression
Nowadays, it is possible to optimize the storage size of large files in distributed environments, maintaining the same availability level in the system. Although replication (backups) is the most used option, it is possible to make use of erasure coding in order to significantly compress the storage size [1]. However, using erasure coding, more information needs to be transmitted than when using replication, in order to replace a node which has failed. This is called the code repair problem. The amount of transmitted information can be an important issue when the file size is very large. If network coding is used in conjunction with erasure codes, the transmitted information can be reduced by compressing the sent data in the regeneration phase. This solution minimizes the code repair problem and consists of the use of regenerating codes introduced by Dimakis et al. [2]. Nevertheless, using network coding, computational resources for any node in the system are required, since linear operations must be carried out and systems of equations must be solved in the nodes. This requirement is too strong for many simple storage devices [3]. In this paper a new family of Minimum Storage Regenerating codes is proposed. These codes not only compress the storage size using erasure coding and achieve optimality for the amount of transmitted information when d = k + 1, but also demand few computational requirements. Therefore, they could be used for simple hard discs without computational resources.
- 1 March 2011
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 33-42
Quasi-cyclic Minimum Storage Regenerating Codes for Distributed Data Compression
Nowadays, it is possible to optimize the storage size of large files in distributed environments, maintaining the same availability level in the system. Although replication (backups) is the most used option, it is possible to make use of erasure coding in order to significantly compress the storage size [1]. However, using erasure coding, more information needs to be transmitted than when using replication, in order to replace a node which has failed. This is called the code repair problem. The amount of transmitted information can be an important issue when the file size is very large. If network coding is used in conjunction with erasure codes, the transmitted information can be reduced by compressing the sent data in the regeneration phase. This solution minimizes the code repair problem and consists of the use of regenerating codes introduced by Dimakis et al. [2]. Nevertheless, using network coding, computational resources for any node in the system are required, since linear operations must be carried out and systems of equations must be solved in the nodes. This requirement is too strong for many simple storage devices [3]. In this paper a new family of Minimum Storage Regenerating codes is proposed. These codes not only compress the storage size using erasure coding and achieve optimality for the amount of transmitted information when d = k + 1, but also demand few computational requirements. Therefore, they could be used for simple hard discs without computational resources.