Federico Fariña

Learn 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)
Copyright and moral rights for the publications made accessible in the public portal are retained by the authors and/or other copyright owners and it is a condition of accessing publications that users recognise and abide by the legal requirements associated with these rights. • Users may download and print one copy of any publication from the public portal(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)
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 /spl middot/ T for a deadlock cycle of n processes, where T is the inter-site(More)
This work introduces a new distributed history-based algorithm for deadlock detection and resolution under the single-unit request model. The algorithm has a communication cost of O(n /spl middot/ log n) messages for a deadlock cycle of n processes. This low cost is achieved by means of two mechanisms. On one hand, to reduce the number of instance(More)
This paper presents a modified leader election algorithm for complete networks without sense of direction. The original algorithm, introduced by Villadangos et al. in (2005), had the aim of reducing the number of exchanged messages in order to select a leader. However, the original O(n) algorithm fails to choose a leader on several occasions. A modified(More)