Energy saving strategy and Nash equilibrium of hybrid P2P networks

被引:10
|
作者
Ma, Zhanyou [1 ]
Zhang, Changzhen [1 ]
Zhang, Liyuan [2 ]
Wang, Shunzhi [1 ]
机构
[1] Yanshan Univ, Sch Sci, Qinhuangdao 066004, Hebei, Peoples R China
[2] Langfang Normal Univ, Sch Sci, Langfang 065000, Peoples R China
基金
中国国家自然科学基金;
关键词
Hybrid P2P network; Energy saving strategy; Nash equilibrium; Matrix geometric solution; REPUTATION MANAGEMENT; SYSTEM; QUEUE; BEHAVIOR; AWARE;
D O I
10.1016/j.jpdc.2021.06.009
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This paper proposes a penalty strategy with differentiated service rate based on the free riding phenomenon in P2P networks, and establishes an M/M/c+d queueing model. Based on this model, a sleep/wakeup mechanism is introduced for the peers at the service end, and a single asynchronous vacation strategy is adopted to reduce the energy consumption of the system. In addition, the energy consumption of peers in each state is quantified, and the relationship between the energy consumption and parameters of the system is analyzed. In order to avoid excessive requests for unnecessary services from requesting nodes and increasing energy consumption of the system, this paper analyzes the Nash equilibrium between the arrival rate and the net profit of a single node, and then studies the optimization of social profit. The stationary distribution of queueing model is obtained by the method of matrix geometric solution, the performance indicators of the system are constructed, and the system performance is analyzed by numerical experiments. Experimental results show that the model developed in this paper has a significant penalty effect on free riding behavior, and that the single asynchronous vacation strategy not only saves more than 10% of the total energy consumption compared with the single synchronous vacation strategy, but also makes the hybrid P2P networks more flexible and efficient. (C) 2021 Elsevier Inc. All rights reserved.
引用
收藏
页码:145 / 156
页数:12
相关论文
共 50 条
  • [1] The Nash Equilibrium of Peers in P2P Networks Based on Game Theory
    Chen, Hongwei
    Chen, Li
    Yu, Shengsheng
    [J]. 2ND INTERNATIONAL SYMPOSIUM ON COMPUTER NETWORK AND MULTIMEDIA TECHNOLOGY (CNMT 2010), VOLS 1 AND 2, 2010, : 545 - 548
  • [2] An energy saving approach: Understanding microservices as multidimensional entities in p2p networks
    Valera, Hernan Humberto Alvarez
    Dalmau, Marc
    Roose, Philippe
    Larracoechea, Jorge
    Herzog, Christina
    [J]. 36TH ANNUAL ACM SYMPOSIUM ON APPLIED COMPUTING, SAC 2021, 2021, : 69 - 78
  • [3] Randomized Search Strategy for Unstructured P2P Networks
    Chen, Wei-Mei
    Liu, Kuang-Chu
    [J]. IEICE TRANSACTIONS ON COMMUNICATIONS, 2012, E95B (01) : 289 - 292
  • [4] A hybrid searching scheme in unstructured P2P networks
    Li, Xiuqi
    Wu, Jie
    [J]. INTERNATIONAL JOURNAL OF PARALLEL EMERGENT AND DISTRIBUTED SYSTEMS, 2007, 22 (01) : 15 - 38
  • [5] A hybrid searching scheme in unstructured P2P networks
    Li, XQ
    Wu, J
    [J]. 2005 International Conference on Parallel Processsing, Proceedings, 2005, : 277 - 284
  • [6] Optimal server scheduling in hybrid P2P networks
    Zhang, Bo
    Borst, Sem C.
    Reiman, Martin I.
    [J]. PERFORMANCE EVALUATION, 2010, 67 (11) : 1259 - 1272
  • [7] HRS: A Hybrid Replication Strategy for Exhaustive P2P Search
    Chen, Hanhua
    Jin, Hai
    Lu, Xucheng
    Qin, Zhiguang
    [J]. NETWORK AND PARALLEL COMPUTING, 2008, 5245 : 173 - +
  • [8] OCTOPUS: A hybrid scheduling strategy for P2P VoD services
    Liao, Xiaofei
    Jin, Hai
    [J]. SIXTH INTERNATIONAL CONFERENCE ON GRID AND COOPERATIVE COMPUTING, PROCEEDINGS, 2007, : 26 - +
  • [9] Cooperative P2P Energy Trading in Active Distribution Networks: An MILP-Based Nash Bargaining Solution
    Zhong, Weifeng
    Xie, Shengli
    Xie, Kan
    Yang, Qiyu
    Xie, Lihua
    [J]. IEEE TRANSACTIONS ON SMART GRID, 2021, 12 (02) : 1264 - 1276
  • [10] HYPHEN - A file replication strategy analyzer on P2P networks
    Islam, MA
    Yasin, MM
    [J]. CIC '04: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON COMMUNICATIONS IN COMPUTING, 2004, : 403 - 407