PETA: Privacy Enabled Task Allocation

被引:1
|
作者
Phuke, Nitin [1 ]
Saurabh, Saket [1 ]
Gharote, Mangesh [1 ]
Lodha, Sachin [1 ]
机构
[1] Tata Consultancy Serv, TCS Res, Pune, Maharashtra, India
关键词
Task Allocation; Data Privacy; Workforce Optimization; Service Organization; Integer Linear Programming; Feasibility Pump;
D O I
10.1109/SCC49832.2020.00037
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Service organizations need to comply with numerous data regulations to protect and preserve their customers' privacy. Any misuse of data and privacy breach can affect the organizations' reputation and brand image. In service delivery scenarios, such as IT support help desk, agents need to access customer data to serve them effectively. This data often includes sensitive and personally identifiable information of the customer. While some amount of data exposure is needed to serve a customer, however, exposure to more data than required could be a threat to an individual's privacy. Hence, organizations need to design methodologies to ensure customer privacy while achieving minimal cost of operations. In this paper, we propose the Privacy Enabled Task Allocation (PETA) model for assigning customer requests to agents so that the overall cost of operations and data exposure is minimal. Data exposure is minimized by restricting the amount of data exposure per agent and by regulating the assignment of tasks. The PETA problem is modelled as an integer linear program, which is NP-hard. To solve this combinatorial hard problem, we have designed an allocation algorithm based on the linear programming relaxation for finding a quick feasible solution.
引用
收藏
页码:226 / 233
页数:8
相关论文
共 50 条
  • [41] Attribute-Aware Task Allocation and Privacy-Preserving Coordination Mechanism for MCS
    Yang P.
    Wu Q.
    Huanan Ligong Daxue Xuebao/Journal of South China University of Technology (Natural Science), 2020, 48 (08): : 38 - 48
  • [42] Privacy-Aware Task Allocation Based on Deep Reinforcement Learning for Mobile Crowdsensing
    Yang, Mingchuan
    Zhu, Jinghua
    Xi, Heran
    Yang, Yue
    WIRELESS ALGORITHMS, SYSTEMS, AND APPLICATIONS, PT III, 2022, 13473 : 191 - 201
  • [43] Deep Reinforcement Learning for Task Allocation in UAV-enabled Mobile Edge Computing
    Yu, Changliang
    Du, Wei
    Ren, Fan
    Zhao, Nan
    ADVANCES IN INTELLIGENT NETWORKING AND COLLABORATIVE SYSTEMS (INCOS-2021), 2022, 312 : 225 - 232
  • [44] Accurate and Privacy-Preserving Task Allocation for Edge Computing Assisted Mobile Crowdsensing
    Wang, Zhihua
    Guo, Chaoqi
    Liu, Jiahao
    Zhang, Jiamin
    Wang, Yongjian
    Luo, Jingtang
    Yang, Xiaolong
    IEEE TRANSACTIONS ON COMPUTATIONAL SOCIAL SYSTEMS, 2022, 9 (01) : 120 - 133
  • [45] Joint Task Offloading and Resource Allocation in UAV-Enabled Mobile Edge Computing
    Yu, Zhe
    Gong, Yanmin
    Gong, Shimin
    Guo, Yuanxiong
    IEEE INTERNET OF THINGS JOURNAL, 2020, 7 (04) : 3147 - 3159
  • [46] Privacy-preserving task allocation for edge computing-based mobile crowdsensing
    Ding, Xuyang
    Lv, Ruizhao
    Pang, Xiaoyi
    Hu, Jiahui
    Wang, Zhibo
    Yang, Xu
    Li, Xiong
    COMPUTERS & ELECTRICAL ENGINEERING, 2022, 97
  • [47] Dynamic Resource Allocation and Task Offloading for NOMA-Enabled IoT Services in MEC
    Xing, Hua
    Xu, Jiajie
    Hu, Jintao
    Chen, Ying
    Huang, Jiwei
    SECURITY AND COMMUNICATION NETWORKS, 2022, 2022
  • [48] Online quality-based privacy-preserving task allocation in mobile crowdsensing ☆
    Chen, Zhenping
    Xu, Miaomiao
    Su, Chunxia
    COMPUTER NETWORKS, 2024, 251
  • [49] Overbooking-Enabled Task Scheduling and Resource Allocation in Mobile Edge Computing Environments
    Gao, Jixun
    Hu, Bingyi
    Liu, Jialei
    Wang, Huaichen
    Huang, Quanzhen
    Zhao, Yuanyuan
    INTELLIGENT AUTOMATION AND SOFT COMPUTING, 2023, 37 (01): : 1 - 16
  • [50] A novel blockchain enabled resource allocation and task offloading strategy in cloud computing environment
    Senthilkumar, G.
    Madhusudhan, K. N.
    Jeyasheela, Y.
    Ajitha, P.
    AUTOMATIKA, 2024, 65 (03) : 973 - 982