CC BY
61
Reliability Tensor Model of Telecommunication
Network with RED
Olexandr V. Lemeshko, Oksana Yevsyeyeva, Sergey Garkusha
Abstract — If the user is buying a telecommunications service, he expects from the provider of a certain quality of servicing. So the delivery of telecommunications traffic must be realized with the specified quality requirements. As a rule the requirements are related to traffic rate, average delay, packet jitter, and the reliability (delivery or loss probability). The main way to meet its is finding appropriate path or multipath along which these requirements are satisfied. The multipath case is related to traffic distribution task. In this article we proposed tensor model for telecommunication network with RED and formulated analytical condition for QoS-ensuring. Satisfaction reliability of the condition guarantees that rate and requirements are be achieved at the same time. The formulated condition has invariant form that doesn’t depend on AQM mechanism type.
Index Terms — Delivery Probability, QoS, Packet loss, RED, Reliability, Telecommunication Network, Tensor model
I. Introduction
GUARANTEED end-to-end Quality of Service (QoS) is one of fundamental aspects of modern telecommunication network (TCN) [1]. In practice QoS ensuring is related to different traffic control features such as classification and marking, routing, shaping, policing, queuing, congestion management [2]. From viewpoint of network productivity the most effective QoS-features from the list are multipath routing as tool for load balancing and Active Queue Management (AQM) mechanisms as tool for congestion management.
In general the end-to-end QoS requires guaranteeing on multiple QoS-parameters, such as rate, average delay, packet jitter, and the reliability (delivery or loss probability) at the same time. As result QoS ensuring is complex and difficult task that needs appropriate mathematical models and algorithms. Currently within the existing technological traffic control means (protocols and mechanisms) the routing and AQM problems are solved apart by using low-level (from viewpoint of their theoretical justification) heuristic models and schemes [3] - [4].
Manuscript received November 23, 2012.
Olexandr Lemeshko is with the Kharkov National University of Radioelectronics, Ukraine, 61166, Kharkov, Lenin Prosp., 14, room 305 (corresponding author to provide phone: (057)7021320; fax: (057)7021320; email: [email protected]).
Oksana Yevsyeyeva is with the Kharkov National University of Radioelectronics, Ukraine, 61166, Kharkov, Lenin Prosp., 14, room 305 (phone: (057)7021320; fax: (057)7021320; e-mail: [email protected]). Sergey Garkusha is with the Kharkov National University of Radioelectronics, Ukraine, 61166, Kharkov, Lenin Prosp., 14, room 305 (phone: (057)7021320; fax: (057)7021320; e-mail: [email protected]).
Therefore an important scientific and engineering problem is developing sufficient mathematical models that can formalize the process of QoS ensuring within solving the traffic control task with taking into account multipath routing and AQM mechanisms on routers. In this regard, approach based on the tensor representation of the telecommunication network deserves attention. This mathematical tool has already proven itself to provide effective holistic and multiaspect description of telecommunication network. In [5] - [6] tensor model of TCN enables to obtain analytical conditions for satisfaction rate and delay requirements at same time under multipath routing.
Providing a required level of reliability of traffic delivery is related to using measurements such as the probability of timely delivery of packet, the probability of authentic delivery of packet, the probability of failure-free operation, availability factor, etc. Reference [7] develops reliability tensor model of TCN in terms of the probability of failure-free operation. In this article we’ll focus on the probability of packet loss (IP packet Loss Ratio, IPLR), which is one of the key characteristics of Network Performance [8].
II. T ENSOR MODEL OF THE TELECOMMUNICATION NETWORK
with RED
In order to develop tensor model of TCN we’ll use a technique based on the generalization postulates of G. Kron [9]. According to a preliminary postulate in the first phase of development behavior equation for a single element of the system should be written. Let us choose link as single element of telecommunication network. Then we’ll consider the network as a set of connected in a certain way (within a certain structure) links.
It is known that the delivery of the packet in the link and the loss of the packet form a complete group of events, i.e.
p = 1- p^ (1)
where p - the probability of packet delivery; p l - the probability of packet loss.
In general, the causes of a packet loss can be different, for example, the signal’s distortion, coding errors, incorrect addressing, a large network delay and expiration of TTL of the packet. But the main reason of packet loss in transport network is related to a buffer overflow and packet drops, i.e. mechanisms of passive and active queue management. At present, most widely applicable queue management mechanisms in the packet-switched networks are Random Early Detection (RED) and its different modifications [2], [4].
40
R&I, 2012, №4
RED and its modifications belong to AQM mechanisms where dropping of packets from queue can happen before buffer overflow. Under RED, discard function pl is linear function of the average length of the queue q
pi =
q -®n
®max ®min
1
s
(2)
where q - actual size of the queue (number of packets in queue); ®min - minimum threshold (if the average queue falls below this minimum threshold then no packets are discarded); ©max - maximum threshold (if the falls above this maximum threshold all packets are discarded); S - mark probability denominator.
Then delivery probability for link under RED is
to set of edges V in graph model of network) [11]; pi -
utilization of the ith link; n - number of link in the network.
The system of equations (5) describes separated network links. Before turning the system of equations into one tensor equation we must be sure that every object from the system (5) has tensor nature. References [5] - [6] show tensor nature of some network parameters (metrics). It is known that additive metrics such as delay, jitter are covariant tensors but metrics satisfying conservation constraint, for instance, traffic intensity or rate, are contravariant tensors.
The probability of packet delivery is multiplicative metric, i.e.
p( path * = n p(v *.
i:v;epath
Let us turn the multiplicative metric into the additive
p = 1 -
q-®„
® max ® min
1
s
(3)
log a (p( path *) = £ log a (p(v)) .
i:v;epath
The average length of queue q is function of traffic intensity transmitted through the router (link) for the formalization of which we will use the results of queuing theory as one possible way of its analytical representation. By using queuing system M/M/ 1/N this quantity can be represented as [10]
P
1 -P
(N + 1)pN+1
1 -pN+1 P.
(4)
Then (5) takes the form
!°ga (p( v)) =
f f
x loga 1 -
1
X( v)
a ( n, + 1)pjNi+1 ^
v-Pi- 1 -PiNi+1 Л
®min
®max ®min
(6)
X,
(v)
or
X
where N = ®b +1; 0b - buffer size; p = — - utilization of
Ф
the link; ф - capacity of the link; X - traffic rate in the link.
Pv = ®vAv ,
(7)
Note, as well as in the case of the functional equation for a single network element, the estimated average queue length can be obtained not only by using the queuing theory, but also by using other mathematical tools such as Markov processes, empirical methods, etc.
Let us add a sliding index i for indicating the number of the link, then the functional equation for reliability of the ith link can be written as
p(v) = 1 -
f_ft (N| + 1)PiN-+' _ '
1 -p,~ 1 -Р|н-+' ~P'
®max ®min
—, (5)
S
where p(v) - the probability of packet delivery through ith
where N; and X'(v) belong to ith link; Pv - vector of reduced (turned into additive form) probability of packet delivery with elements loga(p(v)); ®v - diagonal matrix with elements
f f P| (N + 1)P'N| +1
0(iv) = “T loga
(v)
1-
1 - Pi
1 N; +1
1 - PiNi 1
Pi
®min
(®max ®min)S
(8)
V J
Equation (7) can be interpreted as a projection of the following invariant (tensor) equation in the coordinate system (CS) of edges (type v)
link, ; = 1, n; (v) - mute index (indicates that the link belongs
R&I, 2012, №4
41
P = 0Л,
(9)
where P - univalent covariant tensor of the reduced probability of packet delivery; Л - univalent contravariant tensor of traffic intensity; 0 - divalent covariant tensor acting as a metric tensor.
Equation (9) can be written as
Note that circuit components kj(n) and p(n) from
subvectors Л n and Pn are related to circuits in a network. So
in order to eliminate loops in routes we must satisfy the next condition
Pn= 0. (13)
Л = XP, (10)
where X - divalent contravariant metric tensor, whose projection in the CS of edges is Xv = [©vj-1 .
Note that coordinate system of edges considers the network as a set of separated links, i.e. set of single edges.
Thus, probability tensor model of TCN can be reduced to an invariant tensor equation (9), where coordinates of the divalent covariant tensor 0 (8) in the CS of edges are functions of the discarding parameters (©min , ©max , 8 ), the size of buffer (©b), the capacities of the links (Qi), and the intensities of the traffic transmitted through the routers (k(v)).
III. FORMULATION OF CONDITION FOR ENSURING REQUIRED RELIABILITY OF SERVICE
In order to derive the condition for ensuring quality in terms of reliability we’ll use orthogonal representation of the tensor model of TCN (9) - (10) in CS of circuits and pairs of nodes. This CS considers the network as a set of circuits n and node pairs n , where total dimension of CS is equal to n . Then the projections of tensors of traffic intensity Л and the reduced probability of delivery P in this coordinate system can be represented by the following vectors:
k(n) k1 k (n)
Ли
Лп) — , Ли = k (П) , Лп = k (n)
Лп
n k(n) kC„)
(11)
( n) p1 (n) pi
Pn
P = n) Pn II К CL, ( n) pj II CL, (n) pj
p(n) p(n) p ф
(12)
where Л n), Pn) - n -dimensional vectors that are projections of tensors P and Л in CS of circuits and node pairs; Лп , Pn - ц -dimensional subvectors related to circuits in network, ( = n - m +1; m - number of nodes in the network; Лп , Pn - ф -dimensional subvectors related to node pairs in network, ф = m -1.
The components of sub vectors Лп and Pn show traffic
intensity and the reduced probability of delivery for different pairs of nodes in a network. Then according flow conservation
law for every transit nodes value kj must be zero:
Лп = |k(n) 0 ... Of, (14)
where k^ - traffic intensity between end points which form first pair of nodes.
In accordance with the second generalization postulate of G. Kron [9] tensor equations (9) and (10) have the same form in every the coordinate system, i.e. in CS of circuits and node pairs tensor equation (10) takes the form
Лпп = X nn Pnn , (15)
where Xn) - projection of tensor X in CS of circuits and node pairs.
According to laws of tensor calculus projections of tensors P , Л and X in the CS of circuits and node pairs (type nn) and in the CS of edges (type v) are related as follows
Pv = A Pnn , (16)
Лv = C Лпп , (17)
Xv = CXnnCt, (18)
Xnn= AtXvA. (19)
where A and C - matrices of co- and contravariant transformation of coordinates when transition from CS of circuits and node pairs to CS of edges.
Using (11) - (12) we can represent (15) in next form
Лп x П1) nn I X П2^ 1 П) Pn
Лп x n3n п) — + X ' 1 , 1 : ^ , (20)
42
R&I, 2012, №4
where
xW i x<2
х<3П i x<4
I лп
= х<л , хПП , X Щ - square
цхц and фхф submatrices, respectively; XП2 - p х ф submatrix, X - ф х p submatrix.
Then from (20) and according (13) we have
Л = X <4> P .
(21)
Further we will consider vectors Лп and Pn as
Лп =
© л (n) (n) p1
, Pn =
Л 1 pn i
n-1 П-1
where p(r|) - reduced probability
of traffic delivery between end points which form first pair of nodes. Then (21) can be turned into
where
л (n) Лп-1
X<4’1) 1 X
— + -
X<4’3> 1 X
X <4,1) | X <4,2R
Л^ I <Г|
X<4’3> i X<4’4>
ЛГ1 I ЛП
p(n)
P 1
П-1
(22)
= XП4 , X П4’1) - the first element
of the matrix X <П .
From (14) and (22) we obtain
y,„ = fX<;J) -X14,’2\x<4,’4>l-‘x<y> |p™. (23)
Elements k1^) and p(r|) are related to pair source-
destination and in general can include requirements for traffic intensity (rate) and the reduced probability of delivery
(reliability) for this pair, i.e. k1^) =^req^, p(r|) = pre^,
p<req) = l0§ a f1 - PIPLR ) , PIPLR - required value of IPLR.
Then finally we have the following inequality
x<req> >( X^ -х<4л’2 [ X^’^ ] 'x^ ) p^ (24)
IV. Example of the solution of the QoS- ensuring
PROBLEM WITH RATE AND RELIABILITY REQUIREMENTS
Let us make an example of solving QoS-ensuring problem with two required parameters (transmission rate and the probability of packet delivery) in environment of multipath routing and active queue management mechanism such as RED. The solving QoS-ensuring problem is related to traffic distribution under which given QoS-requirements will be satisfied. Fig. 1 shows example of network where capacity ф i
for every link is known (Table I). For given pair source-destination we will find set of routes such as total for traffic rate (intensity) from source to destination will be not less than
^req) = 535 1/s (in packets per second) and result loss will be
not more than p/PLr = 0,03 (p^re^ = log2(0,97)= -0,0439).
To simplify the problem, assume parameters of mechanism RED on all nodes are the same: © min = 5 and © = 40
II11I1 III ал
packets, 8 = 10, which correspond to the recommended parameters.
Numerical results that satisfy the condition (24) and given QoS-requirements are shown into Table I and in Fig. 2. According to the results for servicing traffic between nodes 1
(source) and 6 (destination) at given rate )SreqR and with given
IPLR pIPLRR we need use four paths that are shown in Fig. 1 and into Table II.
Fig. 1. Example of network structure and obtained set of paths
which is a formalization of the condition for ensuring the required quality of service between a given pair of recipients from reliability point of view. It is assumed that this condition can be placed into dynamic or static model of TCN for solving traffic control (engineering) problem in networks with guaranteed QoS.
Fig. 2. Result traffic distribution between links that satisfy given QoS-requirements. Values near every link show (top-down) capacity, traffic intensity and the probability of delivering through the link
R&I, 2012, №4
43
TABLE I
Result traffic distribution as solution of QoS-ensuring problem
Number of the link (edge) i Capacity of the link 9i, 1/s Traffic intensity in the link Z1(V) , 1/s Reduced probability of delivery log2(p(v)) Probability of delivery in the link p(v) Probability of loss in the link 1 - p(v)
1 445 401 -0,0116 0,9920 0,0080
2 282 265 -0,0268 0,9816 0,0184
3 432 381 -0,0055 0,9962 0,0038
4 147 134 -0,0155 0,9893 0,0107
5 292 270 -0,0195 0,9866 0,0134
6 172 154 -0,0089 0,9939 0,0061
7 155 136 -0,0039 0,9973 0,0027
8 133 116 -0,0034 0,9977 0,0023
TABLE II
Set of used routes and probability of delivery through its
Path Traffic intensity through path, 1/s Probability of delivery through path
(v1> v2> v3) -265 ( 0,992 ■ 0,9816 ■ 0,9962 )-0,97
> '■O > > > -136 ( 0,992 ■ 0,9866 ■ 0,9939 ■ 0,9973 )-0,97
> >" -18 ( 0,9893 ■ 0,9866 ■ 0,9939 )-0,97
CO > >" > -116 ( 0,9962 ■ 0,9893 ■ 0,9866 ■ 0,9977 )-0,97
Thus, the obtained solution, firstly, meets the specified rate and reliability (packet loss) requirements, and secondly, provides not only desired, but the same probability of delivery (loss) through all traffic routes.
V. Conclusion
Thus, the problem of traffic control with Qos-ensuring requires an adequate mathematical model of the telecommunication network that take into account the Qos requirements, on the one hand, and the structural and functional features of the TcN and characteristics of traffic, on the another hand. such contradictory requirements can be satisfied within tensor approach, which has been demonstrated in this paper. The obtained formalization of the condition for ensuring the required reliability of service in networks takes into account characteristics of traffic, the parameters of the active queue management mechanisms, the structural properties of the network and focuses on the multipath transmitting. The condition (24) was formulated from invariant tensor equations and has invariant form that doesn’t depend on AQM mechanism type. The parameters of AQM affect numerical values of the projections of the metric tensor, and doesn’t affect the form of the condition (24). This distinctive feature allows to apply the condition (24) in the network not only with RED, but with other mechanisms of active queue management.
References
[1] General overview of NGN, ITU-T Recommendation Y.2001, 12/2004.
[2] Kun I. Park, QoS in Packet Networks. Springer, 2004.
[3] Yanxing Zheng, Wenhua Dou, Jing Tian, Mingyan Xiao “An Overview of Research on QoS Routing” in Advanced Parallel Processing Technologies, Lecture Notes in Computer Science, vol. 2834, Zhou, X.; Jahnichen, S.; Xu, M.; Cao, J., Eds., Springer, 2003, pp 387-397
[4] R. Adams, “Active Queue Management: A Survey”, IEEE
Communications Surveys & Tutorials, vol. PP, issue 99, pp. 1 - 52, 2012.
[5] O. Lemeshko, O. Yevsyeyeva “Tensor geometrization of structural and functional representation of telecommunication system in the basis of interpoles paths and internal cuts”, Scientific notes of UNDIZ, n. 1 (13). pp. 14 - 26, 2010. (in Russian)
[6] O. Lemeshko “Tensor model of multipath routing of aggregated flows with reservation network resources, that is provided in a curvature space”, Transactions of UNDIRT, n. 4 (40), pp. 12 -18, 2004. (in Russian)
[7] A. V. Lemeshko, “Probabilistic-Temporal Model of QoS-Routing with Precomputation of Routes under the Terms of Non-Ideal Reliability of Telecommunication Network,” Telecommunications and Radio Engineering, vol. 66, issue 13, pp. 1151-1166.
[8] Network performance objectives for IP-based services, ITU-T Recommendation Y.1541, 05/2002.
[9] G. Kron, Tensors for Circuits. Dover Publ., New York, 1959.
[10] D. Gross, J. F. Shortle, J. M. Thompson, C. M. Harris, Fundamentals of Queueing Theory. John Wiley & Sons, 2008.
[11] O. Yevsyeyeva “Classification of spaces and bases used in the geometric description of the structure of telecommunication network”, Radiotekhnika, n. 159, pp. 14 - 19, 2009. (in Russian)
Olexandr V. Lemeshko received the Doctor of Technical Sciences degree in telecommunication systems and networks from Kharkov National University of Radioelectronics, Ukraine, in 2005. From 2005 he is professor of department of Telecommunication Systems in Kharkov National University of Radioelectronics, and assistant editor of the journal "Problems of Telecommunications". His research interest includes the optimization and quality of service in telecommunications. He is the coauthor of three books, author of more than 100 articles, and more than 10 inventions.
Oksana Yevsyeyeva received the Doctor of Technical Sciences degree in telecommunication systems and networks from Kharkov National University of Radioelectronics, Ukraine, in 2010. Currently she is professor of department of Telecommunication Systems in Kharkov National University of Radioelectronics. Her research interest includes the mathematical modeling and optimization in telecommunications. She is the coauthor of three books, author of more than 60 articles.
Sergey Garkusha received the PhD degree in telecommunication systems and networks in 2009. He is currently pursuing the DPhil degree in telecommunication systems and networks at Kharkov National University of Radioelectronics, Ukraine. His research interest includes the optimization and
quality of service in wireless telecommunications.
44
R&I, 2012, №4
