Towards Measuring Quality of Service in Untrusted Multi-Vendor Service Function Chains: Balancing Security and Resource Consumption

被引:0
|
作者
Vairam, Prasanna Karthik [1 ]
Mitra, Gargi [1 ]
Manoharan, Vignesh [1 ]
Rebeiro, Chester [1 ]
Ramamurthy, Byrav [2 ]
Kamakoti, V [1 ]
机构
[1] Indian Inst Technol Madras, Madras, Tamil Nadu, India
[2] Univ Nebraska, Lincoln, NE 68583 USA
来源
IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2019) | 2019年
关键词
D O I
10.1109/infocom.2019.8737487
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The IT infrastructure of large organizations consists of devices and software services purchased from multiple vendors. The problem of measuring the quality of service (QoS) of each of these vendor devices (and services) is challenging since the vendors may tamper with the measurements for monetary benefits or saving debugging efforts. Existing solutions for QoS measurement in trusted environments cannot be extended for this problem since the vendors can easily circumvent them. Solutions borrowed from other areas such as client-server QoS measurement do not help either since they incur unreasonable storage and network overheads, or require extensive modifications to the packet headers. In this paper, we propose the Measuring Tape scheme, comprised of (1) a novel data structure called evidence Bloom filter (e-BF) that can be deployed at the vendor devices (and services), and (2) unique querying techniques, which can be used by the administrator to query the e-BF to measure QoS. While e-BF uses storage and computational resources judiciously, the querying techniques ensure resilience to adversarial behavior. We evaluate our solution based on a few real-world and synthetic traces and with different adversaries. Our results highlight the trade-off between resources (i.e., storage and computation) and the accuracy of QoS predictions, as well as its implications on security. We also present an analytical model of e-BF that establishes the relationship between storage, prediction accuracy, and security. Further, we present security arguments to illustrate how our solution thwarts adversarial attempts to tamper QoS.
引用
收藏
页码:163 / 171
页数:9
相关论文
共 6 条
  • [1] Towards cost optimization in security-aware service function chaining and embedding over multi-vendor edge networks
    Wang, Chao
    Zheng, Danyang
    Liu, Xiaorong
    Tang, Wenyi
    Xu, Honghui
    Cao, Xiaojun
    COMPUTER NETWORKS, 2025, 257
  • [2] Provably efficient security-aware service function tree composing and embedding in multi-vendor networks
    Zheng, Danyang
    Xing, Huanlai
    Feng, Li
    Cao, Xiaojun
    COMPUTER NETWORKS, 2024, 254
  • [3] Resource consumption and security-aware multi-tenant service function chain deployment based on hypergraph matching
    Gao, Jing
    Feng, Lei
    Yu, Peng
    Zhou, Fanqin
    Wu, Zihao
    Qiu, Xuesong
    Li, Jingchun
    Zhu, Yifei
    COMPUTER NETWORKS, 2022, 216
  • [4] Service Function Chains multi-resource orchestration in Virtual Mobile Edge Computing
    Laroui, Mohammed
    Ibn Khedher, Hatem
    Moungla, Hassine
    Afifi, Hossam
    COMPUTER NETWORKS, 2023, 224
  • [5] Multi-Resource Scheduling for Multiple Service Function Chains with Deep Reinforcement Learning
    He, Rui
    Ren, Bangbang
    Xie, Junjie
    Guo, Deke
    Zhao, Laiping
    2022 IEEE 28TH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, ICPADS, 2022, : 665 - 672
  • [6] A reinforcement learning method for scheduling service function chains with multi-resource constraints
    He, Rui
    Ren, Bangbang
    Xie, Junjie
    Guo, Deke
    Zhou, Yuwen
    Zhao, Laiping
    Li, Yong
    COMPUTER NETWORKS, 2023, 235