Termination Detection of Local Computations

Contrary to the sequential world, the processes involved in a distributed system do not necessarily know when a computation is globally finished. This paper investigates the problem of the detection of the termination of local computations. We define four types of termination detection: no detection, detection of the local termination, detection by a distributed observer, detection of the global termination. We give a complete characterisation (except in the local termination detection case where a partial one is given) for each of this termination detection and show that they define a strict hierarchy. These results emphasise the difference between computability of a distributed task and termination detection. Furthermore, these characterisations encompass all standard criteria that are usually formulated : topological restriction (tree, rings, or triangu- lated networks ...), topological knowledge (size, diameter ...), and local knowledge to distinguish nodes (identities, sense of direction). These results are now presented as corollaries of generalising theorems. As a very special and important case, the techniques are also applied to the election problem. Though given in the model of local computations, these results can give qualitative insight for similar results in other standard models. The necessary conditions involve graphs covering and quasi-covering; the sufficient conditions (constructive local computations) are based upon an enumeration algorithm of Mazurkiewicz and a stable properties detection algorithm of Szymanski, Shi and Prywes

Wandering behaviour prevents inter and intra oceanic speciation in a coastal pelagic fish

Small pelagic fishes have the ability to disperse over long distances and may present complex evolutionary histories. Here, Old World Anchovies (OWA) were used as a model system to understand genetic patterns and connectivity of fish between the Atlantic and Pacific basins. We surveyed 16 locations worldwide using mtDNA and 8 microsatellite loci for genetic parameters, and mtDNA (cyt b; 16S) and nuclear (RAG1; RAG2) regions for dating major lineage-splitting events within Engraulidae family. The OWA genetic divergences (0-0.4%) are compatible with intra-specific divergence, showing evidence of both ancient and contemporary admixture between the Pacific and Atlantic populations, enhanced by high asymmetrical migration from the Pacific to the Atlantic. The estimated divergence between Atlantic and Pacific anchovies (0.67 [0.53-0.80] Ma) matches a severe drop of sea temperature during the Gunz glacial stage of the Pleistocene. Our results support an alternative evolutionary scenario for the OWA, suggesting a coastal migration along south Asia, Middle East and eastern Africa continental platforms, followed by the colonization of the Atlantic via the Cape of the Good Hope.Portuguese Foundation for Science & Technology (FCT) [SFRH/BD/36600/2007]; FCT [UID/MAR/04292/2013, SFRH/BPD/65830/2009]; FCT strategic plan [UID/Multi/04326/2013]info:eu-repo/semantics/publishedVersio

A Guide to Stochastic Loewner Evolution and its Applications

This article is meant to serve as a guide to recent developments in the study of the scaling limit of critical models. These new developments were made possible through the definition of the Stochastic Loewner Evolution (SLE) by Oded Schramm. This article opens with a discussion of Loewner's method, explaining how this method can be used to describe families of random curves. Then we define SLE and discuss some of its properties. We also explain how the connection can be made between SLE and the discrete models whose scaling limits it describes, or is believed to describe. Finally, we have included a discussion of results that were obtained from SLE computations. Some explicit proofs are presented as typical examples of such computations. To understand SLE sufficient knowledge of conformal mapping theory and stochastic calculus is required. This material is covered in the appendices.Comment: 80 pages, 22 figures, LaTeX; this version has 5 minor corrections to the text and improved hyperref suppor

A Hybrid Approach to Quality of Service Multicast Routing in High Speed Networks

Multimedia services envisaged for high speed networks may have large numbers of users, require high volumes of network resources and have real-time delay constraints. For these reasons, several multicast routing heuristics that use two link metrics have been proposed with the objective of minimising multicast tree cost while maintaining a bound on delay. Previous evaluation work has compared the relative average performance of some of these heuristics and concludes that they are generally efficient. This thesis presents a detailed analysis and evaluation of these heuristics which illustrate that in some situations their average performance is prone to wide variance for a particular multicast in a specific network. It concludes that the efficiency of an heuristic solution depends on the topology of both the network and the multicast, which is difficult to predict. The integration of two heuristics with Dijkstras shortest path tree algorithm is proposed, to produce a hybrid that consistently generates efficient multicast solutions for all possible multicast groups in any network. The evaluation results show good performance over a wide range of networks (flat and hierarchical) and multicast groups, within differing delay bounds. The more efficient the multicast tree is, the less stable it will be as multicast group membership changes. An efficient heuristic is extended to ensure multicast tree stability where multicast group membership is dynamic. This extension decreases the efficiency of the heuristics solutions, although they remain significantly cheaper than the worst case, a shortest delay path tree. This thesis also discusses how the hybrid and the extended heuristic might be applied to multicast routing protocols for the Internet and ATM Networks. Additionally, the behaviour of the heuristics is examined in networks that use a single link metric to calculate multicast trees and concludes one of the heuristics may be of benefit in such networks