20.11.2012 Views

Contents Telektronikk - Telenor

Contents Telektronikk - Telenor

Contents Telektronikk - Telenor

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

80<br />

Similarly as for Poisson-traffic we note<br />

that overflow traffic is defined for an<br />

infinite group and may likewise be<br />

named ‘offered traffic’. We can now calculate<br />

the means M01 , M02 , ..., M0g and<br />

variances V01 , V02 , ..., V0g overflowing<br />

from direct links using Wilkinson’s formula.<br />

Since the input streams A01 , A02 ,<br />

..., A0g are independent Poisson traffic<br />

processes we can conclude that the individual<br />

overflow processes, too, are independent.<br />

Thus the total traffic offered to<br />

the upward transit link will have the<br />

mean<br />

M0 = M01 + M02 + ... + M0g + A0 and the variance<br />

V0 = V01 + V02 + ... + V0g + A0 Our next step is to calculate the traffic<br />

lost in link ko given that the offered traffic<br />

has the mean M0 and the variance V0 .<br />

This is done smartly be replacing the g<br />

direct links to basic nodes by a single<br />

imaginary link of n channels offered a<br />

Poisson-traffic, A, as shown in Figure 4.<br />

Thus we calculate A and n from the<br />

Wilkinson formula given M = M0 and<br />

V = V0 and we can use the same formulae<br />

to estimate the moments M0 and V0 of<br />

overflow traffic from the link k0 . Especially<br />

we may estimate the average loss<br />

in link k0 as<br />

A n<br />

B0 = M0/M0 = AEn+k0(A)<br />

AEn(A)<br />

Primary<br />

group<br />

Figure 3 ‘The Kosten system’<br />

= En+k0(A)<br />

En(A)<br />

Owerflow<br />

group<br />

∞<br />

A n M 0 , V 0 k 0 M 0 , V 0<br />

Figure 4 The equivalent random principle<br />

For the traffic A 0 offered directly to the<br />

transit link a somewhat better loss estimate<br />

can be obtained as the time congestion,<br />

E 0 , encountered in that link [1]. The<br />

results are approximate, of course, but are<br />

generally considered rather acceptable for<br />

dimensioning purposes. Though we have<br />

omitted the network outside a single transit<br />

centre and its basic nodes, this should<br />

not hide any major difficulties as long as<br />

we are contented with average losses of<br />

combined traffic streams on upward links.<br />

In the sequel, however, we will also<br />

attempt to calculate individual losses<br />

from one basic node to another.<br />

3 Split traffics calculation<br />

A natural approach to our problem of<br />

individual loss calculations would be to<br />

use the ERT concept shown in Figure 4,<br />

where the imaginary poissonian traffic<br />

intensity A is split as follows:<br />

A = A0 + A1 + ... + Ag Ai = M0i /En (A), i = 1, 2, ..., g<br />

Thus we have preserved the individual<br />

overflow means from direct links. This<br />

will hopefully lead to useful results also<br />

when combining split overflow traffics<br />

on downward transit links. The formula<br />

to be used are obtained for the overflow<br />

system of Figure 5 and may be found in<br />

the paper Joint state distributions of partial<br />

traffics [9]. They give estimates of<br />

the means M 0i and variance V 0i of split<br />

overflow traffics behind the (imaginary)<br />

group n + k 0 offered g independent Poisson-processes<br />

defined above. The results<br />

are<br />

M 0i = α i M 0<br />

V0i<br />

M0i<br />

αi = Ai<br />

A<br />

i = 1, 2, ..., g<br />

M0 =AEn + k0 (A)<br />

V0 = M0<br />

− 1=αi<br />

� V0<br />

M0<br />

�<br />

1 −M0 +<br />

�<br />

− 1<br />

A<br />

n + k0 − A + M0<br />

�<br />

It should be noted<br />

that the overflow<br />

processes behind a<br />

transit link are<br />

dependent. Thus<br />

we did not obtain V0 as a sum of individual<br />

variances. Instead we found ‘variance/mean<br />

- 1’ to be an additive characteristic<br />

of the partial overflow traffics.<br />

The individual blocking probabilities in<br />

link k0 are obtained as<br />

B ′ 0i = M0i<br />

=<br />

M0i<br />

Ai<br />

· AEn+k0(A)/AiEn(A)<br />

A<br />

= En+k0(A)<br />

En(A)<br />

a result that is certainly approximate and<br />

will be discussed below. Note that individual<br />

variances V0i will not be used in<br />

our simple routing structure with low<br />

loss transit links.<br />

Considering Figure 2 we could identify<br />

g + 1 link patterns, each showing g links<br />

to basic nodes, one upward transit link<br />

and g downward transit links. Let us<br />

focus on the downward link l1 , a group of<br />

l1 channels. Among the overflow traffics<br />

offered to k0 the only one that can reach<br />

l1 is (M01 , V01 ). Similarly, it is seen that<br />

among traffics offered to k2 the link l1 can only be reached by (M21 , V21 ), and<br />

so on. The total traffic that can have<br />

access to l1 may be written as the mean<br />

M1 = M01 + M21 + M31 + ... + Mg1 + A1 and variance<br />

V1 = V01 + V21 + V31 + ... + Vg1 + A1 Let us assume for simplicity that upward<br />

links, k0 , k2 , ..., kg are all low loss links<br />

that will allow almost all corresponding<br />

overflow calls to reach link l1 . M1 and V1 define just a new combination of traffics<br />

similar to the one offered to the upward<br />

transit link k0 . Clearly the downward link<br />

l1 can be treated in the same way by<br />

ERT. Thus for the simple case of an isolated<br />

network with one transit node and<br />

with low loss transit links we may estimate<br />

the loss from node 0 to node 1 as<br />

B01 = En01 (A01 )(B’ 01 + B’’ 01 )<br />

where B’ 01 and B’’ 01 are the individual<br />

losses in the upward (k 0 ) and downward<br />

(l 1 ) links, respectively.<br />

4 Conclusion<br />

The methods suggested above for estimating<br />

point-to-point losses in hierarchical<br />

alternative routing networks can be<br />

judged only be extensive simulations. At<br />

present, however, we may see some general<br />

consequences of results obtained so<br />

far:

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!