Ricardo Marcelín-Jiménez

  • Citations Per Year
Learn More
This paper presents, in the form of a case study, the design, implementation and performance evaluation of Phoenix: a prototype of fault-tolerant distributed storage web service, based on URLs. Phoenix includes Web Storage Middleware (WSM) that re-uses the URLs of the files to accommodate data/redundancy load dynamically as well as a set of redundancy(More)
Given a set V of active components in charge of a distributed execution, a storage scheme is a sequence B<sub>0</sub>, B<sub>1</sub>,..., B<sub>b-1</sub> of subsets of V, where successive global states are recorded. The subsets, also called blocks, have the same size and are scheduled according to some fixed and cyclic calendar of b steps. During the ith(More)
This paper assumes a set of identical wireless hosts, each one aware of its location. The network is described by a unit distance graph whose vertices are points on the plane two of which are connected if their distance is at most one. The goal of this paper is to design local distributed solutions that require a constant number of communication rounds,(More)
Current proposals for Cognitive Radio Networks (CRN) are created mainly to solve dynamic spectrum access where several cognitive devices are searching for free frequency bands, i.e. ‘white spaces’. This is in order to communicate without or with minimum interference to primary users (PU). Cognitive Radio devices must coordinate the communication with peers(More)
A Wireless sensor network (WSN) consists of a potentially large number of sensor nodes with wireless-communication capabilities that work collaboratively to achieve a common goal. While every WSN application has specific requirements, there are some common basic services that any WSN must offer in order to support applications. There are available(More)
In recent years distributed storage systems have been the object of increasing interest by the research community. They promise improvements on information availability, security and integrity. Nevertheless, at this point in time, there is no a predominant approach, but a wide spectrum of proposals in the literature. In this paper we report our findings(More)
Graphs in which decentralized algorithms can find short paths efficiently by considering only local information are known as Searchable Networks [4], [5]. Jon Kleinberg studied decentralized search in a subtle variant of the Watts-Strogatz model [3] and showed that the structure of searchable networks has to meet some strict requirements [5]. The aim of(More)