Metric Tensor Definition Model for Telecommunication Network Based on Curvilinear Coordinates Systems

: pp. 103 - 109
Lviv Polytechnic National University
Lviv Polytechnic National University
Lviv Polytechnic National University

The tensor representation of telecommunication network parameters for various coordinate systems is described. The number of two-way links between nodes at the virtual level of the network is determined. A multidimensional coordinate system, the components of which may be various network parameters, such as the load between nodes, is considered. The state of the network is represented in a covariant and contravariant coordinate system. For assisted covariant differentiation described the possibility of taking into account changes in the state based on the Christoffel symbols. The definition of Riemann tensors is made. On the basis of the curvature tensor, the Ricci tensor is obtained by holding a convolution in a pair of indices, for example, in the first and third indices. In addition, another convolution was made on the Ricci tensor, which led to a scalar, which is called scalar curvature of space.

The definition of the metric tensor for Euclidean and hyperbolic space is considered. To represent hyperbolic space, it is suggested to use a Poincare disk, which is a canonical unit disk. The description of the Möbius transformation, which is used to display the virtual coordinates on a Poincare disk, is given.

An example of a metric tensor determination based on the cosine theorem is described for two cases:1) when there is a common point for two vectors; 2) when there is no such point.

An increase in the number of components of a metric tensor has been proposed, which allows us to represent a metric in a symmetric tensor field for describing the deformation of the Riemann metric used in the Ricci flows.

For a network of four nodes, for the first time, the component of the metric vectors tensor was determined using the cosine of the quadrangle, taking into account the two-way connection between each pair of nodes.

The case where the load between the nodes is described by means of the exponential distribution law is considered. The component of the metric tensor for such a case and the differential of this component for the Ricci stream are determined.

1. Ryabov, G. (2004), “Routing on lattice-cell structures”, Vich. Met. Programming, 5: 1, pр. 107–117. 2. Donchenko, V. (2011), “Euclidean spaces of numerical vectors and matrices: constructive methods for the description of the basic structures and their use”, International Journal “Information Technologies & Knowledge” Vol.5, Number 3, pр. 203–216. 3. Strykhaluk, B.M., Klymash, Yu.V., Strykhalyuk, I. B. and Koval, B. V (2015), “Increasing the effectiveness of dynamic routing in heterogeneous service-oriented systems using hyperbolic flows Richie”, Bulletin of the National University “Lviv Polytechnic”, Series: Radio Electronics and Telecommunications: a collection of scientific works, No. 818, рр. 189–194. 4. Kleinberg, R. (2007),"Geographic routing using hyperbolic space" in Proc. 26th IEEE Conf. Commun. Soc., pp. 1902–1909. 5. Eppstein, D., Goodrich, M. (2011), “Succinct Greedy Geometric Routing Using Hyperbolic Geometry”, IEEE Trans. Comp. vol. 60, no. 11, pp. 1571-1580. 6. Chow, B., Luo, F. (2003),"Combinatorial Ricci flows on surfaces", J. Different. Geometry, vol. 63, no. 1, pp. 97–129. 7. Pirhadi, V., Razavi, A. (2015),"The flow of Ricci on contact manifolds", Sibirsk. Mat. Journal, 56: 1142-1153; Siberian Math. J., 56: 5, pp. 912-921. 8. Huai-Dong Cao, Xi-Ping Zhu. (2006),"A complete proof of the Poincar ́e and geometrization conjectures — application of the Hamilton-Perelman theory of the Ricci flow“, Asian J. Math.,10, No. 2:165–492. 9. Shi X. (1989), “Ricci deformation of the metric on complete noncompact Riemannian manifolds”, J. of Diff. Geom. 30, рр. 303-394. 10. Klymash, M. M., Kaydan, M. V., Strykhaluk, B. M. (2016), “Tensor model of telecommunication network based on the curvilinear coordinate system”, Telecommunication and Information Technologies, No. 3, pp. 14–21.