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
相关论文
共 50 条
  • [21] The Cloud Service Agent Model based on Service Level Agreement
    Wang, Chunzhi
    Sun, Liang
    Chen, Hongwei
    2015 INTERNATIONAL CONFERENCE ON NETWORK AND INFORMATION SYSTEMS FOR COMPUTERS (ICNISC), 2015, : 282 - 285
  • [22] Autonomous service level agreement negotiation for service composition provision
    Yan, Jun
    Kowalczyk, Ryszard
    Lin, Jian
    Chhetri, Mohan B.
    Goh, Suk Keong
    Zhang, Jianying
    FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF GRID COMPUTING THEORY METHODS AND APPLICATIONS, 2007, 23 (06): : 748 - 759
  • [23] Energy-efficient cloud data center with fair service level agreement for green computing
    Yang, Ming-Jeng
    CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2021, 24 (04): : 3337 - 3349
  • [24] Energy-efficient cloud data center with fair service level agreement for green computing
    Ming-Jeng Yang
    Cluster Computing, 2021, 24 : 3337 - 3349
  • [25] An Efficient Lightweight Authentication and Key Agreement Protocol for Patient Privacy
    Seno, Seyed Amin Hosseini
    Nikooghadam, Mahdi
    Budiarto, Rahmat
    CMC-COMPUTERS MATERIALS & CONTINUA, 2021, 69 (03): : 3495 - 3512
  • [26] Service level agreement based energy-efficient resource management in cloud data centers
    Gao, Yongqiang
    Guan, Haibing
    Qi, Zhengwei
    Song, Tao
    Huan, Fei
    Liu, Liang
    COMPUTERS & ELECTRICAL ENGINEERING, 2014, 40 (05) : 1621 - 1633
  • [27] Service level provisioning agreement and in optical networks
    Fawaz, W
    Daheb, B
    Audouin, O
    Berde, B
    Vigoureux, M
    Du-Pond, M
    Pujolle, G
    IEEE COMMUNICATIONS MAGAZINE, 2004, 42 (01) : 36 - 43
  • [28] Service level agreement aware workflow scheduling
    Dyachuk, Drnytro
    Deters, Ralph
    2007 IEEE INTERNATIONAL CONFERENCE ON SERVICES COMPUTING, PROCEEDINGS, 2007, : 715 - +
  • [29] CM3:: Service Level Agreement
    Kajko-Mattsson, M
    Ahnlund, C
    Lundberg, E
    20TH IEEE INTERNATIONAL CONFERENCE ON SOFTWARE MAINTENANCE, PROCEEDINGS, 2004, : 432 - 436
  • [30] Dynamic Approach to Service Level Agreement Risk
    Kuusela, Pirkko
    Norros, Ilkka
    2013 9TH INTERNATIONAL CONFERENCE ON THE DESIGN OF RELIABLE COMMUNICATION NETWORKS (DRCN), 2013, : 266 - 273