Pub Date : 1900-01-01DOI: 10.1109/CRISIS.2008.4757469
H. Beitollahi, Geert Deconinck
In the last few years, P2P systems have rapidly evolved and emerged as a promising platform to deploy new applications and services in the Internet. The main reasons for this is that P2P systems are self-organizing, have a decentralized nature, good scalability, efficient query search, and good resilience in the presence of node failures. However malicious faults (attacks) are serious threats in these systems. This paper analyzes and discusses dependability issues of four types P2P networks. Dependability issues include scalability, reliability, security, and availability. Simulation results confirm the dependability analysis. Results show that structured topologies are more tolerant against random faults but worse for malicious faults than unstructured topologies. The paper shows that the purely structured decentralized type (e.g. Chord) is the most dependable P2P network.
{"title":"Analysis of Peer-to-Peer networks from a dependability perspective","authors":"H. Beitollahi, Geert Deconinck","doi":"10.1109/CRISIS.2008.4757469","DOIUrl":"https://doi.org/10.1109/CRISIS.2008.4757469","url":null,"abstract":"In the last few years, P2P systems have rapidly evolved and emerged as a promising platform to deploy new applications and services in the Internet. The main reasons for this is that P2P systems are self-organizing, have a decentralized nature, good scalability, efficient query search, and good resilience in the presence of node failures. However malicious faults (attacks) are serious threats in these systems. This paper analyzes and discusses dependability issues of four types P2P networks. Dependability issues include scalability, reliability, security, and availability. Simulation results confirm the dependability analysis. Results show that structured topologies are more tolerant against random faults but worse for malicious faults than unstructured topologies. The paper shows that the purely structured decentralized type (e.g. Chord) is the most dependable P2P network.","PeriodicalId":346123,"journal":{"name":"2008 Third International Conference on Risks and Security of Internet and Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116568885","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 1900-01-01DOI: 10.1109/CRISIS.2008.4757488
H. Beitollahi, Geert Deconinck
Overlay networks enable applications to communicate with users without disclosing their IP addresses; hence overlay networks are used to protect applications against DoS attacks by hiding an applicationpsilas location. This paper analyzes three popular overlay networks (Chord, CAN, and Pastry) by simulation to answer to this question: which topology is more favorable for location-hiding and resisting against DoS attacks? Simulation results show that a CAN overlay network has a better topology structure for location-hiding and resistance against DoS attacks than Chord and Pastry. Simulation results also show the topologies with low average vertex degree are favorable for location-hiding techniques.
{"title":"Comparing Chord, CAN, and Pastry overlay networks for resistance to DoS attacks","authors":"H. Beitollahi, Geert Deconinck","doi":"10.1109/CRISIS.2008.4757488","DOIUrl":"https://doi.org/10.1109/CRISIS.2008.4757488","url":null,"abstract":"Overlay networks enable applications to communicate with users without disclosing their IP addresses; hence overlay networks are used to protect applications against DoS attacks by hiding an applicationpsilas location. This paper analyzes three popular overlay networks (Chord, CAN, and Pastry) by simulation to answer to this question: which topology is more favorable for location-hiding and resisting against DoS attacks? Simulation results show that a CAN overlay network has a better topology structure for location-hiding and resistance against DoS attacks than Chord and Pastry. Simulation results also show the topologies with low average vertex degree are favorable for location-hiding techniques.","PeriodicalId":346123,"journal":{"name":"2008 Third International Conference on Risks and Security of Internet and Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128538039","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：