Dynamical evolution of escaped plutinos, another source of Centaurs

It was shown in previous works the existence of weakly chaotic orbits in the plutino population that diffuse very slowly. These orbits correspond to long-term plutino escapers and then represent the plutinos that are escaping from the resonance at present. In this paper we perform numerical simulations in order to explore the dynamical evolution of plutinos recently escaped from the resonance. The numerical simulations were divided in two parts. In the first one we evolved 20,000 test particles in the resonance in order to detect and select the long-term escapers. In the second one, we numerically integrate the selected escaped plutinos in order to study their dynamical post escaped behavior. Our main results include the characterization of the routes of escape of plutinos and their evolution in the Centaur zone. We obtained a present rate of escape of plutinos between 1 and 10 every 10 years. The escaped plutinos have a mean lifetime in the Centaur zone of 108 Myr and their contribution to the Centaur population would be a fraction of less than 6 % of the total Centaur population. In this way, escaped plutinos would be a secondary source of Centaurs.Comment: Accepted for publication in A&

Vehicle Navigation Service Based on Real-Time Traffic Information

GNSS-assisted vehicle navigation services are nowadays very common in most of the developed countries. However, most of those services are either delivered through proprietary technologies, or fall short in flexibility because of the limited capability to couple road information with real-time traffic information. This paper presents the motivations and a brief summary of a vehicle navigation service based on real-time traffic information, delivered through an open protocol that is currently under standardization in the Open Mobile Alliance forum

A VNF modeling approach for verification purposes

Network Function Virtualization (NFV) architectures are emerging to increase networks flexibility. However, this renewed scenario poses new challenges, because virtualized networks, need to be carefully verified before being actually deployed in production environments in order to preserve network coherency (e.g., absence of forwarding loops, preservation of security on network traffic, etc.). Nowadays, model checking tools, SAT solvers, and Theorem Provers are available for formal verification of such properties in virtualized networks. Unfortunately, most of those verification tools accept input descriptions written in specification languages that are difficult to use for people not experienced in formal methods. Also, in order to enable the use of formal verification tools in real scenarios, vendors of Virtual Network Functions (VNFs) should provide abstract mathematical models of their functions, coded in the specific input languages of the verification tools. This process is error-prone, time-consuming, and often outside the VNF developers’ expertise. This paper presents a framework that we designed for automatically extracting verification models starting from a Java-based representation of a given VNF. It comprises a Java library of classes to define VNFs in a more developer-friendly way, and a tool to translate VNF definitions into formal verification models of different verification tools

A novel approach for security function graph configuration and deployment

Network virtualization increased the versatility in enforcing security protection, by easing the development of new security function implementations. However, the drawback of this opportunity is that a security provider, in charge of configuring and deploying a security function graph, has to choose the best virtual security functions among a pool so large that makes manual decisions unfeasible. In light of this problem, the paper proposes a novel approach for synthesizing virtual security services by introducing the functionality abstraction. This new level of abstraction allows to work in the virtual level without considering the different function implementations, with the objective to postpone the function selection jointly with the deployment, after the configuration of the virtual graph. This novelty enables to optimize the function selection when the pool of available functions is very large. A framework supporting this approach has been implemented and it showed adequate scalability for the requirements of modern virtual networks

Effects of an eccentric inner Jupiter on the dynamical evolution of icy body reservoirs in a planetary scattering scenario

Aims. We analyze the dynamics of small body reservoirs under the effects of an eccentric inner giant planet resulting from a planetary scattering event around a 0.5 M⊙ star. Methods. First, we used a semi-analytical model to define the properties of the protoplanetary disk that lead to the formation of three Jupiter-mass planets. Then, we carried out N-body simulations assuming that the planets are close to their stability limit together with an outer planetesimal disk. In particular, the present work focused on the analysis of N-body simulations in which a single Jupiter-mass planet survives after the dynamical instability event. Results. Our simulations produce outer small body reservoirs with particles on prograde and retrograde orbits, and other ones whose orbital plane flips from prograde to retrograde and back again along their evolution (“Type-F particles”). We find strong correlations between the inclination i and the ascending node longitude Ω of Type-F particles. First, Ω librates around 90° or/and 270°. This property represents a necessary and sufficient condition for the flipping of an orbit. Moreover, the libration periods of i and Ω are equal and they are out to phase by a quarter period. We also remark that the larger the libration amplitude of i, the larger the libration amplitude of Ω. We analyze the orbital parameters of Type-F particles immediately after the instability event (post IE orbital parameters), when a single Jupiter-mass planet survives in the system. Our results suggest that the orbit of a particle can flip for any value of its post IE eccentricity, although we find only two Type-F particles with post IE inclinations i ≲ 17°. Finally, our study indicates that the minimum value of the inclination of the Type-F particles in a given system decreases with an increase in the eccentricity of the giant planet.Fil: Zanardi, Macarena. Universidad Nacional de La Plata. Facultad de Ciencias Astronómicas y Geofísicas; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata. Instituto de Astrofísica La Plata. Universidad Nacional de La Plata. Facultad de Ciencias Astronómicas y Geofísicas. Instituto de Astrofísica La Plata; ArgentinaFil: de Elia, Gonzalo Carlos. Universidad Nacional de La Plata. Facultad de Ciencias Astronómicas y Geofísicas; Argentina. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata. Instituto de Astrofísica La Plata. Universidad Nacional de La Plata. Facultad de Ciencias Astronómicas y Geofísicas. Instituto de Astrofísica La Plata; ArgentinaFil: Di Sisto, Romina Paula. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata. Instituto de Astrofísica La Plata. Universidad Nacional de La Plata. Facultad de Ciencias Astronómicas y Geofísicas. Instituto de Astrofísica La Plata; Argentina. Universidad Nacional de La Plata. Facultad de Ciencias Astronómicas y Geofísicas; ArgentinaFil: Naoz, S.. University of California at Los Angeles; Estados UnidosFil: Li, G.. Harvard-Smithsonian Center for Astrophysics; Estados UnidosFil: Guilera, O. M.. Consejo Nacional de Investigaciones Científicas y Técnicas. Centro Científico Tecnológico Conicet - La Plata. Instituto de Astrofísica La Plata. Universidad Nacional de La Plata. Facultad de Ciencias Astronómicas y Geofísicas. Instituto de Astrofísica La Plata; Argentina. Universidad Nacional de La Plata. Facultad de Ciencias Astronómicas y Geofísicas; ArgentinaFil: Brunini, A.. Universidad Nacional de la Patagonia Austral; Argentin

Automated optimal firewall orchestration and configuration in virtualized networks

Emerging technologies such as Software-Defined Networking and Network Functions Virtualization are making the definition and configuration of network services more dynamic, thus making automatic approaches that can replace manual and error-prone tasks more feasible. In view of these considerations, this paper proposes a novel methodology to automatically compute the optimal allocation scheme and configuration of virtual firewalls within a user-defined network service graph subject to a corresponding set of security requirements. The presented framework adopts a formal approach based on the solution of a weighted partial MaxSMT problem, which also provides good confidence about the solution correctness. A prototype implementation of the proposed approach based on the z3 solver has been used for validation, showing the feasibility of the approach for problem instances requiring tens of virtual firewalls and similar numbers of security requirements

An Efficient Data Exchange Algorithm for Chained Network Functions

In-network function chaining often involves the deployment of multiple applications into a single, possibly multi-tenant, middlebox. This approach has gained much interest since new network paradigms, such as Software Defined Networking (SDN) and Network Function Virtualization (NFV), have been proposed to virtualize resources as well as network functions. In this scenario, it is very common to move data (e.g., packets) from an application to another by means of a switching module that is in charge of chaining network functions in the correct order, also ensuring an adequate level of isolation between any two virtualized components. With this purpose in mind, this paper proposes an efficient algorithm to handle the communication between the internal soft-switch and the heterogeneous network functions that are executed on the same server. Our proposal is designed with the aim of dealing with high speed packet processing, hence an extensive performance evaluation is also provided to prove the goodness of our solution in this context