P is ¼
P n
i¼1 x i
D
ð19:11Þ
And, as above, irregularity should satisfy:
X n
i¼1
x i \resource required
ð19:12Þ
There is an engineering suggestion that might be useful in handling of desperation level up to the last moment of package handling—so-called “epsilon” e Ra .
This “epsilon” can be used as estimate of speed approaching the equality of
resource required and available, and when we see that almost nothing left: resources
available dR a ! 0 it is required to evaluate relative speed of its consumption, then
dR a
R a
! e Ra
means nothing else but relative “share” of the package requirements along the total
cost of the journey. Physically speaking it means that if almost nothing left dR a !
0 but we are at the very end of the journey R a ! 0 it is worth to have for this case
and engineering threshold to consider for the last push priority and policy.
Additionally, as a subject of special further research it is worth to analyze a
question like:—“what if we arrive too early…”. This is important as the load of
inside a node package Shandling might grow enormously. The importance of it
grows—because we might create a queue inside the router and a problem of sorting
packagers to put them in order ease their handling at the destination side. This, in
turn, causes or might cause internal delays along the path of package.
19.5 Graph Theory Elements for Desperation Model
Well, division of the cost of the link on the weight of the total journey is good in
terms of analysis of contribution of this link—share of it in the whole distance
between chosen nodes or vertices.
It is also useful to consider this distance thinking about graph cardinality—i.e.
how many nodes or vertices are in the graph as a whole. Internet as a graph model is
pretty rich in number of connections and astronomical in number of terminals
connected 2Bn+.
For the purpose of this research the structure of the Internet is sufficiently
described in [9, 12, 13] indicating several layers of nodes. Each layer has different
importance; further down Internet becomes a tree-like graph. New trends though
change this established picture because each mobile terminal (device) now receives
an option to become also router for others.
19.4 Researching Desperation
275
P n
i¼1 x i
D
ð19:11Þ
And, as above, irregularity should satisfy:
X n
i¼1
x i \resource required
ð19:12Þ
There is an engineering suggestion that might be useful in handling of desperation level up to the last moment of package handling—so-called “epsilon” e Ra .
This “epsilon” can be used as estimate of speed approaching the equality of
resource required and available, and when we see that almost nothing left: resources
available dR a ! 0 it is required to evaluate relative speed of its consumption, then
dR a
R a
! e Ra
means nothing else but relative “share” of the package requirements along the total
cost of the journey. Physically speaking it means that if almost nothing left dR a !
0 but we are at the very end of the journey R a ! 0 it is worth to have for this case
and engineering threshold to consider for the last push priority and policy.
Additionally, as a subject of special further research it is worth to analyze a
question like:—“what if we arrive too early…”. This is important as the load of
inside a node package Shandling might grow enormously. The importance of it
grows—because we might create a queue inside the router and a problem of sorting
packagers to put them in order ease their handling at the destination side. This, in
turn, causes or might cause internal delays along the path of package.
19.5 Graph Theory Elements for Desperation Model
Well, division of the cost of the link on the weight of the total journey is good in
terms of analysis of contribution of this link—share of it in the whole distance
between chosen nodes or vertices.
It is also useful to consider this distance thinking about graph cardinality—i.e.
how many nodes or vertices are in the graph as a whole. Internet as a graph model is
pretty rich in number of connections and astronomical in number of terminals
connected 2Bn+.
For the purpose of this research the structure of the Internet is sufficiently
described in [9, 12, 13] indicating several layers of nodes. Each layer has different
importance; further down Internet becomes a tree-like graph. New trends though
change this established picture because each mobile terminal (device) now receives
an option to become also router for others.
19.4 Researching Desperation
275