Federico Fariña

Learn More
Leader election is a fundamental problem in distributed computing and it has been studied assuming various computation models and network topologies. This paper analyzes the algorithms for leader election in complete networks using asynchronous communication channels. We present a novel algorithm that reduces the information necessary to select a leader(More)
Mobility management in cellular communication systems is needed to guarantee quality of service, and to offer advanced services based on the user location. High mobility of terminals determines a high effort to predict next movement in order to grant a correct transition to the next phone cell. Then a fuzzy method dealing with the problem of determining the(More)
This paper shows a new distributed algorithm for deadlock detection and resolution under the single-resource request model that highly improves the complexity measurements of previous proposals. The algorithm has a communication cost of 2n − 1 messages and a latency of n · T for a deadlock cycle of n processes, where T is the inter-site communication delay.(More)
This paper presents a string matching experience using deformed fuzzy automata for the recognition of imperfect strings. We propose an algorithm based on a deformed fuzzy automaton that calculates a similarity value between strings having a non-limited number of edition errors. Different selections of the fuzzy operators for computing the deformed fuzzy(More)