A Specific Risk Evaluation System for Live Virtual Machine Migration Based on the Uncertain Theory

Benefiting from the convenience of virtualization, virtual machine migration is generally utilized to fulfil optimization objectives in cloud/edge computing. However, live migration has certain risks and unapt decision may lead to side effects and performance degradation. Leveraging modified deep Q network, this paper provided an advanced risk evaluation system. Thorough formulation was given in this paper and a specific integration method was innovated based on uncertain theory. Series experiments were carried on computing cluster with OpenStack. The experimental results showed deep Q network for risk system was reliable while the uncertain approach was a proper way to deal with the risk integration.

On deficiency problems for graphs

Motivated by analogous questions in the setting of Steiner triple systems and Latin squares, Nenadov, Sudakov and Wagner [Completion and deficiency problems, Journal of Combinatorial Theory Series B, 2020] recently introduced the notion of graph deficiency. Given a global spanning property $\mathcal P$ and a graph $G$ , the deficiency $\text{def}(G)$ of the graph $G$ with respect to the property $\mathcal P$ is the smallest non-negative integer t such that the join $G*K_t$ has property $\mathcal P$ . In particular, Nenadov, Sudakov and Wagner raised the question of determining how many edges an n-vertex graph $G$ needs to ensure $G*K_t$ contains a $K_r$ -factor (for any fixed $r\geq 3$ ). In this paper, we resolve their problem fully. We also give an analogous result that forces $G*K_t$ to contain any fixed bipartite $(n+t)$ -vertex graph of bounded degree and small bandwidth.

Hamilton-connectivity of Interconnection Networks Modeled by a Product of Graphs

The product graph Gm *Gp of two given graphs Gm and Gp, defined by J.C. Bermond et al.[J Combin Theory, Series B 36(1984) 32-48] in the context of the so-called (Δ,D)-problem, is one interesting model in the design of large reliable networks. This work deals with sufficient conditions that guarantee these product graphs to be hamiltonian-connected. Moreover, we state product graphs for which provide panconnectivity of interconnection networks modeled by a product of graphs with faulty elements.

Symmetric Boundary Condition for Laplacian on Net of Regular Hexagons

Hexagonal grid methods are found useful in many research works, including numerical modeling in spherical coordinates, in atmospheric and ocean models, and simulation of electrical wave phenomena in cardiac tissues. Almost all of these used standard Laplacian and mostly on one configuration of regular hexagons. In this work, discrete symmetric boundary condition and energy product for anisotropic Laplacian are investigated firstly on general net of regular hexagons, and then generalized to its most extent in two- or three-dimensional cell-center finite difference applications up to the usage of symmetric stencil in central differences. For analysis of Laplacian related applications, this provides with an approach in addition to the M-matrix theory, series method, functional interpolations and Fourier vectors.