Internet Engineering Task Force (IETF)

Abstract This document considers a VPN end user establishing an IPsec Security Association (SA) with a Security Gateway using the Internet Key Exchange Protocol version 2 (IKEv2), where at least one of the peers has multiple interfaces or where Security Gateway is a cluster with each node having its own IP address

Intended status: Informational

IKEv2/IPsec Context Definition draft-plmrs-ipsecme-ipsec-ikev2-context-definition-01 IKEv2/IPsec clusters are constituted of multiple nodes accessed via a single address by the end user. The traffic is then split between the nodes via specific IP load balancing policies. Once a session is assigned to a given node, IPsec makes it difficult to assign the session to another node. This makes management operations and transparent high availability for end users difficult to perform within the cluster. This document describes the IKEv2 and IPsec contexts that MUST be transferred between nodes within a cluster so a session can be restored. This makes possible to transfer an IPsec session between different nodes

ÉTUDE ANALYTIQUE ET NUMÉRIQUE DU COMPORTEMENT EN DÉTENTE D'UN MATÉRIAU POREUX APRÈS UN CHOC DE COURTE DURÉE

Cette étude présente une analyse du comportement des matériaux poreux en détente, derrière un front de choc. La vitesse matérielle résiduelle à pression nulle dépend de la pression de choc. On montre qu'elle passe par un maximum dont la valeur est determinée en fonction de la porosité initiale du milieu, pour l'aluminium et pour le cuivre.In this paper, we present some results about the release waves in porous materials (Al and Cu) from any shocked state and for porosity between 1 (compact) and Llim ([MATH], Gruneisen coefficient of compact material. We describe the evolution of residual material velocity with the pressure of shocked state. This velocity has a maximum value which is positive ; we give the evolution of this maximum with porosity for Al and Cu

Map of Relaying Messages (MORM) an approach of message distribution enabling network advertisement and discovery

Next generation networks will be more and more heterogeneous and dynamic. The traditional model for interactions between different networks is relatively static. However, future scenarios involve quite dynamic inter-network relationships established to meet service requirements on-the-fly. In particular, Network Composition will enable dynamic and automatic cooperation between networks, based on agreements tailored to meet the specific needs of the networks concerned. To facilitate such interactions, functionality to advertise and to discover various networks and services within the local and remote scope will be required. In this paper, we address the twinfunctions of Network Advertisement and Discovery. A scenariobased analysis is used to determine the key requirements of these functions, with special emphasis on the problem of distributing advertisement and discovery messages to a set of unknown target networks. A novel solution called Map of Relaying Messages is presented to enable the efficient and timely distribution of various messages for the purpose of advertisement and discovery