In this paper, a problem of periodical message transmission in the onboard networks based on the Avionics Full Duplex Ethernet (AFDX) standard is formalized and an algorithm for solving this problem is proposed. The algorithm combines the greedy approach with the limited exhaustive search and consists of several procedures to solve the problem step by step with respect to the constraints imposed. The results of the experimental research aimed at investigating the effectiveness of the proposed algorithm are presented.

In this paper we propose a model of a datacenter that provides an ability to describe a wide class of data center architectures. The resource allocation problem is considered that supports replication of data storage elements. Replication procedure provides a way of congestion elimination on channels connected to data storages with low write rates and high read rates. Experimental investigation that was held with different resource allocation algorithms is showing replication procedure to be able to increase the number of allocated requests.

The problem of organizing periodical message transmission for onboard networks based on the Avionics Full Duplex Ethernet (AFDX) standard is considered, and an approach to solving it is proposed. An important stage of solving this problem is the aggregation procedure, in which a virtual link, via which several messages from one partition are transmitted, is formed. The aggregation procedure is described in detail, and the results from experimental studies of its effectiveness are presented.

This paper presents a comparison of several approaches to design of data exchange networks for onboard real-time information and control systems (RT ICS). The approaches considered are based on Fibre Channel (FC), Avionics Full Duplex Ethernet (AFDX) and Software-Defined Networking (SDN) technologies. The networks are compared according to the following criteria: ability to guarantee real-time messages transfer; ability to maintain common time in the system; amount of extra hardware resources to ensure the necessary reliability; support for dynamic (during the RT ICS runtime) alteration of message transfer routes.

An algorithm for assigning requests to physical recourses for data centers with independent schedulers for different types of resources (computational resources, network resources, and data storages) is considered. This algorithm is based on the combination of greedy and limited search strategies. The algorithm provides a required balance between the computational complexity and quality of assignments by limiting the maximum allowed search depth. Theoretical and experimental results of investigating its features are presented.

In this paper, abstractions for describing resource requests and physical resources of data centers are chosen. A mathematical model of a data center is developed; this model provides an opportunity for describing a wide class of data center architectures. In terms of this model, a mathematical formulation of the resource allocation problem is given that admits migration of virtual machines and replication of data storage elements. Resource allocation algorithms for data centers with a unified scheduler for all types of resources, algorithms for data centers with specific schedulers for each type of resources, and similar algorithms from the OpenStack platform are compared; the comparison results are presented.