Towards an efficient Service Level Agreement assessment
Document typeConference report
PublisherIEEE Computer Society Publications
Rights accessOpen Access
On-line end-to-end Service Level Agreement (SLA) monitoring is of key importance nowadays. For this purpose, past recent researches focused on measuring (when possible) or estimating (most of the times) network QoS or performance parameters. Up to now, attempts to provide accurate techniques for estimating such parameters have failed. In addition, live reporting of the estimated network status requires a huge amount of resources, and lead to unscalable systems. The originality of the contribution presented in this paper, relies on the statement that the accurate estimation of network QoS parameters is absolutely not required in most cases: specifically it is sufficient to be aware of service disruptions, i.e. when the QoS provided by the network collapses. For this purpose, we propose an algorithm for disruption detection of network services. The proposed solution is based on the use of the wellknown Kullback-Leibler Divergence algorithm. More specifically, we work on simple to measure time series, i.e. received interpacket arrival times. In addition of efficiently detecting network QoS disruptions, the algorithm, also drastically reduces the required resources, and the overhead produced by the traffic collection for scalable SLA monitoring systems. The validity of the proposal is verified both in terms of accuracy and consumed resources in a real testbed, using different traffic profiles.
CitationSerral, R. [et al.]. Towards an efficient Service Level Agreement assessment. A: IEEE Conference on Computer Communications (INFOCOM). "INFOCOM 2009 IEEE Proceedings. The 28th Conference on Computer Communications". Rio de Janeiro: IEEE Computer Society Publications, 2009, p. 2581-2585.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder