Information Geometric Structure of Stable M/G/1 Queue

Manifold and its Matrix Exponential

Ismail A Mageed1 Demetres D Kouvatsos2

School of Electrical Engineering and Computer Science,
University of Bradford Bradford, UK

Abstract
Information geometry seeks to characterize the structure of statistical models from a differential-geometric point
of view. By considering families of probability distributions as manifolds with coordinate charts determined by
the parameters of each individual model, the tools of differential geometry, such as divergences and metric tensors,
naturally provide additional means of studying their characteristics. The research undertaken in this paper presents
a novel approach to the study of information geometrics of a queueing system. To this end, the manifold of a
stable M/G/1 queue is characterised from the viewpoint of information geometry, the Kullback’s divergence and
J-divergence. Consequently, the geodesic equations are obtained and the stable M/G/1 queue’s exponential of
information matrix is presented. Adding information geometric links with queueing theory enables the study of the
dynamics of a queueing system from novel Riemannian Geometric point of view and in turn, leading to the analysis
of a queueing system, based on the theory of Relativity.

Keywords: Stable M/G/1 queue, information geometry, statistical manifold, Ricci curvature, Riemannian metric,
Fisher information matrix, Kullback’s divergence, J-divergence, information matrix exponential, geodesic equations.

1 Introduction
Information geometry has been widely applied in many fields such as statistical inference, system
control and neural networks. In other words, information geometry aims to apply the techniques of
differential geometry to statistics. This means that information geometry’s main idea is to apply
methods and techniques of non-Euclidean geometry to stochastic process and probability theories.
Information geometry indicates that the use of a Euclidian geometry technique is not absolutely
correct. Often it is useful to think of a family of probability distributions as a statistical manifold.
More recently, it has been adopted for the study of statistical manifolds where the geometric metrics
gave a new description of the probability density function an important role in statistical manifold
and can be regarded as the coordinate system.

1 Email: ismailmageed@gmail.com
2 Email: D.kouvatsos@bradford.ac.uk
 A manifold [1] is a topological finite dimensional Cartesian space, Rn , where one has an infinite-
dimensional manifold. Rn could be described merely as a topological space. In addition, information
geometry supports reasoning intuitively the description of statistical manifolds. Note that although
figures can be visualised (i.e., plotted in coordinate charts), they should be thought of as purely
abstract figures, namely, geometric figures. One may have a higher level of appreciation of the
significant importance of information geometry [2]. In fig. 1, the parameter inference θ∧ of a model
from data D can also be interpreted as a decision-making problem: Decide which parameter of
a parametric family models M = {mθ } θ ∈ Θ suits the “best” the data. Information geometry
provides a differential-geometric manifold structure M useful for designing decision rules.

Fig. 1. Parametrization of a statistical manifold (c.f., [2])

In [3] Amari studied the exponential distribution families and Dodson ([4]) and his colleagues
investigated some special exponential distributions such as the bivariate normal distribution, the
Gamma distribution, the McKay distribution and the Frund distribution and gave their geometric
structures. In this paper, we study the geometric structure of stable M/G/1 queue manifoldas
well as finding its matrix exponential of information. The matrix exponential is a matrix function
on square matrices analogous to the ordinary exponential function. It is used to solve systems of
linear differential equations. In addition to that, the matrix exponential plays a crucial role in the
theory of Lie groups [5]. Within the literature and up to our level best knowledge, there is only
one research paper [6], which studied the geometry of M/D/1 queues, where a geometric structure
was introduced on the set of M/D/1 queues by employing the properties of queue length paths.
From this point of view, this clarifies why we have undertaken this novel track of research linking
differential geometry with information and matrix theories for the re-interpretation of queueing
systems.
By analogy to Information Theory (IT), why adopting a geometric approach? The answer is that
geometry allows one to study invariance and equivariance of figures in a coordinate-free approach
(n.b., by equivariance as a concept, it is meant when there is a group acting on a pair of spaces and
there is a map from functions on one to the functions on the other [7]). Following the course of
our paper, Ricci curvature [2] measures the deviation of the Riemannian metric from the standard
Euclidean metric and how scalar curvature measures the deviation in the volume of a geodesic ball
from the volume of an Euclidean ball of the same radius (c.f., Fig. 2).
Geodesics are the analogue of straight lines in Euclidean space and possess many of the same
properties as straight lines. In General Relativity (GR), objects travel on a geodesic in curved
space-time, which extremises the proper time between two points. The same mathematics hence
 Fig. 2. Geometric representation of geodesics on curved surfaces (c.f., [8])

describes both the geometry of curved spaces and the geometry of space-time. This maths was
Einstein’s biggest challenge in developing GR. Moreover, a “straight line on a curved surface” is
called a geodesic, which minimizes the distance between 2 points.
In information geometry, the Fisher information metric is a particular Riemannian metric which
can be defined on a smooth statistical manifold, i.e., a smooth manifold whose points are probabil-
ity measures defined on a common probability space. It can be used to calculate the informational
difference between measurements. The Fisher information metric measures closeness of the shape
between two distribution functions, it is also proportional to the amount of information that the dis-
tribution function contains about the parameter of the probability density function of the statistical
manifold.
The focus of this work is foundational and the list of its contributions is as follows i) Fisher’s
information matrix and its inverse as well as the Fisher’s information metric for the stable M/G/1
queue manifold are introduced. It is shown that the lower boundary state probability manifold of
the stable M/G/1 queue is geometrically visualized by geodesic curves of families of logarithmic
functions. It is also shown that the geodesic equation of the first coordinate of the steady state
probability of the stable M/G/1 queue manifold is an arbitrary family of families of temporal
exponential curves ii) A novel α(orO(α) ) − connection (the α − connection (c.f., [9]), maps each
coordinate θ to a value. In particular, the 1-connection (or, ‘exponential connection’) and the (-1)-
connection (or, ‘mixture connection’) of a stable M/G/1 queue manifold are devised. These novel
derivations are used to determine the geodesic equations for the coordinates of the stable M/G/1
queue manifold. These geodesic equations are considered as analogues to the equations of motion
in dynamics. In other words, the information geometric equations of motion are devised for the
coordinates of the stable M/G/1 manifold iii) The geodesic equations, the Kullback Divergence and
the J-divergence of a stable M/G/1 queue are determined iv) The stable M/G/1 queue’s manifold
could be considered to be incompressible or solenoidal, in which case any closed surface has no net
flux across it (c.f., Divergence Theorem [10], which is the second 3-dimensional analogue of Green’s
Theorem stating that ‘If F is a vector field with continuous derivatives defined on a region D ⊆ R2
with boundary curve C, then, the flux of F across C is equal to the integral of the divergence over
its interior’) v) The exponential of the Fisher’s information matrix of the stable M/G/1 queue is
shown to be a solution of a differential equation of the form dxdt = Ax, where x is an n-dimensional
vector and A is an nxn matrix.
The rest of this paper is organised as follows: Section 2 presents preliminary definitions asso-
ciated with information geometry. The Fisher’s information matrix and its inverse as well as the
Fisher information metric for a stable M/G/1 queue manifold are introduced in Section 3. The
α(orO(α) ) − connection of a stable M/G/1 queue manifold is obtained in Section 4. The geodesic
equations, Kullback Divergence and J-divergence (c.f., [11]) of a stable M/G/1 queue manifold are
obtained in Section 5. The exponential matrix analysis of a stable M/G/1 queue is obtained in
Section 6. Lastly, conclusions and future research directions are included in Section 7.

2 Main Definitions in Information Geometry

Definition 2.1 [12]

1. We call M = {p(x, θ)|θ ∈ Θ} a statistical manifold if x is a random variable in sample space X
and p(x,θ) is the probability density function, which satisfies certain regular conditions. Here,
θ = (θ1 , θ2 , · · · , θn ) ∈ Θ is an n-dimensional vector in some open subset Θ ⊂ Rn , and θ can be
viewed as the coordinates on manifold M .
2. An n-dimensional parametric statistical model θ = {pθ |θ ∈ Θ} is called an exponential family
or exponential type, if the probability density function can be expressed inPterms of functions
C, F1 , · · · , Fn and a convex function Ψ on Θ on the form p(x, θ) = e{C(x)+ i Fi −Ψ(θ)}
In addition, we call {θi } the natural parameters and Ψ the potential function. Hence, we have
X

C(x) + Fi − Ψ(θ) = ln p(x; θ) = L(x; θ) (2.1)
i
We call M = {L(x; θ)|θ = (θ1 , θ2 , · · · , θn ) ∈ Rn an n-dimensional distribution manifold, where
(θ1 , θ2 , · · · , θn ) plays the role of the coordinate system.
Definition 2.2 [12]. Having defined the function L(x; θ), by (2.1), the potential function Ψ(θ)to
be the distinguished negative function of the coordinates alone and in the sequel, it will appear in
the information geometric analysis of the M/G/1 queue manifold.
 
Definition 2.3 [9]. The Fisher’s metric (or the Fisher’s information matrix gij ) is given by the
Hessian, (the nxn matrix of the partial derivatives of the potential function Ψ(θ) with respect to
the coordinates) that is,

  h ϑ2
i
gij = Ψ(θ) , i, j, = 1, 2, · · · n (2.2)
ϑθi ϑθj
with respect to natural coordinates.
 
Definition 2.4 [11]. Given the Fisher information matrix c the inverse matrix of gij is defined
by
 
 ij   
−1 adj gij  
g = gij = , O = det gij , i, j, = 1, 2, · · · n (2.3)
O
The Fisher information metric for the manifold M is given in θ coordinates by the arc length
function
n
X
(ds)2 = gij (dθi )(dθj ) (2.4)
i,j=1

Definition 2.5 .[9] α − Connection

For each α ∈ R, the α(orO(α) )−connection is the torsion-free affine connection with components:

(α) 1 − α


Γij,k = ϑi ϑj ϑk (Ψ(θ)) (2.5)
2
 ϑ
where Ψ(θ) is the potential function, and ϑi = ϑθi

Definition 2.6 [11]. Assume p(x; θp ) and q(x; θq ) are two points on the manifold M, the Kullback’s
divergence K(p, q)is defined by
   Z  
p(x; θp )
p(x; θp )
K(p, q) = Eθp ln = p x; θp ln dx (2.6)
q(x; θq ) q(x; θq )
where Eθp stands for the expected value.
and the J-divergence is defined by
   Z   
p(x; θp )

 p(x; θp )
K(p, q) = Eθp ln = p x; θp − q x; θq ln dx (2.7)
q(x; θq ) q(x; θq )
When the two p(x; θp ) and q(x; θq ) are close enough, from the Taylor’s formula, one can see that
K(θ, θ + dθ) = J(θ, θ + dθ) = 21 (ds)2 where (ds)2 stands for the square of the arc length of the
manifold.
Definition 2.7 [8].Geodesics are the analogue of straight lines in Euclidean space and possess
many of the same properties as straight lines.
In General Relativity (GR), objects travel on a geodesic in curved space-time, which extremizes
the proper time between two points. The same mathematics hence describes both the geometry
of curved spaces and the geometry of space-time .This maths was Einstein’s biggest challenge in
developing GR
A “straight line on a curved surface” is called a geodesic, which minimizes the distance between
2 points
The geodesic equations of manifold M with coordinate system θ = (θ1 , θ2 , .., θn ) are defined by
[11]

d2 θk  i  dθj 
k(0) dθ k(α) (α)
+ Γ ij = 0, i, j, = 1, 2, · · · , n, Γij = Γij g sk , i, j, k, s = 1, 2, · · · , n (2.8)
dt2 dt dt

Definition 2.8 [13].

1. Considering the linear system of differential equations
dx
= Ax (2.9)
dt
where x is an n-dimensional vector and A is an nxn matrix. The matrix exponential
∞
X Ai A2 Ak
eA = =I +A+ + ··· + + ··· (2.10)
i=0
i! 2! k!
is the solution of (2.9).
2. If the characteristic polynomial of A is defined by

Φ(δ) = det(A − δI) (2.11)

Then, the set of eigen values of A will is defined to be the set of all the roots of the equation

Φ(δ) = (δ) = det(A − δI) = 0 (2.12)

 and corresponding eigen vectors x assigned to each eigen value δ are defined to satisfy the
equation:

Ax = δx (2.13)
A
Another way to represent e will be

eA = T eD T −1 (2.14)
where D is the diagonal matrix of eigen values of A, and T is matrix having of the corresponding
eigen vectors of A as its columns.
Definition 2.9 [14]
1. Developable surfaces are a special kind of ruled surfaces: they have a Gaussian curvature equal
to 0, and can be mapped onto the plane surface without distortion of curves: any curve from
such a surface drawn onto the flat plane remains the same. In this context, it is important
to remember the following property of Gaussian curvature: if the surface is subjected to an
isometric transformation (or more plainly bending), the Gaussian curvature at any point of
the surface will remain invariant. The Gaussian curvature is in fact determined by the inner
metric of a surface, therefore all the lengths and angles on the surface remain invariant under
bending, a property immensely important in using developable surfaces in manufacturing. As
a consequence, developable surfaces, having the Gaussian curvature equal to zero, the same
as plane surfaces, can be obtained from un-stretchable materials without fear of extending or
tearing, but by transforming a plane through folding, bending, gluing or rolling.
2. The use of developable surfaces in contemporary architecture, for example, given user-specified
three-dimensional boundary curves, generates a smooth developable surface. In our usual world
of three dimensions, the one in which we make architectural objects, all developable surfaces
are ruled.

Fig. 3. The three kinds of developable surfaces: a, left) tangential; b, centre) conical; c, right) cylindrical. Curves
in bold are directrix or base curves; straight lines in bold are directors or generating lines (curves) (c.f., [14])

3. There are therefore three types of developable surfaces (excluding a fourth type, the planar
surface):
i) Surfaces in which generating lines are tangents of a space curve: this type of surface is
spanned by a set of straight lines tangential to a space curve, which is called the edge of
regression (Fig. 3a);
ii) Surfaces which can be described as a generalised ‘cone’ where all generating lines run
through a fixed point, the apex or vertex of the surface (Fig. 3b);
 iii) Surfaces which, in the same manner, can be described as a generalised cylinder, where all
generating lines are parallel, swept by a set of mutually parallel lines (Fig. 3c).
It should be mentioned that the developable surfaces are also those which contain elements
of any of the above mentioned general cases of developable surfaces, as long as they can be
flattened onto a planar surface, without creasing, tearing or stretching (Fig. 3).

3 The Fisher Information Matrix and its Inverse for the Stable M/G/1
Queue Manifold
According to Kouvatsos [15], the maximum entropy state probability of the generalized geometric
solution of a stable M/G/1queue, subject to normalisation, mean queue length (MQL), L and server
utilisation, ρ(< 1) is given by

Fig. 4. A Stable M/G/1 queue


1 − ρ, n=0
p(n) = (3.1)
n
1 − ρgx , n ≥ 1


1+ρC 2
 
ρ2 (L−ρ)
where g = (L−ρ)(1−ρ) ,x = L and L = ρ2 1 + 1−ρ s (MQL of Pollaczeck-Khinchin Formula
of a stable M/G/1 queue), ρ = (1 − p(0)) and Cs2 is the SCV of the service times). It clearly follows
that p(n) of (3.1) can be rewritten as


 1 − ρ, n=0

p(n) = 1+ρβ

n−1 (3.2)
2ρ 1−ρ −1
n≥1


 1+ρβ

n ,
1−ρ +1

where β = Cs2 .

Theorem 1.3

For the stable M/G/1 queue manifold, it holds that

i) The Fisher Information Matrix is given by
!
1
h i
(1−ρ)2 0
gij = −1
(3.3)
0 (β+1)2
 ii) The square of the arc length (i.e., Fisher Information Metric) is determined by

2  1 
 −1 
2
2
ds = 2
dρ − 2
dβ (3.4)
(1 − ρ) (β + 1)
iii) The inverse of Fisher Information Matrix is given by
h i !
h i h i−1 adj gij (1 − ρ)2 0
ij
g = gij = = (3.5)
4 0 −(β + 1)2

Proof

i) Following (3.2), two cases would arise.

Case I: When n = 0, p(n) = 1 − ρ. Hence, the coordinate system in this case will be one
dimensional, and it holds that


L(x; θ) = ln p(x; θ) = ln(1 − ρ), θ = θ1 = ρ (3.6)
The potential function Ψ(θ) will be the standalone part of (−L(x; θ)) involving the coordi-
nates, i.e.,

Ψ(θ) = −ln(1 − ρ) (3.7)

Thus,
ϑΨ 1
ϑ1 = = (3.8)
ϑρ 1−ρ
ϑ2 Ψ 1
ϑ 1 ϑ1 = = (3.9)
ϑρ2 (1 − ρ)2
Therefore, the Fisher Information Matrix is given by
h i h ϑ2 Ψ i h 1 i
gij = = (3.10)
ϑρ2 (1 − ρ)2
and the inverse of the Fisher Information Matrix will be determined by
h i h i−1  2
g ij = gij = 1−ρ (3.11)
Moreover, it follows that
 1 − α 
  1 − α 
(α)
Γ11,1 = ϑ1 ϑ1 ϑ1 Ψ(θ) = (3.12)
2 (1 − ρ)3
1(α) (α)
 1 − α  2  1−α
Γ11 = Γ11,1 g 11 = 3
1 − ρ = (3.13)
(1 − ρ) (1 − ρ)
1(0) 1
Γ11 = (3.14)
(1 − ρ)
 In this case, the geodesic equations are

d2 ρ 1(0) dρ
  dρ 
+ Γ 11 =0 (3.15)
dt2 dt dt
It is clearly implied that

d2 ρ 1  dρ 2
+ =0 (3.16)
dt2 (1 − ρ) dt
Solving (3.16), the following solutions is yield

ρ = 1 − aebt , a > 0, b < 0 (3.17)

This is a novel result that could be read geometrically that the geodesic curves of the lower
boundary state probability of the stable M/G/1 queue manifold are of the lower boundary state
probability of the stable M/G/1 queue manifold is characterized by an arbitrary of family of
families of temporal exponential curves.

1+ρβ

n−1
2ρ 1−ρ −1
Case II: Following similar steps to Case I, when n ≥ 1, p(n) = 1+ρβ

n . Hence, the
1−ρ +1
coordinate system in this case will be two dimensional and it holds that

 1 + ρβ   1 + ρβ 
L(x; θ) = ln p(x; θ) = (ln2 + ln(ρ) + (n − 1) ln − 1 − nln −1 , (3.18)
1−ρ 1−ρ

where θ = (θ1 , θ2 ) = (ρ, β)

To this end, the potential function Ψ(θ) will be the standalone part of (−L(x; θ)) involving
the coordinates, i.e,
 1 + ρβ 
Ψ(θ) = ln − 1 − ln2 − ln(ρ) (3.19)
1−ρ
In analogy to the above proof, after some algebraic manipulation, it clearly follows that the
Fisher Information Matrix is given by
!
1
h i
(1−ρ)2 0
gij = −1
(3.20)
0 (β+1)2

Hence, expression (3.3) of i) follows.

ii) By following analogous algebraic analysis to that of i), it can be established that the square of
the arc length of (ii) is given by
n

2 X
 1 

2
 1 
2
gij dθi dθj =


ds = 2
dρ − 2
dβ (3.21)
i,j=1
(1 − ρ) (β + 1)
iii) Similarly, after some lengthy analytic derivations,
  it can be the determinant of the Fisher
Information Matrix will be given by 4 = det gij = − (β+1)21(1−ρ)2 6= 0. Hence, the inverse
matrix of Fisher information exists. To this end, after some algebraic steps, it follows that
 inverse matrix of Fisher Information Matrix is expressed by
!
h
ij
i (1 − ρ)2 0
g = (3.22)
0 −(β + 1)2
This proves (iii).
In the following section, novel formulae for the components of α(orO(α) ) − connection of the
stable M/G/1 queue manifold are devised. These novel derivations will be used later to devise
the geodesic equations for the coordinates of the stable M/G/1 queue manifold. These geodesics
equations reconsidered as analogous to the equations of motion in dynamics. In other words, the
information geometric equations of motion are devised for he coordinates of the stable M/G/1
manifold.

4 The α(orO(α) ) − connection of the M/G/1 Queue Manifold

By (2.5), it is implied that

(α) (1 − α)
Γ11,1 = (4.1)
(1 − ρ)3
In a similar fashion, the remaining components are devised.
1(α) (α) (α)
By using (2.8), the following expressions follow: Γ11 = Γ11,1 g 11 + Γ11,2 g 21 which is after some
lengthy calculations
 1−α 
2 1−α
1(α)
Γ11 = 3
1−ρ = (4.2)
2(1 − ρ) (1 − ρ)
1(0) 1
Γ11 = (4.3)
(1 − ρ)
Engaging the same approach, the remaining components are computed.
Using the above derivations, the geodesic equations of the stable M/G/1 queue manifold can be
devised, which are considered to be the information geometric equations of motion for the stable
M/G/1 queue manifold.

5 The Geodesic Equations, the Kullback Divergence, and the J-divergence

of the Stable M/G/1 Queue Manifold
By the definition, the geodesic equations should take the form

d2 θk  i  dθj 
k(0) dθ
2
+ Γij = 0, i, j, = 1, 2, · · · , n, (5.1)
dt dt dt
At k = 1, the first set of geodesic equations is given by

d2 ρ  2
1(0) dρ
 2 
1(0) dβ 1(0) 1(0)
 dρ  dβ 
+ Γ 11 + Γ 22 + Γ 12 + Γ 21 =0 (5.2)
dt2 dt dt dt dt
By the above calculations, it can be verified that the first set of geodesic equations corresponding
to the first coordinate ρ is given by

d2 ρ 1  dρ 2
+ + =0 (5.3)
dt2 (1 − ρ) dt
 Solving (5.3), it follows that

ρ = 1 − AeBt , whereA, B are any real numbers such that 0 < |1 − AeBt | < 1 (5.4)
Expression (5.4) shows that the geodesic equation of the first coordinate ρ, is an arbitrary family
of exponential curves.
At k = 2, we have the second set of geodesic equations corresponding to the second coordinate
β is

d2 β 1  dβ 2
2
− =0 (5.5)
dt β + 1 dt
Solving (5.5), we have the exact solution β = aebt − 1 Which shows that the equation of
motion of squared coefficient of variation. This reads geometrically as the geodesic curves of of
the stable M/G/1 queue manifold is characterized by an arbitrary of family of families of temporal
exponential curves, which is a new result to be presented. Stability of M/G/1 queue requires that
> 1. mathematically speaking, this implies β = aebt > 2 which directly enforces the parameter
a > 0,b < 0.
Now, by definition (2.6), after some few algebraic steps, we have the Kullback divergence to be
     
p(x; θp )  p(x; θp )  ρ 
p
K(p, q) = Eθp ln = Eθp ln = ln (5.6)
q(x; θq q(x; θq ρq
Also, as for the J-divergence, we get
ρ  ρ 
p q
J(p, q) = K(p, q) + K(q, p) = ln + ln =0 (5.7)
ρq ρp
Equation (5.7) presents a great contribution as it shows that the stable M/G/1 queue manifold
could be looked at to be incompressible or solenoidal, in which case any closed surface has no net
flux across it.

6 The Exponential Matrix of the Fisher Information Matrix of the Stable

M/G/1 Queue manifold

Theorem 1.6
The exponential matrix of the Fisher information [13] of the stable M/G/1 queue manifold is a
solution of a differential equation of the form dx
dt = Ax.

Proof

It hasbeen
 proved earlier on that the Fisher information matrix of the stable M/G/1 queue
manifold gij , i, j = 1, 2 is given by
!
1
h i
(1−ρ)2 0
gij = −1
(6.1)
0 (β+1)2
  
Rewriting gij in a more simpler form,
!    
h i a0 1 −1
gij = ,a = ,b = (6.2)
0 b (1 − ρ)2 (β + 1)2
!
   a−δ 0
It follows that Φ(δ) = (δ) = det gij − δI = det = 0. Hence, it holds that
0 b−δ
δ 2 − (a + b)δ + ab = 0, implies that the Eigen values are

δ1,2 = a, b (6.3)
Therefore, the diagonal matrix D is given by
!
δ1 0
D= (6.4)
0 δ2
Applying (2.12), it clearly follows that the matrix
!
−1 1 0
T =T = unity matrix I = (6.5)
0 1
Hence the exponential matrix of the Fisher information matrix of the stable M/G/1 queue
manifold will be given by
!
A D −1 ea 0
e =T e T = (6.6)
0 eb
The result obtained in (6.6) shows that the exponential of the Fisher Information Matrix of the
stable M/G/1 queue manifold is a solution of a differential equation of the form

dx
= Ax (6.7)
dt

7 Conclusions and Future Work

The stable M/G/1 queue manifold is characterized from the viewpoint of information geometry is
characterized and the geodesic equations, Kullback divergence and J-divergence are obtained. Also,
the matrix exponential of information of the M/G/1 queue manifold is devised. This paper opens
a new ground for research linking queueing theory with many other mathematical disciplines such
as information theory, differential geometry and matrix theory. Specifically, adding information
geometric links with queueing theory enables the study of the dynamics of a queueing system from
the Riemannian Geometric point of view [3,4] and in turn, enabling the analysis of a queueing
system based on the theory of Relativity (c.f., [8]).
To summarise the contributions of the paper, the Fisher information matrix and its inverse as
well as the Fisher information metric for the M/G/1 queue manifold are introduced. Also, it is
proven that for the case n = 0, the stable M/G/1queue manifold is geometrically visualized by
geodesic curves a family of families of functions that the geodesic equation of the first coordinate of
the steady state probability of the stable M/G/1 queue manifold is an arbitrary family of temporal
exponential curves. Moreover, it is proven that for the case n > 0, the stable M/G/1queue manifold
is geometrically visualized by geodesic curves of a family of families of functions that the geodesic
equations of both the service utilization coordinate and the SCV coordinate of the stable M/G/1
queue manifold is an arbitrary family of families of temporal exponential curves.
Moreover, a novel expression for α(orO(α) )−connection of the M/G/1 queue manifold is devised.
These derivations were used later to devise the geodesic equations for the coordinates of the stable
M/G/1 queue manifold. The geodesics equations are considered to be analogous to the equations of
motion in relativistic dynamics, which were employed to devise the information geometric equations
of motion for the coordinates of the stable M/G/1 manifold. In addition, the geodesic equations,
the Kullback Divergence, and the J-divergence of the Stable M/G/1 Queue manifold are devised. In
this context, it was shown that the stable M/G/1 queue manifold can be described as incompressible
or solenoidal, in which case any closed surface has no net flux across it. The latter, was justified by
the Divergence Theorem [10], which states that the flux of a vector field across a closed boundary
curve C is equal to the integral of the divergence over its interior. It is implied that, when the
J-divergence is zero, any closed surface has no net flux across the M/G/1 queue manifold. Finally,
it has been proven that the exponential of the Fisher information matrix of the stable M/G/1 queue
manifold is a solution of a differential equation of the form dx dt = Ax.
Based on the contributions of this paper, there are several future research directions towards
the further establishment of information geometric queueing theory, such as i) The determination
of the information geometric structure of the Service Model manifold (c.f., [16]), where the service
model MAXCOMPE distribution adopts load dependent mean service rates, µn = nΦ µ, where Φ
is a pressure parameter indicating the degree that the service rate is affected by the state of the
system, n(n = 0, 1, 2, · · · ) and µ is the service rate ii) The derivation of the information geometric
structure of the Generalized Feller Pareto manifold (c.f., [17]) as well as developing further advances
on many existing queueing manifolds, such as the G/G/1 queue (c.f., [15]) manifold and employing
information geometrics on various statistical manifolds.

Acknowledgments
The authors wish to express their sincerest thanks to Mr Kabiru M. Maiyama, PhD research
student, Networks and Performance Engineering Research Group, Department of Computer Science,
University of Bradford, UK for the presentational conversion of our paper from Word into Latex
format.

References
[1] Information geometry https://ncatlab.org/nlab/show/information+geometry, 2019.
[2] Frank Nielsen. An elementary introduction to information geometry. arXiv preprint arXiv:1808.08271, 2018.
[3] Shun-ichi Amari. Differential-geometrical methods in statistics, volume 28. Springer Science & Business Media,
2012.
[4] C. T. J. Dodson. Spatial statistics and information geometry for parametric statistical models of galaxy
clustering. International journal of theoretical physics, 38(10):2581–2593, 1999.
[5] Brian Hall. Lie groups, Lie algebras, and representations: an elementary introduction, volume 222. Springer,
2015.
[6] Kenji Nakagawa. The geometry of m/d/1 queues and large deviation. International Transactions in Operational
Research, 9(2):213–222, 2002.
[7] Risi Kondor and Shubhendu Trivedi. On the generalization of equivariance and convolution in neural networks
to the action of compact groups. arXiv preprint arXiv:1802.03690, 2018.
[8] Chris Blake. The geodesics in curved space http://astronomy.swin.edu.au/∼cblake/class7 geodesics.pdf, 2019.
[9] C. T. J. Dodson. Topics in information geometry http://eprints.maths.manchester.ac.uk/131/1/infogeom.pdf,
2005.
[10] Neil Donaldson. The divergence theorem https://www.math.uci.edu/∼ndonalds/math2e/16-9divergence.pdf,
2015.

[11] Linyu Peng, Huafei Sun, and Lin Jiu. The geometric structure of the pareto distribution. Boletın de la Asociación
Matemática Venezolana, 14(1-2):5–13, 2007.

[12] Didong Li, Huafei Sun, Chen Tao, and Lin Jiu. Riemannian holonomy groups of statistical manifolds. arXiv
preprint arXiv:1401.5706, 2014.

[13] J Gunawardena. Matrix algebra for beginners. Cambridge: Harvard Medical School, 2006.

[14] Snežana Lawrence. Developable surfaces: their history and application. Nexus Network Journal, 13(3):701–714,
2011.

[15] Demetres D Kouvatsos. A maximum entropy analysis of the g/g/1 queue at equilibrium. Journal of the
Operational Research Society, 39(2):183–200, 1988.

[16] Silvia Maria Prado, Francisco Louzada, José Gilberto S Rinaldi, and Benedito Galvão Benze. A distribution for
the service model. Pesquisa Operacional, 35(3):555–576, 2015.

[17] Mahmoud Riad Mahmoud and Amani S Abd El Ghafour. Shannon entropy for the generalized feller-pareto
(gfp) family and order statistics of gfp subfamilies. Applied Mathematical Sciences, 7(65):3247–3253, 2013.