Preference based multi-issue negotiation algorithm (PMINA) for fog resource allocation

被引:1
|
作者
Malukani, Shaifali [1 ]
Bhensdadia, C. K. [1 ]
机构
[1] Dharmsinh Desai Univ, Dept Comp Engn, Nadiad 387001, Gujarat, India
关键词
Fog computing; Multi-issue negotiation; Preference; QoS attributes; SLA; Price; Availability; Concession; Trade-off; MECHANISM;
D O I
10.1007/s00607-024-01271-4
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Fog computing has emerged as a decentralized computing paradigm that extends cloud services to the network edge, enabling faster data processing and real-time applications. The increasing popularity of fog computing has led to the emergence of a potential market involving users and providers of fog resources. However, both parties are driven by self-interest and seek to maximize their utility, giving rise to multiple conflicts extending beyond mere price considerations. Negotiations can play a crucial role in resolving conflicts and establishing mutually beneficial service level agreements. Moreover, in the heterogeneous fog environment, quality of service attributes, such as throughput, delay, trust, power dissipation, etc., vary significantly among different user-fog associations. These attributes, although non-negotiable, hold great importance for entities and directly influence partner selection. Entities may exhibit a preference for one another based on these non-negotiable attributes. To the best of our knowledge, no existing literature specifically addresses the issue of associating with a preferred trading partner at a negotiated value for multiple issues in the fog environment. This research aims to address this gap and provide insights into this unexplored area. This work presents a novel Preference-based Muti-Issue Negotiation Algorithm, PMINA, for many to many, bilateral and concurrent negotiations in the fog environment. The results confirm the significance of PMINA, demonstrating a substantial enhancement in user and fog utilities.
引用
收藏
页码:1633 / 1657
页数:25
相关论文
共 50 条
  • [31] Pareto Bid Estimation for Multi-Issue Bilateral Negotiation under User Preference Uncertainty
    Bagga, Pallavi
    Paoletti, Nicola
    Stathis, Kostas
    IEEE CIS INTERNATIONAL CONFERENCE ON FUZZY SYSTEMS 2021 (FUZZ-IEEE), 2021,
  • [32] Multi-issue negotiation with deep reinforcement learning
    Chang, Ho-Chun Herbert
    KNOWLEDGE-BASED SYSTEMS, 2021, 211
  • [33] Persuasive multi-agent multi-issue negotiation
    Yang, Pei
    Gao, Yang
    Chen, Zhaoqian
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2006, 43 (07): : 1149 - 1154
  • [34] Acquisition of a concession strategy in multi-issue negotiation
    Yasumura, Yoshiaki
    Kamiryo, Takahiko
    Yoshikawa, Shohei
    Uehara, Kuniaki
    Web Intelligence and Agent Systems, 2009, 7 (02): : 161 - 171
  • [35] A Study on Multi-issue Negotiation with Incomplete Information
    Huang, Wei-Wei
    Liu, Alan
    Wang, Chih-Chun
    2014 CACS INTERNATIONAL AUTOMATIC CONTROL CONFERENCE (CACS 2014), 2014, : 243 - 248
  • [36] A Meta-strategy for Multi-issue Negotiation
    Tawil, Safeyah
    Mansour, Khalid
    Al-Lahham, Yaser
    2019 INTERNATIONAL ARAB CONFERENCE ON INFORMATION TECHNOLOGY (ACIT), 2019, : 81 - 86
  • [37] Double Learning Algorithm in Bilateral Multi-Issue Negotiation under Incomplete Information
    曹元大
    李剑
    Journal of Beijing Institute of Technology(English Edition), 2003, (English Edition) : 100 - 103
  • [38] Accelerating chaos evolution algorithm of bilateral multi-issue automated negotiation in MAS
    School of Computer Science and Technology, Yantai University, Yantai 264005, China
    Jisuanji Yanjiu yu Fazhan, 2006, 6 (1104-1108):
  • [39] Research on Multi-Lateral Multi-Issue Negotiation Based on Hybrid Genetic Algorithm in E-Commerce
    Song, Qiang
    Zhang, Han
    2010 2ND IEEE INTERNATIONAL CONFERENCE ON INFORMATION AND FINANCIAL ENGINEERING (ICIFE), 2010, : 706 - 709
  • [40] Double Learning Algorithm in Bilateral Multi-Issue Negotiation under Incomplete Information
    曹元大
    李剑
    Journal of Beijing Institute of Technology, 2003, (S1) : 100 - 103