The disjoint multipath challenge: multiple disjoint paths guaranteeing scalability

The multipath challenge is a research line in continuous development because of its multiple benefits, however, these benefits are overshadowed by scalability, which goes down considerably when the paths are multiple and disjoint. The disjointness aggregates an extra value to the multiple paths, but it also implies more complex mathematical operations that increase the computational cost. In fact, diverse proposals exist that try to increase scalability by limiting the number of paths obtained to the minimum possible (two-disjoint paths), which is enough for backup applications but not for other purposes. This paper presents an algorithm that solves these drawbacks by discovering multiple disjoint paths among multiple nodes in an efficient way, while keeping bounded the computational cost and ensuring scalability. The proposed algorithm has been validated thoroughly by performing a theoretical analysis, bolstered afterwards by an exhaustive experimental evaluation. The collected results are promising, our algorithm reduces the time spent to obtain the disjoint paths regarding its competitors between one and three orders of magnitude, at the cost of a slight decrease in the number of paths discovered.Comunidad de MadridJunta de Comunidades de Castilla-La Manch

One-Shot Multiple Disjoint Path Discovery Protocol (1S-MDP)

Multipath routing over disjoint paths is a classic solution to allow better resource allocation, resilience, and security. Current proposals rely on centralised computation or iterative distributed algorithms and exhibit large convergence times. We propose 1S-MDP, a distributed mechanism based on a single network exploration with concurrent path selection to discover multiple available paths among the target node and the remaining nodes in the network. The paper evaluates 1S-MDP in two different scenarios against previous solutions. We show how it reduces the convergence time by several orders of magnitude with a small decrease in the number of disjoint paths discovered.Comunidad de Madri

GA3: scalable, distributed address assignment for dynamic data center networks

Deployment and maintenance of current data center networks is costly and prone to errors. In order to avoid manual configuration, many of them require centralized administrators which constitute a clear bottleneck, while distributed approaches do not guarantee sufficient flexibility or robustness. This paper describes and evaluates GA3 (Generalized Automatic Address Assignment), a discovery protocol that assigns multiple unique labels to all the switches in a hierarchical network, without any modification of hosts or the standard Ethernet frames. Labeling is distributed and uses probes. These labels can be leveraged for shortest path routing without tables, as in the case of the Torii protocol, but GA3 also allows other label-based routing protocols (such as PortLand or ALIAS). Additionally, GA3 can detect miswirings in the network. Furthermore, control traffic is only necessary upon network deployment rather than periodically. Simulation results showed a reduced convergence time of less than 2 s and 100 kB/s of bandwidth (to send the GA3 frames) in the worst case for popular data center topologies, which outperforms other similar protocols.Comunidad de Madri

TEDP: an enhanced topology discovery service for Software-Defined Networking

Currently, software-defined networking (SDN) platforms leverage the link-layer discovery protocol (LLDP) to discover the underlying topology. However, the LLDP is suboptimal in terms of message load. In this letter, we present the tree exploration discovery protocol (TEDP), proving that shortest paths can be built at the same time that the topology information is gathered, without extra messages compared with LLDP. We also analyze two alternative implementations for the TEDP and give insights into some features that SDN platforms should ideally provide for an efficient topology discovery service.Comunidad de Madri

Performance of Magnetic-Superconductor Non-Contact Harmonic Drive for Cryogenic Space Applications

Harmonic drives are profusely used in aerospace mainly because of their compactness and large reduction ratio. However, their use in cryogenic environments is still a challenge. Lubrication and fatigue are non-trivial issues under these conditions. The objective of the Magnetic-Superconductor Cryogenic Non-contact Harmonic Drive (MAGDRIVE) project, funded by the EU Space FP7, is to design, build, and test a new concept of MAGDRIVE. Non-contact interactions among magnets, soft magnetic materials, and superconductors are efficiently used to provide a high reduction ratio gear that smoothly and naturally operates at cryogenic environments. The limiting elements of conventional harmonic drives (teeth, flexspline, and ball bearings) are substituted by contactless mechanical components (magnetic gear and superconducting magnetic bearings). The absence of contact between moving parts prevents wear, lubricants are no longer required, and the operational lifetime is greatly increased. This is the first mechanical reducer in mechanical engineering history without any contact between moving parts. In this paper, the test results of a −1:20 inverse reduction ratio MAGDRIVE prototype are reported. In these tests, successful operation at 40 K and 10−3 Pa was demonstrated for more than 1.5 million input cycles. A maximum torque of 3 N·m and an efficiency of 80% were demonstrated. The maximum tested input speed was 3000 rpm, six times the previous existing record for harmonic drives at cryogenic temperature

Potential role of new molecular plasma signatures on cardiovascular risk stratification in asymptomatic individuals

The evaluation of cardiovascular (CV) risk is based on equations derived from epidemiological data in individuals beyond the limits of middle age such as the Framingham and SCORE risk assessments. Lifetime Risk calculator (QRisk®), estimates CV risk throughout a subjects' lifetime, allowing those. A more aggressive and earlier intervention to be identified and offered protection from the consequences of CV and renal disease. The search for molecular profiles in young people that allow a correct stratification of CV risk would be of great interest to adopt preventive therapeutic measures in individuals at high CV risk. To improve the selection of subjects susceptible to intervention with aged between 30-50 years, we have employed a multiple proteomic strategy to search for new markers of early CV disease or reported CV events and to evaluate their relationship with Lifetime Risk. Blood samples from 71 patients were classified into 3 groups according to their CV risk (healthy, with CV risk factors and with a previously reported CV event subjects) and they were analyzed using a high through quantitative proteomics approach. This strategy allowed three different proteomic signatures to be defined, two of which were related to CV stratification and the third one involved markers of organ damage.This work was supported by grants from the Instituto de Salud Carlos III (PI070537, IF08/3667-1, PI11-02239, PI 14/01917, PI11/01401, PI11/02432, PI13/01873, PI13/01746, PI13/01581, PI14/01650, PI14/01841), PT13/0001/0013, PIE13/00051, PIE13/00045, CP09/00229, CP15/00129, IDC Salud (3371/002), the MutuaMadrileña Foundation, the SENEFRO Foundation and FONDOS FEDER (RD06/0014/1015, RD12/0042/0071). Sociedad Española de cardiología para la Investigación Básica 2017. Grant PRB3 (IPT17/0019 - ISCIII-SGEFI / ERDF. These results are in line with the Spanish initiative on the Human Proteome Project.S

Search for tt¯ resonances in fully hadronic final states in pp collisions at √s = 13 TeV with the ATLAS detector

This paper presents a search for new heavy particles decaying into a pair of top quarks using 139 fb of proton-proton collision data recorded at a centre-of-mass energy of s = 13 TeV with the ATLAS detector at the Large Hadron Collider. The search is performed using events consistent with pair production of high-transverse-momentum top quarks and their subsequent decays into the fully hadronic final states. The analysis is optimized for resonances decaying into a tt¯ pair with mass above 1.4 TeV, exploiting a dedicated multivariate technique with jet substructure to identify hadronically decaying top quarks using large-radius jets and evaluating the background expectation from data. No significant deviation from the background prediction is observed. Limits are set on the production cross-section times branching fraction for the new Z′ boson in a topcolor-assisted-technicolor model. The Z′ boson masses below 3.9 and 4.7 TeV are excluded at 95% confidence level for the decay widths of 1% and 3%, respectively. [Figure not available: see fulltext.

A search for an unexpected asymmetry in the production of e(+)mu(-) and e(-)mu(+) pairs in proton-proton collisions recorded by the ATLAS detector at root s=13 TeV

This search, a type not previously performed at ATLAS, uses a comparison of the production cross sections for e(+)mu(-) and e(-)mu(+) pairs to constrain physics processes beyond the Standard Model. It uses 139 fb(-1) of proton-proton collision data recorded at root s = 13 TeV at the LHC. Targeting sources of new physics which prefer final states containing e(+)mu(-) and e(-)mu(+), the search contains two broad signal regions which are used to provide model-independent constraints on the ratio of cross sections at the 2% level. The search also has two special selections targeting supersymmetric models and leptoquark signatures. Observations using one of these selections are able to exclude, at 95% confidence level, singly produced smuons with masses up to 640 GeV in a model in which the only other light sparticle is a neutralino when the R-parity-violating coupling lambda(23)(1)' is close to unity. Observations using the other selection exclude scalar leptoquarks with masses below 1880 GeV when g(1R)(eu) = g(1R)(mu c) = 1, at 95% confidence level. The limit on the coupling reduces to g(1R)(eu) = g(1R)(mu c) = 0.46 for a mass of 1420 GeV

Calidad de las elecciones a titular del Ejecutivo en el Centro y Centro-occidente de México

Este libro, que tiene por objetivo analizar la calidad de las elecciones celebradas entre 2006 y 2011 para ocupar la titularidad del Poder Ejecutivo de las 14 entidades federativas de la República Mexicana que conforman las regiones Centro y Centro-occidente de este país, ha sido elaborado por investigadores pertenecientes a la Red Nacional de Investigación sobre la Calidad de la Democracia en México (Renicadem), la cual cuenta con un equipo de investigación en cada una de las entidades federativas del país. A su vez, esta Red constituye una de las cuatro líneas temáticas que componen la red temática del Conacyt “Sociedad civil y calidad de la democracia”. Con todo, la presente obra puede considerarse, en dos sentidos, como el resultado parcial de estudios realizados por investigadores que conforman la mencionada Renicadem. Por un lado, trata sólo de una de las varias dimensiones que esta Red ha establecido como necesarias para analizar la calidad de la democracia: la calidad electoral (otras dimensiones, que se encuentran en proceso de investigación, son calidad de vida, rendición de cuentas y Estado de derecho). También es parcial porque no abarca la totalidad de la República Mexicana, sino únicamente a las 14 entidades indicadas.UAE