Francesc Daniel Munoz-Escoi
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
Research Subjects
Francesc Daniel Munoz-Escoi has a total of 99 co-authors. Here are the top co-authors by number of shared publications:
- José Enrique Armendáriz-Iñigo
Public University of Navarre, Pamplona, Spain
35 shared publications Hendrik Decker
Universidad Politécnica de Valencia
14 shared publicationsH. Decker
Universidad Politécnica de Valencia
12 shared publicationsJ. R. González de Mendívil
12 shared publicationsLuis Irún-Briz
12 shared publications- Jose Manuel Bernabeu Auban
Instituto Tecnológico de Informática, Valencia, Spain
11 shared publications
Latest Publications
- 5 August 2024
- Published by Wiley in International Journal of Network Management
- Vol. 34 (5)
DELTA: A Modular, Transparent, and Efficient Synchronization of DLTs and Databases
Besides cryptocurrencies, DLTs may be also exploited in enterprise systems operated by a consortium of organizations. Their interaction takes usually place on a permissioned blockchain network that holds a set of data to be queried frequently. In this scope, the main problem of DLTs is their unsuitability for a fast service of complex queries on those data. In order to solve this issue, many proposals dump the ledger contents onto databases that, because of their own goals and design, are already optimized for the execution of those queries. Unfortunately, many of those proposals assume that the data to be queried consist in only a block or (cryptocurrency‐related) transaction history. However, those organization consortiums commonly store other structured business‐related information in the DLT, and there is an evident lack of support for querying that other kind of structured data. To remedy those problems, DELTA synchronizes, with minimal overhead, the DLT state into a database, providing (1) a modular architecture with event‐based handling of DLT updates that supports different DLTs and databases, (2) a transparent management, since DLT end users do not need to learn or use any new API in order to handle that synchronization (i.e., those users still rely on the original interface provided by their chosen DLT), (3) the efficient execution of complex queries on those structured data. Thus, DELTA reduces query times up to five orders of magnitude, depending on the DLT and the database, compared to queries directed to the ledger nodes.
- 5 August 2024
- Published by Wiley in International Journal of Network Management
- Vol. 34 (5)
DELTA: A Modular, Transparent, and Efficient Synchronization of DLTs and Databases
Besides cryptocurrencies, DLTs may be also exploited in enterprise systems operated by a consortium of organizations. Their interaction takes usually place on a permissioned blockchain network that holds a set of data to be queried frequently. In this scope, the main problem of DLTs is their unsuitability for a fast service of complex queries on those data. In order to solve this issue, many proposals dump the ledger contents onto databases that, because of their own goals and design, are already optimized for the execution of those queries. Unfortunately, many of those proposals assume that the data to be queried consist in only a block or (cryptocurrency‐related) transaction history. However, those organization consortiums commonly store other structured business‐related information in the DLT, and there is an evident lack of support for querying that other kind of structured data. To remedy those problems, DELTA synchronizes, with minimal overhead, the DLT state into a database, providing (1) a modular architecture with event‐based handling of DLT updates that supports different DLTs and databases, (2) a transparent management, since DLT end users do not need to learn or use any new API in order to handle that synchronization (i.e., those users still rely on the original interface provided by their chosen DLT), (3) the efficient execution of complex queries on those structured data. Thus, DELTA reduces query times up to five orders of magnitude, depending on the DLT and the database, compared to queries directed to the ledger nodes.
- 30 March 2024
- Published by Elsevier in Journal of Systems and Software
- Vol. 213
Modeling microservice architectures
- 30 March 2024
- Published by Elsevier in Journal of Systems and Software
- Vol. 213
Modeling microservice architectures
- Open Access
- 5 September 2023
- Published by Wiley
DELTA: A Modular, Transparent and Efficient Synchronization of DLTs and Databases
Besides cryptocurrencies, DLTs may be also exploited in enterprise systems operated by a consortium of organizations. Their interaction takes usually place on a permissioned blockchain network that holds a set of data to be queried frequently. In this scope, the main problem of DLTs is their unsuitability for a fast service of complex queries on those data. In order to solve this issue, many proposals dump the ledger contents onto databases that, because of their own goals and design, are already optimized for the execution of those queries. Unfortunately, many of those proposals assume that the data to be queried consist in only a block or (cryptocurrency-related) transaction history. However, those organization consortiums commonly store other structured business-related information in the DLT, and there is an evident lack of support for querying that other kind of structured data. To remedy those problems, DELTA synchronizes, with minimal overhead, the DLT state into a database, providing: (1) a modular architecture with event-based handling of DLT updates that supports different DLTs and databases, (2) a transparent management, since DLT end users do not need to learn or use any new API in order to handle that synchronization (i.e., those users still rely on the original interface provided by their chosen DLT), (3) the efficient execution of complex queries on those structured data. Thus, DELTA reduces query times up to five orders of magnitude, depending on the DLT and the database, compared to queries directed to the ledger nodes.
- 5 September 2023
- Published by Wiley
Open AccessDELTA: A Modular, Transparent and Efficient Synchronization of DLTs and Databases
Besides cryptocurrencies, DLTs may be also exploited in enterprise systems operated by a consortium of organizations. Their interaction takes usually place on a permissioned blockchain network that holds a set of data to be queried frequently. In this scope, the main problem of DLTs is their unsuitability for a fast service of complex queries on those data. In order to solve this issue, many proposals dump the ledger contents onto databases that, because of their own goals and design, are already optimized for the execution of those queries. Unfortunately, many of those proposals assume that the data to be queried consist in only a block or (cryptocurrency-related) transaction history. However, those organization consortiums commonly store other structured business-related information in the DLT, and there is an evident lack of support for querying that other kind of structured data. To remedy those problems, DELTA synchronizes, with minimal overhead, the DLT state into a database, providing: (1) a modular architecture with event-based handling of DLT updates that supports different DLTs and databases, (2) a transparent management, since DLT end users do not need to learn or use any new API in order to handle that synchronization (i.e., those users still rely on the original interface provided by their chosen DLT), (3) the efficient execution of complex queries on those structured data. Thus, DELTA reduces query times up to five orders of magnitude, depending on the DLT and the database, compared to queries directed to the ledger nodes.
- Open Access
- 16 March 2019
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 62 (6) , 943-960
CAP Theorem: Revision of Its Related Consistency Models
- 16 March 2019
- Published by Oxford University Press (OUP) in The Computer Journal
- Vol. 62 (6) , 943-960
Open AccessCAP Theorem: Revision of Its Related Consistency Models
- Open Access
- 1 August 2018
- Published by Walter de Gruyter GmbH in Open Computer Science
- Vol. 8 (1) , 154-164
On synchrony in dynamic distributed systems
Many modern distributed services are deployed in dynamic systems. Cloud services are an example. They are expected to provide service to a potentially huge amount of users and may require a wide geographical deployment in multiple data centres. Their service processes vary in volume in accordance with workload variations, showing an adaptive behaviour in order to minimise economical costs. Dynamic distributed systems may be classifed considering two axes: (a) the number of processes that compose the system, and (b) the diameter of the networking graph that interconnects those processes. Other important features of dynamic systems can be derived from these two characteristics, e.g., their attainable synchrony. We analyse the level of synchrony that may be achieved in each dynamic system class and revise the existing techniques for transforming an initially asynchronous large dynamic system into another one with a higher synchrony level. With this, a larger set of problems may be handled in dynamic distributed systems. This facilitates the implementation and provision of additional services in those systems.
- 1 August 2018
- Published by Walter de Gruyter GmbH in Open Computer Science
- Vol. 8 (1) , 154-164
Open AccessOn synchrony in dynamic distributed systems
Many modern distributed services are deployed in dynamic systems. Cloud services are an example. They are expected to provide service to a potentially huge amount of users and may require a wide geographical deployment in multiple data centres. Their service processes vary in volume in accordance with workload variations, showing an adaptive behaviour in order to minimise economical costs. Dynamic distributed systems may be classifed considering two axes: (a) the number of processes that compose the system, and (b) the diameter of the networking graph that interconnects those processes. Other important features of dynamic systems can be derived from these two characteristics, e.g., their attainable synchrony. We analyse the level of synchrony that may be achieved in each dynamic system class and revise the existing techniques for transforming an initially asynchronous large dynamic system into another one with a higher synchrony level. With this, a larger set of problems may be handled in dynamic distributed systems. This facilitates the implementation and provision of additional services in those systems.
- 1 January 2018
- Published by Central Library of the Slovak Academy of Sciences in Computing and Informatics
- Vol. 37 (5) , 1037-1072
Eventual Consistency: Origin and Support
- 1 January 2018
- Published by Central Library of the Slovak Academy of Sciences in Computing and Informatics
- Vol. 37 (5) , 1037-1072
Eventual Consistency: Origin and Support
- 29 June 2016
- Published by Springer Nature in Computing
- Vol. 99 (7) , 617-656
A survey on elasticity management in PaaS systems
- 29 June 2016
- Published by Springer Nature in Computing
- Vol. 99 (7) , 617-656
A survey on elasticity management in PaaS systems
- 12 December 2015
- Published by Springer Nature in Computing
- Vol. 98 (9) , 923-947
Scalability approaches for causal multicast: a survey
- 12 December 2015
- Published by Springer Nature in Computing
- Vol. 98 (9) , 923-947
Scalability approaches for causal multicast: a survey
- 19 June 2015
- Published by Springer Nature
- p. 206-220
Data Consistency: Toward a Terminological Clarification
- 19 June 2015
- Published by Springer Nature
- p. 206-220
Data Consistency: Toward a Terminological Clarification
- 20 January 2014
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 68 (3) , 1280-1301
Improving the benefits of multicast prioritization algorithms
- 20 January 2014
- Published by Springer Nature in The Journal of Supercomputing
- Vol. 68 (3) , 1280-1301
Improving the benefits of multicast prioritization algorithms