Subscribe Now Subscribe Today
Research Article

Continuous Monitoring System for Estimation the Quality of Service of Computer Network

Vladimir Sayenko, Mohammad Al Rawajbeh and Alexandr Golubev
Facebook Twitter Digg Reddit Linkedin StumbleUpon E-mail

The aim of this study is to develop a method for evaluation of service quality estimations in continuous monitoring system for computer networks. The computer network is considered as dynamic system with service functionality objects. We proposed the composed concept of quality of service evaluation in conditions of continuous monitoring process. It is suggested to reduce the services state estimation to the forming of qualitative estimates of a state and calculating a trend of these estimates values. Practical significance consists in rising of networks controllability and decreasing its exploitation cost by the possibility of the service quality analysis, forecasting its changes, which allows making the appropriate control decision. The method is based on consideration the service as the functional network object describable with the set of service state indexes, which are varying in time. Quality if service is also determined by the set of these indexes and also varies in time. The suggested method allows us to estimate the service by its quality in the current time and by the forecasted quality for the next two times taking in account given values of thresholds. It is also proposed to evaluate service quality indices as quantity on time and prediction estimations. Correctness of the solutions is proved by examples.

Related Articles in ASCI
Similar Articles in this Journal
Search in Google Scholar
View Citation
Report Citation

  How to cite this article:

Vladimir Sayenko, Mohammad Al Rawajbeh and Alexandr Golubev, 2010. Continuous Monitoring System for Estimation the Quality of Service of Computer Network. Journal of Applied Sciences, 10: 2034-2040.

DOI: 10.3923/jas.2010.2034.2040

Received: April 18, 2010; Accepted: June 10, 2010; Published: July 05, 2010


Computer networks become inalienable part of any enterprise infrastructure today. The complexity level of computer network rises and in the same time the issues of more effective using of available information resources become up-to-date too. Information resources are inseparable from information services which provide the access to the resources (Sommers and Barford, 2004). Together with the computer network complexity the number of supported services increases and the current resource load rises (Broun et al., 2008). The most part of the computer networks works in the condition of tight resources that is why the problems of the estimation of supported services quality become particularly urgent. In the technical sources these problems are known as the QoS (Quality of Service) estimation.

For any computer network the problem of the selective (one-time) QoS estimation can be well-formalized and solved, e.g., in (Al Rawajbeh et al., 2009). In this case we obtain static estimation and an object, i.e., computer network, is considered as a static one (dynamic characteristics are not taken into account (Lu et al., 2009).

In the situation when the computer network is considered as a dynamic system, the problem of the QoS estimation becomes much more complicated (Schubert and Boche, 2005; Abouaissa, 2009). The fact is that a station of the dynamic system must be described with some continuous function and therefore a QoS index must be described with a continuous function or estimated with some discrete dimension intervals.

This problem is not new and there are different solutions for different classes of systems (e.g., Shiping and Greemfield, 2004) analyze the quality evaluation method of Java messages service in terms of dynamic changes o f a computer network status. Lee et al. (1999) described the methods of forming the quality factor for dynamic evaluation, with that it is supposed to consider latencies and rejects in the network as unique parameters determining quality (Liu et al., 2004). An interesting solution is described by Sayenko et al. (2005). It is dedicated to estimation of several services used for providing the best local resource use conditions of the network. Nevertheless, questions related to generalize formalization of the quality estimation methods still remain unstudied. In particular to provide QoS and manage it is quite difficult task. Therefore, it is a big challenge but it is very necessary to give affordable solution (Shirahase et al., 1999). In Clark and Gilmore (2006) and Curtis and McGregor (2001) concerned with the quantitative core of an SLA (Service Level Agreement) and consider parallel structures and approaches to calculate the QoS estimations.

This study is a continuation of the article (Al Rawajbeh et al., 2009) which describes a method of the quality estimation of information services in a computer network. The method is determined as a static object. It provides a generalized estimator by comparing several quality indexes.

The purpose of the article comes to searching ways to estimate network services in a dynamic change of basic characteristics of a network.

Problem formulation describes the network as an object of research. Also the concept of the service quality estimation is described. In the paragraph Computation of the service quality index the summary of the method (Al Rawajbeh et al., 2009) is given. Then the choice of weights and the formation of the qualitative estimators, finding and estimating of trend are described. There is also a description of the method of service state estimation in the article as a generalization and systematization of the preceding paragraphs. After a brief analysis of the method we give an example. Finally the main scientific and practical results are formalized.


Let us assume that a computer network Net is given. There are some users in the network U = {ui}, i = 1..p. Services supported by the network are its main functional units Stype = {stypej} j = 1..p. Users request the network about granting a certain type of a service. When the request is satisfied, the network creates an instance of service si,j, where i is a user of a service, j is a type of a service. The quality index QoS (si,j) can define this service si,j. Hereafter, we propose to suppress indexes for service instances, assuming that any instance is defined by a service type and a user: for ∀si,j ∃ui ∈ Uu ∃stypej ∈ SType, that is why let us calling si,j just s.

In most cases the quality of users' service is determined in the specific Service Level Agreement and is given as a delimitation of observable parameter, e.g., d≤d0. Access latency to a resource d should not be superior to some threshold value d0. While the network is active the access latency value is a function (Fig. 1). Therefore, values of the quality index also change in time.

Fig. 1: Change of time latency in using some service

Thus, to evaluate characteristics of the service quality is necessary to answer questions, which determine the estimation method. Some of them are:

How to estimate the quality index? Obviously it must be a discrete estimation in the real conditions
At what intervals should we estimate it?
What is considered as a point index? Should it be multiple or averaged value?
What to do with values accumulated in time?
What to do with obtained number results? How to estimate them?

Modern technologies for system status scanning suppose special systems of continuous network monitoring. In the context of building of such systems a solution for the service status evaluation is proposed.

So the problem formulation amounts to the development of methods for system status estimating in systems of continuous network monitoring. Basically it is supposed to use the method proposed by Al Rawajbeh et al. (2009).

Concept of service quality estimation in the computer network: The quality index QoS(s) is considered on basis of certain state parameters [qii]. These parameters obtain definite values at every instant. Every index reflexes some feature of the network.


where, i is a sequence number of service s state index, n is a number of state indexes, QoS(s) the quality index, non-dimensional quantitative value.

For every service type stypei (and in general case for a user, i.e., an element s) delimitations, e.g., threshold values, are set. QoSa(s) = (q1a, q2a,..., qna), QoSb(s) = (qib), i = 1..n lower and higher boundaries of the state indexes. Required values of the state indexes QoSo(s) = (qio), i = 1..n are set in accordance with SLA for each user. In addition the relation QoSa(s)≤QoSo(s)≤QoSb(s) is fulfilled.

Fig. 2: Relation between quality service index and threshold estimations

Permitted deviations of required indexes are defined as ΔqoS(s) = (ΔΔi).

A relation between computational estimation QoS(s, t) and threshold estimations is depicted on the Fig. 2.

The estimation of QoS(s, t) is carried out discretely, with a specified discrimination interval and subsequent interpolation (preferably linear).

The choice of the discrimination interval is performed depending on the task of monitoring (maximum loads monitoring, standard monitoring, monitoring of configuration changes result).

As point values we take QoS(s, t) = QoS(s[tk]), where, [tk] is a discrete point of measurement, we choose some averaged value QoS(s[tk]). With that:


The index QoS(s,[tk]), accumulated in the process of state parameters measuring, is maintained only during some history, which is determined by a task type and taking into account the effect of information aging.

Bearing in mind that a problem of the index value control is up-to-date in the systems of continuous monitoring, we propose to use qualitative values instead of numerical values of the quality index. In addition we put a new scale for estimation of the quality index.

We propose to use the numerical values of the quality indexes to form an estimation of a process behavior trend QoS(s, tk), in view of the information aging for the set of history of discrete values QoS(s,[tk]).

The main requirements to the method of service quality estimation are:

Non-resource-intensiveness, for on-line computation performing
Interpretability, visualization

Computation of the service quality index: The service quality index QoS(s) is a non-dimensional quantitative value, calculated on the basis of predefined indices of a process observed and its characteristics. As a basis we take the method proposed by Al Rawajbeh et al. (2009).

QoS(s) = f(q1, q2,..., qn) is correct. We use the weighted sum of normalized state estimations as the function f(), then:



The index (Eq. 3) is considered on the interval of rated values [qia, qib], specified for the network and the index qi. Values should be homogeneous to give us the possibility to use the Eq. 3.

Homogeneity is considered in terms that should be defined on the interval [0, 1] and for every the relation: →opt~→max, must be fulfilled, i.e., an optimal value for the index can be found only when it increases. We use the operation of normalization and rate setting in order to ensure homogeneity of all the state indexes. The constraint → max provides the normalization and the generation (qi∈ [-∞, ∞])→(∈ [0, 1]) provides the rate setting. Normalized and rated estimation results from the generation:


Forming and choice of the weight numbers: Weight numbers make it possible to increase or lessen the influence of any factor on the value of generalized estimation. Usually the weight number wi is set on the interval wi ∈ [0, 1] that is why it is interpreted as the coefficient of reduction for some factor. In such a case the following formula is used in Eq. 3.

In general cases the number can be set in integers in any rank scale. If so we can use such a transformation formula:

where, w'i is any rank, w'min are boundary values of the evaluation scale we use for rank evaluation.

Such an approach allows the administrator to use more flexible rules of displaying the value of any index to evaluate the state of the service.

Forming of qualitative evaluation: According to the Eq. 3 we get the value of quality index for QoS(s) in current time. When in the system of current monitoring this value conveys nothing and what is more the stored values remain unused. Instead it is better to use the value Q1(s), which reflects the relative state of service in current moment of time with reference to boundary values. To calculate the comparative value we use the boundary values according to the specifications for the index qi-{qia, qib, qio Δqi}.

In general case it is impossible to set the QoS specifications in advance because of the low interpretability of this parameter. In the same time we can concretely and accurately set the same specifications for qi index. But if we need qualitative evaluations for QoS(s) index we should take relative values QoS(s) instead of absolute qi values.

Considering the limitations of qi let us calculate the corresponding values for QoS(s), that is QoSa(s) = 0 the lowest operating limit, QoSb(s) = 1 the highest operating limit. The term operating means that QoSa(s), QoSa(s) are set in such a conditions that any qi changes within the acceptable range [qia, qib].

It is important to mark that when we use the method of continuous monitoring, the value QoS(s) may be greater than 1 and lesser than 0. In the course of functioning of the system the values of qi may exceed the range of [qia, qib] and than QoS(s) can be either QoS(s)<0 or QoS(s)>1.

That is why it is considered that the system is in the state of relatively normal functioning if the following constraints are performed:



The Eq. 6 is more strict than the Eq. 5.

The system should function in such a way that SLA demands are fulfilled. Than we can calculate the next two values that correspond to the required range of value. Thus, we have (qio) and (ΔΔi), so QoSc(s) and QoSd(s) correspondingly the highest and the lowest boundaries will be acquired as:




1, if qi→opt~qi→max
-1, if qi→opt~qi→max
G = (gi); gi = {}

Fig. 3: The correlation of limitations and service state measure

Table 1: Qualitative estimates of a service state



The correlation of threshold indexes of state with varying in time measure of state is shown on Fig. 3.

Qualitative estimates are suggested to be formed on the ground of some scale (Table 1). The following values of the estimation are acceptable:

Trend estimation: All the previous results have covered derivation of pointed estimates and did not take into account dynamics of the process. It is quite enough for solution of the current monitoring tasks for QoS(s). Using of QoS(s, [tk]) the cumulative results over some interval [To, Tn] allows forecasting of current values and estimating a trend of the process. The general purpose of such operation consists in more exact estimation of the current situation. In this case, it is suggested to forecast by two steps forward. We use a linear regression which is built on the ground of least-squares method to calculate the forecasting estimates on the dataset (history) with length r = 5. Quantity r = 5 is accepted as axiomatically correct for QoS calculation processes.

Table 2: Qualitative estimates of a forecasting state

The point is that dataset with length r≤3 is not initially representative, but with r = 10 it is excessive big as there is an actual amount for QoS values in the interval [tk-2, tk+1] on the subset {tk-2, tk-1, tk, tk+1}.

By this means for the estimation of service Q(s) state we add the estimation of the state of a forecasting measure of quality Q2(s) (Table 2). QoS'(s) = QoS(s, [tk+2]) current moment of time tk. Estimate possesses three states:


The estimation method will be presented as a list of operations:

Choosing an observable service si,j of a definite type stypej, for some user si,j
Determining a vector (q1, q2,..., qn) of state measures for chosen instance of a service si,j
Defining a new significance weighting coefficient wi for each measure
Performing the operations of fixing and normalizing in conformity with Eq. 4
Calculating a quality measure QoS(s) Eq. 3
Determining quality measures for thresholds Eq. 7-10 and form the conditions for quality estimate Q1(s) receiving subject to threshold requirements
Calculating an estimate of forecasting state Q2(s)
Determining a final state of the system in a functional form Q(s) = (Q1(s, [tk]), Q2(s, [tk]))

Analysis of method: The described method possesses the following characteristics:

Operability of calculation, not resource-intensively it is attained by a small number of analyzable values
Possibility of a threshold specifying-minimal and maximal acceptable measures of quality given by a set of state measures are taken into account in this method
Possibility of operating with the different types of indexes to form a complex estimation. Quality index is calculated from a set of parameters conditioning quality of service by Al Rawajbeh et al. (2009)
Possibility of changing the influence of different service parameters on final estimation. Indexes weights can vary with priorities variations
SLA requirements accounting
Possibility of forecasting an index by two steps forward
Possibility of the service state detection (whether it is enhancing or impairing)
Good interpretability (possibility to present graphics or estimation scales on the method’s operation results)


Service s is a TCP service. Program application is an IP Telephony application stype=<TCP,IP phone>.

State indexes are defined as QoS(s) = (qi) = (b, d), where, b is a data transferring rate in kbps; dis a latency (time interval between sending and receiving data in msec) Table 3.

There are indexes measured for time tk, where, k = 1..5. The current time is tk, k = 5.

There are threshold values of state indexes, QoS optimal state indexes and acceptable variation of state indexes given:

We have to estimate a service state by determining the quality in the current time k = 5, determine a trend and also estimate the forecasted value.

Let’s intake the weight coefficients on the ground of an expert estimation on the interval [0, 1]: W = (0,2;0,8).

Let’s represent Eq. 2 as a matrix with given values, then norm and normalize state indexes Eq. 4.

Meanwhile number of columns equals to number of state indexes Eq. 2 and number of rows equals to length of a values changing history Eq. 5:

Table 3: Values of data transferring rate and si Latency for service in times tk

Fig. 4: Correlation of thresholds, approximating function and quality indexes values

Calculating quality index by (3): QõS(s) = QõS(s, [t5]) = 0,58

Determining quality indexes for thresholds: QoSa(s) = 0, QoSb(s) = 1, q1c = 140 kbps; q2c = 70 m sec.

q1d = 160 kbps; q2d = 40 m sec by Eq. 8 meanwhile G = (1,-1). Calculating quality indexes for required quality thresholds: QoSc(s) = 0.56 by Eq. 9, QoSc(s) = 0.7 by Eq. 10.

Determining quality estimation in consideration of threshold requirements: according to Table 1 the condition 0<QoS(s)<QoSc(s) holds, which corresponds to Q1(s)=<normal> estimate.

Let’s calculate forecasting state value by determining numerical values of quality indexes for times tk, where, k = 1..5: QõS(s, [tk]) - (0.9; 0.88; 0.85; 0.76; 0.58).

Determining the process trend for suggested technique of estimation. Use a linear regression y = mx+b to obtain QoS(s, [tk]) values for points [k+1] and [k+2]. m and b coefficients are determined on the ground of dataset with length r = 5 by least-squares method: m = -0.08; b =1.03. Meanwhile linear function takes on form y = -0.8x+1.03. The correlation between QoS(s, [tk]) values, regression function values and thresholds is presented on Fig. 4.

According to the Table 2 obtaining Q2(s)=<bad>, as the condition 0<QoS'<QoSc(s) holds.

Thus the system state for a point of current monitoring estimates as Q(s) = Q1(s, [tk]), Q2(s, [tk]) = = (<normal>, <bad>). The summary is that the system requires the control action to avoid further quality deterioration.


There is a service state estimation method within the bounds of continuous monitoring systems creation and development suggested. Service is considered as the functional network object describable with the set of service state indexes, which are varying in time. Quality if service is also determined by the set of these indexes and also varies in time. The suggested method allows us to estimate the service by its quality in the current time and by the forecasted quality for the next two times taking in account given values of thresholds..

The scientific novelty: It consists in the further development of service state estimation method. It is suggested to reduce the services state estimation to the forming of qualitative estimates of a state and calculating a trend of these estimates values.

Practical significance: It consists in rising of networks controllability and decreasing its exploitation cost by the possibility of the service quality analysis, forecasting its changes, which allows making the appropriate control decision.

Comparing with the best analogs: The given work can be regarded as the further development of the ideas stated by Al Rawajbeh et al. (2009), which allows us to determine the dynamic changes in quality of service. Unlike the works (where estimation is performed only for specified service types (Shiping and Greemfield, 2004) or on the ground of previously defined service state parameters (Lee et al., 1999), this method suggests a generalized formal apparatus for the estimation of services quality. The results can be used together with the methods (Sayenko et al., 2005) for the estimation and control of quality provided.

Directions of further research: The further work will be directed to determining of policy rules influence on services quality (under specified quality requirements) methods creation.

Abouaissa, H., 2009. An algebraic framework for traffic state estimation. Int. J. Innovative Comput. Inform. Control, 5: 2499-2510.
Direct Link  |  

Al Rawajbeh, M., V. Sayenko and A. Golubev, 2009. Simple method for services quality estimation in computer network. Research Journal of Aleppo University, Engineering Science Series No 67.

Broun, T., M. Diaz, J. Enriquez-Gabeiras and T. Staub, 2008. End-to-End Quality of Service Over Heterogeneous Network. Springer-Verlag, Berlin and Heidelberg, pp: 277.

Clark, A. and S. Gilmore, 2006. Evaluating Quality of Service for Service Level Agreements. In: Formal Methods: Applications and Technology, Brim, L. and M. Leucker (Eds.). Springer-Verlag, Berlin Heldeberg, pp: 181-194.

Curtis, J. and T. McGregor, 2001. Review of bandwidth estimation techniques. Proceedings of the New Zealand Computer Science Research Students' Conference, Volume 8, April 2001, University of Canterbury, New Zealand, pp: 172-174.

Lee, C., J. Lehoezky, R. Rajkumar and D. Siewiorek, 1999. On quality of service optimization with discrete QoS options. Proceedings of the 5th IEEE Real-Time Technology and Applications Symposium, June 02-04, Vancouver, British Columbia, Canada pp: 276-276.

Liu, Y., A.H. Ngu and L.Z. Zeng, 2004. QoS computation and policing in dynamic web service selection. Proceedings of the 13th International World Wide Web Conference on Alternate Track Papers and Posters, May 17-22, 2004, New York, USA., pp: 66-73.

Lu, E.H.C., C.W. Huang and V.S. Tseng, 2009. Continuous fastest path planning in road networks by mining real-time traffic event information. ICIC Express Lett., 3: 969-974.

Sayenko, V., A.L. M. Rawajbeh and V. Levikin, 2005. The E-space and models of the services. Proceedings of the iNEER Conference for Engineering Education and Research, (ICEER'05), Taipei, Taiwan, pp: 41-41.

Schubert, M. and H. Boche, 2005. QoS-based resource allocation and transceiver optimization.optimization. Commun. Inform. Theory, 2: 383-529.
Direct Link  |  

Shiping, C. and P. Greemfield, 2004. QoS evaluation of JMS: An empirical approach. Proceedings of the 37th Annual Hawaii International Conference on System Sciences Track 9, Jan. 05-08, Big Island, Hawaii, pp: 90276.2-90276.2.

Shirahase, A., M. Hashmani, M. Yoshida, K. Nagami and Y. Atarashi et al., 1999. Design and deployment of QoS enabled network for contents businesses. Proceedings of the International Conference on Computer Communication, Sept. 14-16, Tokyo, Japan, pp: 1-8.

Sommers, J. and P. Barford, 2004. Self-configuring network traffic generation. Proceedings of the 4th ACM SIGCOMM Conference on Internet Measurement, October 25-27, 2004, New York, USA., pp: 68-81.

©  2020 Science Alert. All Rights Reserved