Study on trust-based maintenance of overlays in structured P2P systems

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

Structured peer-to-peer overlay maintenance mechanisms require efficient methods to find stale routing table entries and replace them with new entries in a way that retains the desired routing behavior. Futhermore, overlay maintenance algorithms require to be devised to handle peer churn, the continuous process of node arrival and departure. Existing strategies of selecting new entries for routing tables are usually based on logical identifiers or proximity. Non-trust neighborhood selection criterion is used. Over the past decade, a respectable number of e-commerce companies, such as Amazon, eBay, and NetFlix, have deployed trust in ranking their products and suppliers. Such rankings are capitalized as effective incentives and low-cost mechanisms, letting e-commerce companies enhance product marketing and sales management. Since the use of trust has brought many benefits to e-commerce companies, we propose to introduce trust to structured P2P overlay maintenance. In this paper, we propose a trust-based maintenance strategy, using quantified "trust" as the judge criterion for neighbor selection and next-hop selection during routing, considering different aspects of trust in common structured P2P systems. The simulation results show that our maintenance strategy, applying to Chord, leads to lower maintenance overhead, while the mean hops of queries are slightly increased but remain O(logN), where N denotes the network size, compared with original Chord.

Original languageEnglish
Title of host publication2011 International Conference on Computational Problem-Solving, ICCP 2011
Pages598-603
Number of pages6
DOIs
Publication statusPublished - 2011
Event2011 International Conference on Computational Problem-Solving, ICCP 2011 - Chengdu
Duration: 2011 Oct 212011 Oct 23

Other

Other2011 International Conference on Computational Problem-Solving, ICCP 2011
CityChengdu
Period11/10/2111/10/23

Fingerprint

Pavement overlays
P2P Systems
Overlay
Maintenance
Routing
Electronic Commerce
Chord or secant line
Ranking
Industry
Peer to Peer
Incentives
Proximity
Tables
Marketing
Table
Sales
Query
Denote
Vertex of a graph
Strategy

Keywords

  • Chord
  • churn
  • maintenance
  • PlP
  • trust

ASJC Scopus subject areas

  • Computational Mathematics

Cite this

Ding, X., & Koyanagi, K. (2011). Study on trust-based maintenance of overlays in structured P2P systems. In 2011 International Conference on Computational Problem-Solving, ICCP 2011 (pp. 598-603). [6089940] https://doi.org/10.1109/ICCPS.2011.6089940

Study on trust-based maintenance of overlays in structured P2P systems. / Ding, Xin; Koyanagi, Keiichi.

2011 International Conference on Computational Problem-Solving, ICCP 2011. 2011. p. 598-603 6089940.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Ding, X & Koyanagi, K 2011, Study on trust-based maintenance of overlays in structured P2P systems. in 2011 International Conference on Computational Problem-Solving, ICCP 2011., 6089940, pp. 598-603, 2011 International Conference on Computational Problem-Solving, ICCP 2011, Chengdu, 11/10/21. https://doi.org/10.1109/ICCPS.2011.6089940
Ding X, Koyanagi K. Study on trust-based maintenance of overlays in structured P2P systems. In 2011 International Conference on Computational Problem-Solving, ICCP 2011. 2011. p. 598-603. 6089940 https://doi.org/10.1109/ICCPS.2011.6089940
Ding, Xin ; Koyanagi, Keiichi. / Study on trust-based maintenance of overlays in structured P2P systems. 2011 International Conference on Computational Problem-Solving, ICCP 2011. 2011. pp. 598-603
@inproceedings{5cdbb5c2d0d94bb7980ed6e9615253f4,
title = "Study on trust-based maintenance of overlays in structured P2P systems",
abstract = "Structured peer-to-peer overlay maintenance mechanisms require efficient methods to find stale routing table entries and replace them with new entries in a way that retains the desired routing behavior. Futhermore, overlay maintenance algorithms require to be devised to handle peer churn, the continuous process of node arrival and departure. Existing strategies of selecting new entries for routing tables are usually based on logical identifiers or proximity. Non-trust neighborhood selection criterion is used. Over the past decade, a respectable number of e-commerce companies, such as Amazon, eBay, and NetFlix, have deployed trust in ranking their products and suppliers. Such rankings are capitalized as effective incentives and low-cost mechanisms, letting e-commerce companies enhance product marketing and sales management. Since the use of trust has brought many benefits to e-commerce companies, we propose to introduce trust to structured P2P overlay maintenance. In this paper, we propose a trust-based maintenance strategy, using quantified {"}trust{"} as the judge criterion for neighbor selection and next-hop selection during routing, considering different aspects of trust in common structured P2P systems. The simulation results show that our maintenance strategy, applying to Chord, leads to lower maintenance overhead, while the mean hops of queries are slightly increased but remain O(logN), where N denotes the network size, compared with original Chord.",
keywords = "Chord, churn, maintenance, PlP, trust",
author = "Xin Ding and Keiichi Koyanagi",
year = "2011",
doi = "10.1109/ICCPS.2011.6089940",
language = "English",
isbn = "9781457706035",
pages = "598--603",
booktitle = "2011 International Conference on Computational Problem-Solving, ICCP 2011",

}

TY - GEN

T1 - Study on trust-based maintenance of overlays in structured P2P systems

AU - Ding, Xin

AU - Koyanagi, Keiichi

PY - 2011

Y1 - 2011

N2 - Structured peer-to-peer overlay maintenance mechanisms require efficient methods to find stale routing table entries and replace them with new entries in a way that retains the desired routing behavior. Futhermore, overlay maintenance algorithms require to be devised to handle peer churn, the continuous process of node arrival and departure. Existing strategies of selecting new entries for routing tables are usually based on logical identifiers or proximity. Non-trust neighborhood selection criterion is used. Over the past decade, a respectable number of e-commerce companies, such as Amazon, eBay, and NetFlix, have deployed trust in ranking their products and suppliers. Such rankings are capitalized as effective incentives and low-cost mechanisms, letting e-commerce companies enhance product marketing and sales management. Since the use of trust has brought many benefits to e-commerce companies, we propose to introduce trust to structured P2P overlay maintenance. In this paper, we propose a trust-based maintenance strategy, using quantified "trust" as the judge criterion for neighbor selection and next-hop selection during routing, considering different aspects of trust in common structured P2P systems. The simulation results show that our maintenance strategy, applying to Chord, leads to lower maintenance overhead, while the mean hops of queries are slightly increased but remain O(logN), where N denotes the network size, compared with original Chord.

AB - Structured peer-to-peer overlay maintenance mechanisms require efficient methods to find stale routing table entries and replace them with new entries in a way that retains the desired routing behavior. Futhermore, overlay maintenance algorithms require to be devised to handle peer churn, the continuous process of node arrival and departure. Existing strategies of selecting new entries for routing tables are usually based on logical identifiers or proximity. Non-trust neighborhood selection criterion is used. Over the past decade, a respectable number of e-commerce companies, such as Amazon, eBay, and NetFlix, have deployed trust in ranking their products and suppliers. Such rankings are capitalized as effective incentives and low-cost mechanisms, letting e-commerce companies enhance product marketing and sales management. Since the use of trust has brought many benefits to e-commerce companies, we propose to introduce trust to structured P2P overlay maintenance. In this paper, we propose a trust-based maintenance strategy, using quantified "trust" as the judge criterion for neighbor selection and next-hop selection during routing, considering different aspects of trust in common structured P2P systems. The simulation results show that our maintenance strategy, applying to Chord, leads to lower maintenance overhead, while the mean hops of queries are slightly increased but remain O(logN), where N denotes the network size, compared with original Chord.

KW - Chord

KW - churn

KW - maintenance

KW - PlP

KW - trust

UR - http://www.scopus.com/inward/record.url?scp=84055176108&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84055176108&partnerID=8YFLogxK

U2 - 10.1109/ICCPS.2011.6089940

DO - 10.1109/ICCPS.2011.6089940

M3 - Conference contribution

AN - SCOPUS:84055176108

SN - 9781457706035

SP - 598

EP - 603

BT - 2011 International Conference on Computational Problem-Solving, ICCP 2011

ER -