Vicent Cholvi

Learn More
In this paper we present an algorithm that can be used to implement sequential, causal, or cache consistency in distributed shared memory (DSM) systems. For this purpose it has a parameter that allows to choose the consistency model to be implemented. As far as we know, this is the first algorithm proposed that implements cache coherence. In our algorithm,(More)
Random walks are gaining much attention from the networks research community. They are the basis of many proposals aimed to solve a variety of network-related problems such as resource location, network construction, nodes sampling, etc. This interest on random walks is justified by their inherent properties. They are very simple to implement as nodes only(More)
In this work, we consider a generalized version of the adversarial model and study the universal stability (stability in any network) of scheduling policies under low load rates. We show that any work-conserving policy is universally stable at any load rate (1 ), where is the largest number of links crossed by any packet. We also show that system-wide time(More)
In this paper we analyze a novel paradigm of reliable communications which is not based on the traditional timeout-and-retransmit mechanism of TCP. Our approach, which we call FBP (Fountain Based Protocol), consists on using a digital fountain encoding which guarantees that duplicate packets are not possible. Using Game Theory, we analyze the behavior of(More)
Research on video-on-demand transmissions is essentially divided into periodic broadcasting methods and on-demand methods. Periodic broadcasting is aimed to schedule transmissions off-line, so that an optimized time schedule is achieved. On the other hand video-ondemand has to deal with constraints at requesting times. Thus, studies on these areas have been(More)
One of the most important abstractions for designing distributed programs is the broadcast facility. In this paper, we study the interconnection of distributed message passing systems. We have shown that totally ordered systems cannot be properly interconnected in any form. However, we have provided a simple protocol to properly interconnect FIFO ordered(More)
This paper describes user location and tracking on indoor scenarios through a wireless network. We propose a fuzzy location algorithm, using fuzzy inference systems, in order to deal with imprecise location based on radio-frequency trilateration estimations, providing high location rates near to 90. This indoor positioning approach is based on the pattern(More)
Most studies in complex networks assume that once a link is created between two nodes it is never deleted. However, there is a recent interest towards systems where links can be rapidly rewired. An important issue in that type of networks is to discover the topology that, given a search algorithm, optimizes the search process. In this paper, we present a(More)