An efficient and lightweight method for Service Level Agreement assessment

被引:12
作者
Serral-Gracia, Rene [1 ]
Yannuzzi, Marcelo
Labit, Yann [2 ,3 ]
Owezarski, Philippe [3 ]
Masip-Bruin, Xavi
机构
[1] Tech Univ Catalonia UPC, Adv Network Architectures Lab CRAAX, Dept Comp Architecture, Catalonia, Spain
[2] Univ Toulouse UPS, F-31062 Toulouse, France
[3] CNRS, LAAS, F-31077 Toulouse, France
关键词
SLA assessment; Inter Packet Arrival Times; Hausdorff Distance;
D O I
10.1016/j.comnet.2010.06.005
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Traditional approaches to on-line end-to-end Service Level Agreement (SLA) assessment have focused on the estimation of network QoS parameters These approaches however face a trade-off between accuracy and the amount of resources needed to achieve such accuracy This paper offers an alternative approach where instead of estimating QoS parameters we propose an effective and lightweight solution for directly detecting SIA violations Our solution monitors the Inter-Packet Arrival Time (IPAT) at an end-point wherein current IPAT distributions are periodically compared with a set of reference IPAT distributions as the main basis for detecting SLA violations A mapping of the IPAT distribution with the current network conditions is derived and a training algorithm that dynamically acquires the set of reference IPAT distributions is designed For the comparison of the IPAT distributions we propose a variant of the Hausdorff Distance algorithm Our variant provides a better accuracy than the traditional Hausdorff Distance while presenting linear complexity Our proposal is validated in a real testbed by comparing the SLA violations detected and the resources required in terms of bandwidth with other existing alternatives as well as with perfect knowledge of current network QoS status (C) 2010 Elsevier BV All rights reserved
引用
收藏
页码:3144 / 3158
页数:15
相关论文
共 24 条
[1]  
Almes G., 1999, 2680 RFC
[2]  
[Anonymous], 1999, REQUEST FOR COMMENTS, DOI DOI 10.17487/RFC2679
[3]   A LINEAR TIME ALGORITHM FOR THE HAUSDORFF DISTANCE BETWEEN CONVEX POLYGONS [J].
ATALLAH, MJ .
INFORMATION PROCESSING LETTERS, 1983, 17 (04) :207-209
[4]   Comparing probe- and router-based packet-loss measurement [J].
Barford, P ;
Sommers, J .
IEEE INTERNET COMPUTING, 2004, 8 (05) :50-56
[5]  
Butlin RK., 1997, CAMBRIDGE SERIES STA, V671998
[6]  
Demichelis C., 2002, 3393 RFC
[7]  
GRACIA RS, 2009, THESIS U POLITECNICA
[8]  
GRACIA RS, 2008, IEEE NETW OP MAN S W, P124
[9]  
GRACIA RS, 2008, LNCS, V4982, P252
[10]  
GRACIA RS, 2008, P 4 INT TEL NETW WOR, P142