Abstract: A method to manage approaches to a platform (in particular at sea and operated by a helicopter) comprises the steps of receiving initial parameters and determining four particular waypoints (called IAF, IF, FAF and MAP). These flight plan points respectively determine the starting point of the approach procedure, the intermediate point corresponding to the end of the initial alignment and to the start of the capture of the final approach axis, the starting point of the final approach, and the point of decision to terminate the approach or initialize a go-around. Different developments describe different types of approaches that can be achieved by this method, the management of the descent and speed profiles, the management of the safety distances and the management of the display of the piloting instructions. Software and system aspects are described.

Abstract: A method to manage approaches to a platform (in particular at sea and operated by a helicopter) comprises the steps of receiving initial parameters and determining four particular waypoints (called IAF, IF, FAF and MAP). These flight plan points respectively determine the starting point of the approach procedure, the intermediate point corresponding to the end of the initial alignment and to the start of the capture of the final approach axis, the starting point of the final approach, and the point of decision to terminate the approach or initialize a go-around. Different developments describe different types of approaches that can be achieved by this method, the management of the descent and speed profiles, the management of the safety distances and the management of the display of the piloting instructions. Software and system aspects are described.

Abstract: Deterministic type packet-switching transmission networks are networks in which the different flows of information follow virtual paths defined in advance for which any change requires a reprogramming of the interconnection nodes. The advantage of determinism is that it makes it easier to estimate the maximum delay time that the packets may undergo during their journey in the network. However, it remains to be verified that the network is appropriately sized for the transmission of the different information flows, with the constraints of maximum delay times and of regularity imposed by the connected items of equipment. A method is proposed here for the sizing of the network. In this method, the verification of compliance with these constraints is based on the determining of the jitter components added by the different interconnection nodes of the network, at their different output ports.

Abstract: Deterministic type packet-switching transmission networks are networks in which the different flows of information follow virtual paths defined in advance for which any change requires a reprogramming of the interconnection nodes. The advantage of determinism is that it makes it easier to estimate the maximum delay time that the packets may undergo during their journey in the network. However, it remains to be verified that the network is appropriately sized for the transmission of the different information flows, with the constraints of maximum delay times and of regularity imposed by the connected items of equipment. A method is proposed here for the sizing of the network. In this method, the verification of compliance with these constraints is based on the determining of the jitter components added by the different interconnection nodes of the network, at their different output ports.